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_label45.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 19:49:36,465 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 19:49:36,467 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 19:49:36,485 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 19:49:36,485 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 19:49:36,487 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 19:49:36,489 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 19:49:36,499 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 19:49:36,503 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 19:49:36,506 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 19:49:36,509 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 19:49:36,511 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 19:49:36,511 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 19:49:36,513 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 19:49:36,516 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 19:49:36,517 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 19:49:36,518 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 19:49:36,520 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 19:49:36,522 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 19:49:36,527 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 19:49:36,531 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 19:49:36,533 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 19:49:36,536 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 19:49:36,537 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 19:49:36,539 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 19:49:36,539 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 19:49:36,539 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 19:49:36,542 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 19:49:36,543 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 19:49:36,544 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 19:49:36,544 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 19:49:36,546 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 19:49:36,547 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 19:49:36,547 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 19:49:36,549 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 19:49:36,550 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 19:49:36,550 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 19:49:36,551 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 19:49:36,551 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 19:49:36,552 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 19:49:36,552 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 19:49:36,554 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:36,590 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 19:49:36,591 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 19:49:36,594 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 19:49:36,594 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 19:49:36,595 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 19:49:36,595 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 19:49:36,595 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 19:49:36,595 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 19:49:36,595 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 19:49:36,596 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 19:49:36,596 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 19:49:36,596 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 19:49:36,600 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 19:49:36,601 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 19:49:36,601 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 19:49:36,601 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 19:49:36,601 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 19:49:36,602 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 19:49:36,602 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 19:49:36,602 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 19:49:36,602 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 19:49:36,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 19:49:36,603 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 19:49:36,603 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 19:49:36,603 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 19:49:36,603 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 19:49:36,603 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 19:49:36,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 19:49:36,604 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 19:49:36,654 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 19:49:36,671 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 19:49:36,675 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 19:49:36,676 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 19:49:36,677 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 19:49:36,677 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label45.c [2019-09-07 19:49:36,738 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d01fcadc/425bd44e5d3b423ca3bb3e7419451a92/FLAGb36f8abd0 [2019-09-07 19:49:37,439 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 19:49:37,440 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label45.c [2019-09-07 19:49:37,477 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d01fcadc/425bd44e5d3b423ca3bb3e7419451a92/FLAGb36f8abd0 [2019-09-07 19:49:37,982 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d01fcadc/425bd44e5d3b423ca3bb3e7419451a92 [2019-09-07 19:49:37,993 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 19:49:37,994 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 19:49:37,995 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 19:49:37,995 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 19:49:37,999 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 19:49:37,999 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:49:37" (1/1) ... [2019-09-07 19:49:38,002 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23b28937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:49:38, skipping insertion in model container [2019-09-07 19:49:38,002 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:49:37" (1/1) ... [2019-09-07 19:49:38,010 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 19:49:38,181 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 19:49:39,760 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:49:39,777 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 19:49:40,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:49:40,604 INFO L192 MainTranslator]: Completed translation [2019-09-07 19:49:40,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:49:40 WrapperNode [2019-09-07 19:49:40,605 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 19:49:40,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 19:49:40,606 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 19:49:40,606 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 19:49:40,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:49:40" (1/1) ... [2019-09-07 19:49:40,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:49:40" (1/1) ... [2019-09-07 19:49:40,697 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:49:40" (1/1) ... [2019-09-07 19:49:40,699 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:49:40" (1/1) ... [2019-09-07 19:49:40,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:49:40" (1/1) ... [2019-09-07 19:49:40,939 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:49:40" (1/1) ... [2019-09-07 19:49:41,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:49:40" (1/1) ... [2019-09-07 19:49:41,062 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 19:49:41,063 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 19:49:41,063 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 19:49:41,063 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 19:49:41,064 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:49:40" (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:49:41,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 19:49:41,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 19:49:41,133 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 19:49:41,134 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 19:49:41,134 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-07 19:49:41,134 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2019-09-07 19:49:41,134 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 19:49:41,134 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 19:49:41,134 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 19:49:41,135 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-07 19:49:41,135 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2019-09-07 19:49:41,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 19:49:41,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 19:49:41,139 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 19:49:41,140 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 19:49:41,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 19:49:41,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 19:49:47,892 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 19:49:47,893 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 19:49:47,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:49:47 BoogieIcfgContainer [2019-09-07 19:49:47,900 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 19:49:47,901 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 19:49:47,901 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 19:49:47,905 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 19:49:47,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 07:49:37" (1/3) ... [2019-09-07 19:49:47,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57bbb6c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:49:47, skipping insertion in model container [2019-09-07 19:49:47,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:49:40" (2/3) ... [2019-09-07 19:49:47,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57bbb6c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:49:47, skipping insertion in model container [2019-09-07 19:49:47,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:49:47" (3/3) ... [2019-09-07 19:49:47,913 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem13_label45.c [2019-09-07 19:49:47,931 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 19:49:47,946 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 19:49:47,975 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 19:49:48,049 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 19:49:48,051 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 19:49:48,051 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 19:49:48,051 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 19:49:48,051 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 19:49:48,052 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 19:49:48,052 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 19:49:48,052 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 19:49:48,052 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 19:49:48,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states. [2019-09-07 19:49:48,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-07 19:49:48,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:49:48,118 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:49:48,120 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:49:48,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:49:48,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1434155184, now seen corresponding path program 1 times [2019-09-07 19:49:48,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:49:48,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:49:48,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:49:48,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:49:48,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:49:48,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:49:48,427 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:49:48,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:49:48,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 19:49:48,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:49:48,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:49:48,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:49:48,455 INFO L87 Difference]: Start difference. First operand 1119 states. Second operand 4 states. [2019-09-07 19:49:58,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:49:58,411 INFO L93 Difference]: Finished difference Result 4059 states and 7607 transitions. [2019-09-07 19:49:58,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 19:49:58,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-09-07 19:49:58,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:49:58,484 INFO L225 Difference]: With dead ends: 4059 [2019-09-07 19:49:58,484 INFO L226 Difference]: Without dead ends: 2859 [2019-09-07 19:49:58,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:49:58,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2019-09-07 19:49:58,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 1920. [2019-09-07 19:49:58,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1920 states. [2019-09-07 19:49:58,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1920 states and 3303 transitions. [2019-09-07 19:49:58,731 INFO L78 Accepts]: Start accepts. Automaton has 1920 states and 3303 transitions. Word has length 13 [2019-09-07 19:49:58,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:49:58,731 INFO L475 AbstractCegarLoop]: Abstraction has 1920 states and 3303 transitions. [2019-09-07 19:49:58,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:49:58,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1920 states and 3303 transitions. [2019-09-07 19:49:58,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-07 19:49:58,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:49:58,738 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:49:58,738 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:49:58,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:49:58,739 INFO L82 PathProgramCache]: Analyzing trace with hash 325952728, now seen corresponding path program 1 times [2019-09-07 19:49:58,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:49:58,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:49:58,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:49:58,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:49:58,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:49:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:49:59,067 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:49:59,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:49:59,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:49:59,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:49:59,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:49:59,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:49:59,080 INFO L87 Difference]: Start difference. First operand 1920 states and 3303 transitions. Second operand 6 states. [2019-09-07 19:50:08,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:50:08,989 INFO L93 Difference]: Finished difference Result 5573 states and 9713 transitions. [2019-09-07 19:50:08,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:50:08,990 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-09-07 19:50:08,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:50:09,016 INFO L225 Difference]: With dead ends: 5573 [2019-09-07 19:50:09,017 INFO L226 Difference]: Without dead ends: 3659 [2019-09-07 19:50:09,023 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:09,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3659 states. [2019-09-07 19:50:09,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3659 to 3612. [2019-09-07 19:50:09,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3612 states. [2019-09-07 19:50:09,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3612 states to 3612 states and 6092 transitions. [2019-09-07 19:50:09,184 INFO L78 Accepts]: Start accepts. Automaton has 3612 states and 6092 transitions. Word has length 83 [2019-09-07 19:50:09,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:50:09,185 INFO L475 AbstractCegarLoop]: Abstraction has 3612 states and 6092 transitions. [2019-09-07 19:50:09,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:50:09,185 INFO L276 IsEmpty]: Start isEmpty. Operand 3612 states and 6092 transitions. [2019-09-07 19:50:09,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-07 19:50:09,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:50:09,191 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:50:09,192 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:50:09,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:50:09,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1122806031, now seen corresponding path program 1 times [2019-09-07 19:50:09,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:50:09,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:50:09,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:50:09,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:50:09,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:50:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:50:09,403 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:50:09,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:50:09,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:50:09,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:50:09,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:50:09,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:50:09,405 INFO L87 Difference]: Start difference. First operand 3612 states and 6092 transitions. Second operand 6 states. [2019-09-07 19:50:16,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:50:16,806 INFO L93 Difference]: Finished difference Result 9803 states and 16883 transitions. [2019-09-07 19:50:16,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:50:16,807 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-09-07 19:50:16,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:50:16,852 INFO L225 Difference]: With dead ends: 9803 [2019-09-07 19:50:16,855 INFO L226 Difference]: Without dead ends: 6197 [2019-09-07 19:50:16,868 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:16,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6197 states. [2019-09-07 19:50:17,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6197 to 6142. [2019-09-07 19:50:17,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6142 states. [2019-09-07 19:50:17,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6142 states to 6142 states and 10165 transitions. [2019-09-07 19:50:17,091 INFO L78 Accepts]: Start accepts. Automaton has 6142 states and 10165 transitions. Word has length 86 [2019-09-07 19:50:17,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:50:17,092 INFO L475 AbstractCegarLoop]: Abstraction has 6142 states and 10165 transitions. [2019-09-07 19:50:17,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:50:17,093 INFO L276 IsEmpty]: Start isEmpty. Operand 6142 states and 10165 transitions. [2019-09-07 19:50:17,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-07 19:50:17,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:50:17,095 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:50:17,095 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:50:17,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:50:17,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1977807237, now seen corresponding path program 1 times [2019-09-07 19:50:17,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:50:17,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:50:17,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:50:17,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:50:17,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:50:17,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:50:17,201 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:50:17,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:50:17,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 19:50:17,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 19:50:17,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 19:50:17,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 19:50:17,204 INFO L87 Difference]: Start difference. First operand 6142 states and 10165 transitions. Second operand 5 states. [2019-09-07 19:50:25,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:50:25,590 INFO L93 Difference]: Finished difference Result 17822 states and 30773 transitions. [2019-09-07 19:50:25,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 19:50:25,590 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-09-07 19:50:25,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:50:25,653 INFO L225 Difference]: With dead ends: 17822 [2019-09-07 19:50:25,653 INFO L226 Difference]: Without dead ends: 11686 [2019-09-07 19:50:25,675 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:25,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11686 states. [2019-09-07 19:50:25,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11686 to 11466. [2019-09-07 19:50:25,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11466 states. [2019-09-07 19:50:26,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11466 states to 11466 states and 17880 transitions. [2019-09-07 19:50:26,014 INFO L78 Accepts]: Start accepts. Automaton has 11466 states and 17880 transitions. Word has length 96 [2019-09-07 19:50:26,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:50:26,014 INFO L475 AbstractCegarLoop]: Abstraction has 11466 states and 17880 transitions. [2019-09-07 19:50:26,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 19:50:26,015 INFO L276 IsEmpty]: Start isEmpty. Operand 11466 states and 17880 transitions. [2019-09-07 19:50:26,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-07 19:50:26,024 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:50:26,024 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:50:26,025 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:50:26,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:50:26,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1114105367, now seen corresponding path program 1 times [2019-09-07 19:50:26,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:50:26,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:50:26,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:50:26,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:50:26,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:50:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:50:26,132 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:50:26,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:50:26,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 19:50:26,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 19:50:26,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 19:50:26,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:50:26,134 INFO L87 Difference]: Start difference. First operand 11466 states and 17880 transitions. Second operand 3 states. [2019-09-07 19:50:33,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:50:33,705 INFO L93 Difference]: Finished difference Result 32943 states and 53882 transitions. [2019-09-07 19:50:33,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 19:50:33,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2019-09-07 19:50:33,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:50:33,802 INFO L225 Difference]: With dead ends: 32943 [2019-09-07 19:50:33,802 INFO L226 Difference]: Without dead ends: 21483 [2019-09-07 19:50:33,842 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:33,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21483 states. [2019-09-07 19:50:34,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21483 to 21474. [2019-09-07 19:50:34,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21474 states. [2019-09-07 19:50:34,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21474 states to 21474 states and 32272 transitions. [2019-09-07 19:50:34,480 INFO L78 Accepts]: Start accepts. Automaton has 21474 states and 32272 transitions. Word has length 113 [2019-09-07 19:50:34,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:50:34,482 INFO L475 AbstractCegarLoop]: Abstraction has 21474 states and 32272 transitions. [2019-09-07 19:50:34,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 19:50:34,482 INFO L276 IsEmpty]: Start isEmpty. Operand 21474 states and 32272 transitions. [2019-09-07 19:50:34,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-07 19:50:34,485 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:50:34,485 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,485 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:50:34,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:50:34,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1776191122, now seen corresponding path program 1 times [2019-09-07 19:50:34,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:50:34,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:50:34,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:50:34,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:50:34,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:50:34,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:50:34,732 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:50:34,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:50:34,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:50:34,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:50:34,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:50:34,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:50:34,734 INFO L87 Difference]: Start difference. First operand 21474 states and 32272 transitions. Second operand 6 states. [2019-09-07 19:50:46,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:50:46,936 INFO L93 Difference]: Finished difference Result 72176 states and 115658 transitions. [2019-09-07 19:50:46,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:50:46,936 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 154 [2019-09-07 19:50:46,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:50:47,164 INFO L225 Difference]: With dead ends: 72176 [2019-09-07 19:50:47,164 INFO L226 Difference]: Without dead ends: 50708 [2019-09-07 19:50:47,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-07 19:50:47,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50708 states. [2019-09-07 19:50:48,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50708 to 50660. [2019-09-07 19:50:48,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50660 states. [2019-09-07 19:50:48,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50660 states to 50660 states and 76852 transitions. [2019-09-07 19:50:48,608 INFO L78 Accepts]: Start accepts. Automaton has 50660 states and 76852 transitions. Word has length 154 [2019-09-07 19:50:48,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:50:48,609 INFO L475 AbstractCegarLoop]: Abstraction has 50660 states and 76852 transitions. [2019-09-07 19:50:48,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:50:48,609 INFO L276 IsEmpty]: Start isEmpty. Operand 50660 states and 76852 transitions. [2019-09-07 19:50:48,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-07 19:50:48,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:50:48,618 INFO L399 BasicCegarLoop]: trace histogram [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, 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:48,619 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:50:48,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:50:48,619 INFO L82 PathProgramCache]: Analyzing trace with hash 434410572, now seen corresponding path program 1 times [2019-09-07 19:50:48,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:50:48,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:50:48,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:50:48,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:50:48,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:50:48,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:50:48,821 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-07 19:50:48,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:50:48,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 19:50:48,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 19:50:48,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 19:50:48,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:50:48,832 INFO L87 Difference]: Start difference. First operand 50660 states and 76852 transitions. Second operand 3 states. [2019-09-07 19:50:54,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:50:54,713 INFO L93 Difference]: Finished difference Result 101322 states and 154545 transitions. [2019-09-07 19:50:54,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 19:50:54,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-09-07 19:50:54,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:50:54,894 INFO L225 Difference]: With dead ends: 101322 [2019-09-07 19:50:54,895 INFO L226 Difference]: Without dead ends: 50668 [2019-09-07 19:50:55,024 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:55,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50668 states. [2019-09-07 19:50:57,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50668 to 50663. [2019-09-07 19:50:57,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50663 states. [2019-09-07 19:50:57,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50663 states to 50663 states and 71333 transitions. [2019-09-07 19:50:57,597 INFO L78 Accepts]: Start accepts. Automaton has 50663 states and 71333 transitions. Word has length 213 [2019-09-07 19:50:57,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:50:57,597 INFO L475 AbstractCegarLoop]: Abstraction has 50663 states and 71333 transitions. [2019-09-07 19:50:57,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 19:50:57,597 INFO L276 IsEmpty]: Start isEmpty. Operand 50663 states and 71333 transitions. [2019-09-07 19:50:57,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-07 19:50:57,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:50:57,603 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57,603 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:50:57,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:50:57,604 INFO L82 PathProgramCache]: Analyzing trace with hash 155748619, now seen corresponding path program 1 times [2019-09-07 19:50:57,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:50:57,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:50:57,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:50:57,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:50:57,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:50:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:50:57,899 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:50:57,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:50:57,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:50:57,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:50:57,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:50:57,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:50:57,902 INFO L87 Difference]: Start difference. First operand 50663 states and 71333 transitions. Second operand 6 states. [2019-09-07 19:51:06,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:51:06,174 INFO L93 Difference]: Finished difference Result 139541 states and 214324 transitions. [2019-09-07 19:51:06,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:51:06,174 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 222 [2019-09-07 19:51:06,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:51:07,125 INFO L225 Difference]: With dead ends: 139541 [2019-09-07 19:51:07,126 INFO L226 Difference]: Without dead ends: 88884 [2019-09-07 19:51:07,226 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:51:07,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88884 states. [2019-09-07 19:51:08,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88884 to 87867. [2019-09-07 19:51:08,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87867 states. [2019-09-07 19:51:09,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87867 states to 87867 states and 124183 transitions. [2019-09-07 19:51:09,031 INFO L78 Accepts]: Start accepts. Automaton has 87867 states and 124183 transitions. Word has length 222 [2019-09-07 19:51:09,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:51:09,032 INFO L475 AbstractCegarLoop]: Abstraction has 87867 states and 124183 transitions. [2019-09-07 19:51:09,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:51:09,033 INFO L276 IsEmpty]: Start isEmpty. Operand 87867 states and 124183 transitions. [2019-09-07 19:51:09,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-07 19:51:09,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:51:09,039 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:51:09,040 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:51:09,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:51:09,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1063313001, now seen corresponding path program 1 times [2019-09-07 19:51:09,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:51:09,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:51:09,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:51:09,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:51:09,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:51:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:51:11,209 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 115 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 19:51:11,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:51:11,210 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:51:11,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:51:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:51:11,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 19:51:11,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:51:11,453 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 19:51:11,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:51:11,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-09-07 19:51:11,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:51:11,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:51:11,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:51:11,470 INFO L87 Difference]: Start difference. First operand 87867 states and 124183 transitions. Second operand 6 states. [2019-09-07 19:51:27,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:51:27,447 INFO L93 Difference]: Finished difference Result 215742 states and 317264 transitions. [2019-09-07 19:51:27,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 19:51:27,447 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 245 [2019-09-07 19:51:27,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:51:28,135 INFO L225 Difference]: With dead ends: 215742 [2019-09-07 19:51:28,135 INFO L226 Difference]: Without dead ends: 127881 [2019-09-07 19:51:28,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-09-07 19:51:28,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127881 states. [2019-09-07 19:51:32,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127881 to 119268. [2019-09-07 19:51:32,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119268 states. [2019-09-07 19:51:32,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119268 states to 119268 states and 148636 transitions. [2019-09-07 19:51:32,606 INFO L78 Accepts]: Start accepts. Automaton has 119268 states and 148636 transitions. Word has length 245 [2019-09-07 19:51:32,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:51:32,607 INFO L475 AbstractCegarLoop]: Abstraction has 119268 states and 148636 transitions. [2019-09-07 19:51:32,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:51:32,607 INFO L276 IsEmpty]: Start isEmpty. Operand 119268 states and 148636 transitions. [2019-09-07 19:51:32,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-07 19:51:32,614 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:51:32,614 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 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:32,615 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:51:32,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:51:32,615 INFO L82 PathProgramCache]: Analyzing trace with hash -2027069195, now seen corresponding path program 1 times [2019-09-07 19:51:32,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:51:32,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:51:32,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:51:32,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:51:32,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:51:32,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:51:32,902 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 162 proven. 9 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-09-07 19:51:32,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:51:32,903 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:32,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:51:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:51:33,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 19:51:33,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:51:33,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:51:33,181 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-09-07 19:51:33,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:51:33,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2019-09-07 19:51:33,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 19:51:33,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 19:51:33,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-07 19:51:33,190 INFO L87 Difference]: Start difference. First operand 119268 states and 148636 transitions. Second operand 10 states. [2019-09-07 19:52:12,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:52:12,620 INFO L93 Difference]: Finished difference Result 373234 states and 497106 transitions. [2019-09-07 19:52:12,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-07 19:52:12,623 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 258 [2019-09-07 19:52:12,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:52:14,379 INFO L225 Difference]: With dead ends: 373234 [2019-09-07 19:52:14,379 INFO L226 Difference]: Without dead ends: 252350 [2019-09-07 19:52:14,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=281, Invalid=1201, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 19:52:14,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252350 states. [2019-09-07 19:52:18,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252350 to 201889. [2019-09-07 19:52:18,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201889 states. [2019-09-07 19:52:18,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201889 states to 201889 states and 257852 transitions. [2019-09-07 19:52:18,925 INFO L78 Accepts]: Start accepts. Automaton has 201889 states and 257852 transitions. Word has length 258 [2019-09-07 19:52:18,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:52:18,925 INFO L475 AbstractCegarLoop]: Abstraction has 201889 states and 257852 transitions. [2019-09-07 19:52:18,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 19:52:18,926 INFO L276 IsEmpty]: Start isEmpty. Operand 201889 states and 257852 transitions. [2019-09-07 19:52:18,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-09-07 19:52:18,930 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:52:18,931 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 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:18,931 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:52:18,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:52:18,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1684242873, now seen corresponding path program 1 times [2019-09-07 19:52:18,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:52:18,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:52:18,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:52:18,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:52:18,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:52:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:52:19,198 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-09-07 19:52:19,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:52:19,199 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:52:19,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:52:19,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:52:19,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:52:19,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:52:19,436 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 139 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream closed [2019-09-07 19:52:19,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:52:19,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 19:52:19,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:52:19,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:52:19,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:52:19,451 INFO L87 Difference]: Start difference. First operand 201889 states and 257852 transitions. Second operand 9 states. [2019-09-07 19:52:31,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:52:31,476 INFO L93 Difference]: Finished difference Result 385996 states and 500054 transitions. [2019-09-07 19:52:31,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 19:52:31,477 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 288 [2019-09-07 19:52:31,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:52:31,982 INFO L225 Difference]: With dead ends: 385996 [2019-09-07 19:52:31,982 INFO L226 Difference]: Without dead ends: 197165 [2019-09-07 19:52:32,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 289 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-09-07 19:52:32,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197165 states. [2019-09-07 19:52:39,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197165 to 174334. [2019-09-07 19:52:39,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174334 states. [2019-09-07 19:52:40,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174334 states to 174334 states and 220399 transitions. [2019-09-07 19:52:40,020 INFO L78 Accepts]: Start accepts. Automaton has 174334 states and 220399 transitions. Word has length 288 [2019-09-07 19:52:40,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:52:40,020 INFO L475 AbstractCegarLoop]: Abstraction has 174334 states and 220399 transitions. [2019-09-07 19:52:40,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 19:52:40,020 INFO L276 IsEmpty]: Start isEmpty. Operand 174334 states and 220399 transitions. [2019-09-07 19:52:40,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-09-07 19:52:40,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:52:40,037 INFO L399 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:52:40,037 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:52:40,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:52:40,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1418527444, now seen corresponding path program 1 times [2019-09-07 19:52:40,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:52:40,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:52:40,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:52:40,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:52:40,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:52:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:52:40,343 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 233 proven. 75 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2019-09-07 19:52:40,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:52:40,343 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:40,364 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:40,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:52:40,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 19:52:40,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:52:40,680 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 364 proven. 2 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-09-07 19:52:40,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:52:40,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2019-09-07 19:52:40,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 19:52:40,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 19:52:40,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-09-07 19:52:40,687 INFO L87 Difference]: Start difference. First operand 174334 states and 220399 transitions. Second operand 11 states. [2019-09-07 19:53:45,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:53:45,285 INFO L93 Difference]: Finished difference Result 536903 states and 681317 transitions. [2019-09-07 19:53:45,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-07 19:53:45,285 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 393 [2019-09-07 19:53:45,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:53:46,106 INFO L225 Difference]: With dead ends: 536903 [2019-09-07 19:53:46,107 INFO L226 Difference]: Without dead ends: 357634 [2019-09-07 19:53:46,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 443 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1558 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=803, Invalid=3753, Unknown=0, NotChecked=0, Total=4556 [2019-09-07 19:53:46,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357634 states. [2019-09-07 19:53:56,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357634 to 332510. [2019-09-07 19:53:56,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332510 states. [2019-09-07 19:53:57,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332510 states to 332510 states and 395927 transitions. [2019-09-07 19:53:57,073 INFO L78 Accepts]: Start accepts. Automaton has 332510 states and 395927 transitions. Word has length 393 [2019-09-07 19:53:57,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:53:57,074 INFO L475 AbstractCegarLoop]: Abstraction has 332510 states and 395927 transitions. [2019-09-07 19:53:57,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 19:53:57,074 INFO L276 IsEmpty]: Start isEmpty. Operand 332510 states and 395927 transitions. [2019-09-07 19:53:57,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2019-09-07 19:53:57,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:53:57,084 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57,084 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:53:57,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:53:57,085 INFO L82 PathProgramCache]: Analyzing trace with hash -615401171, now seen corresponding path program 1 times [2019-09-07 19:53:57,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:53:57,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:53:57,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:53:57,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:53:57,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:53:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:53:57,322 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-09-07 19:53:57,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:53:57,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 19:53:57,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 19:53:57,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 19:53:57,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:53:57,324 INFO L87 Difference]: Start difference. First operand 332510 states and 395927 transitions. Second operand 3 states. [2019-09-07 19:54:08,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:54:08,531 INFO L93 Difference]: Finished difference Result 676933 states and 804924 transitions. [2019-09-07 19:54:08,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 19:54:08,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 429 [2019-09-07 19:54:08,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:54:10,178 INFO L225 Difference]: With dead ends: 676933 [2019-09-07 19:54:10,178 INFO L226 Difference]: Without dead ends: 340318 [2019-09-07 19:54:10,450 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:54:10,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340318 states. [2019-09-07 19:54:18,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340318 to 333853. [2019-09-07 19:54:18,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333853 states. [2019-09-07 19:54:19,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333853 states to 333853 states and 379889 transitions. [2019-09-07 19:54:19,425 INFO L78 Accepts]: Start accepts. Automaton has 333853 states and 379889 transitions. Word has length 429 [2019-09-07 19:54:19,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:54:19,426 INFO L475 AbstractCegarLoop]: Abstraction has 333853 states and 379889 transitions. [2019-09-07 19:54:19,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 19:54:19,426 INFO L276 IsEmpty]: Start isEmpty. Operand 333853 states and 379889 transitions. [2019-09-07 19:54:19,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2019-09-07 19:54:19,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:54:19,435 INFO L399 BasicCegarLoop]: trace histogram [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, 4, 4, 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, 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] [2019-09-07 19:54:19,436 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:54:19,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:54:19,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1410460148, now seen corresponding path program 1 times [2019-09-07 19:54:19,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:54:19,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:54:19,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:54:19,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:54:19,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:54:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:54:20,818 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 130 proven. 188 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-09-07 19:54:20,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:54:20,819 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:54:20,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:54:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:54:20,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:54:20,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:54:21,068 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2019-09-07 19:54:21,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:54:21,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2019-09-07 19:54:21,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 19:54:21,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 19:54:21,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-07 19:54:21,083 INFO L87 Difference]: Start difference. First operand 333853 states and 379889 transitions. Second operand 8 states. [2019-09-07 19:54:37,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:54:37,165 INFO L93 Difference]: Finished difference Result 769122 states and 913518 transitions. [2019-09-07 19:54:37,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 19:54:37,166 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 446 [2019-09-07 19:54:37,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:54:46,001 INFO L225 Difference]: With dead ends: 769122 [2019-09-07 19:54:46,001 INFO L226 Difference]: Without dead ends: 433601 [2019-09-07 19:54:46,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 459 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-07 19:54:46,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433601 states. [2019-09-07 19:54:51,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433601 to 418383. [2019-09-07 19:54:51,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418383 states. [2019-09-07 19:54:53,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418383 states to 418383 states and 469551 transitions. [2019-09-07 19:54:53,028 INFO L78 Accepts]: Start accepts. Automaton has 418383 states and 469551 transitions. Word has length 446 [2019-09-07 19:54:53,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:54:53,029 INFO L475 AbstractCegarLoop]: Abstraction has 418383 states and 469551 transitions. [2019-09-07 19:54:53,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 19:54:53,029 INFO L276 IsEmpty]: Start isEmpty. Operand 418383 states and 469551 transitions. [2019-09-07 19:54:53,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2019-09-07 19:54:53,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:54:53,037 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:54:53,038 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:54:53,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:54:53,038 INFO L82 PathProgramCache]: Analyzing trace with hash 806134815, now seen corresponding path program 1 times [2019-09-07 19:54:53,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:54:53,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:54:53,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:54:53,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:54:53,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:54:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:54:53,319 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2019-09-07 19:54:53,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:54:53,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 19:54:53,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 19:54:53,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 19:54:53,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:54:53,321 INFO L87 Difference]: Start difference. First operand 418383 states and 469551 transitions. Second operand 3 states. [2019-09-07 19:55:05,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:55:05,825 INFO L93 Difference]: Finished difference Result 868801 states and 980861 transitions. [2019-09-07 19:55:05,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 19:55:05,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 490 [2019-09-07 19:55:05,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:55:06,942 INFO L225 Difference]: With dead ends: 868801 [2019-09-07 19:55:06,942 INFO L226 Difference]: Without dead ends: 447115 [2019-09-07 19:55:07,309 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:55:07,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447115 states. [2019-09-07 19:55:17,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447115 to 430217. [2019-09-07 19:55:17,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430217 states. [2019-09-07 19:55:19,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430217 states to 430217 states and 474195 transitions. [2019-09-07 19:55:19,689 INFO L78 Accepts]: Start accepts. Automaton has 430217 states and 474195 transitions. Word has length 490 [2019-09-07 19:55:19,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:55:19,690 INFO L475 AbstractCegarLoop]: Abstraction has 430217 states and 474195 transitions. [2019-09-07 19:55:19,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 19:55:19,690 INFO L276 IsEmpty]: Start isEmpty. Operand 430217 states and 474195 transitions. [2019-09-07 19:55:19,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2019-09-07 19:55:19,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:55:19,700 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,700 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:55:19,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:55:19,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1500434369, now seen corresponding path program 1 times [2019-09-07 19:55:19,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:55:19,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:55:19,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:55:19,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:55:19,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:55:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:55:20,246 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 89 proven. 290 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 19:55:20,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:55:20,247 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:55:20,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:55:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:55:20,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 19:55:20,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:55:20,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:55:21,640 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 374 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-07 19:55:21,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:55:21,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2019-09-07 19:55:21,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 19:55:21,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 19:55:21,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-09-07 19:55:21,648 INFO L87 Difference]: Start difference. First operand 430217 states and 474195 transitions. Second operand 16 states. [2019-09-07 19:56:13,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:56:13,494 INFO L93 Difference]: Finished difference Result 815344 states and 902073 transitions. [2019-09-07 19:56:13,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-09-07 19:56:13,494 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 516 [2019-09-07 19:56:13,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:56:14,696 INFO L225 Difference]: With dead ends: 815344 [2019-09-07 19:56:14,696 INFO L226 Difference]: Without dead ends: 517310 [2019-09-07 19:56:15,007 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 709 GetRequests, 597 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4877 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1796, Invalid=10860, Unknown=0, NotChecked=0, Total=12656 [2019-09-07 19:56:15,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517310 states. [2019-09-07 19:56:29,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517310 to 492779. [2019-09-07 19:56:29,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492779 states. [2019-09-07 19:56:31,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492779 states to 492779 states and 540139 transitions. [2019-09-07 19:56:31,175 INFO L78 Accepts]: Start accepts. Automaton has 492779 states and 540139 transitions. Word has length 516 [2019-09-07 19:56:31,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:56:31,175 INFO L475 AbstractCegarLoop]: Abstraction has 492779 states and 540139 transitions. [2019-09-07 19:56:31,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 19:56:31,176 INFO L276 IsEmpty]: Start isEmpty. Operand 492779 states and 540139 transitions. [2019-09-07 19:56:31,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 625 [2019-09-07 19:56:31,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:56:31,190 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 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, 7, 7, 7, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:56:31,191 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:56:31,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:56:31,191 INFO L82 PathProgramCache]: Analyzing trace with hash -553597147, now seen corresponding path program 1 times [2019-09-07 19:56:31,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:56:31,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:56:31,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:56:31,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:56:31,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:56:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:56:31,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 325 proven. 559 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2019-09-07 19:56:31,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:56:31,927 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) [2019-09-07 19:56:31,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:56:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:56:32,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 1085 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:56:32,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:56:37,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 1168 proven. 2 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2019-09-07 19:56:37,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:56:37,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-09-07 19:56:37,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 19:56:37,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 19:56:37,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-07 19:56:37,396 INFO L87 Difference]: Start difference. First operand 492779 states and 540139 transitions. Second operand 11 states. [2019-09-07 19:56:55,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:56:55,000 INFO L93 Difference]: Finished difference Result 991778 states and 1086838 transitions. [2019-09-07 19:56:55,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 19:56:55,001 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 624 [2019-09-07 19:56:55,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:56:56,151 INFO L225 Difference]: With dead ends: 991778 [2019-09-07 19:56:56,152 INFO L226 Difference]: Without dead ends: 508666 [2019-09-07 19:56:56,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 633 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2019-09-07 19:56:56,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508666 states. [2019-09-07 19:57:10,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508666 to 503767. [2019-09-07 19:57:10,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503767 states. [2019-09-07 19:57:12,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503767 states to 503767 states and 543500 transitions. [2019-09-07 19:57:12,470 INFO L78 Accepts]: Start accepts. Automaton has 503767 states and 543500 transitions. Word has length 624 [2019-09-07 19:57:12,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:57:12,471 INFO L475 AbstractCegarLoop]: Abstraction has 503767 states and 543500 transitions. [2019-09-07 19:57:12,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 19:57:12,471 INFO L276 IsEmpty]: Start isEmpty. Operand 503767 states and 543500 transitions. [2019-09-07 19:57:12,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2019-09-07 19:57:12,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:57:12,490 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:57:12,490 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:57:12,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:57:12,491 INFO L82 PathProgramCache]: Analyzing trace with hash -744593267, now seen corresponding path program 1 times [2019-09-07 19:57:12,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:57:12,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:57:12,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:57:12,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:57:12,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:57:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:57:12,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1634 backedges. 295 proven. 208 refuted. 0 times theorem prover too weak. 1131 trivial. 0 not checked. [2019-09-07 19:57:12,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:57:12,914 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:57:12,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:57:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:57:13,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 1121 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 19:57:13,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:57:13,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 19:57:19,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1634 backedges. 877 proven. 2 refuted. 0 times theorem prover too weak. 755 trivial. 0 not checked. [2019-09-07 19:57:19,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:57:19,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 11 [2019-09-07 19:57:19,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 19:57:19,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 19:57:19,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-07 19:57:19,187 INFO L87 Difference]: Start difference. First operand 503767 states and 543500 transitions. Second operand 11 states. [2019-09-07 19:58:00,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:58:00,792 INFO L93 Difference]: Finished difference Result 1102288 states and 1193163 transitions. [2019-09-07 19:58:00,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-07 19:58:00,793 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 663 [2019-09-07 19:58:00,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:58:02,218 INFO L225 Difference]: With dead ends: 1102288 [2019-09-07 19:58:02,218 INFO L226 Difference]: Without dead ends: 610605 [2019-09-07 19:58:02,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 840 GetRequests, 741 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3911 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1308, Invalid=8792, Unknown=0, NotChecked=0, Total=10100 [2019-09-07 19:58:03,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610605 states. [2019-09-07 19:58:18,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610605 to 596765. [2019-09-07 19:58:18,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596765 states. [2019-09-07 19:58:20,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596765 states to 596765 states and 637929 transitions. [2019-09-07 19:58:20,419 INFO L78 Accepts]: Start accepts. Automaton has 596765 states and 637929 transitions. Word has length 663 [2019-09-07 19:58:20,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:58:20,419 INFO L475 AbstractCegarLoop]: Abstraction has 596765 states and 637929 transitions. [2019-09-07 19:58:20,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 19:58:20,420 INFO L276 IsEmpty]: Start isEmpty. Operand 596765 states and 637929 transitions. [2019-09-07 19:58:20,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2019-09-07 19:58:20,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:58:20,430 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:20,430 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:58:20,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:58:20,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1924012481, now seen corresponding path program 1 times [2019-09-07 19:58:20,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:58:20,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:58:20,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:58:20,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:58:20,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:58:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:58:27,322 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-09-07 19:58:27,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:58:27,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 19:58:27,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 19:58:27,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 19:58:27,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 19:58:27,325 INFO L87 Difference]: Start difference. First operand 596765 states and 637929 transitions. Second operand 4 states. [2019-09-07 19:58:39,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:58:39,267 INFO L93 Difference]: Finished difference Result 1200602 states and 1284253 transitions. [2019-09-07 19:58:39,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 19:58:39,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 732 [2019-09-07 19:58:39,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:58:40,871 INFO L225 Difference]: With dead ends: 1200602 [2019-09-07 19:58:40,871 INFO L226 Difference]: Without dead ends: 629673 [2019-09-07 19:58:41,229 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:58:42,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629673 states. [2019-09-07 19:58:57,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629673 to 611980. [2019-09-07 19:58:57,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611980 states. [2019-09-07 19:58:59,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611980 states to 611980 states and 651300 transitions. [2019-09-07 19:58:59,599 INFO L78 Accepts]: Start accepts. Automaton has 611980 states and 651300 transitions. Word has length 732 [2019-09-07 19:58:59,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:58:59,600 INFO L475 AbstractCegarLoop]: Abstraction has 611980 states and 651300 transitions. [2019-09-07 19:58:59,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 19:58:59,600 INFO L276 IsEmpty]: Start isEmpty. Operand 611980 states and 651300 transitions. [2019-09-07 19:58:59,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 757 [2019-09-07 19:58:59,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:58:59,614 INFO L399 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:58:59,615 INFO L418 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:58:59,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:58:59,615 INFO L82 PathProgramCache]: Analyzing trace with hash -451722048, now seen corresponding path program 1 times [2019-09-07 19:58:59,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:58:59,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:58:59,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:58:59,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:58:59,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:58:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:59:07,135 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 179 proven. 73 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2019-09-07 19:59:07,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:59:07,135 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) [2019-09-07 19:59:07,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:59:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:59:07,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 1104 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 19:59:07,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:59:07,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:59:07,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:59:07,616 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 591 proven. 2 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-07 19:59:07,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:59:07,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-09-07 19:59:07,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 19:59:07,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 19:59:07,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 19:59:07,622 INFO L87 Difference]: Start difference. First operand 611980 states and 651300 transitions. Second operand 7 states. [2019-09-07 19:59:24,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:59:24,900 INFO L93 Difference]: Finished difference Result 1215532 states and 1317229 transitions. [2019-09-07 19:59:24,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 19:59:24,901 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 756 [2019-09-07 19:59:24,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:59:26,834 INFO L225 Difference]: With dead ends: 1215532 [2019-09-07 19:59:26,834 INFO L226 Difference]: Without dead ends: 660890 [2019-09-07 19:59:27,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 773 GetRequests, 761 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 19:59:29,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660890 states. [2019-09-07 19:59:39,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660890 to 644659. [2019-09-07 19:59:39,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644659 states. [2019-09-07 19:59:40,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644659 states to 644659 states and 686936 transitions. [2019-09-07 19:59:40,766 INFO L78 Accepts]: Start accepts. Automaton has 644659 states and 686936 transitions. Word has length 756 [2019-09-07 19:59:40,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:59:40,767 INFO L475 AbstractCegarLoop]: Abstraction has 644659 states and 686936 transitions. [2019-09-07 19:59:40,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 19:59:40,767 INFO L276 IsEmpty]: Start isEmpty. Operand 644659 states and 686936 transitions. [2019-09-07 19:59:40,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 773 [2019-09-07 19:59:40,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:59:40,776 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 19:59:40,776 INFO L418 AbstractCegarLoop]: === Iteration 21 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:59:40,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:59:40,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1867333008, now seen corresponding path program 1 times [2019-09-07 19:59:40,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:59:40,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:59:40,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:59:40,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:59:40,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:59:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:59:49,441 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 255 proven. 160 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2019-09-07 19:59:49,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:59:49,441 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) [2019-09-07 19:59:49,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:59:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:59:49,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 1171 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 19:59:49,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:59:49,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:59:49,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 19:59:50,173 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 504 proven. 13 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2019-09-07 19:59:50,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:59:50,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 9 [2019-09-07 19:59:50,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 19:59:50,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 19:59:50,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-07 19:59:50,180 INFO L87 Difference]: Start difference. First operand 644659 states and 686936 transitions. Second operand 9 states.