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/Problem18_label20.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 22:31:13,841 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 22:31:13,843 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 22:31:13,855 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 22:31:13,855 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 22:31:13,856 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 22:31:13,857 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 22:31:13,859 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 22:31:13,861 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 22:31:13,862 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 22:31:13,863 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 22:31:13,864 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 22:31:13,864 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 22:31:13,865 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 22:31:13,866 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 22:31:13,868 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 22:31:13,868 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 22:31:13,869 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 22:31:13,871 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 22:31:13,873 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 22:31:13,875 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 22:31:13,876 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 22:31:13,878 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 22:31:13,878 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 22:31:13,881 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 22:31:13,881 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 22:31:13,882 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 22:31:13,883 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 22:31:13,883 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 22:31:13,884 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 22:31:13,884 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 22:31:13,885 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 22:31:13,886 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 22:31:13,887 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 22:31:13,888 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 22:31:13,888 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 22:31:13,889 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 22:31:13,889 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 22:31:13,889 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 22:31:13,890 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 22:31:13,891 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 22:31:13,892 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 22:31:13,909 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 22:31:13,909 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 22:31:13,910 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 22:31:13,912 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 22:31:13,912 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 22:31:13,912 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 22:31:13,913 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 22:31:13,913 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 22:31:13,913 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 22:31:13,913 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 22:31:13,914 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 22:31:13,914 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 22:31:13,914 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 22:31:13,914 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 22:31:13,914 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 22:31:13,915 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 22:31:13,915 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 22:31:13,915 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 22:31:13,915 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 22:31:13,915 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 22:31:13,916 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 22:31:13,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 22:31:13,917 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 22:31:13,918 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 22:31:13,918 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 22:31:13,918 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 22:31:13,918 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 22:31:13,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 22:31:13,919 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 22:31:13,957 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 22:31:13,970 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 22:31:13,973 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 22:31:13,975 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 22:31:13,975 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 22:31:13,976 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem18_label20.c [2019-09-07 22:31:14,033 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ee298074/2ae56ae25d334b64b6ffdc80d6fbf3a7/FLAGec4aa7f67 [2019-09-07 22:31:14,810 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 22:31:14,812 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem18_label20.c [2019-09-07 22:31:14,838 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ee298074/2ae56ae25d334b64b6ffdc80d6fbf3a7/FLAGec4aa7f67 [2019-09-07 22:31:14,857 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ee298074/2ae56ae25d334b64b6ffdc80d6fbf3a7 [2019-09-07 22:31:14,870 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 22:31:14,871 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 22:31:14,873 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 22:31:14,873 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 22:31:14,876 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 22:31:14,877 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:31:14" (1/1) ... [2019-09-07 22:31:14,880 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4af09ad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:31:14, skipping insertion in model container [2019-09-07 22:31:14,880 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 10:31:14" (1/1) ... [2019-09-07 22:31:14,887 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 22:31:15,010 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 22:31:16,178 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 22:31:16,188 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 22:31:16,635 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 22:31:16,662 INFO L192 MainTranslator]: Completed translation [2019-09-07 22:31:16,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:31:16 WrapperNode [2019-09-07 22:31:16,663 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 22:31:16,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 22:31:16,664 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 22:31:16,664 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 22:31:16,679 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:31:16" (1/1) ... [2019-09-07 22:31:16,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:31:16" (1/1) ... [2019-09-07 22:31:16,730 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:31:16" (1/1) ... [2019-09-07 22:31:16,732 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:31:16" (1/1) ... [2019-09-07 22:31:16,895 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:31:16" (1/1) ... [2019-09-07 22:31:16,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:31:16" (1/1) ... [2019-09-07 22:31:16,961 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:31:16" (1/1) ... [2019-09-07 22:31:17,000 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 22:31:17,001 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 22:31:17,001 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 22:31:17,001 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 22:31:17,003 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:31:16" (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 22:31:17,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 22:31:17,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 22:31:17,065 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 22:31:17,065 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-09-07 22:31:17,065 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2019-09-07 22:31:17,065 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 22:31:17,065 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 22:31:17,066 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-09-07 22:31:17,066 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2019-09-07 22:31:17,066 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 22:31:17,066 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 22:31:17,066 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 22:31:17,067 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 22:31:17,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 22:31:17,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 22:31:20,468 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 22:31:20,472 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 22:31:20,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:31:20 BoogieIcfgContainer [2019-09-07 22:31:20,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 22:31:20,476 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 22:31:20,477 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 22:31:20,479 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 22:31:20,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 10:31:14" (1/3) ... [2019-09-07 22:31:20,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c35c0d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:31:20, skipping insertion in model container [2019-09-07 22:31:20,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 10:31:16" (2/3) ... [2019-09-07 22:31:20,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c35c0d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 10:31:20, skipping insertion in model container [2019-09-07 22:31:20,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 10:31:20" (3/3) ... [2019-09-07 22:31:20,486 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem18_label20.c [2019-09-07 22:31:20,500 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 22:31:20,511 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 22:31:20,528 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 22:31:20,576 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 22:31:20,577 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 22:31:20,577 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 22:31:20,577 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 22:31:20,577 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 22:31:20,577 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 22:31:20,577 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 22:31:20,577 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 22:31:20,578 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 22:31:20,614 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states. [2019-09-07 22:31:20,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-07 22:31:20,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:31:20,620 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:31:20,622 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:31:20,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:31:20,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1233530833, now seen corresponding path program 1 times [2019-09-07 22:31:20,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:31:20,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:31:20,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:31:20,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:31:20,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:31:20,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:31:20,865 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 22:31:20,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:31:20,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 22:31:20,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 22:31:20,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 22:31:20,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 22:31:20,889 INFO L87 Difference]: Start difference. First operand 774 states. Second operand 3 states. [2019-09-07 22:31:25,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:31:25,124 INFO L93 Difference]: Finished difference Result 2248 states and 4319 transitions. [2019-09-07 22:31:25,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 22:31:25,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-09-07 22:31:25,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:31:25,163 INFO L225 Difference]: With dead ends: 2248 [2019-09-07 22:31:25,163 INFO L226 Difference]: Without dead ends: 1412 [2019-09-07 22:31:25,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 22:31:25,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2019-09-07 22:31:25,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1412. [2019-09-07 22:31:25,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2019-09-07 22:31:25,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2558 transitions. [2019-09-07 22:31:25,332 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2558 transitions. Word has length 12 [2019-09-07 22:31:25,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:31:25,333 INFO L475 AbstractCegarLoop]: Abstraction has 1412 states and 2558 transitions. [2019-09-07 22:31:25,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 22:31:25,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2558 transitions. [2019-09-07 22:31:25,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-07 22:31:25,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:31:25,337 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 22:31:25,337 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:31:25,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:31:25,338 INFO L82 PathProgramCache]: Analyzing trace with hash -618546903, now seen corresponding path program 1 times [2019-09-07 22:31:25,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:31:25,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:31:25,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:31:25,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:31:25,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:31:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:31:25,567 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:31:25,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:31:25,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 22:31:25,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 22:31:25,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 22:31:25,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 22:31:25,570 INFO L87 Difference]: Start difference. First operand 1412 states and 2558 transitions. Second operand 5 states. [2019-09-07 22:31:31,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:31:31,012 INFO L93 Difference]: Finished difference Result 3572 states and 6416 transitions. [2019-09-07 22:31:31,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 22:31:31,014 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-09-07 22:31:31,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:31:31,034 INFO L225 Difference]: With dead ends: 3572 [2019-09-07 22:31:31,034 INFO L226 Difference]: Without dead ends: 2166 [2019-09-07 22:31:31,040 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 22:31:31,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2166 states. [2019-09-07 22:31:31,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2166 to 2146. [2019-09-07 22:31:31,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2146 states. [2019-09-07 22:31:31,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 3628 transitions. [2019-09-07 22:31:31,147 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 3628 transitions. Word has length 83 [2019-09-07 22:31:31,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:31:31,149 INFO L475 AbstractCegarLoop]: Abstraction has 2146 states and 3628 transitions. [2019-09-07 22:31:31,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 22:31:31,150 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 3628 transitions. [2019-09-07 22:31:31,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-07 22:31:31,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:31:31,160 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 22:31:31,160 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:31:31,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:31:31,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1079500740, now seen corresponding path program 1 times [2019-09-07 22:31:31,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:31:31,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:31:31,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:31:31,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:31:31,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:31:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:31:31,448 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:31:31,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:31:31,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 22:31:31,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 22:31:31,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 22:31:31,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 22:31:31,451 INFO L87 Difference]: Start difference. First operand 2146 states and 3628 transitions. Second operand 6 states. [2019-09-07 22:31:36,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:31:36,145 INFO L93 Difference]: Finished difference Result 5051 states and 8506 transitions. [2019-09-07 22:31:36,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 22:31:36,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 106 [2019-09-07 22:31:36,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:31:36,162 INFO L225 Difference]: With dead ends: 5051 [2019-09-07 22:31:36,163 INFO L226 Difference]: Without dead ends: 2911 [2019-09-07 22:31:36,168 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 22:31:36,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2019-09-07 22:31:36,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 2887. [2019-09-07 22:31:36,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2887 states. [2019-09-07 22:31:36,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2887 states to 2887 states and 4487 transitions. [2019-09-07 22:31:36,254 INFO L78 Accepts]: Start accepts. Automaton has 2887 states and 4487 transitions. Word has length 106 [2019-09-07 22:31:36,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:31:36,255 INFO L475 AbstractCegarLoop]: Abstraction has 2887 states and 4487 transitions. [2019-09-07 22:31:36,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 22:31:36,255 INFO L276 IsEmpty]: Start isEmpty. Operand 2887 states and 4487 transitions. [2019-09-07 22:31:36,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-07 22:31:36,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:31:36,258 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 22:31:36,258 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:31:36,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:31:36,258 INFO L82 PathProgramCache]: Analyzing trace with hash 140345460, now seen corresponding path program 1 times [2019-09-07 22:31:36,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:31:36,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:31:36,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:31:36,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:31:36,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:31:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:31:36,410 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:31:36,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:31:36,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 22:31:36,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 22:31:36,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 22:31:36,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 22:31:36,413 INFO L87 Difference]: Start difference. First operand 2887 states and 4487 transitions. Second operand 6 states. [2019-09-07 22:31:40,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:31:40,855 INFO L93 Difference]: Finished difference Result 6543 states and 10148 transitions. [2019-09-07 22:31:40,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 22:31:40,855 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 110 [2019-09-07 22:31:40,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:31:40,872 INFO L225 Difference]: With dead ends: 6543 [2019-09-07 22:31:40,872 INFO L226 Difference]: Without dead ends: 3662 [2019-09-07 22:31:40,878 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 22:31:40,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3662 states. [2019-09-07 22:31:40,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3662 to 3642. [2019-09-07 22:31:40,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3642 states. [2019-09-07 22:31:40,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3642 states to 3642 states and 5124 transitions. [2019-09-07 22:31:40,960 INFO L78 Accepts]: Start accepts. Automaton has 3642 states and 5124 transitions. Word has length 110 [2019-09-07 22:31:40,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:31:40,960 INFO L475 AbstractCegarLoop]: Abstraction has 3642 states and 5124 transitions. [2019-09-07 22:31:40,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 22:31:40,961 INFO L276 IsEmpty]: Start isEmpty. Operand 3642 states and 5124 transitions. [2019-09-07 22:31:40,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-07 22:31:40,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:31:40,963 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 22:31:40,963 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:31:40,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:31:40,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1104679829, now seen corresponding path program 1 times [2019-09-07 22:31:40,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:31:40,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:31:40,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:31:40,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:31:40,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:31:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:31:41,102 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:31:41,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:31:41,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 22:31:41,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 22:31:41,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 22:31:41,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 22:31:41,104 INFO L87 Difference]: Start difference. First operand 3642 states and 5124 transitions. Second operand 6 states. [2019-09-07 22:31:45,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:31:45,921 INFO L93 Difference]: Finished difference Result 10404 states and 14982 transitions. [2019-09-07 22:31:45,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 22:31:45,923 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-09-07 22:31:45,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:31:45,956 INFO L225 Difference]: With dead ends: 10404 [2019-09-07 22:31:45,956 INFO L226 Difference]: Without dead ends: 6768 [2019-09-07 22:31:45,967 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 22:31:45,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6768 states. [2019-09-07 22:31:46,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6768 to 6670. [2019-09-07 22:31:46,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6670 states. [2019-09-07 22:31:46,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6670 states to 6670 states and 9031 transitions. [2019-09-07 22:31:46,125 INFO L78 Accepts]: Start accepts. Automaton has 6670 states and 9031 transitions. Word has length 141 [2019-09-07 22:31:46,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:31:46,125 INFO L475 AbstractCegarLoop]: Abstraction has 6670 states and 9031 transitions. [2019-09-07 22:31:46,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 22:31:46,126 INFO L276 IsEmpty]: Start isEmpty. Operand 6670 states and 9031 transitions. [2019-09-07 22:31:46,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-07 22:31:46,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:31:46,131 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 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 22:31:46,132 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:31:46,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:31:46,132 INFO L82 PathProgramCache]: Analyzing trace with hash -980479594, now seen corresponding path program 1 times [2019-09-07 22:31:46,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:31:46,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:31:46,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:31:46,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:31:46,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:31:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:31:46,304 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 10 proven. 67 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 22:31:46,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:31:46,304 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 22:31:46,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:31:46,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:31:46,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 22:31:46,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:31:46,592 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 22:31:46,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 22:31:46,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2019-09-07 22:31:46,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 22:31:46,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 22:31:46,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-07 22:31:46,599 INFO L87 Difference]: Start difference. First operand 6670 states and 9031 transitions. Second operand 7 states. [2019-09-07 22:31:56,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:31:56,607 INFO L93 Difference]: Finished difference Result 26373 states and 40409 transitions. [2019-09-07 22:31:56,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 22:31:56,608 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 173 [2019-09-07 22:31:56,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:31:56,766 INFO L225 Difference]: With dead ends: 26373 [2019-09-07 22:31:56,766 INFO L226 Difference]: Without dead ends: 19709 [2019-09-07 22:31:56,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-09-07 22:31:56,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19709 states. [2019-09-07 22:31:57,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19709 to 19490. [2019-09-07 22:31:57,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19490 states. [2019-09-07 22:31:57,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19490 states to 19490 states and 25887 transitions. [2019-09-07 22:31:57,438 INFO L78 Accepts]: Start accepts. Automaton has 19490 states and 25887 transitions. Word has length 173 [2019-09-07 22:31:57,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:31:57,438 INFO L475 AbstractCegarLoop]: Abstraction has 19490 states and 25887 transitions. [2019-09-07 22:31:57,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 22:31:57,439 INFO L276 IsEmpty]: Start isEmpty. Operand 19490 states and 25887 transitions. [2019-09-07 22:31:57,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-07 22:31:57,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:31:57,447 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-07 22:31:57,448 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:31:57,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:31:57,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1783249799, now seen corresponding path program 1 times [2019-09-07 22:31:57,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:31:57,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:31:57,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:31:57,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:31:57,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:31:57,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:31:57,634 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 22:31:57,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:31:57,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 22:31:57,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 22:31:57,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 22:31:57,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 22:31:57,636 INFO L87 Difference]: Start difference. First operand 19490 states and 25887 transitions. Second operand 3 states. [2019-09-07 22:32:01,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:32:01,480 INFO L93 Difference]: Finished difference Result 38974 states and 51832 transitions. [2019-09-07 22:32:01,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 22:32:01,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-09-07 22:32:01,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:32:01,578 INFO L225 Difference]: With dead ends: 38974 [2019-09-07 22:32:01,579 INFO L226 Difference]: Without dead ends: 19490 [2019-09-07 22:32:01,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 22:32:01,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19490 states. [2019-09-07 22:32:01,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19490 to 19458. [2019-09-07 22:32:01,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19458 states. [2019-09-07 22:32:02,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19458 states to 19458 states and 23653 transitions. [2019-09-07 22:32:02,023 INFO L78 Accepts]: Start accepts. Automaton has 19458 states and 23653 transitions. Word has length 235 [2019-09-07 22:32:02,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:32:02,024 INFO L475 AbstractCegarLoop]: Abstraction has 19458 states and 23653 transitions. [2019-09-07 22:32:02,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 22:32:02,024 INFO L276 IsEmpty]: Start isEmpty. Operand 19458 states and 23653 transitions. [2019-09-07 22:32:02,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-07 22:32:02,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:32:02,029 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:32:02,030 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:32:02,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:32:02,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1650500639, now seen corresponding path program 1 times [2019-09-07 22:32:02,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:32:02,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:32:02,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:32:02,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:32:02,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:32:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:32:02,188 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-07 22:32:02,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:32:02,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 22:32:02,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 22:32:02,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 22:32:02,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 22:32:02,190 INFO L87 Difference]: Start difference. First operand 19458 states and 23653 transitions. Second operand 3 states. [2019-09-07 22:32:06,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:32:06,083 INFO L93 Difference]: Finished difference Result 54546 states and 67930 transitions. [2019-09-07 22:32:06,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 22:32:06,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 268 [2019-09-07 22:32:06,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:32:06,182 INFO L225 Difference]: With dead ends: 54546 [2019-09-07 22:32:06,182 INFO L226 Difference]: Without dead ends: 35094 [2019-09-07 22:32:06,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 22:32:06,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35094 states. [2019-09-07 22:32:06,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35094 to 33686. [2019-09-07 22:32:06,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33686 states. [2019-09-07 22:32:06,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33686 states to 33686 states and 40535 transitions. [2019-09-07 22:32:06,996 INFO L78 Accepts]: Start accepts. Automaton has 33686 states and 40535 transitions. Word has length 268 [2019-09-07 22:32:06,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:32:06,997 INFO L475 AbstractCegarLoop]: Abstraction has 33686 states and 40535 transitions. [2019-09-07 22:32:06,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 22:32:06,997 INFO L276 IsEmpty]: Start isEmpty. Operand 33686 states and 40535 transitions. [2019-09-07 22:32:07,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-07 22:32:07,005 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:32:07,005 INFO L399 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:32:07,005 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:32:07,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:32:07,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1406244582, now seen corresponding path program 1 times [2019-09-07 22:32:07,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:32:07,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:32:07,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:32:07,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:32:07,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:32:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:32:07,262 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 198 proven. 2 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-09-07 22:32:07,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:32:07,263 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 22:32:07,286 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 22:32:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:32:07,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:32:07,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:32:07,568 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 198 proven. 2 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-09-07 22:32:07,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:32:07,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 22:32:07,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:32:07,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:32:07,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:32:07,587 INFO L87 Difference]: Start difference. First operand 33686 states and 40535 transitions. Second operand 9 states. [2019-09-07 22:32:16,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:32:16,812 INFO L93 Difference]: Finished difference Result 82374 states and 105044 transitions. [2019-09-07 22:32:16,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 22:32:16,812 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 300 [2019-09-07 22:32:16,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:32:16,955 INFO L225 Difference]: With dead ends: 82374 [2019-09-07 22:32:16,956 INFO L226 Difference]: Without dead ends: 48694 [2019-09-07 22:32:17,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-09-07 22:32:17,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48694 states. [2019-09-07 22:32:17,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48694 to 46954. [2019-09-07 22:32:17,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46954 states. [2019-09-07 22:32:17,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46954 states to 46954 states and 55642 transitions. [2019-09-07 22:32:17,763 INFO L78 Accepts]: Start accepts. Automaton has 46954 states and 55642 transitions. Word has length 300 [2019-09-07 22:32:17,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:32:17,765 INFO L475 AbstractCegarLoop]: Abstraction has 46954 states and 55642 transitions. [2019-09-07 22:32:17,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:32:17,765 INFO L276 IsEmpty]: Start isEmpty. Operand 46954 states and 55642 transitions. [2019-09-07 22:32:17,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-09-07 22:32:17,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:32:17,776 INFO L399 BasicCegarLoop]: trace histogram [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, 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] [2019-09-07 22:32:17,777 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:32:17,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:32:17,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1013341459, now seen corresponding path program 1 times [2019-09-07 22:32:17,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:32:17,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:32:17,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:32:17,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:32:17,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:32:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:32:17,944 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2019-09-07 22:32:17,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:32:17,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 22:32:17,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 22:32:17,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 22:32:17,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 22:32:17,946 INFO L87 Difference]: Start difference. First operand 46954 states and 55642 transitions. Second operand 3 states. [2019-09-07 22:32:22,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:32:22,366 INFO L93 Difference]: Finished difference Result 107983 states and 129678 transitions. [2019-09-07 22:32:22,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 22:32:22,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 348 [2019-09-07 22:32:22,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:32:22,542 INFO L225 Difference]: With dead ends: 107983 [2019-09-07 22:32:22,542 INFO L226 Difference]: Without dead ends: 61035 [2019-09-07 22:32:22,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 22:32:22,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61035 states. [2019-09-07 22:32:23,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61035 to 61035. [2019-09-07 22:32:23,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61035 states. [2019-09-07 22:32:23,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61035 states to 61035 states and 72360 transitions. [2019-09-07 22:32:23,824 INFO L78 Accepts]: Start accepts. Automaton has 61035 states and 72360 transitions. Word has length 348 [2019-09-07 22:32:23,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:32:23,825 INFO L475 AbstractCegarLoop]: Abstraction has 61035 states and 72360 transitions. [2019-09-07 22:32:23,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 22:32:23,826 INFO L276 IsEmpty]: Start isEmpty. Operand 61035 states and 72360 transitions. [2019-09-07 22:32:23,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2019-09-07 22:32:23,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:32:23,871 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:32:23,872 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:32:23,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:32:23,872 INFO L82 PathProgramCache]: Analyzing trace with hash 90183156, now seen corresponding path program 1 times [2019-09-07 22:32:23,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:32:23,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:32:23,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:32:23,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:32:23,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:32:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:32:24,191 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-07 22:32:24,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 22:32:24,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 22:32:24,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 22:32:24,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 22:32:24,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 22:32:24,193 INFO L87 Difference]: Start difference. First operand 61035 states and 72360 transitions. Second operand 3 states. [2019-09-07 22:32:28,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:32:28,474 INFO L93 Difference]: Finished difference Result 136930 states and 164857 transitions. [2019-09-07 22:32:28,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 22:32:28,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 509 [2019-09-07 22:32:28,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:32:28,697 INFO L225 Difference]: With dead ends: 136930 [2019-09-07 22:32:28,698 INFO L226 Difference]: Without dead ends: 75901 [2019-09-07 22:32:28,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 22:32:28,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75901 states. [2019-09-07 22:32:29,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75901 to 75899. [2019-09-07 22:32:29,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75899 states. [2019-09-07 22:32:29,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75899 states to 75899 states and 89096 transitions. [2019-09-07 22:32:29,643 INFO L78 Accepts]: Start accepts. Automaton has 75899 states and 89096 transitions. Word has length 509 [2019-09-07 22:32:29,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:32:29,644 INFO L475 AbstractCegarLoop]: Abstraction has 75899 states and 89096 transitions. [2019-09-07 22:32:29,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 22:32:29,644 INFO L276 IsEmpty]: Start isEmpty. Operand 75899 states and 89096 transitions. [2019-09-07 22:32:29,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 636 [2019-09-07 22:32:29,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:32:29,715 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 22:32:29,715 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:32:29,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:32:29,715 INFO L82 PathProgramCache]: Analyzing trace with hash 81969408, now seen corresponding path program 1 times [2019-09-07 22:32:29,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:32:29,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:32:29,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:32:29,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:32:29,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:32:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:32:32,630 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 114 proven. 194 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-07 22:32:32,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:32:32,631 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 22:32:32,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:32:32,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:32:32,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 22:32:32,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:32:33,196 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 395 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-07 22:32:33,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:32:33,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5] total 16 [2019-09-07 22:32:33,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 22:32:33,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 22:32:33,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-09-07 22:32:33,203 INFO L87 Difference]: Start difference. First operand 75899 states and 89096 transitions. Second operand 16 states. [2019-09-07 22:32:51,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:32:51,594 INFO L93 Difference]: Finished difference Result 201866 states and 250348 transitions. [2019-09-07 22:32:51,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-07 22:32:51,594 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 635 [2019-09-07 22:32:51,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:32:51,947 INFO L225 Difference]: With dead ends: 201866 [2019-09-07 22:32:51,947 INFO L226 Difference]: Without dead ends: 125520 [2019-09-07 22:32:52,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 716 GetRequests, 662 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 890 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=627, Invalid=2453, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 22:32:52,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125520 states. [2019-09-07 22:32:53,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125520 to 123008. [2019-09-07 22:32:53,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123008 states. [2019-09-07 22:32:53,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123008 states to 123008 states and 136194 transitions. [2019-09-07 22:32:53,766 INFO L78 Accepts]: Start accepts. Automaton has 123008 states and 136194 transitions. Word has length 635 [2019-09-07 22:32:53,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:32:53,767 INFO L475 AbstractCegarLoop]: Abstraction has 123008 states and 136194 transitions. [2019-09-07 22:32:53,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 22:32:53,767 INFO L276 IsEmpty]: Start isEmpty. Operand 123008 states and 136194 transitions. [2019-09-07 22:32:53,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 761 [2019-09-07 22:32:53,839 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:32:53,840 INFO L399 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:32:53,840 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:32:53,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:32:53,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1142443908, now seen corresponding path program 1 times [2019-09-07 22:32:53,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:32:53,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:32:53,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:32:53,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:32:53,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:32:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:32:54,322 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 20 proven. 332 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2019-09-07 22:32:54,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:32:54,322 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 22:32:54,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:32:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:32:54,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 1051 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 22:32:54,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:32:56,522 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-09-07 22:32:56,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 22:32:56,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-07 22:32:56,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:32:56,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:32:56,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:32:56,531 INFO L87 Difference]: Start difference. First operand 123008 states and 136194 transitions. Second operand 9 states. [2019-09-07 22:33:02,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:33:02,176 INFO L93 Difference]: Finished difference Result 244745 states and 272025 transitions. [2019-09-07 22:33:02,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 22:33:02,177 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 760 [2019-09-07 22:33:02,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:33:02,369 INFO L225 Difference]: With dead ends: 244745 [2019-09-07 22:33:02,369 INFO L226 Difference]: Without dead ends: 122445 [2019-09-07 22:33:02,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 784 GetRequests, 767 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-09-07 22:33:02,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122445 states. [2019-09-07 22:33:03,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122445 to 115275. [2019-09-07 22:33:03,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115275 states. [2019-09-07 22:33:03,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115275 states to 115275 states and 124475 transitions. [2019-09-07 22:33:03,829 INFO L78 Accepts]: Start accepts. Automaton has 115275 states and 124475 transitions. Word has length 760 [2019-09-07 22:33:03,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:33:03,829 INFO L475 AbstractCegarLoop]: Abstraction has 115275 states and 124475 transitions. [2019-09-07 22:33:03,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:33:03,830 INFO L276 IsEmpty]: Start isEmpty. Operand 115275 states and 124475 transitions. [2019-09-07 22:33:03,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 939 [2019-09-07 22:33:03,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:33:03,893 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:33:03,894 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:33:03,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:33:03,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1906774613, now seen corresponding path program 1 times [2019-09-07 22:33:03,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:33:03,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:33:03,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:33:03,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:33:03,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:33:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:33:05,006 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 102 proven. 543 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-07 22:33:05,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:33:05,007 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 22:33:05,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:33:05,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:33:05,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 1249 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:33:05,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:33:05,563 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 673 proven. 2 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-09-07 22:33:05,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:33:05,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-09-07 22:33:05,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 22:33:05,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 22:33:05,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-07 22:33:05,570 INFO L87 Difference]: Start difference. First operand 115275 states and 124475 transitions. Second operand 11 states. [2019-09-07 22:33:16,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:33:16,839 INFO L93 Difference]: Finished difference Result 250635 states and 275400 transitions. [2019-09-07 22:33:16,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 22:33:16,839 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 938 [2019-09-07 22:33:16,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:33:17,165 INFO L225 Difference]: With dead ends: 250635 [2019-09-07 22:33:17,165 INFO L226 Difference]: Without dead ends: 127454 [2019-09-07 22:33:17,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 983 GetRequests, 956 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2019-09-07 22:33:17,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127454 states. [2019-09-07 22:33:19,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127454 to 124385. [2019-09-07 22:33:19,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124385 states. [2019-09-07 22:33:19,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124385 states to 124385 states and 133120 transitions. [2019-09-07 22:33:19,471 INFO L78 Accepts]: Start accepts. Automaton has 124385 states and 133120 transitions. Word has length 938 [2019-09-07 22:33:19,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:33:19,471 INFO L475 AbstractCegarLoop]: Abstraction has 124385 states and 133120 transitions. [2019-09-07 22:33:19,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 22:33:19,471 INFO L276 IsEmpty]: Start isEmpty. Operand 124385 states and 133120 transitions. [2019-09-07 22:33:19,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 981 [2019-09-07 22:33:19,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:33:19,529 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 22:33:19,530 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:33:19,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:33:19,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1579841351, now seen corresponding path program 1 times [2019-09-07 22:33:19,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:33:19,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:33:19,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:33:19,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:33:19,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:33:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:33:20,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1078 backedges. 298 proven. 96 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-09-07 22:33:20,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:33:20,280 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 22:33:20,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:33:20,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:33:20,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 1335 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 22:33:20,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:33:22,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1078 backedges. 844 proven. 2 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2019-09-07 22:33:22,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:33:22,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 22:33:22,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 22:33:22,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 22:33:22,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 22:33:22,586 INFO L87 Difference]: Start difference. First operand 124385 states and 133120 transitions. Second operand 9 states. [2019-09-07 22:33:28,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:33:28,994 INFO L93 Difference]: Finished difference Result 213591 states and 229325 transitions. [2019-09-07 22:33:28,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 22:33:28,995 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 980 [2019-09-07 22:33:28,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:33:29,127 INFO L225 Difference]: With dead ends: 213591 [2019-09-07 22:33:29,128 INFO L226 Difference]: Without dead ends: 89922 [2019-09-07 22:33:29,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 999 GetRequests, 985 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2019-09-07 22:33:29,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89922 states. [2019-09-07 22:33:29,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89922 to 89092. [2019-09-07 22:33:29,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89092 states. [2019-09-07 22:33:30,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89092 states to 89092 states and 94676 transitions. [2019-09-07 22:33:30,057 INFO L78 Accepts]: Start accepts. Automaton has 89092 states and 94676 transitions. Word has length 980 [2019-09-07 22:33:30,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:33:30,057 INFO L475 AbstractCegarLoop]: Abstraction has 89092 states and 94676 transitions. [2019-09-07 22:33:30,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 22:33:30,058 INFO L276 IsEmpty]: Start isEmpty. Operand 89092 states and 94676 transitions. [2019-09-07 22:33:30,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1119 [2019-09-07 22:33:30,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:33:30,079 INFO L399 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:33:30,080 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:33:30,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:33:30,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1614354946, now seen corresponding path program 1 times [2019-09-07 22:33:30,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:33:30,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:33:30,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:33:30,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:33:30,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:33:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:33:31,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 714 proven. 2 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2019-09-07 22:33:31,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:33:31,606 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 22:33:31,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:33:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:33:31,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 1429 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 22:33:31,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:33:32,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 714 proven. 2 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2019-09-07 22:33:32,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:33:32,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2019-09-07 22:33:32,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 22:33:32,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 22:33:32,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-07 22:33:32,970 INFO L87 Difference]: Start difference. First operand 89092 states and 94676 transitions. Second operand 8 states. [2019-09-07 22:33:39,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:33:39,993 INFO L93 Difference]: Finished difference Result 210693 states and 224083 transitions. [2019-09-07 22:33:39,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 22:33:39,994 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1118 [2019-09-07 22:33:39,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:33:40,219 INFO L225 Difference]: With dead ends: 210693 [2019-09-07 22:33:40,219 INFO L226 Difference]: Without dead ends: 122317 [2019-09-07 22:33:40,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1129 GetRequests, 1120 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-09-07 22:33:40,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122317 states. [2019-09-07 22:33:41,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122317 to 119472. [2019-09-07 22:33:41,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119472 states. [2019-09-07 22:33:41,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119472 states to 119472 states and 126346 transitions. [2019-09-07 22:33:41,696 INFO L78 Accepts]: Start accepts. Automaton has 119472 states and 126346 transitions. Word has length 1118 [2019-09-07 22:33:41,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:33:41,697 INFO L475 AbstractCegarLoop]: Abstraction has 119472 states and 126346 transitions. [2019-09-07 22:33:41,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 22:33:41,697 INFO L276 IsEmpty]: Start isEmpty. Operand 119472 states and 126346 transitions. [2019-09-07 22:33:41,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1223 [2019-09-07 22:33:41,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:33:41,732 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-07 22:33:41,732 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:33:41,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:33:41,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1416156430, now seen corresponding path program 1 times [2019-09-07 22:33:41,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:33:41,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:33:41,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:33:41,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:33:41,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:33:41,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:33:43,457 INFO L134 CoverageAnalysis]: Checked inductivity of 646 backedges. 259 proven. 9 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-09-07 22:33:43,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:33:43,458 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 22:33:43,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:33:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:33:43,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 1515 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 22:33:43,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:33:43,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:33:46,432 INFO L134 CoverageAnalysis]: Checked inductivity of 646 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2019-09-07 22:33:46,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 22:33:46,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2019-09-07 22:33:46,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 22:33:46,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 22:33:46,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-09-07 22:33:46,440 INFO L87 Difference]: Start difference. First operand 119472 states and 126346 transitions. Second operand 11 states. [2019-09-07 22:34:00,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:34:00,956 INFO L93 Difference]: Finished difference Result 255433 states and 268097 transitions. [2019-09-07 22:34:00,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-07 22:34:00,956 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1222 [2019-09-07 22:34:00,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:34:01,229 INFO L225 Difference]: With dead ends: 255433 [2019-09-07 22:34:01,229 INFO L226 Difference]: Without dead ends: 140183 [2019-09-07 22:34:01,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1287 GetRequests, 1239 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=404, Invalid=2046, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 22:34:01,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140183 states. [2019-09-07 22:34:02,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140183 to 132977. [2019-09-07 22:34:02,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132977 states. [2019-09-07 22:34:03,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132977 states to 132977 states and 137917 transitions. [2019-09-07 22:34:03,123 INFO L78 Accepts]: Start accepts. Automaton has 132977 states and 137917 transitions. Word has length 1222 [2019-09-07 22:34:03,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:34:03,124 INFO L475 AbstractCegarLoop]: Abstraction has 132977 states and 137917 transitions. [2019-09-07 22:34:03,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 22:34:03,124 INFO L276 IsEmpty]: Start isEmpty. Operand 132977 states and 137917 transitions. [2019-09-07 22:34:03,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2084 [2019-09-07 22:34:03,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:34:03,216 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:34:03,217 INFO L418 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:34:03,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:34:03,217 INFO L82 PathProgramCache]: Analyzing trace with hash 165683206, now seen corresponding path program 1 times [2019-09-07 22:34:03,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:34:03,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:34:03,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:34:03,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:34:03,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:34:03,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:34:07,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2796 backedges. 1837 proven. 9 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2019-09-07 22:34:07,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:34:07,964 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 22:34:07,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:34:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:34:08,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 2517 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 22:34:08,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:34:08,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:34:10,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2796 backedges. 2067 proven. 2 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2019-09-07 22:34:10,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:34:10,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-09-07 22:34:10,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 22:34:10,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 22:34:10,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-07 22:34:10,134 INFO L87 Difference]: Start difference. First operand 132977 states and 137917 transitions. Second operand 10 states. [2019-09-07 22:34:28,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 22:34:28,236 INFO L93 Difference]: Finished difference Result 271701 states and 281857 transitions. [2019-09-07 22:34:28,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-07 22:34:28,236 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 2083 [2019-09-07 22:34:28,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 22:34:28,519 INFO L225 Difference]: With dead ends: 271701 [2019-09-07 22:34:28,519 INFO L226 Difference]: Without dead ends: 142233 [2019-09-07 22:34:28,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2178 GetRequests, 2128 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=414, Invalid=2238, Unknown=0, NotChecked=0, Total=2652 [2019-09-07 22:34:28,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142233 states. [2019-09-07 22:34:29,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142233 to 136556. [2019-09-07 22:34:29,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136556 states. [2019-09-07 22:34:30,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136556 states to 136556 states and 141452 transitions. [2019-09-07 22:34:30,078 INFO L78 Accepts]: Start accepts. Automaton has 136556 states and 141452 transitions. Word has length 2083 [2019-09-07 22:34:30,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 22:34:30,079 INFO L475 AbstractCegarLoop]: Abstraction has 136556 states and 141452 transitions. [2019-09-07 22:34:30,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 22:34:30,079 INFO L276 IsEmpty]: Start isEmpty. Operand 136556 states and 141452 transitions. [2019-09-07 22:34:30,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2167 [2019-09-07 22:34:30,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 22:34:30,169 INFO L399 BasicCegarLoop]: trace histogram [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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 22:34:30,169 INFO L418 AbstractCegarLoop]: === Iteration 19 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 22:34:30,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 22:34:30,170 INFO L82 PathProgramCache]: Analyzing trace with hash 610994881, now seen corresponding path program 1 times [2019-09-07 22:34:30,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 22:34:30,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 22:34:30,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:34:30,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:34:30,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 22:34:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:34:35,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3335 backedges. 2165 proven. 17 refuted. 0 times theorem prover too weak. 1153 trivial. 0 not checked. [2019-09-07 22:34:35,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 22:34:35,404 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 22:34:35,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 22:34:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 22:34:35,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 2642 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 22:34:35,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 22:34:35,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:34:35,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:34:35,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:34:35,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:34:44,040 WARN L188 SmtUtils]: Spent 4.06 s on a formula simplification that was a NOOP. DAG size: 28 [2019-09-07 22:34:52,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:34:52,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:34:52,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 22:35:00,347 WARN L188 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 28 [2019-09-07 22:35:00,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:35:04,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-07 22:35:07,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3335 backedges. 2165 proven. 15 refuted. 2 times theorem prover too weak. 1153 trivial. 0 not checked. [2019-09-07 22:35:07,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 22:35:07,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-09-07 22:35:07,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 22:35:07,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 22:35:07,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=116, Unknown=4, NotChecked=0, Total=156 [2019-09-07 22:35:07,387 INFO L87 Difference]: Start difference. First operand 136556 states and 141452 transitions. Second operand 13 states. [2019-09-07 22:38:22,329 WARN L188 SmtUtils]: Spent 16.13 s on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-09-07 22:41:44,352 WARN L188 SmtUtils]: Spent 26.21 s on a formula simplification. DAG size of input: 35 DAG size of output: 34