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_label52.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 19:57:33,682 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 19:57:33,685 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 19:57:33,696 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 19:57:33,696 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 19:57:33,697 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 19:57:33,699 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 19:57:33,700 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 19:57:33,702 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 19:57:33,703 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 19:57:33,704 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 19:57:33,705 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 19:57:33,705 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 19:57:33,706 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 19:57:33,707 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 19:57:33,708 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 19:57:33,709 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 19:57:33,710 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 19:57:33,712 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 19:57:33,714 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 19:57:33,715 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 19:57:33,717 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 19:57:33,718 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 19:57:33,718 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 19:57:33,720 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 19:57:33,721 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 19:57:33,721 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 19:57:33,722 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 19:57:33,722 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 19:57:33,723 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 19:57:33,723 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 19:57:33,724 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 19:57:33,725 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 19:57:33,726 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 19:57:33,727 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 19:57:33,727 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 19:57:33,727 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 19:57:33,728 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 19:57:33,728 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 19:57:33,729 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 19:57:33,729 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 19:57:33,730 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:57:33,744 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 19:57:33,745 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 19:57:33,746 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 19:57:33,746 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 19:57:33,746 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 19:57:33,747 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 19:57:33,747 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 19:57:33,747 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 19:57:33,747 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 19:57:33,747 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 19:57:33,748 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 19:57:33,748 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 19:57:33,748 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 19:57:33,748 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 19:57:33,748 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 19:57:33,748 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 19:57:33,749 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 19:57:33,749 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 19:57:33,749 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 19:57:33,749 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 19:57:33,749 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 19:57:33,750 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 19:57:33,750 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 19:57:33,750 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 19:57:33,750 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 19:57:33,750 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 19:57:33,751 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 19:57:33,751 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 19:57:33,751 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 19:57:33,779 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 19:57:33,791 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 19:57:33,795 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 19:57:33,796 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 19:57:33,796 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 19:57:33,797 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem13_label52.c [2019-09-07 19:57:33,859 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/014bbc1af/34e720d748b64199ab091aa9f7c25504/FLAGcb644dd5a [2019-09-07 19:57:34,641 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 19:57:34,642 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem13_label52.c [2019-09-07 19:57:34,673 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/014bbc1af/34e720d748b64199ab091aa9f7c25504/FLAGcb644dd5a [2019-09-07 19:57:34,699 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/014bbc1af/34e720d748b64199ab091aa9f7c25504 [2019-09-07 19:57:34,710 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 19:57:34,712 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 19:57:34,713 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 19:57:34,713 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 19:57:34,718 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 19:57:34,719 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:57:34" (1/1) ... [2019-09-07 19:57:34,722 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b05ff34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:57:34, skipping insertion in model container [2019-09-07 19:57:34,722 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 07:57:34" (1/1) ... [2019-09-07 19:57:34,730 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 19:57:34,894 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 19:57:36,679 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:57:36,691 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 19:57:37,466 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 19:57:37,499 INFO L192 MainTranslator]: Completed translation [2019-09-07 19:57:37,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:57:37 WrapperNode [2019-09-07 19:57:37,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 19:57:37,501 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 19:57:37,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 19:57:37,501 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 19:57:37,516 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:57:37" (1/1) ... [2019-09-07 19:57:37,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:57:37" (1/1) ... [2019-09-07 19:57:37,586 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:57:37" (1/1) ... [2019-09-07 19:57:37,589 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:57:37" (1/1) ... [2019-09-07 19:57:37,723 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:57:37" (1/1) ... [2019-09-07 19:57:37,756 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:57:37" (1/1) ... [2019-09-07 19:57:37,788 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:57:37" (1/1) ... [2019-09-07 19:57:37,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 19:57:37,824 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 19:57:37,825 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 19:57:37,825 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 19:57:37,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:57:37" (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:57:37,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 19:57:37,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 19:57:37,924 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 19:57:37,924 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 19:57:37,924 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-07 19:57:37,925 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output4 [2019-09-07 19:57:37,925 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 19:57:37,925 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 19:57:37,926 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 19:57:37,926 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-07 19:57:37,926 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output4 [2019-09-07 19:57:37,926 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 19:57:37,927 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 19:57:37,927 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 19:57:37,927 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 19:57:37,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 19:57:37,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 19:57:44,367 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 19:57:44,367 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 19:57:44,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:57:44 BoogieIcfgContainer [2019-09-07 19:57:44,370 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 19:57:44,371 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 19:57:44,371 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 19:57:44,375 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 19:57:44,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 07:57:34" (1/3) ... [2019-09-07 19:57:44,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27bc82c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:57:44, skipping insertion in model container [2019-09-07 19:57:44,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 07:57:37" (2/3) ... [2019-09-07 19:57:44,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27bc82c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 07:57:44, skipping insertion in model container [2019-09-07 19:57:44,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 07:57:44" (3/3) ... [2019-09-07 19:57:44,379 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem13_label52.c [2019-09-07 19:57:44,389 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 19:57:44,398 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 19:57:44,415 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 19:57:44,457 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 19:57:44,457 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 19:57:44,457 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 19:57:44,458 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 19:57:44,458 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 19:57:44,458 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 19:57:44,458 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 19:57:44,458 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 19:57:44,458 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 19:57:44,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states. [2019-09-07 19:57:44,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-07 19:57:44,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:57:44,509 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 19:57:44,511 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:57:44,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:57:44,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1357052199, now seen corresponding path program 1 times [2019-09-07 19:57:44,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:57:44,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:57:44,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:57:44,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:57:44,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:57:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:57:44,898 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:57:44,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:57:44,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 19:57:44,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 19:57:44,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 19:57:44,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:57:44,923 INFO L87 Difference]: Start difference. First operand 1119 states. Second operand 3 states. [2019-09-07 19:57:51,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:57:51,944 INFO L93 Difference]: Finished difference Result 3090 states and 5712 transitions. [2019-09-07 19:57:51,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 19:57:51,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-07 19:57:51,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:57:51,993 INFO L225 Difference]: With dead ends: 3090 [2019-09-07 19:57:51,994 INFO L226 Difference]: Without dead ends: 1909 [2019-09-07 19:57:52,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 19:57:52,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1909 states. [2019-09-07 19:57:52,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1909 to 1895. [2019-09-07 19:57:52,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1895 states. [2019-09-07 19:57:52,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1895 states to 1895 states and 3364 transitions. [2019-09-07 19:57:52,179 INFO L78 Accepts]: Start accepts. Automaton has 1895 states and 3364 transitions. Word has length 70 [2019-09-07 19:57:52,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:57:52,180 INFO L475 AbstractCegarLoop]: Abstraction has 1895 states and 3364 transitions. [2019-09-07 19:57:52,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 19:57:52,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1895 states and 3364 transitions. [2019-09-07 19:57:52,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-07 19:57:52,186 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:57:52,187 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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:52,187 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:57:52,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:57:52,187 INFO L82 PathProgramCache]: Analyzing trace with hash -2129839903, now seen corresponding path program 1 times [2019-09-07 19:57:52,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:57:52,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:57:52,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:57:52,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:57:52,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:57:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:57:52,477 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:57:52,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:57:52,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:57:52,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:57:52,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:57:52,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:57:52,481 INFO L87 Difference]: Start difference. First operand 1895 states and 3364 transitions. Second operand 6 states. [2019-09-07 19:58:01,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:58:01,645 INFO L93 Difference]: Finished difference Result 4707 states and 8327 transitions. [2019-09-07 19:58:01,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:58:01,651 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 152 [2019-09-07 19:58:01,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:58:01,673 INFO L225 Difference]: With dead ends: 4707 [2019-09-07 19:58:01,674 INFO L226 Difference]: Without dead ends: 2818 [2019-09-07 19:58:01,680 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:58:01,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states. [2019-09-07 19:58:01,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2772. [2019-09-07 19:58:01,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2772 states. [2019-09-07 19:58:01,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2772 states to 2772 states and 4628 transitions. [2019-09-07 19:58:01,767 INFO L78 Accepts]: Start accepts. Automaton has 2772 states and 4628 transitions. Word has length 152 [2019-09-07 19:58:01,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:58:01,768 INFO L475 AbstractCegarLoop]: Abstraction has 2772 states and 4628 transitions. [2019-09-07 19:58:01,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:58:01,768 INFO L276 IsEmpty]: Start isEmpty. Operand 2772 states and 4628 transitions. [2019-09-07 19:58:01,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-07 19:58:01,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:58:01,772 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,773 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:58:01,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:58:01,773 INFO L82 PathProgramCache]: Analyzing trace with hash -675116441, now seen corresponding path program 1 times [2019-09-07 19:58:01,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:58:01,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:58:01,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:58:01,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:58:01,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:58:01,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:58:01,950 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:58:01,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:58:01,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 19:58:01,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 19:58:01,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 19:58:01,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 19:58:01,954 INFO L87 Difference]: Start difference. First operand 2772 states and 4628 transitions. Second operand 5 states. [2019-09-07 19:58:12,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:58:12,237 INFO L93 Difference]: Finished difference Result 8374 states and 14262 transitions. [2019-09-07 19:58:12,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 19:58:12,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2019-09-07 19:58:12,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:58:12,275 INFO L225 Difference]: With dead ends: 8374 [2019-09-07 19:58:12,278 INFO L226 Difference]: Without dead ends: 5608 [2019-09-07 19:58:12,287 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:58:12,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5608 states. [2019-09-07 19:58:12,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5608 to 5382. [2019-09-07 19:58:12,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5382 states. [2019-09-07 19:58:12,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5382 states to 5382 states and 8713 transitions. [2019-09-07 19:58:12,510 INFO L78 Accepts]: Start accepts. Automaton has 5382 states and 8713 transitions. Word has length 159 [2019-09-07 19:58:12,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:58:12,511 INFO L475 AbstractCegarLoop]: Abstraction has 5382 states and 8713 transitions. [2019-09-07 19:58:12,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 19:58:12,511 INFO L276 IsEmpty]: Start isEmpty. Operand 5382 states and 8713 transitions. [2019-09-07 19:58:12,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-07 19:58:12,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:58:12,516 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,516 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:58:12,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:58:12,516 INFO L82 PathProgramCache]: Analyzing trace with hash -89989327, now seen corresponding path program 1 times [2019-09-07 19:58:12,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:58:12,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:58:12,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:58:12,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:58:12,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:58:12,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:58:12,629 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:58:12,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:58:12,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 19:58:12,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 19:58:12,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 19:58:12,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 19:58:12,631 INFO L87 Difference]: Start difference. First operand 5382 states and 8713 transitions. Second operand 5 states. [2019-09-07 19:58:22,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:58:22,811 INFO L93 Difference]: Finished difference Result 16339 states and 27878 transitions. [2019-09-07 19:58:22,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 19:58:22,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 168 [2019-09-07 19:58:22,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:58:22,869 INFO L225 Difference]: With dead ends: 16339 [2019-09-07 19:58:22,870 INFO L226 Difference]: Without dead ends: 10963 [2019-09-07 19:58:22,889 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:58:22,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10963 states. [2019-09-07 19:58:23,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10963 to 10702. [2019-09-07 19:58:23,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10702 states. [2019-09-07 19:58:23,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10702 states to 10702 states and 16382 transitions. [2019-09-07 19:58:23,204 INFO L78 Accepts]: Start accepts. Automaton has 10702 states and 16382 transitions. Word has length 168 [2019-09-07 19:58:23,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:58:23,205 INFO L475 AbstractCegarLoop]: Abstraction has 10702 states and 16382 transitions. [2019-09-07 19:58:23,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 19:58:23,206 INFO L276 IsEmpty]: Start isEmpty. Operand 10702 states and 16382 transitions. [2019-09-07 19:58:23,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-07 19:58:23,209 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:58:23,209 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23,210 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:58:23,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:58:23,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1690452769, now seen corresponding path program 1 times [2019-09-07 19:58:23,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:58:23,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:58:23,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:58:23,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:58:23,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:58:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:58:23,421 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:58:23,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:58:23,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:58:23,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:58:23,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:58:23,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:58:23,423 INFO L87 Difference]: Start difference. First operand 10702 states and 16382 transitions. Second operand 6 states. [2019-09-07 19:58:32,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:58:32,071 INFO L93 Difference]: Finished difference Result 32067 states and 54064 transitions. [2019-09-07 19:58:32,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:58:32,074 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 179 [2019-09-07 19:58:32,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:58:32,180 INFO L225 Difference]: With dead ends: 32067 [2019-09-07 19:58:32,181 INFO L226 Difference]: Without dead ends: 21371 [2019-09-07 19:58:32,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 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:58:32,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21371 states. [2019-09-07 19:58:32,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21371 to 21264. [2019-09-07 19:58:32,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21264 states. [2019-09-07 19:58:32,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21264 states to 21264 states and 32745 transitions. [2019-09-07 19:58:32,847 INFO L78 Accepts]: Start accepts. Automaton has 21264 states and 32745 transitions. Word has length 179 [2019-09-07 19:58:32,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:58:32,848 INFO L475 AbstractCegarLoop]: Abstraction has 21264 states and 32745 transitions. [2019-09-07 19:58:32,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:58:32,848 INFO L276 IsEmpty]: Start isEmpty. Operand 21264 states and 32745 transitions. [2019-09-07 19:58:32,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-07 19:58:32,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:58:32,852 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,853 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:58:32,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:58:32,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1713998204, now seen corresponding path program 1 times [2019-09-07 19:58:32,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:58:32,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:58:32,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:58:32,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:58:32,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:58:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:58:33,017 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:58:33,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:58:33,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:58:33,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:58:33,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:58:33,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:58:33,019 INFO L87 Difference]: Start difference. First operand 21264 states and 32745 transitions. Second operand 6 states. [2019-09-07 19:58:41,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:58:41,245 INFO L93 Difference]: Finished difference Result 63003 states and 107750 transitions. [2019-09-07 19:58:41,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:58:41,246 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 188 [2019-09-07 19:58:41,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:58:41,482 INFO L225 Difference]: With dead ends: 63003 [2019-09-07 19:58:41,483 INFO L226 Difference]: Without dead ends: 41745 [2019-09-07 19:58:42,840 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:58:42,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41745 states. [2019-09-07 19:58:43,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41745 to 40791. [2019-09-07 19:58:43,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40791 states. [2019-09-07 19:58:43,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40791 states to 40791 states and 62614 transitions. [2019-09-07 19:58:43,924 INFO L78 Accepts]: Start accepts. Automaton has 40791 states and 62614 transitions. Word has length 188 [2019-09-07 19:58:43,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:58:43,926 INFO L475 AbstractCegarLoop]: Abstraction has 40791 states and 62614 transitions. [2019-09-07 19:58:43,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:58:43,926 INFO L276 IsEmpty]: Start isEmpty. Operand 40791 states and 62614 transitions. [2019-09-07 19:58:43,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-07 19:58:43,936 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:58:43,937 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,937 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:58:43,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:58:43,937 INFO L82 PathProgramCache]: Analyzing trace with hash -467054860, now seen corresponding path program 1 times [2019-09-07 19:58:43,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:58:43,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:58:43,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:58:43,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:58:43,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:58:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:58:44,218 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:58:44,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:58:44,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 19:58:44,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 19:58:44,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 19:58:44,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 19:58:44,220 INFO L87 Difference]: Start difference. First operand 40791 states and 62614 transitions. Second operand 6 states. [2019-09-07 19:58:52,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:58:52,081 INFO L93 Difference]: Finished difference Result 88049 states and 137103 transitions. [2019-09-07 19:58:52,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 19:58:52,081 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 263 [2019-09-07 19:58:52,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:58:53,727 INFO L225 Difference]: With dead ends: 88049 [2019-09-07 19:58:53,727 INFO L226 Difference]: Without dead ends: 47264 [2019-09-07 19:58:53,809 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:58:53,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47264 states. [2019-09-07 19:58:54,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47264 to 43901. [2019-09-07 19:58:54,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43901 states. [2019-09-07 19:58:54,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43901 states to 43901 states and 62969 transitions. [2019-09-07 19:58:54,949 INFO L78 Accepts]: Start accepts. Automaton has 43901 states and 62969 transitions. Word has length 263 [2019-09-07 19:58:54,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:58:54,949 INFO L475 AbstractCegarLoop]: Abstraction has 43901 states and 62969 transitions. [2019-09-07 19:58:54,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 19:58:54,950 INFO L276 IsEmpty]: Start isEmpty. Operand 43901 states and 62969 transitions. [2019-09-07 19:58:54,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-09-07 19:58:54,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:58:54,958 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,959 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:58:54,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:58:54,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1312845128, now seen corresponding path program 1 times [2019-09-07 19:58:54,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:58:54,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:58:54,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:58:54,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:58:54,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:58:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:58:55,182 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:58:55,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 19:58:55,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 19:58:55,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 19:58:55,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 19:58:55,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 19:58:55,184 INFO L87 Difference]: Start difference. First operand 43901 states and 62969 transitions. Second operand 5 states. [2019-09-07 19:59:07,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:59:07,471 INFO L93 Difference]: Finished difference Result 109715 states and 163054 transitions. [2019-09-07 19:59:07,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 19:59:07,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 269 [2019-09-07 19:59:07,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:59:08,050 INFO L225 Difference]: With dead ends: 109715 [2019-09-07 19:59:08,051 INFO L226 Difference]: Without dead ends: 65820 [2019-09-07 19:59:08,115 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:59:08,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65820 states. [2019-09-07 19:59:09,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65820 to 65683. [2019-09-07 19:59:09,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65683 states. [2019-09-07 19:59:09,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65683 states to 65683 states and 98581 transitions. [2019-09-07 19:59:09,452 INFO L78 Accepts]: Start accepts. Automaton has 65683 states and 98581 transitions. Word has length 269 [2019-09-07 19:59:09,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:59:09,453 INFO L475 AbstractCegarLoop]: Abstraction has 65683 states and 98581 transitions. [2019-09-07 19:59:09,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 19:59:09,453 INFO L276 IsEmpty]: Start isEmpty. Operand 65683 states and 98581 transitions. [2019-09-07 19:59:09,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-09-07 19:59:09,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:59:09,464 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2019-09-07 19:59:09,464 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:59:09,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:59:09,464 INFO L82 PathProgramCache]: Analyzing trace with hash 639406101, now seen corresponding path program 1 times [2019-09-07 19:59:09,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:59:09,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:59:09,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:59:09,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:59:09,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:59:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:59:09,925 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 204 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:59:09,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:59:09,925 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:59:10,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:59:10,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:59:10,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 19:59:10,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:59:10,603 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-07 19:59:10,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 19:59:10,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-09-07 19:59:10,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 19:59:10,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 19:59:10,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-09-07 19:59:10,619 INFO L87 Difference]: Start difference. First operand 65683 states and 98581 transitions. Second operand 12 states. [2019-09-07 19:59:33,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 19:59:33,891 INFO L93 Difference]: Finished difference Result 155905 states and 243437 transitions. [2019-09-07 19:59:33,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 19:59:33,892 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 279 [2019-09-07 19:59:33,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 19:59:34,375 INFO L225 Difference]: With dead ends: 155905 [2019-09-07 19:59:34,376 INFO L226 Difference]: Without dead ends: 91031 [2019-09-07 19:59:34,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2019-09-07 19:59:34,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91031 states. [2019-09-07 19:59:37,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91031 to 88944. [2019-09-07 19:59:37,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88944 states. [2019-09-07 19:59:37,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88944 states to 88944 states and 119299 transitions. [2019-09-07 19:59:37,666 INFO L78 Accepts]: Start accepts. Automaton has 88944 states and 119299 transitions. Word has length 279 [2019-09-07 19:59:37,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 19:59:37,666 INFO L475 AbstractCegarLoop]: Abstraction has 88944 states and 119299 transitions. [2019-09-07 19:59:37,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 19:59:37,666 INFO L276 IsEmpty]: Start isEmpty. Operand 88944 states and 119299 transitions. [2019-09-07 19:59:37,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2019-09-07 19:59:37,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 19:59:37,698 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 19:59:37,698 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 19:59:37,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 19:59:37,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1792544799, now seen corresponding path program 1 times [2019-09-07 19:59:37,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 19:59:37,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 19:59:37,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:59:37,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 19:59:37,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 19:59:37,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:59:38,145 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 239 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 19:59:38,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 19:59:38,145 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) [2019-09-07 19:59:38,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 19:59:38,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 19:59:38,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 19:59:38,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 19:59:38,497 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 130 proven. 2 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-07 19:59:38,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 19:59:38,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2019-09-07 19:59:38,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 19:59:38,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 19:59:38,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-07 19:59:38,504 INFO L87 Difference]: Start difference. First operand 88944 states and 119299 transitions. Second operand 11 states. [2019-09-07 20:00:24,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:00:24,988 INFO L93 Difference]: Finished difference Result 313622 states and 456408 transitions. [2019-09-07 20:00:24,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-07 20:00:24,989 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 397 [2019-09-07 20:00:24,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:00:26,075 INFO L225 Difference]: With dead ends: 313622 [2019-09-07 20:00:26,076 INFO L226 Difference]: Without dead ends: 217319 [2019-09-07 20:00:26,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1860 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=883, Invalid=4229, Unknown=0, NotChecked=0, Total=5112 [2019-09-07 20:00:26,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217319 states. [2019-09-07 20:00:30,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217319 to 200156. [2019-09-07 20:00:30,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200156 states. [2019-09-07 20:00:36,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200156 states to 200156 states and 244142 transitions. [2019-09-07 20:00:36,220 INFO L78 Accepts]: Start accepts. Automaton has 200156 states and 244142 transitions. Word has length 397 [2019-09-07 20:00:36,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:00:36,221 INFO L475 AbstractCegarLoop]: Abstraction has 200156 states and 244142 transitions. [2019-09-07 20:00:36,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 20:00:36,221 INFO L276 IsEmpty]: Start isEmpty. Operand 200156 states and 244142 transitions. [2019-09-07 20:00:36,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-09-07 20:00:36,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:00:36,267 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 20:00:36,267 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:00:36,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:00:36,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1444681821, now seen corresponding path program 1 times [2019-09-07 20:00:36,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:00:36,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:00:36,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:00:36,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:00:36,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:00:36,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:00:36,472 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 126 proven. 2 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-09-07 20:00:36,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:00:36,473 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 20:00:36,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:00:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:00:36,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 20:00:36,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:00:36,709 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-07 20:00:36,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:00:36,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-09-07 20:00:36,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:00:36,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:00:36,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:00:36,721 INFO L87 Difference]: Start difference. First operand 200156 states and 244142 transitions. Second operand 4 states. [2019-09-07 20:00:50,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:00:50,646 INFO L93 Difference]: Finished difference Result 506371 states and 627696 transitions. [2019-09-07 20:00:50,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:00:50,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 399 [2019-09-07 20:00:50,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:00:51,731 INFO L225 Difference]: With dead ends: 506371 [2019-09-07 20:00:51,731 INFO L226 Difference]: Without dead ends: 298953 [2019-09-07 20:00:51,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 399 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 20:00:52,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298953 states. [2019-09-07 20:01:02,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298953 to 278818. [2019-09-07 20:01:02,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278818 states. [2019-09-07 20:01:03,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278818 states to 278818 states and 336537 transitions. [2019-09-07 20:01:03,085 INFO L78 Accepts]: Start accepts. Automaton has 278818 states and 336537 transitions. Word has length 399 [2019-09-07 20:01:03,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:01:03,085 INFO L475 AbstractCegarLoop]: Abstraction has 278818 states and 336537 transitions. [2019-09-07 20:01:03,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:01:03,085 INFO L276 IsEmpty]: Start isEmpty. Operand 278818 states and 336537 transitions. [2019-09-07 20:01:03,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2019-09-07 20:01:03,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:01:03,122 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 20:01:03,123 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:01:03,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:01:03,123 INFO L82 PathProgramCache]: Analyzing trace with hash 258209230, now seen corresponding path program 1 times [2019-09-07 20:01:03,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:01:03,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:01:03,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:01:03,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:01:03,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:01:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:01:03,399 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 204 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:01:03,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:01:03,399 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:01:03,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:01:03,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:01:03,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 20:01:03,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:01:04,664 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 20:01:04,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:01:04,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2019-09-07 20:01:04,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:01:04,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:01:04,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:01:04,680 INFO L87 Difference]: Start difference. First operand 278818 states and 336537 transitions. Second operand 9 states. [2019-09-07 20:01:25,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:01:25,734 INFO L93 Difference]: Finished difference Result 610782 states and 742936 transitions. [2019-09-07 20:01:25,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 20:01:25,734 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 418 [2019-09-07 20:01:25,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:01:26,589 INFO L225 Difference]: With dead ends: 610782 [2019-09-07 20:01:26,589 INFO L226 Difference]: Without dead ends: 333578 [2019-09-07 20:01:26,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-09-07 20:01:27,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333578 states. [2019-09-07 20:01:36,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333578 to 327115. [2019-09-07 20:01:36,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327115 states. [2019-09-07 20:01:37,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327115 states to 327115 states and 390093 transitions. [2019-09-07 20:01:37,071 INFO L78 Accepts]: Start accepts. Automaton has 327115 states and 390093 transitions. Word has length 418 [2019-09-07 20:01:37,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:01:37,071 INFO L475 AbstractCegarLoop]: Abstraction has 327115 states and 390093 transitions. [2019-09-07 20:01:37,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:01:37,071 INFO L276 IsEmpty]: Start isEmpty. Operand 327115 states and 390093 transitions. [2019-09-07 20:01:37,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 697 [2019-09-07 20:01:37,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:01:37,162 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-07 20:01:37,162 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:01:37,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:01:37,163 INFO L82 PathProgramCache]: Analyzing trace with hash 203700665, now seen corresponding path program 1 times [2019-09-07 20:01:37,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:01:37,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:01:37,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:01:37,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:01:37,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:01:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:01:40,693 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 448 proven. 436 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-07 20:01:40,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:01:40,693 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 20:01:40,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:01:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:01:40,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 1012 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:01:40,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:01:44,838 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 647 proven. 2 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2019-09-07 20:01:44,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:01:44,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 5] total 19 [2019-09-07 20:01:44,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 20:01:44,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 20:01:44,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-09-07 20:01:44,844 INFO L87 Difference]: Start difference. First operand 327115 states and 390093 transitions. Second operand 19 states. [2019-09-07 20:01:46,067 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-07 20:01:48,791 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-07 20:01:50,280 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 38 [2019-09-07 20:01:50,803 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-07 20:01:52,192 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-07 20:01:52,486 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-07 20:01:53,910 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-09-07 20:01:55,170 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-09-07 20:01:55,664 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-09-07 20:01:56,364 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-07 20:01:56,517 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-09-07 20:01:58,838 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-07 20:02:00,370 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-07 20:02:00,779 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-07 20:02:02,304 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-07 20:02:03,125 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-09-07 20:02:03,349 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-09-07 20:02:05,738 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-09-07 20:02:06,002 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-09-07 20:02:06,210 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 33 [2019-09-07 20:02:07,529 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-07 20:02:08,374 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2019-09-07 20:02:08,917 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-09-07 20:02:09,706 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-07 20:02:10,595 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-09-07 20:02:12,471 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-09-07 20:02:12,992 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-07 20:02:17,296 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-09-07 20:02:18,786 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-07 20:02:19,501 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-09-07 20:02:20,135 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-07 20:02:24,442 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-07 20:02:27,891 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-07 20:02:28,857 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-09-07 20:02:33,437 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-07 20:02:36,630 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-09-07 20:02:42,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:02:42,289 INFO L93 Difference]: Finished difference Result 661830 states and 833676 transitions. [2019-09-07 20:02:42,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2019-09-07 20:02:42,290 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 696 [2019-09-07 20:02:42,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:02:43,266 INFO L225 Difference]: With dead ends: 661830 [2019-09-07 20:02:43,266 INFO L226 Difference]: Without dead ends: 335161 [2019-09-07 20:02:43,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 986 GetRequests, 819 SyntacticMatches, 2 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11435 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=3770, Invalid=23952, Unknown=0, NotChecked=0, Total=27722 [2019-09-07 20:02:43,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335161 states. [2019-09-07 20:02:49,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335161 to 316377. [2019-09-07 20:02:49,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316377 states. [2019-09-07 20:02:49,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316377 states to 316377 states and 353626 transitions. [2019-09-07 20:02:49,449 INFO L78 Accepts]: Start accepts. Automaton has 316377 states and 353626 transitions. Word has length 696 [2019-09-07 20:02:49,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:02:49,450 INFO L475 AbstractCegarLoop]: Abstraction has 316377 states and 353626 transitions. [2019-09-07 20:02:49,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 20:02:49,451 INFO L276 IsEmpty]: Start isEmpty. Operand 316377 states and 353626 transitions. [2019-09-07 20:02:49,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 861 [2019-09-07 20:02:49,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:02:49,555 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:02:49,556 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:02:49,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:02:49,556 INFO L82 PathProgramCache]: Analyzing trace with hash -807109082, now seen corresponding path program 1 times [2019-09-07 20:02:49,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:02:49,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:02:49,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:02:49,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:02:49,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:02:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:02:51,442 INFO L134 CoverageAnalysis]: Checked inductivity of 966 backedges. 742 proven. 149 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-07 20:02:51,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:02:51,443 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 20:02:52,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:02:52,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:02:52,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 1198 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 20:02:52,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:02:53,222 INFO L134 CoverageAnalysis]: Checked inductivity of 966 backedges. 631 proven. 2 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2019-09-07 20:02:53,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:02:53,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 20:02:53,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:02:53,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:02:53,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:02:53,229 INFO L87 Difference]: Start difference. First operand 316377 states and 353626 transitions. Second operand 9 states. [2019-09-07 20:03:13,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:03:13,708 INFO L93 Difference]: Finished difference Result 689624 states and 808641 transitions. [2019-09-07 20:03:13,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 20:03:13,709 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 860 [2019-09-07 20:03:13,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:03:14,939 INFO L225 Difference]: With dead ends: 689624 [2019-09-07 20:03:14,939 INFO L226 Difference]: Without dead ends: 373904 [2019-09-07 20:03:15,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 893 GetRequests, 873 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-09-07 20:03:22,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373904 states. [2019-09-07 20:03:27,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373904 to 365165. [2019-09-07 20:03:27,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365165 states. [2019-09-07 20:03:27,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365165 states to 365165 states and 412154 transitions. [2019-09-07 20:03:27,683 INFO L78 Accepts]: Start accepts. Automaton has 365165 states and 412154 transitions. Word has length 860 [2019-09-07 20:03:27,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:03:27,683 INFO L475 AbstractCegarLoop]: Abstraction has 365165 states and 412154 transitions. [2019-09-07 20:03:27,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:03:27,684 INFO L276 IsEmpty]: Start isEmpty. Operand 365165 states and 412154 transitions. [2019-09-07 20:03:27,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 873 [2019-09-07 20:03:27,841 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:03:27,844 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:03:27,844 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:03:27,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:03:27,845 INFO L82 PathProgramCache]: Analyzing trace with hash -775931079, now seen corresponding path program 1 times [2019-09-07 20:03:27,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:03:27,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:03:27,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:03:27,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:03:27,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:03:27,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:03:34,383 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 368 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 20:03:34,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:03:34,384 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:03:34,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:03:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:03:34,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 1194 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 20:03:34,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:03:35,565 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 416 proven. 2 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 20:03:35,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:03:35,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 5] total 21 [2019-09-07 20:03:35,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 20:03:35,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 20:03:35,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2019-09-07 20:03:35,582 INFO L87 Difference]: Start difference. First operand 365165 states and 412154 transitions. Second operand 21 states. [2019-09-07 20:03:35,769 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-07 20:03:36,962 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-09-07 20:03:38,690 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-09-07 20:03:40,411 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-07 20:03:40,781 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-09-07 20:03:41,916 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-07 20:03:42,903 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-09-07 20:03:43,612 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-09-07 20:03:43,868 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-09-07 20:03:44,281 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-09-07 20:03:44,658 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-07 20:03:45,446 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-07 20:03:46,462 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-09-07 20:03:47,040 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-07 20:03:47,685 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-07 20:03:48,451 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-07 20:03:48,704 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-07 20:03:50,042 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-07 20:03:51,580 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-07 20:03:54,992 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-09-07 20:03:55,402 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-07 20:03:57,180 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-09-07 20:03:58,725 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2019-09-07 20:03:59,908 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-09-07 20:04:00,351 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-07 20:04:00,876 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-09-07 20:04:01,701 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-07 20:04:03,578 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-09-07 20:04:04,321 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-07 20:04:05,366 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-07 20:04:06,475 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-07 20:04:07,290 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-07 20:04:07,556 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-07 20:04:07,735 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-09-07 20:04:08,450 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-07 20:04:09,972 WARN L188 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-09-07 20:04:15,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:04:15,722 INFO L93 Difference]: Finished difference Result 688547 states and 771599 transitions. [2019-09-07 20:04:15,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-09-07 20:04:15,723 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 872 [2019-09-07 20:04:15,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:04:16,469 INFO L225 Difference]: With dead ends: 688547 [2019-09-07 20:04:16,469 INFO L226 Difference]: Without dead ends: 332237 [2019-09-07 20:04:16,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1121 GetRequests, 978 SyntacticMatches, 1 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8317 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=3581, Invalid=17011, Unknown=0, NotChecked=0, Total=20592 [2019-09-07 20:04:17,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332237 states. [2019-09-07 20:04:22,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332237 to 325120. [2019-09-07 20:04:22,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325120 states. [2019-09-07 20:04:23,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325120 states to 325120 states and 350064 transitions. [2019-09-07 20:04:23,119 INFO L78 Accepts]: Start accepts. Automaton has 325120 states and 350064 transitions. Word has length 872 [2019-09-07 20:04:23,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:04:23,120 INFO L475 AbstractCegarLoop]: Abstraction has 325120 states and 350064 transitions. [2019-09-07 20:04:23,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 20:04:23,120 INFO L276 IsEmpty]: Start isEmpty. Operand 325120 states and 350064 transitions. [2019-09-07 20:04:23,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 988 [2019-09-07 20:04:23,239 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:04:23,239 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 20:04:23,240 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:04:23,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:04:23,240 INFO L82 PathProgramCache]: Analyzing trace with hash 380594326, now seen corresponding path program 1 times [2019-09-07 20:04:23,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:04:23,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:04:23,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:04:23,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:04:23,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:04:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:04:26,051 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2019-09-07 20:04:26,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:04:26,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:04:26,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:04:26,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:04:26,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:04:26,054 INFO L87 Difference]: Start difference. First operand 325120 states and 350064 transitions. Second operand 4 states. [2019-09-07 20:04:41,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:04:41,570 INFO L93 Difference]: Finished difference Result 675383 states and 727413 transitions. [2019-09-07 20:04:41,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:04:41,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 987 [2019-09-07 20:04:41,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:04:42,376 INFO L225 Difference]: With dead ends: 675383 [2019-09-07 20:04:42,376 INFO L226 Difference]: Without dead ends: 358322 [2019-09-07 20:04:42,559 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 20:04:42,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358322 states. [2019-09-07 20:04:52,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358322 to 335697. [2019-09-07 20:04:52,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335697 states. [2019-09-07 20:04:53,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335697 states to 335697 states and 360078 transitions. [2019-09-07 20:04:53,306 INFO L78 Accepts]: Start accepts. Automaton has 335697 states and 360078 transitions. Word has length 987 [2019-09-07 20:04:53,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:04:53,307 INFO L475 AbstractCegarLoop]: Abstraction has 335697 states and 360078 transitions. [2019-09-07 20:04:53,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:04:53,307 INFO L276 IsEmpty]: Start isEmpty. Operand 335697 states and 360078 transitions. [2019-09-07 20:04:53,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1230 [2019-09-07 20:04:53,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:04:53,463 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 20:04:53,464 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:04:53,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:04:53,464 INFO L82 PathProgramCache]: Analyzing trace with hash 50628480, now seen corresponding path program 1 times [2019-09-07 20:04:53,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:04:53,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:04:53,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:04:53,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:04:53,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:04:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:04:56,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1180 backedges. 500 proven. 357 refuted. 0 times theorem prover too weak. 323 trivial. 0 not checked. [2019-09-07 20:04:56,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:04:56,845 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 20:04:56,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:04:57,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:04:57,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 1622 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 20:04:57,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:04:57,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 20:04:57,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1180 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2019-09-07 20:04:57,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 20:04:57,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 20:04:57,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 20:04:57,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 20:04:57,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-07 20:04:57,912 INFO L87 Difference]: Start difference. First operand 335697 states and 360078 transitions. Second operand 9 states. [2019-09-07 20:05:21,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:05:21,989 INFO L93 Difference]: Finished difference Result 683661 states and 734209 transitions. [2019-09-07 20:05:21,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-07 20:05:21,989 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1229 [2019-09-07 20:05:21,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:05:22,887 INFO L225 Difference]: With dead ends: 683661 [2019-09-07 20:05:22,887 INFO L226 Difference]: Without dead ends: 355246 [2019-09-07 20:05:23,153 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1274 GetRequests, 1248 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2019-09-07 20:05:24,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355246 states. [2019-09-07 20:05:28,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355246 to 352639. [2019-09-07 20:05:28,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352639 states. [2019-09-07 20:05:29,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352639 states to 352639 states and 378004 transitions. [2019-09-07 20:05:29,379 INFO L78 Accepts]: Start accepts. Automaton has 352639 states and 378004 transitions. Word has length 1229 [2019-09-07 20:05:29,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:05:29,380 INFO L475 AbstractCegarLoop]: Abstraction has 352639 states and 378004 transitions. [2019-09-07 20:05:29,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 20:05:29,380 INFO L276 IsEmpty]: Start isEmpty. Operand 352639 states and 378004 transitions. [2019-09-07 20:05:30,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1256 [2019-09-07 20:05:30,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:05:30,552 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:05:30,553 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:05:30,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:05:30,553 INFO L82 PathProgramCache]: Analyzing trace with hash -21640579, now seen corresponding path program 1 times [2019-09-07 20:05:30,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:05:30,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:05:30,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:05:30,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:05:30,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:05:30,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:05:33,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1329 backedges. 370 proven. 507 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2019-09-07 20:05:33,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:05:33,138 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:05:33,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:05:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:05:33,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 1703 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 20:05:33,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:05:39,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1329 backedges. 727 proven. 2 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2019-09-07 20:05:39,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:05:39,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-09-07 20:05:39,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 20:05:39,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 20:05:39,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-09-07 20:05:39,092 INFO L87 Difference]: Start difference. First operand 352639 states and 378004 transitions. Second operand 12 states. [2019-09-07 20:06:17,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:06:17,576 INFO L93 Difference]: Finished difference Result 761866 states and 817432 transitions. [2019-09-07 20:06:17,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 20:06:17,576 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 1255 [2019-09-07 20:06:17,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:06:18,540 INFO L225 Difference]: With dead ends: 761866 [2019-09-07 20:06:18,540 INFO L226 Difference]: Without dead ends: 418927 [2019-09-07 20:06:18,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1305 GetRequests, 1272 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=310, Invalid=880, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 20:06:19,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418927 states. [2019-09-07 20:06:24,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418927 to 403533. [2019-09-07 20:06:24,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403533 states. [2019-09-07 20:06:34,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403533 states to 403533 states and 431898 transitions. [2019-09-07 20:06:34,029 INFO L78 Accepts]: Start accepts. Automaton has 403533 states and 431898 transitions. Word has length 1255 [2019-09-07 20:06:34,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:06:34,029 INFO L475 AbstractCegarLoop]: Abstraction has 403533 states and 431898 transitions. [2019-09-07 20:06:34,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 20:06:34,030 INFO L276 IsEmpty]: Start isEmpty. Operand 403533 states and 431898 transitions. [2019-09-07 20:06:34,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1369 [2019-09-07 20:06:34,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:06:34,259 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:06:34,259 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:06:34,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:06:34,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1029947705, now seen corresponding path program 1 times [2019-09-07 20:06:34,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:06:34,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:06:34,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:06:34,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:06:34,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:06:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:06:36,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2125 backedges. 1061 proven. 62 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked. [2019-09-07 20:06:36,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 20:06:36,584 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 20:06:36,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:06:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:06:37,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 1830 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 20:06:37,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 20:06:38,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2125 backedges. 1399 proven. 6 refuted. 0 times theorem prover too weak. 720 trivial. 0 not checked. [2019-09-07 20:06:38,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 20:06:38,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-09-07 20:06:38,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 20:06:38,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 20:06:38,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-09-07 20:06:38,022 INFO L87 Difference]: Start difference. First operand 403533 states and 431898 transitions. Second operand 12 states. [2019-09-07 20:07:37,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:07:37,866 INFO L93 Difference]: Finished difference Result 1026981 states and 1104196 transitions. [2019-09-07 20:07:37,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-07 20:07:37,867 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 1368 [2019-09-07 20:07:37,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:07:39,225 INFO L225 Difference]: With dead ends: 1026981 [2019-09-07 20:07:39,225 INFO L226 Difference]: Without dead ends: 629892 [2019-09-07 20:07:39,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1509 GetRequests, 1432 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2084 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1061, Invalid=5101, Unknown=0, NotChecked=0, Total=6162 [2019-09-07 20:07:39,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629892 states. [2019-09-07 20:07:52,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629892 to 569792. [2019-09-07 20:07:52,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569792 states. [2019-09-07 20:07:53,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569792 states to 569792 states and 607458 transitions. [2019-09-07 20:07:53,435 INFO L78 Accepts]: Start accepts. Automaton has 569792 states and 607458 transitions. Word has length 1368 [2019-09-07 20:07:53,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:07:53,436 INFO L475 AbstractCegarLoop]: Abstraction has 569792 states and 607458 transitions. [2019-09-07 20:07:53,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 20:07:53,437 INFO L276 IsEmpty]: Start isEmpty. Operand 569792 states and 607458 transitions. [2019-09-07 20:07:53,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1382 [2019-09-07 20:07:53,684 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:07:53,685 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 20:07:53,686 INFO L418 AbstractCegarLoop]: === Iteration 20 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:07:53,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:07:53,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1005873975, now seen corresponding path program 1 times [2019-09-07 20:07:53,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:07:53,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:07:53,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:07:53,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:07:53,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:07:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 20:08:03,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1518 backedges. 330 proven. 0 refuted. 0 times theorem prover too weak. 1188 trivial. 0 not checked. [2019-09-07 20:08:03,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 20:08:03,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 20:08:03,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 20:08:03,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 20:08:03,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 20:08:03,519 INFO L87 Difference]: Start difference. First operand 569792 states and 607458 transitions. Second operand 4 states. [2019-09-07 20:08:17,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 20:08:17,725 INFO L93 Difference]: Finished difference Result 1217213 states and 1300189 transitions. [2019-09-07 20:08:17,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 20:08:17,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1381 [2019-09-07 20:08:17,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 20:08:19,359 INFO L225 Difference]: With dead ends: 1217213 [2019-09-07 20:08:19,359 INFO L226 Difference]: Without dead ends: 665192 [2019-09-07 20:08:19,687 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 20:08:20,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665192 states. [2019-09-07 20:08:35,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665192 to 630499. [2019-09-07 20:08:35,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630499 states. [2019-09-07 20:08:36,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630499 states to 630499 states and 671519 transitions. [2019-09-07 20:08:36,672 INFO L78 Accepts]: Start accepts. Automaton has 630499 states and 671519 transitions. Word has length 1381 [2019-09-07 20:08:36,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 20:08:36,673 INFO L475 AbstractCegarLoop]: Abstraction has 630499 states and 671519 transitions. [2019-09-07 20:08:36,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 20:08:36,674 INFO L276 IsEmpty]: Start isEmpty. Operand 630499 states and 671519 transitions. [2019-09-07 20:08:37,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1754 [2019-09-07 20:08:37,124 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 20:08:37,125 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 20:08:37,125 INFO L418 AbstractCegarLoop]: === Iteration 21 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 20:08:37,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 20:08:37,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1301408674, now seen corresponding path program 1 times [2019-09-07 20:08:37,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 20:08:37,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 20:08:37,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 20:08:37,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 20:08:37,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY