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/Problem13_label46.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 19:49:59,714 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 19:49:59,717 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 19:49:59,736 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 19:49:59,736 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 19:49:59,738 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 19:49:59,740 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 19:49:59,750 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 19:49:59,754 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 19:49:59,757 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 19:49:59,759 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 19:49:59,761 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 19:49:59,762 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 19:49:59,763 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 19:49:59,766 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 19:49:59,767 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 19:49:59,769 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 19:49:59,770 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 19:49:59,772 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 19:49:59,777 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 19:49:59,781 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 19:49:59,782 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 19:49:59,783 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 19:49:59,784 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 19:49:59,785 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 19:49:59,786 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 19:49:59,786 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 19:49:59,787 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 19:49:59,787 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 19:49:59,788 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 19:49:59,788 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 19:49:59,789 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 19:49:59,790 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 19:49:59,791 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 19:49:59,791 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 19:49:59,792 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 19:49:59,793 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 19:49:59,794 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 19:49:59,794 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 19:49:59,795 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 19:49:59,795 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 19:49:59,797 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-09-07 19:49:59,834 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 19:49:59,834 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 19:49:59,835 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 19:49:59,836 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 19:49:59,836 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 19:49:59,836 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 19:49:59,836 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 19:49:59,837 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 19:49:59,837 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 19:49:59,837 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 19:49:59,837 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 19:49:59,837 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 19:49:59,838 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 19:49:59,838 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 19:49:59,838 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 19:49:59,839 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 19:49:59,839 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 19:49:59,840 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 19:49:59,840 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 19:49:59,840 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 19:49:59,840 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 19:49:59,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 19:49:59,841 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 19:49:59,841 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 19:49:59,845 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 19:49:59,845 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 19:49:59,845 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 19:49:59,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 19:49:59,846 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 19:49:59,889 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 19:49:59,902 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 19:49:59,907 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 19:49:59,908 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 19:49:59,911 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 19:49:59,912 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label46.c [2019-09-07 19:49:59,986 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdfba6944/56ba9a839431415ab1bae19e19f24ce4/FLAG04e65e758 [2019-09-07 19:50:00,854 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 19:50:00,855 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label46.c [2019-09-07 19:50:00,903 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdfba6944/56ba9a839431415ab1bae19e19f24ce4/FLAG04e65e758 [2019-09-07 19:50:01,334 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdfba6944/56ba9a839431415ab1bae19e19f24ce4 [2019-09-07 19:50:01,347 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 19:50:01,348 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 19:50:01,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 19:50:01,350 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 19:50:01,353 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 19:50:01,355 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:50:01" (1/1) ... [2019-09-07 19:50:01,358 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6681a6dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:50:01, skipping insertion in model container [2019-09-07 19:50:01,358 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:50:01" (1/1) ... [2019-09-07 19:50:01,365 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 19:50:01,539 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 19:50:03,311 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:50:03,319 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 19:50:04,139 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:50:04,173 INFO L192 MainTranslator]: Completed translation [2019-09-07 19:50:04,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:50:04 WrapperNode [2019-09-07 19:50:04,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 19:50:04,175 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 19:50:04,175 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 19:50:04,175 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 19:50:04,190 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:50:04" (1/1) ... [2019-09-07 19:50:04,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:50:04" (1/1) ... [2019-09-07 19:50:04,269 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:50:04" (1/1) ... [2019-09-07 19:50:04,269 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:50:04" (1/1) ... [2019-09-07 19:50:04,423 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:50:04" (1/1) ... [2019-09-07 19:50:04,454 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:50:04" (1/1) ... [2019-09-07 19:50:04,509 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:50:04" (1/1) ... [2019-09-07 19:50:04,562 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 19:50:04,563 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 19:50:04,563 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 19:50:04,563 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 19:50:04,565 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:50:04" (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-09-07 19:50:04,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 19:50:04,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 19:50:04,632 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 19:50:04,632 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 19:50:04,633 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-07 19:50:04,633 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2019-09-07 19:50:04,634 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 19:50:04,634 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 19:50:04,634 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 19:50:04,634 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-07 19:50:04,634 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2019-09-07 19:50:04,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 19:50:04,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 19:50:04,636 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 19:50:04,636 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 19:50:04,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 19:50:04,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 19:50:11,296 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 19:50:11,299 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 19:50:11,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:50:11 BoogieIcfgContainer [2019-09-07 19:50:11,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 19:50:11,305 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 19:50:11,305 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 19:50:11,310 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 19:50:11,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 07:50:01" (1/3) ... [2019-09-07 19:50:11,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@390cdf8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:50:11, skipping insertion in model container [2019-09-07 19:50:11,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:50:04" (2/3) ... [2019-09-07 19:50:11,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@390cdf8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:50:11, skipping insertion in model container [2019-09-07 19:50:11,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:50:11" (3/3) ... [2019-09-07 19:50:11,315 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem13_label46.c [2019-09-07 19:50:11,326 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 19:50:11,336 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 19:50:11,354 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 19:50:11,405 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 19:50:11,406 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 19:50:11,406 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 19:50:11,406 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 19:50:11,406 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 19:50:11,406 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 19:50:11,406 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 19:50:11,407 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 19:50:11,407 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 19:50:11,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states. [2019-09-07 19:50:11,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-07 19:50:11,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:50:11,464 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:50:11,466 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:50:11,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:50:11,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1542666417, now seen corresponding path program 1 times [2019-09-07 19:50:11,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:50:11,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:50:11,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:50:11,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:50:11,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:50:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:50:11,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:50:11,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:50:11,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 19:50:11,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 19:50:11,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 19:50:11,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:50:11,861 INFO L87 Difference]: Start difference. First operand 1119 states. Second operand 3 states. [2019-09-07 19:50:18,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:50:18,093 INFO L93 Difference]: Finished difference Result 3098 states and 5727 transitions. [2019-09-07 19:50:18,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 19:50:18,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-09-07 19:50:18,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:50:18,145 INFO L225 Difference]: With dead ends: 3098 [2019-09-07 19:50:18,145 INFO L226 Difference]: Without dead ends: 1917 [2019-09-07 19:50:18,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:50:18,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2019-09-07 19:50:18,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1897. [2019-09-07 19:50:18,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1897 states. [2019-09-07 19:50:18,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 3364 transitions. [2019-09-07 19:50:18,314 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 3364 transitions. Word has length 72 [2019-09-07 19:50:18,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:50:18,315 INFO L475 AbstractCegarLoop]: Abstraction has 1897 states and 3364 transitions. [2019-09-07 19:50:18,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 19:50:18,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 3364 transitions. [2019-09-07 19:50:18,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-07 19:50:18,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:50:18,322 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:50:18,322 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:50:18,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:50:18,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1826001525, now seen corresponding path program 1 times [2019-09-07 19:50:18,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:50:18,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:50:18,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:50:18,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:50:18,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:50:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:50:18,504 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:50:18,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:50:18,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 19:50:18,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 19:50:18,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 19:50:18,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 19:50:18,508 INFO L87 Difference]: Start difference. First operand 1897 states and 3364 transitions. Second operand 5 states. [2019-09-07 19:50:27,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:50:27,588 INFO L93 Difference]: Finished difference Result 5569 states and 9991 transitions. [2019-09-07 19:50:27,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 19:50:27,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-09-07 19:50:27,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:50:27,617 INFO L225 Difference]: With dead ends: 5569 [2019-09-07 19:50:27,617 INFO L226 Difference]: Without dead ends: 3678 [2019-09-07 19:50:27,624 INFO L628 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-09-07 19:50:27,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3678 states. [2019-09-07 19:50:27,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3678 to 3595. [2019-09-07 19:50:27,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3595 states. [2019-09-07 19:50:27,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3595 states to 3595 states and 5740 transitions. [2019-09-07 19:50:27,756 INFO L78 Accepts]: Start accepts. Automaton has 3595 states and 5740 transitions. Word has length 147 [2019-09-07 19:50:27,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:50:27,758 INFO L475 AbstractCegarLoop]: Abstraction has 3595 states and 5740 transitions. [2019-09-07 19:50:27,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 19:50:27,758 INFO L276 IsEmpty]: Start isEmpty. Operand 3595 states and 5740 transitions. [2019-09-07 19:50:27,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-07 19:50:27,771 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:50:27,772 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:50:27,772 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:50:27,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:50:27,772 INFO L82 PathProgramCache]: Analyzing trace with hash 93459516, now seen corresponding path program 1 times [2019-09-07 19:50:27,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:50:27,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:50:27,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:50:27,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:50:27,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:50:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:50:28,003 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:50:28,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:50:28,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:50:28,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:50:28,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:50:28,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:50:28,007 INFO L87 Difference]: Start difference. First operand 3595 states and 5740 transitions. Second operand 6 states. [2019-09-07 19:50:34,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:50:34,922 INFO L93 Difference]: Finished difference Result 10681 states and 17552 transitions. [2019-09-07 19:50:34,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:50:34,923 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2019-09-07 19:50:34,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:50:34,962 INFO L225 Difference]: With dead ends: 10681 [2019-09-07 19:50:34,965 INFO L226 Difference]: Without dead ends: 7092 [2019-09-07 19:50:34,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:50:34,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7092 states. [2019-09-07 19:50:35,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7092 to 7045. [2019-09-07 19:50:35,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7045 states. [2019-09-07 19:50:35,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7045 states to 7045 states and 10390 transitions. [2019-09-07 19:50:35,197 INFO L78 Accepts]: Start accepts. Automaton has 7045 states and 10390 transitions. Word has length 148 [2019-09-07 19:50:35,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:50:35,199 INFO L475 AbstractCegarLoop]: Abstraction has 7045 states and 10390 transitions. [2019-09-07 19:50:35,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:50:35,200 INFO L276 IsEmpty]: Start isEmpty. Operand 7045 states and 10390 transitions. [2019-09-07 19:50:35,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-07 19:50:35,202 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:50:35,203 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:50:35,203 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:50:35,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:50:35,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1499317899, now seen corresponding path program 1 times [2019-09-07 19:50:35,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:50:35,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:50:35,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:50:35,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:50:35,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:50:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:50:35,357 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:50:35,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:50:35,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 19:50:35,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 19:50:35,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 19:50:35,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:50:35,359 INFO L87 Difference]: Start difference. First operand 7045 states and 10390 transitions. Second operand 3 states. [2019-09-07 19:50:40,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:50:40,404 INFO L93 Difference]: Finished difference Result 20735 states and 31782 transitions. [2019-09-07 19:50:40,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 19:50:40,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-09-07 19:50:40,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:50:40,479 INFO L225 Difference]: With dead ends: 20735 [2019-09-07 19:50:40,480 INFO L226 Difference]: Without dead ends: 13696 [2019-09-07 19:50:40,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:50:40,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13696 states. [2019-09-07 19:50:40,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13696 to 13695. [2019-09-07 19:50:40,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13695 states. [2019-09-07 19:50:40,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13695 states to 13695 states and 19650 transitions. [2019-09-07 19:50:40,895 INFO L78 Accepts]: Start accepts. Automaton has 13695 states and 19650 transitions. Word has length 172 [2019-09-07 19:50:40,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:50:40,899 INFO L475 AbstractCegarLoop]: Abstraction has 13695 states and 19650 transitions. [2019-09-07 19:50:40,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 19:50:40,899 INFO L276 IsEmpty]: Start isEmpty. Operand 13695 states and 19650 transitions. [2019-09-07 19:50:40,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-07 19:50:40,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:50:40,905 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:50:40,905 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:50:40,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:50:40,906 INFO L82 PathProgramCache]: Analyzing trace with hash -138570541, now seen corresponding path program 1 times [2019-09-07 19:50:40,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:50:40,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:50:40,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:50:40,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:50:40,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:50:40,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:50:41,119 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 130 proven. 71 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 19:50:41,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:50:41,120 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:50:41,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:50:41,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:50:41,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 19:50:41,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:50:41,585 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-07 19:50:41,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:50:41,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 19:50:41,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:50:41,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:50:41,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:50:41,596 INFO L87 Difference]: Start difference. First operand 13695 states and 19650 transitions. Second operand 9 states. [2019-09-07 19:50:54,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:50:54,524 INFO L93 Difference]: Finished difference Result 41875 states and 65082 transitions. [2019-09-07 19:50:54,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 19:50:54,525 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 224 [2019-09-07 19:50:54,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:50:54,679 INFO L225 Difference]: With dead ends: 41875 [2019-09-07 19:50:54,679 INFO L226 Difference]: Without dead ends: 28186 [2019-09-07 19:50:54,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 232 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2019-09-07 19:50:54,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28186 states. [2019-09-07 19:50:55,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28186 to 28050. [2019-09-07 19:50:55,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28050 states. [2019-09-07 19:50:56,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28050 states to 28050 states and 40705 transitions. [2019-09-07 19:50:56,714 INFO L78 Accepts]: Start accepts. Automaton has 28050 states and 40705 transitions. Word has length 224 [2019-09-07 19:50:56,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:50:56,714 INFO L475 AbstractCegarLoop]: Abstraction has 28050 states and 40705 transitions. [2019-09-07 19:50:56,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:50:56,715 INFO L276 IsEmpty]: Start isEmpty. Operand 28050 states and 40705 transitions. [2019-09-07 19:50:56,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-09-07 19:50:56,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:50:56,728 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 19:50:56,728 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:50:56,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:50:56,729 INFO L82 PathProgramCache]: Analyzing trace with hash -988590677, now seen corresponding path program 1 times [2019-09-07 19:50:56,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:50:56,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:50:56,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:50:56,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:50:56,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:50:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:50:57,036 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2019-09-07 19:50:57,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:50:57,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 19:50:57,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:50:57,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:50:57,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:50:57,038 INFO L87 Difference]: Start difference. First operand 28050 states and 40705 transitions. Second operand 4 states. [2019-09-07 19:51:07,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:51:07,551 INFO L93 Difference]: Finished difference Result 107186 states and 167569 transitions. [2019-09-07 19:51:07,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 19:51:07,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 317 [2019-09-07 19:51:07,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:51:07,918 INFO L225 Difference]: With dead ends: 107186 [2019-09-07 19:51:07,918 INFO L226 Difference]: Without dead ends: 79142 [2019-09-07 19:51:07,986 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:51:08,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79142 states. [2019-09-07 19:51:11,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79142 to 76575. [2019-09-07 19:51:11,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76575 states. [2019-09-07 19:51:11,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76575 states to 76575 states and 122204 transitions. [2019-09-07 19:51:11,729 INFO L78 Accepts]: Start accepts. Automaton has 76575 states and 122204 transitions. Word has length 317 [2019-09-07 19:51:11,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:51:11,731 INFO L475 AbstractCegarLoop]: Abstraction has 76575 states and 122204 transitions. [2019-09-07 19:51:11,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:51:11,732 INFO L276 IsEmpty]: Start isEmpty. Operand 76575 states and 122204 transitions. [2019-09-07 19:51:11,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2019-09-07 19:51:11,777 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:51:11,778 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 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-09-07 19:51:11,778 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:51:11,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:51:11,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1703657243, now seen corresponding path program 1 times [2019-09-07 19:51:11,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:51:11,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:51:11,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:51:11,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:51:11,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:51:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:51:12,103 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 275 proven. 78 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-09-07 19:51:12,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:51:12,103 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:51:12,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:51:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:51:12,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:51:12,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:51:12,358 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 401 proven. 2 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-07 19:51:12,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:51:12,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:51:12,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:51:12,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:51:12,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:51:12,365 INFO L87 Difference]: Start difference. First operand 76575 states and 122204 transitions. Second operand 9 states. [2019-09-07 19:51:29,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:51:29,149 INFO L93 Difference]: Finished difference Result 173519 states and 316464 transitions. [2019-09-07 19:51:29,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 19:51:29,150 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 427 [2019-09-07 19:51:29,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:51:29,866 INFO L225 Difference]: With dead ends: 173519 [2019-09-07 19:51:29,866 INFO L226 Difference]: Without dead ends: 96950 [2019-09-07 19:51:30,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 434 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-07 19:51:30,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96950 states. [2019-09-07 19:51:35,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96950 to 91006. [2019-09-07 19:51:35,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91006 states. [2019-09-07 19:51:35,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91006 states to 91006 states and 155179 transitions. [2019-09-07 19:51:35,736 INFO L78 Accepts]: Start accepts. Automaton has 91006 states and 155179 transitions. Word has length 427 [2019-09-07 19:51:35,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:51:35,737 INFO L475 AbstractCegarLoop]: Abstraction has 91006 states and 155179 transitions. [2019-09-07 19:51:35,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:51:35,738 INFO L276 IsEmpty]: Start isEmpty. Operand 91006 states and 155179 transitions. [2019-09-07 19:51:35,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2019-09-07 19:51:35,841 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:51:35,841 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 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] [2019-09-07 19:51:35,842 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:51:35,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:51:35,843 INFO L82 PathProgramCache]: Analyzing trace with hash 18136063, now seen corresponding path program 1 times [2019-09-07 19:51:35,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:51:35,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:51:35,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:51:35,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:51:35,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:51:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:51:36,368 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 403 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-07 19:51:36,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:51:36,369 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:51:36,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:51:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:51:36,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 19:51:36,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:51:37,042 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 19:51:37,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:51:37,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 19:51:37,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:51:37,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:51:37,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:51:37,049 INFO L87 Difference]: Start difference. First operand 91006 states and 155179 transitions. Second operand 9 states. [2019-09-07 19:52:00,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:52:00,446 INFO L93 Difference]: Finished difference Result 246210 states and 412853 transitions. [2019-09-07 19:52:00,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 19:52:00,446 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 438 [2019-09-07 19:52:00,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:52:01,132 INFO L225 Difference]: With dead ends: 246210 [2019-09-07 19:52:01,132 INFO L226 Difference]: Without dead ends: 154398 [2019-09-07 19:52:01,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 458 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=845, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 19:52:01,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154398 states. [2019-09-07 19:52:04,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154398 to 144556. [2019-09-07 19:52:04,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144556 states. [2019-09-07 19:52:05,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144556 states to 144556 states and 212450 transitions. [2019-09-07 19:52:05,226 INFO L78 Accepts]: Start accepts. Automaton has 144556 states and 212450 transitions. Word has length 438 [2019-09-07 19:52:05,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:52:05,227 INFO L475 AbstractCegarLoop]: Abstraction has 144556 states and 212450 transitions. [2019-09-07 19:52:05,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:52:05,227 INFO L276 IsEmpty]: Start isEmpty. Operand 144556 states and 212450 transitions. [2019-09-07 19:52:05,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2019-09-07 19:52:05,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:52:05,325 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 19:52:05,326 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:52:05,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:52:05,326 INFO L82 PathProgramCache]: Analyzing trace with hash -616229655, now seen corresponding path program 1 times [2019-09-07 19:52:05,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:52:05,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:52:05,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:52:05,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:52:05,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:52:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:52:05,981 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 505 proven. 2 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-09-07 19:52:05,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:52:05,981 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 19:52:06,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:52:06,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:52:06,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:52:06,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:52:07,093 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 505 proven. 2 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-09-07 19:52:07,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:52:07,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:52:07,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:52:07,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:52:07,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:52:07,108 INFO L87 Difference]: Start difference. First operand 144556 states and 212450 transitions. Second operand 9 states. [2019-09-07 19:52:28,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:52:28,261 INFO L93 Difference]: Finished difference Result 306249 states and 504682 transitions. [2019-09-07 19:52:28,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 19:52:28,261 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 470 [2019-09-07 19:52:28,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:52:28,794 INFO L225 Difference]: With dead ends: 306249 [2019-09-07 19:52:28,794 INFO L226 Difference]: Without dead ends: 162502 [2019-09-07 19:52:29,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 480 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2019-09-07 19:52:29,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162502 states. [2019-09-07 19:52:35,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162502 to 153158. [2019-09-07 19:52:35,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153158 states. [2019-09-07 19:52:35,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153158 states to 153158 states and 234311 transitions. [2019-09-07 19:52:35,983 INFO L78 Accepts]: Start accepts. Automaton has 153158 states and 234311 transitions. Word has length 470 [2019-09-07 19:52:35,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:52:35,984 INFO L475 AbstractCegarLoop]: Abstraction has 153158 states and 234311 transitions. [2019-09-07 19:52:35,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:52:35,985 INFO L276 IsEmpty]: Start isEmpty. Operand 153158 states and 234311 transitions. [2019-09-07 19:52:36,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2019-09-07 19:52:36,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:52:36,023 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 19:52:36,023 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:52:36,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:52:36,024 INFO L82 PathProgramCache]: Analyzing trace with hash 294963871, now seen corresponding path program 1 times [2019-09-07 19:52:36,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:52:36,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:52:36,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:52:36,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:52:36,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:52:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:52:36,652 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 197 proven. 4 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2019-09-07 19:52:36,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:52:36,652 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 19:52:36,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:52:36,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:52:36,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 19:52:36,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:52:37,001 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2019-09-07 19:52:37,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:52:37,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-07 19:52:37,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 19:52:37,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 19:52:37,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 19:52:37,010 INFO L87 Difference]: Start difference. First operand 153158 states and 234311 transitions. Second operand 7 states. [2019-09-07 19:52:50,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:52:50,984 INFO L93 Difference]: Finished difference Result 294029 states and 470724 transitions. [2019-09-07 19:52:50,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 19:52:50,984 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 576 [2019-09-07 19:52:50,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:52:51,658 INFO L225 Difference]: With dead ends: 294029 [2019-09-07 19:52:51,658 INFO L226 Difference]: Without dead ends: 158766 [2019-09-07 19:52:51,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 582 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:52:52,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158766 states. [2019-09-07 19:52:54,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158766 to 154505. [2019-09-07 19:52:54,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154505 states. [2019-09-07 19:52:55,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154505 states to 154505 states and 218580 transitions. [2019-09-07 19:52:55,016 INFO L78 Accepts]: Start accepts. Automaton has 154505 states and 218580 transitions. Word has length 576 [2019-09-07 19:52:55,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:52:55,017 INFO L475 AbstractCegarLoop]: Abstraction has 154505 states and 218580 transitions. [2019-09-07 19:52:55,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 19:52:55,017 INFO L276 IsEmpty]: Start isEmpty. Operand 154505 states and 218580 transitions. [2019-09-07 19:52:55,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2019-09-07 19:52:55,069 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:52:55,070 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:52:55,070 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:52:55,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:52:55,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1397552063, now seen corresponding path program 1 times [2019-09-07 19:52:55,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:52:55,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:52:55,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:52:55,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:52:55,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:52:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:52:55,934 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 266 proven. 353 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 19:52:55,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:52:55,935 INFO L223 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-09-07 19:52:55,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:52:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:52:56,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:52:56,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:52:56,923 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 422 trivial. 0 not checked. [2019-09-07 19:52:56,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:52:56,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2019-09-07 19:52:56,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 19:52:56,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 19:52:56,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-07 19:52:56,934 INFO L87 Difference]: Start difference. First operand 154505 states and 218580 transitions. Second operand 11 states. [2019-09-07 19:53:20,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:53:20,338 INFO L93 Difference]: Finished difference Result 318856 states and 458283 transitions. [2019-09-07 19:53:20,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-07 19:53:20,339 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 607 [2019-09-07 19:53:20,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:53:20,879 INFO L225 Difference]: With dead ends: 318856 [2019-09-07 19:53:20,879 INFO L226 Difference]: Without dead ends: 167835 [2019-09-07 19:53:21,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 662 GetRequests, 629 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=256, Invalid=866, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 19:53:21,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167835 states. [2019-09-07 19:53:24,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167835 to 156495. [2019-09-07 19:53:24,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156495 states. [2019-09-07 19:53:25,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156495 states to 156495 states and 201880 transitions. [2019-09-07 19:53:25,005 INFO L78 Accepts]: Start accepts. Automaton has 156495 states and 201880 transitions. Word has length 607 [2019-09-07 19:53:25,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:53:25,006 INFO L475 AbstractCegarLoop]: Abstraction has 156495 states and 201880 transitions. [2019-09-07 19:53:25,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 19:53:25,007 INFO L276 IsEmpty]: Start isEmpty. Operand 156495 states and 201880 transitions. [2019-09-07 19:53:25,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2019-09-07 19:53:25,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:53:25,055 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:53:25,055 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:53:25,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:53:25,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1124131442, now seen corresponding path program 1 times [2019-09-07 19:53:25,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:53:25,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:53:25,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:53:25,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:53:25,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:53:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:53:25,624 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 456 proven. 94 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2019-09-07 19:53:25,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:53:25,625 INFO L223 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:53:25,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:53:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:53:25,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 933 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 19:53:25,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:53:25,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:53:30,795 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 341 proven. 0 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 19:53:30,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:53:30,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-07 19:53:30,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 19:53:30,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 19:53:30,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:53:30,814 INFO L87 Difference]: Start difference. First operand 156495 states and 201880 transitions. Second operand 8 states. [2019-09-07 19:53:50,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:53:50,172 INFO L93 Difference]: Finished difference Result 367844 states and 491556 transitions. [2019-09-07 19:53:50,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-07 19:53:50,173 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 615 [2019-09-07 19:53:50,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:53:50,846 INFO L225 Difference]: With dead ends: 367844 [2019-09-07 19:53:50,846 INFO L226 Difference]: Without dead ends: 212158 [2019-09-07 19:53:51,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 661 GetRequests, 633 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=699, Unknown=0, NotChecked=0, Total=870 [2019-09-07 19:53:51,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212158 states. [2019-09-07 19:53:54,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212158 to 207822. [2019-09-07 19:53:54,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207822 states. [2019-09-07 19:54:00,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207822 states to 207822 states and 271404 transitions. [2019-09-07 19:54:00,941 INFO L78 Accepts]: Start accepts. Automaton has 207822 states and 271404 transitions. Word has length 615 [2019-09-07 19:54:00,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:54:00,942 INFO L475 AbstractCegarLoop]: Abstraction has 207822 states and 271404 transitions. [2019-09-07 19:54:00,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 19:54:00,942 INFO L276 IsEmpty]: Start isEmpty. Operand 207822 states and 271404 transitions. [2019-09-07 19:54:01,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 764 [2019-09-07 19:54:01,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:54:01,027 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 19:54:01,027 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:54:01,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:54:01,028 INFO L82 PathProgramCache]: Analyzing trace with hash 965805936, now seen corresponding path program 1 times [2019-09-07 19:54:01,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:54:01,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:54:01,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:54:01,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:54:01,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:54:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:54:02,026 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 624 proven. 2 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2019-09-07 19:54:02,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:54:02,027 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:54:02,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:54:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:54:02,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 1111 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 19:54:02,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:54:03,006 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 542 proven. 2 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2019-09-07 19:54:03,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:54:03,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2019-09-07 19:54:03,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 19:54:03,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 19:54:03,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-07 19:54:03,013 INFO L87 Difference]: Start difference. First operand 207822 states and 271404 transitions. Second operand 11 states. [2019-09-07 19:54:58,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:54:58,692 INFO L93 Difference]: Finished difference Result 588209 states and 756377 transitions. [2019-09-07 19:54:58,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-09-07 19:54:58,693 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 763 [2019-09-07 19:54:58,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:54:59,796 INFO L225 Difference]: With dead ends: 588209 [2019-09-07 19:54:59,797 INFO L226 Difference]: Without dead ends: 381196 [2019-09-07 19:55:00,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 936 GetRequests, 841 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3459 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1460, Invalid=7852, Unknown=0, NotChecked=0, Total=9312 [2019-09-07 19:55:00,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381196 states. [2019-09-07 19:55:06,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381196 to 373916. [2019-09-07 19:55:06,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373916 states. [2019-09-07 19:55:17,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373916 states to 373916 states and 437930 transitions. [2019-09-07 19:55:17,077 INFO L78 Accepts]: Start accepts. Automaton has 373916 states and 437930 transitions. Word has length 763 [2019-09-07 19:55:17,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:55:17,078 INFO L475 AbstractCegarLoop]: Abstraction has 373916 states and 437930 transitions. [2019-09-07 19:55:17,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 19:55:17,078 INFO L276 IsEmpty]: Start isEmpty. Operand 373916 states and 437930 transitions. [2019-09-07 19:55:17,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 795 [2019-09-07 19:55:17,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:55:17,140 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 19:55:17,141 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:55:17,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:55:17,141 INFO L82 PathProgramCache]: Analyzing trace with hash -338925514, now seen corresponding path program 1 times [2019-09-07 19:55:17,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:55:17,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:55:17,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:55:17,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:55:17,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:55:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:55:19,114 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 586 proven. 195 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-07 19:55:19,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:55:19,115 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:55:19,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:55:19,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:55:19,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 1133 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-07 19:55:19,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:55:19,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-09-07 19:55:19,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:55:19,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:55:19,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:55:19,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-07 19:55:21,443 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 590 proven. 2 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2019-09-07 19:55:21,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:55:21,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2019-09-07 19:55:21,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 19:55:21,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 19:55:21,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2019-09-07 19:55:21,449 INFO L87 Difference]: Start difference. First operand 373916 states and 437930 transitions. Second operand 20 states. [2019-09-07 19:56:06,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:56:06,042 INFO L93 Difference]: Finished difference Result 688434 states and 807288 transitions. [2019-09-07 19:56:06,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2019-09-07 19:56:06,042 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 794 [2019-09-07 19:56:06,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:56:06,876 INFO L225 Difference]: With dead ends: 688434 [2019-09-07 19:56:06,876 INFO L226 Difference]: Without dead ends: 351637 [2019-09-07 19:56:07,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1068 GetRequests, 891 SyntacticMatches, 1 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13073 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=4644, Invalid=26862, Unknown=0, NotChecked=0, Total=31506 [2019-09-07 19:56:07,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351637 states. [2019-09-07 19:56:13,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351637 to 348267. [2019-09-07 19:56:13,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348267 states. [2019-09-07 19:56:14,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348267 states to 348267 states and 389008 transitions. [2019-09-07 19:56:14,098 INFO L78 Accepts]: Start accepts. Automaton has 348267 states and 389008 transitions. Word has length 794 [2019-09-07 19:56:14,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:56:14,099 INFO L475 AbstractCegarLoop]: Abstraction has 348267 states and 389008 transitions. [2019-09-07 19:56:14,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 19:56:14,099 INFO L276 IsEmpty]: Start isEmpty. Operand 348267 states and 389008 transitions. [2019-09-07 19:56:14,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 891 [2019-09-07 19:56:14,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:56:14,164 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 19:56:14,164 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:56:14,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:56:14,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1032169022, now seen corresponding path program 1 times [2019-09-07 19:56:14,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:56:14,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:56:14,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:56:14,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:56:14,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:56:14,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:56:22,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 631 proven. 140 refuted. 0 times theorem prover too weak. 817 trivial. 0 not checked. [2019-09-07 19:56:22,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:56:22,026 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:56:22,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:56:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:56:22,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 1318 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 19:56:22,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:56:22,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 824 proven. 2 refuted. 0 times theorem prover too weak. 762 trivial. 0 not checked. [2019-09-07 19:56:22,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:56:22,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:56:22,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:56:22,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:56:22,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:56:22,903 INFO L87 Difference]: Start difference. First operand 348267 states and 389008 transitions. Second operand 9 states. [2019-09-07 19:56:49,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:56:49,492 INFO L93 Difference]: Finished difference Result 766163 states and 897637 transitions. [2019-09-07 19:56:49,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 19:56:49,492 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 890 [2019-09-07 19:56:49,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:56:56,122 INFO L225 Difference]: With dead ends: 766163 [2019-09-07 19:56:56,122 INFO L226 Difference]: Without dead ends: 450926 [2019-09-07 19:56:56,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 922 GetRequests, 901 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=360, Unknown=0, NotChecked=0, Total=506 [2019-09-07 19:56:56,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450926 states. [2019-09-07 19:57:02,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450926 to 432299. [2019-09-07 19:57:02,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432299 states. [2019-09-07 19:57:03,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432299 states to 432299 states and 482241 transitions. [2019-09-07 19:57:03,675 INFO L78 Accepts]: Start accepts. Automaton has 432299 states and 482241 transitions. Word has length 890 [2019-09-07 19:57:03,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:57:03,675 INFO L475 AbstractCegarLoop]: Abstraction has 432299 states and 482241 transitions. [2019-09-07 19:57:03,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:57:03,675 INFO L276 IsEmpty]: Start isEmpty. Operand 432299 states and 482241 transitions. [2019-09-07 19:57:03,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 901 [2019-09-07 19:57:03,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:57:03,737 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-07 19:57:03,738 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:57:03,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:57:03,738 INFO L82 PathProgramCache]: Analyzing trace with hash -571040693, now seen corresponding path program 1 times [2019-09-07 19:57:03,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:57:03,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:57:03,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:57:03,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:57:03,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:57:03,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:57:09,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1328 backedges. 1042 proven. 6 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2019-09-07 19:57:09,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:57:09,876 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:57:09,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:57:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:57:10,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 1287 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 19:57:10,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:57:10,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:57:10,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1328 backedges. 792 proven. 2 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-09-07 19:57:10,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:57:10,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-09-07 19:57:10,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 19:57:10,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 19:57:10,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-09-07 19:57:10,610 INFO L87 Difference]: Start difference. First operand 432299 states and 482241 transitions. Second operand 15 states. [2019-09-07 19:58:57,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:58:57,716 INFO L93 Difference]: Finished difference Result 1120922 states and 1257440 transitions. [2019-09-07 19:58:57,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2019-09-07 19:58:57,717 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 900 [2019-09-07 19:58:57,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:59:00,632 INFO L225 Difference]: With dead ends: 1120922 [2019-09-07 19:59:00,633 INFO L226 Difference]: Without dead ends: 689432 [2019-09-07 19:59:01,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1192 GetRequests, 1031 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10926 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2704, Invalid=23702, Unknown=0, NotChecked=0, Total=26406 [2019-09-07 19:59:01,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689432 states. [2019-09-07 19:59:20,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689432 to 666159. [2019-09-07 19:59:20,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666159 states. [2019-09-07 19:59:22,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666159 states to 666159 states and 744528 transitions. [2019-09-07 19:59:22,332 INFO L78 Accepts]: Start accepts. Automaton has 666159 states and 744528 transitions. Word has length 900 [2019-09-07 19:59:22,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:59:22,333 INFO L475 AbstractCegarLoop]: Abstraction has 666159 states and 744528 transitions. [2019-09-07 19:59:22,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 19:59:22,333 INFO L276 IsEmpty]: Start isEmpty. Operand 666159 states and 744528 transitions. [2019-09-07 19:59:22,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 956 [2019-09-07 19:59:22,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:59:22,366 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:59:22,366 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:59:22,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:59:22,367 INFO L82 PathProgramCache]: Analyzing trace with hash 164491535, now seen corresponding path program 1 times [2019-09-07 19:59:22,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:59:22,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:59:22,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:59:22,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:59:22,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:59:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:59:30,134 INFO L134 CoverageAnalysis]: Checked inductivity of 995 backedges. 415 proven. 76 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2019-09-07 19:59:30,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:59:30,134 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:59:30,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:59:30,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:59:30,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 1328 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 19:59:30,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:59:30,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:59:30,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:59:30,759 INFO L134 CoverageAnalysis]: Checked inductivity of 995 backedges. 830 proven. 2 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2019-09-07 19:59:30,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:59:30,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-09-07 19:59:30,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 19:59:30,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 19:59:30,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 19:59:30,766 INFO L87 Difference]: Start difference. First operand 666159 states and 744528 transitions. Second operand 7 states. [2019-09-07 19:59:57,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:59:57,792 INFO L93 Difference]: Finished difference Result 1345371 states and 1565307 transitions. [2019-09-07 19:59:57,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 19:59:57,793 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 955 [2019-09-07 19:59:57,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:00:00,557 INFO L225 Difference]: With dead ends: 1345371 [2019-09-07 20:00:00,557 INFO L226 Difference]: Without dead ends: 768188 [2019-09-07 20:00:01,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 972 GetRequests, 960 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-09-07 20:00:01,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768188 states. [2019-09-07 20:00:13,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768188 to 706532. [2019-09-07 20:00:13,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706532 states. [2019-09-07 20:00:29,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706532 states to 706532 states and 789107 transitions. [2019-09-07 20:00:29,226 INFO L78 Accepts]: Start accepts. Automaton has 706532 states and 789107 transitions. Word has length 955 [2019-09-07 20:00:29,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:00:29,227 INFO L475 AbstractCegarLoop]: Abstraction has 706532 states and 789107 transitions. [2019-09-07 20:00:29,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 20:00:29,227 INFO L276 IsEmpty]: Start isEmpty. Operand 706532 states and 789107 transitions. [2019-09-07 20:00:29,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1134 [2019-09-07 20:00:29,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:00:29,294 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 20:00:29,295 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:00:29,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:00:29,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1807138364, now seen corresponding path program 1 times [2019-09-07 20:00:29,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:00:29,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:00:29,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:00:29,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:00:29,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:00:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:00:33,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 270 proven. 118 refuted. 0 times theorem prover too weak. 923 trivial. 0 not checked. [2019-09-07 20:00:33,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:00:33,211 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:00:33,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:00:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:00:40,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 1505 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 20:00:40,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:00:40,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:00:40,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:00:40,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:00:40,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 20:00:41,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1311 backedges. 270 proven. 672 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2019-09-07 20:00:41,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:00:41,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2019-09-07 20:00:41,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 20:00:41,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 20:00:41,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-09-07 20:00:41,419 INFO L87 Difference]: Start difference. First operand 706532 states and 789107 transitions. Second operand 15 states.