java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/hopv/lia/mochi/enc-zipmap.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:17:13,818 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:17:13,820 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:17:13,834 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:17:13,834 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:17:13,835 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:17:13,836 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:17:13,842 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:17:13,843 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:17:13,844 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:17:13,857 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:17:13,858 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:17:13,858 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:17:13,860 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:17:13,860 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:17:13,861 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:17:13,863 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:17:13,867 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:17:13,869 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:17:13,870 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:17:13,875 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:17:13,877 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:17:13,877 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:17:13,877 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:17:13,880 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:17:13,881 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:17:13,882 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:17:13,882 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:17:13,885 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:17:13,885 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:17:13,886 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:17:13,887 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:17:13,887 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:17:13,888 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:17:13,893 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:17:13,893 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 21:17:13,907 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:17:13,907 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:17:13,908 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:17:13,908 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:17:13,909 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:17:13,909 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:17:13,909 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:17:13,909 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:17:13,910 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:17:13,910 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:17:13,910 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:17:13,910 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:17:13,910 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:17:13,911 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:17:13,911 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:17:13,911 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:17:13,911 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:17:13,911 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:17:13,911 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:17:13,912 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:17:13,912 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:17:13,913 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:17:13,913 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:17:13,951 INFO ]: Repository-Root is: /tmp [2018-06-24 21:17:13,963 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:17:13,967 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:17:13,968 INFO ]: Initializing SmtParser... [2018-06-24 21:17:13,968 INFO ]: SmtParser initialized [2018-06-24 21:17:13,970 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/enc-zipmap.smt2 [2018-06-24 21:17:13,971 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-24 21:17:14,060 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/enc-zipmap.smt2 unknown [2018-06-24 21:17:14,303 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/enc-zipmap.smt2 [2018-06-24 21:17:14,308 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:17:14,314 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:17:14,314 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:17:14,314 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:17:14,315 INFO ]: ChcToBoogie initialized [2018-06-24 21:17:14,318 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:17:14" (1/1) ... [2018-06-24 21:17:14,373 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:17:14 Unit [2018-06-24 21:17:14,374 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:17:14,374 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:17:14,374 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:17:14,374 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:17:14,393 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:17:14" (1/1) ... [2018-06-24 21:17:14,393 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:17:14" (1/1) ... [2018-06-24 21:17:14,399 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:17:14" (1/1) ... [2018-06-24 21:17:14,399 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:17:14" (1/1) ... [2018-06-24 21:17:14,404 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:17:14" (1/1) ... [2018-06-24 21:17:14,406 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:17:14" (1/1) ... [2018-06-24 21:17:14,414 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:17:14" (1/1) ... [2018-06-24 21:17:14,416 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:17:14,417 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:17:14,417 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:17:14,417 INFO ]: RCFGBuilder initialized [2018-06-24 21:17:14,417 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:17:14" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-24 21:17:14,435 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:17:14,436 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:17:14,436 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:17:14,436 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:17:14,436 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:17:14,436 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:17:14,755 INFO ]: Using library mode [2018-06-24 21:17:14,756 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:17:14 BoogieIcfgContainer [2018-06-24 21:17:14,756 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:17:14,756 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:17:14,757 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:17:14,757 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:17:14,758 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:17:14" (1/1) ... [2018-06-24 21:17:14,772 INFO ]: Initial Icfg 18 locations, 27 edges [2018-06-24 21:17:14,773 INFO ]: Using Remove infeasible edges [2018-06-24 21:17:14,773 INFO ]: Using Maximize final states [2018-06-24 21:17:14,774 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:17:14,774 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:17:14,776 INFO ]: Using Remove sink states [2018-06-24 21:17:14,776 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:17:14,776 INFO ]: Using Use SBE [2018-06-24 21:17:14,795 INFO ]: SBE split 0 edges [2018-06-24 21:17:14,799 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-24 21:17:14,801 INFO ]: 0 new accepting states [2018-06-24 21:17:14,876 INFO ]: Removed 17 edges and 5 locations by large block encoding [2018-06-24 21:17:14,878 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:17:14,880 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:17:14,880 INFO ]: 0 new accepting states [2018-06-24 21:17:14,880 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:17:14,880 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:17:14,881 INFO ]: Encoded RCFG 11 locations, 20 edges [2018-06-24 21:17:14,881 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:17:14 BasicIcfg [2018-06-24 21:17:14,881 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:17:14,882 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:17:14,882 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:17:14,885 INFO ]: TraceAbstraction initialized [2018-06-24 21:17:14,885 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:17:14" (1/4) ... [2018-06-24 21:17:14,885 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf000e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:17:14, skipping insertion in model container [2018-06-24 21:17:14,886 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:17:14" (2/4) ... [2018-06-24 21:17:14,886 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf000e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:17:14, skipping insertion in model container [2018-06-24 21:17:14,886 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:17:14" (3/4) ... [2018-06-24 21:17:14,886 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf000e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:17:14, skipping insertion in model container [2018-06-24 21:17:14,886 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:17:14" (4/4) ... [2018-06-24 21:17:14,888 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:17:14,896 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:17:14,902 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:17:14,948 INFO ]: Using default assertion order modulation [2018-06-24 21:17:14,949 INFO ]: Interprodecural is true [2018-06-24 21:17:14,949 INFO ]: Hoare is false [2018-06-24 21:17:14,949 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:17:14,949 INFO ]: Backedges is TWOTRACK [2018-06-24 21:17:14,949 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:17:14,949 INFO ]: Difference is false [2018-06-24 21:17:14,949 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:17:14,949 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:17:14,963 INFO ]: Start isEmpty. Operand 11 states. [2018-06-24 21:17:14,974 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:17:14,974 INFO ]: Found error trace [2018-06-24 21:17:14,974 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:17:14,975 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:17:14,984 INFO ]: Analyzing trace with hash 35184928, now seen corresponding path program 1 times [2018-06-24 21:17:14,985 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:17:14,986 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:17:15,017 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:15,017 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:17:15,017 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:15,057 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:15,111 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:17:15,113 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:17:15,113 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:17:15,115 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:17:15,126 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:17:15,126 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:17:15,128 INFO ]: Start difference. First operand 11 states. Second operand 3 states. [2018-06-24 21:17:15,267 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:17:15,267 INFO ]: Finished difference Result 18 states and 35 transitions. [2018-06-24 21:17:15,268 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:17:15,268 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:17:15,269 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:17:15,279 INFO ]: With dead ends: 18 [2018-06-24 21:17:15,279 INFO ]: Without dead ends: 18 [2018-06-24 21:17:15,281 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:17:15,295 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 21:17:15,315 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-24 21:17:15,316 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 21:17:15,318 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 35 transitions. [2018-06-24 21:17:15,319 INFO ]: Start accepts. Automaton has 18 states and 35 transitions. Word has length 5 [2018-06-24 21:17:15,321 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:17:15,321 INFO ]: Abstraction has 18 states and 35 transitions. [2018-06-24 21:17:15,321 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:17:15,321 INFO ]: Start isEmpty. Operand 18 states and 35 transitions. [2018-06-24 21:17:15,323 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:17:15,323 INFO ]: Found error trace [2018-06-24 21:17:15,323 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:17:15,324 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:17:15,324 INFO ]: Analyzing trace with hash 35304092, now seen corresponding path program 1 times [2018-06-24 21:17:15,324 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:17:15,324 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:17:15,325 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:15,325 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:17:15,325 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:15,336 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:15,830 WARN ]: Spent 428.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 11 [2018-06-24 21:17:15,831 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:17:15,831 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:17:15,831 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:17:15,832 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:17:15,832 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:17:15,832 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:17:15,832 INFO ]: Start difference. First operand 18 states and 35 transitions. Second operand 3 states. [2018-06-24 21:17:15,925 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:17:15,925 INFO ]: Finished difference Result 20 states and 37 transitions. [2018-06-24 21:17:15,926 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:17:15,926 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:17:15,926 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:17:15,927 INFO ]: With dead ends: 20 [2018-06-24 21:17:15,927 INFO ]: Without dead ends: 20 [2018-06-24 21:17:15,927 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:17:15,928 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 21:17:15,932 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-24 21:17:15,932 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 21:17:15,933 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-06-24 21:17:15,933 INFO ]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 5 [2018-06-24 21:17:15,933 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:17:15,933 INFO ]: Abstraction has 20 states and 37 transitions. [2018-06-24 21:17:15,933 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:17:15,933 INFO ]: Start isEmpty. Operand 20 states and 37 transitions. [2018-06-24 21:17:15,934 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:17:15,934 INFO ]: Found error trace [2018-06-24 21:17:15,934 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:17:15,934 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:17:15,934 INFO ]: Analyzing trace with hash 35363674, now seen corresponding path program 1 times [2018-06-24 21:17:15,935 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:17:15,935 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:17:15,937 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:15,937 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:17:15,937 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:15,942 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:15,962 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:17:15,962 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:17:15,962 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:17:15,962 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:17:15,962 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:17:15,962 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:17:15,963 INFO ]: Start difference. First operand 20 states and 37 transitions. Second operand 3 states. [2018-06-24 21:17:15,991 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:17:15,991 INFO ]: Finished difference Result 22 states and 39 transitions. [2018-06-24 21:17:15,991 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:17:15,991 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:17:15,991 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:17:15,992 INFO ]: With dead ends: 22 [2018-06-24 21:17:15,992 INFO ]: Without dead ends: 18 [2018-06-24 21:17:15,992 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:17:15,993 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 21:17:15,996 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-24 21:17:15,996 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 21:17:15,997 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 31 transitions. [2018-06-24 21:17:15,997 INFO ]: Start accepts. Automaton has 18 states and 31 transitions. Word has length 5 [2018-06-24 21:17:15,997 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:17:15,997 INFO ]: Abstraction has 18 states and 31 transitions. [2018-06-24 21:17:15,997 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:17:15,997 INFO ]: Start isEmpty. Operand 18 states and 31 transitions. [2018-06-24 21:17:15,998 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 21:17:15,998 INFO ]: Found error trace [2018-06-24 21:17:15,998 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:17:15,998 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:17:15,998 INFO ]: Analyzing trace with hash 22817641, now seen corresponding path program 1 times [2018-06-24 21:17:15,998 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:17:15,998 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:17:15,999 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:15,999 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:17:15,999 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:16,007 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:16,026 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:17:16,026 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:17:16,026 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:17:16,026 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:17:16,026 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:17:16,026 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:17:16,026 INFO ]: Start difference. First operand 18 states and 31 transitions. Second operand 3 states. [2018-06-24 21:17:16,114 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:17:16,114 INFO ]: Finished difference Result 25 states and 42 transitions. [2018-06-24 21:17:16,115 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:17:16,115 INFO ]: Start accepts. Automaton has 3 states. Word has length 10 [2018-06-24 21:17:16,115 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:17:16,116 INFO ]: With dead ends: 25 [2018-06-24 21:17:16,116 INFO ]: Without dead ends: 25 [2018-06-24 21:17:16,116 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:17:16,116 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-24 21:17:16,123 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-24 21:17:16,123 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-24 21:17:16,126 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 42 transitions. [2018-06-24 21:17:16,126 INFO ]: Start accepts. Automaton has 25 states and 42 transitions. Word has length 10 [2018-06-24 21:17:16,126 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:17:16,126 INFO ]: Abstraction has 25 states and 42 transitions. [2018-06-24 21:17:16,126 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:17:16,126 INFO ]: Start isEmpty. Operand 25 states and 42 transitions. [2018-06-24 21:17:16,127 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 21:17:16,127 INFO ]: Found error trace [2018-06-24 21:17:16,127 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:17:16,127 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:17:16,127 INFO ]: Analyzing trace with hash -148362619, now seen corresponding path program 1 times [2018-06-24 21:17:16,127 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:17:16,127 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:17:16,128 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:16,128 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:17:16,128 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:16,150 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:16,498 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:17:16,499 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:17:16,499 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 21:17:16,499 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:17:16,499 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:17:16,499 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:17:16,499 INFO ]: Start difference. First operand 25 states and 42 transitions. Second operand 6 states. [2018-06-24 21:17:16,993 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:17:16,993 INFO ]: Finished difference Result 34 states and 59 transitions. [2018-06-24 21:17:16,995 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 21:17:16,995 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 21:17:16,995 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:17:16,997 INFO ]: With dead ends: 34 [2018-06-24 21:17:16,997 INFO ]: Without dead ends: 32 [2018-06-24 21:17:16,998 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:17:16,998 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-24 21:17:17,003 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-06-24 21:17:17,003 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-24 21:17:17,004 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2018-06-24 21:17:17,004 INFO ]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 10 [2018-06-24 21:17:17,004 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:17:17,005 INFO ]: Abstraction has 30 states and 49 transitions. [2018-06-24 21:17:17,005 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:17:17,005 INFO ]: Start isEmpty. Operand 30 states and 49 transitions. [2018-06-24 21:17:17,006 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:17:17,006 INFO ]: Found error trace [2018-06-24 21:17:17,006 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:17:17,006 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:17:17,006 INFO ]: Analyzing trace with hash -1857636387, now seen corresponding path program 1 times [2018-06-24 21:17:17,006 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:17:17,006 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:17:17,007 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:17,007 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:17:17,007 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:17,018 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:17,125 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:17:17,125 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:17:17,125 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:17:17,137 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:17:17,166 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:17,172 INFO ]: Computing forward predicates... [2018-06-24 21:17:17,235 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:17:17,259 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:17:17,259 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2018-06-24 21:17:17,260 INFO ]: Interpolant automaton has 7 states [2018-06-24 21:17:17,260 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 21:17:17,260 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:17:17,260 INFO ]: Start difference. First operand 30 states and 49 transitions. Second operand 7 states. [2018-06-24 21:17:17,663 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:17:17,663 INFO ]: Finished difference Result 34 states and 55 transitions. [2018-06-24 21:17:17,663 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:17:17,663 INFO ]: Start accepts. Automaton has 7 states. Word has length 11 [2018-06-24 21:17:17,663 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:17:17,664 INFO ]: With dead ends: 34 [2018-06-24 21:17:17,664 INFO ]: Without dead ends: 34 [2018-06-24 21:17:17,664 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:17:17,664 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-24 21:17:17,670 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 29. [2018-06-24 21:17:17,670 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 21:17:17,671 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 47 transitions. [2018-06-24 21:17:17,671 INFO ]: Start accepts. Automaton has 29 states and 47 transitions. Word has length 11 [2018-06-24 21:17:17,671 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:17:17,672 INFO ]: Abstraction has 29 states and 47 transitions. [2018-06-24 21:17:17,672 INFO ]: Interpolant automaton has 7 states. [2018-06-24 21:17:17,672 INFO ]: Start isEmpty. Operand 29 states and 47 transitions. [2018-06-24 21:17:17,673 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 21:17:17,673 INFO ]: Found error trace [2018-06-24 21:17:17,673 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:17:17,673 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:17:17,673 INFO ]: Analyzing trace with hash 110795703, now seen corresponding path program 1 times [2018-06-24 21:17:17,673 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:17:17,673 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:17:17,674 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:17,674 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:17:17,674 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:17,689 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:17,778 INFO ]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:17:17,778 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:17:17,778 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-06-24 21:17:17,784 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:17:17,825 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:17,827 INFO ]: Computing forward predicates... [2018-06-24 21:17:18,312 INFO ]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:17:18,333 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:17:18,333 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-06-24 21:17:18,333 INFO ]: Interpolant automaton has 11 states [2018-06-24 21:17:18,333 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 21:17:18,334 INFO ]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:17:18,334 INFO ]: Start difference. First operand 29 states and 47 transitions. Second operand 11 states. [2018-06-24 21:17:18,678 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:17:18,678 INFO ]: Finished difference Result 42 states and 69 transitions. [2018-06-24 21:17:18,678 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 21:17:18,678 INFO ]: Start accepts. Automaton has 11 states. Word has length 15 [2018-06-24 21:17:18,678 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:17:18,679 INFO ]: With dead ends: 42 [2018-06-24 21:17:18,679 INFO ]: Without dead ends: 42 [2018-06-24 21:17:18,680 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:17:18,680 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-24 21:17:18,688 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 39. [2018-06-24 21:17:18,688 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-24 21:17:18,689 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 66 transitions. [2018-06-24 21:17:18,689 INFO ]: Start accepts. Automaton has 39 states and 66 transitions. Word has length 15 [2018-06-24 21:17:18,690 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:17:18,690 INFO ]: Abstraction has 39 states and 66 transitions. [2018-06-24 21:17:18,690 INFO ]: Interpolant automaton has 11 states. [2018-06-24 21:17:18,690 INFO ]: Start isEmpty. Operand 39 states and 66 transitions. [2018-06-24 21:17:18,691 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 21:17:18,691 INFO ]: Found error trace [2018-06-24 21:17:18,691 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:17:18,691 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:17:18,691 INFO ]: Analyzing trace with hash 1085711711, now seen corresponding path program 1 times [2018-06-24 21:17:18,691 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:17:18,691 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:17:18,692 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:18,692 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:17:18,692 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:18,713 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:18,883 INFO ]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:17:18,883 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:17:18,883 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-06-24 21:17:18,889 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:17:18,913 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:18,915 INFO ]: Computing forward predicates... [2018-06-24 21:17:19,031 INFO ]: Checked inductivity of 8 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:17:19,049 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:17:19,050 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-06-24 21:17:19,050 INFO ]: Interpolant automaton has 11 states [2018-06-24 21:17:19,050 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 21:17:19,050 INFO ]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:17:19,050 INFO ]: Start difference. First operand 39 states and 66 transitions. Second operand 11 states. [2018-06-24 21:17:19,257 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:17:19,257 INFO ]: Finished difference Result 50 states and 82 transitions. [2018-06-24 21:17:19,257 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 21:17:19,257 INFO ]: Start accepts. Automaton has 11 states. Word has length 16 [2018-06-24 21:17:19,257 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:17:19,259 INFO ]: With dead ends: 50 [2018-06-24 21:17:19,259 INFO ]: Without dead ends: 50 [2018-06-24 21:17:19,259 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2018-06-24 21:17:19,259 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-24 21:17:19,268 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 40. [2018-06-24 21:17:19,268 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-24 21:17:19,269 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 67 transitions. [2018-06-24 21:17:19,269 INFO ]: Start accepts. Automaton has 40 states and 67 transitions. Word has length 16 [2018-06-24 21:17:19,270 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:17:19,270 INFO ]: Abstraction has 40 states and 67 transitions. [2018-06-24 21:17:19,270 INFO ]: Interpolant automaton has 11 states. [2018-06-24 21:17:19,270 INFO ]: Start isEmpty. Operand 40 states and 67 transitions. [2018-06-24 21:17:19,271 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 21:17:19,271 INFO ]: Found error trace [2018-06-24 21:17:19,271 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:17:19,271 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:17:19,271 INFO ]: Analyzing trace with hash 1243336887, now seen corresponding path program 2 times [2018-06-24 21:17:19,271 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:17:19,271 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:17:19,272 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:19,272 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:17:19,272 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:19,295 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:19,495 INFO ]: Checked inductivity of 10 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:17:19,495 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:17:19,495 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-06-24 21:17:19,501 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:17:19,528 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:17:19,528 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:19,530 INFO ]: Computing forward predicates... [2018-06-24 21:17:19,655 INFO ]: Checked inductivity of 10 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:17:19,674 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:17:19,674 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-24 21:17:19,675 INFO ]: Interpolant automaton has 10 states [2018-06-24 21:17:19,675 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 21:17:19,675 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:17:19,675 INFO ]: Start difference. First operand 40 states and 67 transitions. Second operand 10 states. [2018-06-24 21:17:19,872 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:17:19,872 INFO ]: Finished difference Result 47 states and 79 transitions. [2018-06-24 21:17:19,872 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 21:17:19,872 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-24 21:17:19,872 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:17:19,873 INFO ]: With dead ends: 47 [2018-06-24 21:17:19,873 INFO ]: Without dead ends: 47 [2018-06-24 21:17:19,874 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:17:19,874 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-24 21:17:19,881 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-06-24 21:17:19,881 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 21:17:19,882 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2018-06-24 21:17:19,882 INFO ]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 17 [2018-06-24 21:17:19,882 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:17:19,882 INFO ]: Abstraction has 34 states and 57 transitions. [2018-06-24 21:17:19,882 INFO ]: Interpolant automaton has 10 states. [2018-06-24 21:17:19,882 INFO ]: Start isEmpty. Operand 34 states and 57 transitions. [2018-06-24 21:17:19,883 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 21:17:19,883 INFO ]: Found error trace [2018-06-24 21:17:19,883 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:17:19,883 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:17:19,883 INFO ]: Analyzing trace with hash -482577045, now seen corresponding path program 1 times [2018-06-24 21:17:19,883 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:17:19,884 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:17:19,884 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:19,884 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:17:19,884 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:19,896 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:19,983 INFO ]: Checked inductivity of 17 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 21:17:19,983 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:17:19,983 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-06-24 21:17:19,990 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:17:20,008 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:20,010 INFO ]: Computing forward predicates... [2018-06-24 21:17:20,067 INFO ]: Checked inductivity of 17 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 21:17:20,098 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:17:20,099 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-06-24 21:17:20,099 INFO ]: Interpolant automaton has 13 states [2018-06-24 21:17:20,099 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 21:17:20,099 INFO ]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:17:20,099 INFO ]: Start difference. First operand 34 states and 57 transitions. Second operand 13 states. [2018-06-24 21:17:20,451 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:17:20,451 INFO ]: Finished difference Result 50 states and 88 transitions. [2018-06-24 21:17:20,451 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 21:17:20,451 INFO ]: Start accepts. Automaton has 13 states. Word has length 20 [2018-06-24 21:17:20,451 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:17:20,453 INFO ]: With dead ends: 50 [2018-06-24 21:17:20,453 INFO ]: Without dead ends: 50 [2018-06-24 21:17:20,453 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-06-24 21:17:20,453 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-24 21:17:20,467 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 46. [2018-06-24 21:17:20,467 INFO ]: Start removeUnreachable. Operand 46 states. [2018-06-24 21:17:20,468 INFO ]: Finished removeUnreachable. Reduced from 46 states to 46 states and 84 transitions. [2018-06-24 21:17:20,468 INFO ]: Start accepts. Automaton has 46 states and 84 transitions. Word has length 20 [2018-06-24 21:17:20,468 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:17:20,468 INFO ]: Abstraction has 46 states and 84 transitions. [2018-06-24 21:17:20,468 INFO ]: Interpolant automaton has 13 states. [2018-06-24 21:17:20,468 INFO ]: Start isEmpty. Operand 46 states and 84 transitions. [2018-06-24 21:17:20,470 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 21:17:20,470 INFO ]: Found error trace [2018-06-24 21:17:20,470 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:17:20,470 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:17:20,470 INFO ]: Analyzing trace with hash 351024323, now seen corresponding path program 1 times [2018-06-24 21:17:20,470 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:17:20,470 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:17:20,471 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:20,471 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:17:20,471 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:20,487 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:20,593 INFO ]: Checked inductivity of 18 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 21:17:20,593 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:17:20,593 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-06-24 21:17:20,600 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:17:20,634 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:20,636 INFO ]: Computing forward predicates... [2018-06-24 21:17:20,907 INFO ]: Checked inductivity of 18 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 21:17:20,926 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:17:20,926 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-24 21:17:20,926 INFO ]: Interpolant automaton has 11 states [2018-06-24 21:17:20,927 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 21:17:20,927 INFO ]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:17:20,927 INFO ]: Start difference. First operand 46 states and 84 transitions. Second operand 11 states. [2018-06-24 21:17:21,144 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:17:21,145 INFO ]: Finished difference Result 58 states and 102 transitions. [2018-06-24 21:17:21,145 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 21:17:21,145 INFO ]: Start accepts. Automaton has 11 states. Word has length 21 [2018-06-24 21:17:21,145 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:17:21,146 INFO ]: With dead ends: 58 [2018-06-24 21:17:21,146 INFO ]: Without dead ends: 58 [2018-06-24 21:17:21,146 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:17:21,146 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-24 21:17:21,156 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 47. [2018-06-24 21:17:21,156 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-24 21:17:21,157 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 86 transitions. [2018-06-24 21:17:21,157 INFO ]: Start accepts. Automaton has 47 states and 86 transitions. Word has length 21 [2018-06-24 21:17:21,158 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:17:21,158 INFO ]: Abstraction has 47 states and 86 transitions. [2018-06-24 21:17:21,158 INFO ]: Interpolant automaton has 11 states. [2018-06-24 21:17:21,158 INFO ]: Start isEmpty. Operand 47 states and 86 transitions. [2018-06-24 21:17:21,159 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 21:17:21,159 INFO ]: Found error trace [2018-06-24 21:17:21,159 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:17:21,159 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:17:21,160 INFO ]: Analyzing trace with hash 422862955, now seen corresponding path program 2 times [2018-06-24 21:17:21,160 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:17:21,160 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:17:21,160 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:21,160 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:17:21,160 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:21,184 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:21,345 INFO ]: Checked inductivity of 20 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 21:17:21,345 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:17:21,345 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-06-24 21:17:21,351 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:17:21,370 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:17:21,370 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:21,372 INFO ]: Computing forward predicates... [2018-06-24 21:17:21,520 INFO ]: Checked inductivity of 20 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 21:17:21,540 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:17:21,540 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2018-06-24 21:17:21,540 INFO ]: Interpolant automaton has 18 states [2018-06-24 21:17:21,540 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 21:17:21,540 INFO ]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-06-24 21:17:21,540 INFO ]: Start difference. First operand 47 states and 86 transitions. Second operand 18 states. [2018-06-24 21:17:22,253 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:17:22,253 INFO ]: Finished difference Result 63 states and 120 transitions. [2018-06-24 21:17:22,254 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-24 21:17:22,254 INFO ]: Start accepts. Automaton has 18 states. Word has length 22 [2018-06-24 21:17:22,255 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:17:22,256 INFO ]: With dead ends: 63 [2018-06-24 21:17:22,256 INFO ]: Without dead ends: 63 [2018-06-24 21:17:22,256 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=991, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 21:17:22,256 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-24 21:17:22,268 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 58. [2018-06-24 21:17:22,268 INFO ]: Start removeUnreachable. Operand 58 states. [2018-06-24 21:17:22,270 INFO ]: Finished removeUnreachable. Reduced from 58 states to 58 states and 113 transitions. [2018-06-24 21:17:22,270 INFO ]: Start accepts. Automaton has 58 states and 113 transitions. Word has length 22 [2018-06-24 21:17:22,270 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:17:22,270 INFO ]: Abstraction has 58 states and 113 transitions. [2018-06-24 21:17:22,270 INFO ]: Interpolant automaton has 18 states. [2018-06-24 21:17:22,270 INFO ]: Start isEmpty. Operand 58 states and 113 transitions. [2018-06-24 21:17:22,272 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 21:17:22,272 INFO ]: Found error trace [2018-06-24 21:17:22,272 INFO ]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:17:22,272 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:17:22,272 INFO ]: Analyzing trace with hash -1645106749, now seen corresponding path program 3 times [2018-06-24 21:17:22,272 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:17:22,272 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:17:22,273 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:22,273 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:17:22,273 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:22,286 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:22,614 INFO ]: Checked inductivity of 23 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 21:17:22,614 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:17:22,614 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-06-24 21:17:22,621 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:17:22,664 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-24 21:17:22,664 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:22,668 INFO ]: Computing forward predicates... [2018-06-24 21:17:22,851 INFO ]: Checked inductivity of 23 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-24 21:17:22,871 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:17:22,871 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 24 [2018-06-24 21:17:22,872 INFO ]: Interpolant automaton has 24 states [2018-06-24 21:17:22,872 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-24 21:17:22,872 INFO ]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2018-06-24 21:17:22,872 INFO ]: Start difference. First operand 58 states and 113 transitions. Second operand 24 states. [2018-06-24 21:17:23,736 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:17:23,736 INFO ]: Finished difference Result 86 states and 149 transitions. [2018-06-24 21:17:23,737 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-24 21:17:23,737 INFO ]: Start accepts. Automaton has 24 states. Word has length 23 [2018-06-24 21:17:23,737 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:17:23,738 INFO ]: With dead ends: 86 [2018-06-24 21:17:23,738 INFO ]: Without dead ends: 77 [2018-06-24 21:17:23,739 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=274, Invalid=2176, Unknown=0, NotChecked=0, Total=2450 [2018-06-24 21:17:23,739 INFO ]: Start minimizeSevpa. Operand 77 states. [2018-06-24 21:17:23,750 INFO ]: Finished minimizeSevpa. Reduced states from 77 to 52. [2018-06-24 21:17:23,750 INFO ]: Start removeUnreachable. Operand 52 states. [2018-06-24 21:17:23,751 INFO ]: Finished removeUnreachable. Reduced from 52 states to 52 states and 97 transitions. [2018-06-24 21:17:23,751 INFO ]: Start accepts. Automaton has 52 states and 97 transitions. Word has length 23 [2018-06-24 21:17:23,751 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:17:23,751 INFO ]: Abstraction has 52 states and 97 transitions. [2018-06-24 21:17:23,751 INFO ]: Interpolant automaton has 24 states. [2018-06-24 21:17:23,751 INFO ]: Start isEmpty. Operand 52 states and 97 transitions. [2018-06-24 21:17:23,753 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-24 21:17:23,753 INFO ]: Found error trace [2018-06-24 21:17:23,753 INFO ]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:17:23,753 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:17:23,753 INFO ]: Analyzing trace with hash -876684459, now seen corresponding path program 4 times [2018-06-24 21:17:23,753 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:17:23,753 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:17:23,754 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:23,754 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:17:23,754 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:23,767 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:23,916 INFO ]: Checked inductivity of 42 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-24 21:17:23,916 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:17:23,916 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-06-24 21:17:23,933 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:17:23,961 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:17:23,961 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:23,964 INFO ]: Computing forward predicates... [2018-06-24 21:17:24,006 INFO ]: Checked inductivity of 42 backedges. 19 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-24 21:17:24,038 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:17:24,038 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-06-24 21:17:24,038 INFO ]: Interpolant automaton has 15 states [2018-06-24 21:17:24,038 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 21:17:24,039 INFO ]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:17:24,039 INFO ]: Start difference. First operand 52 states and 97 transitions. Second operand 15 states. [2018-06-24 21:17:24,498 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:17:24,498 INFO ]: Finished difference Result 62 states and 117 transitions. [2018-06-24 21:17:24,499 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 21:17:24,499 INFO ]: Start accepts. Automaton has 15 states. Word has length 29 [2018-06-24 21:17:24,499 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:17:24,500 INFO ]: With dead ends: 62 [2018-06-24 21:17:24,500 INFO ]: Without dead ends: 62 [2018-06-24 21:17:24,501 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2018-06-24 21:17:24,501 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-24 21:17:24,513 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 55. [2018-06-24 21:17:24,513 INFO ]: Start removeUnreachable. Operand 55 states. [2018-06-24 21:17:24,515 INFO ]: Finished removeUnreachable. Reduced from 55 states to 55 states and 104 transitions. [2018-06-24 21:17:24,515 INFO ]: Start accepts. Automaton has 55 states and 104 transitions. Word has length 29 [2018-06-24 21:17:24,515 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:17:24,515 INFO ]: Abstraction has 55 states and 104 transitions. [2018-06-24 21:17:24,515 INFO ]: Interpolant automaton has 15 states. [2018-06-24 21:17:24,515 INFO ]: Start isEmpty. Operand 55 states and 104 transitions. [2018-06-24 21:17:24,516 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-24 21:17:24,516 INFO ]: Found error trace [2018-06-24 21:17:24,516 INFO ]: trace histogram [5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:17:24,517 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:17:24,517 INFO ]: Analyzing trace with hash -1506489395, now seen corresponding path program 5 times [2018-06-24 21:17:24,517 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:17:24,517 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:17:24,517 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:24,517 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:17:24,517 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:24,534 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:24,750 INFO ]: Checked inductivity of 62 backedges. 12 proven. 32 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-24 21:17:24,750 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:17:24,750 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:17:24,756 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:17:24,834 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-24 21:17:24,834 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:24,838 INFO ]: Computing forward predicates... [2018-06-24 21:17:25,107 INFO ]: Checked inductivity of 62 backedges. 12 proven. 34 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-24 21:17:25,127 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:17:25,127 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 28 [2018-06-24 21:17:25,127 INFO ]: Interpolant automaton has 28 states [2018-06-24 21:17:25,127 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-24 21:17:25,127 INFO ]: CoverageRelationStatistics Valid=57, Invalid=699, Unknown=0, NotChecked=0, Total=756 [2018-06-24 21:17:25,128 INFO ]: Start difference. First operand 55 states and 104 transitions. Second operand 28 states. [2018-06-24 21:17:27,250 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:17:27,250 INFO ]: Finished difference Result 84 states and 170 transitions. [2018-06-24 21:17:27,250 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-24 21:17:27,250 INFO ]: Start accepts. Automaton has 28 states. Word has length 34 [2018-06-24 21:17:27,251 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:17:27,252 INFO ]: With dead ends: 84 [2018-06-24 21:17:27,252 INFO ]: Without dead ends: 84 [2018-06-24 21:17:27,253 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=201, Invalid=2349, Unknown=0, NotChecked=0, Total=2550 [2018-06-24 21:17:27,253 INFO ]: Start minimizeSevpa. Operand 84 states. [2018-06-24 21:17:27,263 INFO ]: Finished minimizeSevpa. Reduced states from 84 to 66. [2018-06-24 21:17:27,263 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-24 21:17:27,265 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 131 transitions. [2018-06-24 21:17:27,265 INFO ]: Start accepts. Automaton has 66 states and 131 transitions. Word has length 34 [2018-06-24 21:17:27,265 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:17:27,265 INFO ]: Abstraction has 66 states and 131 transitions. [2018-06-24 21:17:27,265 INFO ]: Interpolant automaton has 28 states. [2018-06-24 21:17:27,265 INFO ]: Start isEmpty. Operand 66 states and 131 transitions. [2018-06-24 21:17:27,267 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-24 21:17:27,267 INFO ]: Found error trace [2018-06-24 21:17:27,267 INFO ]: trace histogram [5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:17:27,267 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:17:27,267 INFO ]: Analyzing trace with hash 1364644133, now seen corresponding path program 6 times [2018-06-24 21:17:27,267 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:17:27,267 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:17:27,268 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:27,268 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:17:27,268 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:27,285 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:27,530 INFO ]: Checked inductivity of 67 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-24 21:17:27,530 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:17:27,530 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:17:27,535 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:17:27,570 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-24 21:17:27,570 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:27,574 INFO ]: Computing forward predicates... [2018-06-24 21:17:28,014 INFO ]: Checked inductivity of 67 backedges. 5 proven. 42 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-24 21:17:28,035 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:17:28,035 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 22] total 36 [2018-06-24 21:17:28,035 INFO ]: Interpolant automaton has 36 states [2018-06-24 21:17:28,035 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-24 21:17:28,036 INFO ]: CoverageRelationStatistics Valid=104, Invalid=1156, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 21:17:28,036 INFO ]: Start difference. First operand 66 states and 131 transitions. Second operand 36 states. [2018-06-24 21:17:29,583 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:17:29,583 INFO ]: Finished difference Result 106 states and 212 transitions. [2018-06-24 21:17:29,583 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-06-24 21:17:29,583 INFO ]: Start accepts. Automaton has 36 states. Word has length 35 [2018-06-24 21:17:29,584 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:17:29,585 INFO ]: With dead ends: 106 [2018-06-24 21:17:29,585 INFO ]: Without dead ends: 97 [2018-06-24 21:17:29,587 INFO ]: 0 DeclaredPredicates, 94 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1474 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=540, Invalid=5160, Unknown=0, NotChecked=0, Total=5700 [2018-06-24 21:17:29,588 INFO ]: Start minimizeSevpa. Operand 97 states. [2018-06-24 21:17:29,607 INFO ]: Finished minimizeSevpa. Reduced states from 97 to 60. [2018-06-24 21:17:29,607 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-24 21:17:29,616 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 115 transitions. [2018-06-24 21:17:29,616 INFO ]: Start accepts. Automaton has 60 states and 115 transitions. Word has length 35 [2018-06-24 21:17:29,616 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:17:29,617 INFO ]: Abstraction has 60 states and 115 transitions. [2018-06-24 21:17:29,617 INFO ]: Interpolant automaton has 36 states. [2018-06-24 21:17:29,617 INFO ]: Start isEmpty. Operand 60 states and 115 transitions. [2018-06-24 21:17:29,618 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-24 21:17:29,618 INFO ]: Found error trace [2018-06-24 21:17:29,618 INFO ]: trace histogram [6, 6, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:17:29,618 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:17:29,618 INFO ]: Analyzing trace with hash -1455984141, now seen corresponding path program 7 times [2018-06-24 21:17:29,618 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:17:29,618 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:17:29,619 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:29,619 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:17:29,619 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:29,649 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:30,457 INFO ]: Checked inductivity of 98 backedges. 30 proven. 41 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-24 21:17:30,457 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:17:30,457 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:17:30,462 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:17:30,494 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:30,497 INFO ]: Computing forward predicates... [2018-06-24 21:17:30,549 INFO ]: Checked inductivity of 98 backedges. 36 proven. 35 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-24 21:17:30,568 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:17:30,568 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-06-24 21:17:30,568 INFO ]: Interpolant automaton has 19 states [2018-06-24 21:17:30,569 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 21:17:30,569 INFO ]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2018-06-24 21:17:30,569 INFO ]: Start difference. First operand 60 states and 115 transitions. Second operand 19 states. [2018-06-24 21:17:30,861 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:17:30,861 INFO ]: Finished difference Result 72 states and 141 transitions. [2018-06-24 21:17:30,862 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 21:17:30,862 INFO ]: Start accepts. Automaton has 19 states. Word has length 41 [2018-06-24 21:17:30,862 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:17:30,863 INFO ]: With dead ends: 72 [2018-06-24 21:17:30,863 INFO ]: Without dead ends: 72 [2018-06-24 21:17:30,864 INFO ]: 0 DeclaredPredicates, 68 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2018-06-24 21:17:30,864 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-24 21:17:30,875 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 63. [2018-06-24 21:17:30,875 INFO ]: Start removeUnreachable. Operand 63 states. [2018-06-24 21:17:30,880 INFO ]: Finished removeUnreachable. Reduced from 63 states to 63 states and 122 transitions. [2018-06-24 21:17:30,880 INFO ]: Start accepts. Automaton has 63 states and 122 transitions. Word has length 41 [2018-06-24 21:17:30,880 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:17:30,880 INFO ]: Abstraction has 63 states and 122 transitions. [2018-06-24 21:17:30,880 INFO ]: Interpolant automaton has 19 states. [2018-06-24 21:17:30,880 INFO ]: Start isEmpty. Operand 63 states and 122 transitions. [2018-06-24 21:17:30,882 INFO ]: Finished isEmpty. Found accepting run of length 47 [2018-06-24 21:17:30,882 INFO ]: Found error trace [2018-06-24 21:17:30,882 INFO ]: trace histogram [7, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:17:30,882 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:17:30,883 INFO ]: Analyzing trace with hash -443040977, now seen corresponding path program 8 times [2018-06-24 21:17:30,883 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:17:30,883 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:17:30,883 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:30,883 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:17:30,883 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:30,911 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:31,289 WARN ]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-24 21:17:31,737 INFO ]: Checked inductivity of 128 backedges. 18 proven. 72 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-24 21:17:31,737 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:17:31,737 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-24 21:17:31,751 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:17:31,791 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:17:31,791 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:31,795 INFO ]: Computing forward predicates... [2018-06-24 21:17:32,067 INFO ]: Checked inductivity of 128 backedges. 18 proven. 72 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-24 21:17:32,085 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:17:32,086 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 26 [2018-06-24 21:17:32,086 INFO ]: Interpolant automaton has 26 states [2018-06-24 21:17:32,086 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 21:17:32,086 INFO ]: CoverageRelationStatistics Valid=55, Invalid=595, Unknown=0, NotChecked=0, Total=650 [2018-06-24 21:17:32,086 INFO ]: Start difference. First operand 63 states and 122 transitions. Second operand 26 states. [2018-06-24 21:17:33,052 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:17:33,052 INFO ]: Finished difference Result 83 states and 168 transitions. [2018-06-24 21:17:33,052 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-24 21:17:33,052 INFO ]: Start accepts. Automaton has 26 states. Word has length 46 [2018-06-24 21:17:33,053 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:17:33,054 INFO ]: With dead ends: 83 [2018-06-24 21:17:33,054 INFO ]: Without dead ends: 83 [2018-06-24 21:17:33,055 INFO ]: 0 DeclaredPredicates, 86 GetRequests, 37 SyntacticMatches, 8 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=140, Invalid=1666, Unknown=0, NotChecked=0, Total=1806 [2018-06-24 21:17:33,055 INFO ]: Start minimizeSevpa. Operand 83 states. [2018-06-24 21:17:33,064 INFO ]: Finished minimizeSevpa. Reduced states from 83 to 74. [2018-06-24 21:17:33,064 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-24 21:17:33,065 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 149 transitions. [2018-06-24 21:17:33,066 INFO ]: Start accepts. Automaton has 74 states and 149 transitions. Word has length 46 [2018-06-24 21:17:33,066 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:17:33,066 INFO ]: Abstraction has 74 states and 149 transitions. [2018-06-24 21:17:33,066 INFO ]: Interpolant automaton has 26 states. [2018-06-24 21:17:33,066 INFO ]: Start isEmpty. Operand 74 states and 149 transitions. [2018-06-24 21:17:33,068 INFO ]: Finished isEmpty. Found accepting run of length 48 [2018-06-24 21:17:33,068 INFO ]: Found error trace [2018-06-24 21:17:33,068 INFO ]: trace histogram [7, 7, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:17:33,068 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:17:33,069 INFO ]: Analyzing trace with hash 2045017223, now seen corresponding path program 9 times [2018-06-24 21:17:33,069 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:17:33,069 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:17:33,069 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:33,069 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:17:33,069 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:33,093 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:33,345 INFO ]: Checked inductivity of 135 backedges. 39 proven. 58 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-24 21:17:33,345 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:17:33,345 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:17:33,350 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:17:33,392 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-24 21:17:33,392 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:33,395 INFO ]: Computing forward predicates... [2018-06-24 21:17:33,433 INFO ]: Checked inductivity of 135 backedges. 46 proven. 51 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-24 21:17:33,452 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:17:33,452 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-06-24 21:17:33,453 INFO ]: Interpolant automaton has 21 states [2018-06-24 21:17:33,453 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 21:17:33,453 INFO ]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2018-06-24 21:17:33,453 INFO ]: Start difference. First operand 74 states and 149 transitions. Second operand 21 states. [2018-06-24 21:17:33,855 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:17:33,855 INFO ]: Finished difference Result 83 states and 165 transitions. [2018-06-24 21:17:33,856 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-24 21:17:33,856 INFO ]: Start accepts. Automaton has 21 states. Word has length 47 [2018-06-24 21:17:33,856 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:17:33,857 INFO ]: With dead ends: 83 [2018-06-24 21:17:33,857 INFO ]: Without dead ends: 83 [2018-06-24 21:17:33,857 INFO ]: 0 DeclaredPredicates, 78 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=654, Unknown=0, NotChecked=0, Total=812 [2018-06-24 21:17:33,857 INFO ]: Start minimizeSevpa. Operand 83 states. [2018-06-24 21:17:33,866 INFO ]: Finished minimizeSevpa. Reduced states from 83 to 66. [2018-06-24 21:17:33,866 INFO ]: Start removeUnreachable. Operand 66 states. [2018-06-24 21:17:33,867 INFO ]: Finished removeUnreachable. Reduced from 66 states to 66 states and 129 transitions. [2018-06-24 21:17:33,867 INFO ]: Start accepts. Automaton has 66 states and 129 transitions. Word has length 47 [2018-06-24 21:17:33,867 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:17:33,867 INFO ]: Abstraction has 66 states and 129 transitions. [2018-06-24 21:17:33,867 INFO ]: Interpolant automaton has 21 states. [2018-06-24 21:17:33,867 INFO ]: Start isEmpty. Operand 66 states and 129 transitions. [2018-06-24 21:17:33,868 INFO ]: Finished isEmpty. Found accepting run of length 52 [2018-06-24 21:17:33,868 INFO ]: Found error trace [2018-06-24 21:17:33,868 INFO ]: trace histogram [8, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:17:33,868 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:17:33,868 INFO ]: Analyzing trace with hash -41238639, now seen corresponding path program 10 times [2018-06-24 21:17:33,868 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:17:33,868 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:17:33,871 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:33,871 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:17:33,871 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:33,891 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:34,346 INFO ]: Checked inductivity of 163 backedges. 78 proven. 34 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-24 21:17:34,346 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:17:34,346 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:17:34,352 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:17:34,394 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:17:34,394 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:34,397 INFO ]: Computing forward predicates... [2018-06-24 21:17:34,438 INFO ]: Checked inductivity of 163 backedges. 78 proven. 34 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-24 21:17:34,461 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:17:34,461 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-06-24 21:17:34,462 INFO ]: Interpolant automaton has 21 states [2018-06-24 21:17:34,462 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 21:17:34,462 INFO ]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2018-06-24 21:17:34,462 INFO ]: Start difference. First operand 66 states and 129 transitions. Second operand 21 states. [2018-06-24 21:17:34,783 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:17:34,783 INFO ]: Finished difference Result 83 states and 162 transitions. [2018-06-24 21:17:34,784 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-24 21:17:34,784 INFO ]: Start accepts. Automaton has 21 states. Word has length 51 [2018-06-24 21:17:34,784 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:17:34,784 INFO ]: With dead ends: 83 [2018-06-24 21:17:34,784 INFO ]: Without dead ends: 83 [2018-06-24 21:17:34,785 INFO ]: 0 DeclaredPredicates, 92 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=1097, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 21:17:34,785 INFO ]: Start minimizeSevpa. Operand 83 states. [2018-06-24 21:17:34,794 INFO ]: Finished minimizeSevpa. Reduced states from 83 to 67. [2018-06-24 21:17:34,794 INFO ]: Start removeUnreachable. Operand 67 states. [2018-06-24 21:17:34,795 INFO ]: Finished removeUnreachable. Reduced from 67 states to 67 states and 131 transitions. [2018-06-24 21:17:34,795 INFO ]: Start accepts. Automaton has 67 states and 131 transitions. Word has length 51 [2018-06-24 21:17:34,795 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:17:34,795 INFO ]: Abstraction has 67 states and 131 transitions. [2018-06-24 21:17:34,795 INFO ]: Interpolant automaton has 21 states. [2018-06-24 21:17:34,795 INFO ]: Start isEmpty. Operand 67 states and 131 transitions. [2018-06-24 21:17:34,796 INFO ]: Finished isEmpty. Found accepting run of length 53 [2018-06-24 21:17:34,796 INFO ]: Found error trace [2018-06-24 21:17:34,796 INFO ]: trace histogram [8, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:17:34,796 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:17:34,796 INFO ]: Analyzing trace with hash 641275193, now seen corresponding path program 11 times [2018-06-24 21:17:34,797 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:17:34,797 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:17:34,797 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:34,797 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:17:34,797 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:34,821 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:35,365 WARN ]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-24 21:17:35,599 INFO ]: Checked inductivity of 170 backedges. 21 proven. 98 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-24 21:17:35,599 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:17:35,599 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:17:35,604 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:17:35,654 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-24 21:17:35,654 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:35,657 INFO ]: Computing forward predicates... [2018-06-24 21:17:36,462 INFO ]: Checked inductivity of 170 backedges. 21 proven. 103 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-06-24 21:17:36,485 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:17:36,485 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25] total 40 [2018-06-24 21:17:36,485 INFO ]: Interpolant automaton has 40 states [2018-06-24 21:17:36,485 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-24 21:17:36,486 INFO ]: CoverageRelationStatistics Valid=84, Invalid=1476, Unknown=0, NotChecked=0, Total=1560 [2018-06-24 21:17:36,486 INFO ]: Start difference. First operand 67 states and 131 transitions. Second operand 40 states. [2018-06-24 21:17:39,796 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:17:39,796 INFO ]: Finished difference Result 108 states and 227 transitions. [2018-06-24 21:17:39,796 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-06-24 21:17:39,796 INFO ]: Start accepts. Automaton has 40 states. Word has length 52 [2018-06-24 21:17:39,797 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:17:39,798 INFO ]: With dead ends: 108 [2018-06-24 21:17:39,798 INFO ]: Without dead ends: 108 [2018-06-24 21:17:39,800 INFO ]: 0 DeclaredPredicates, 113 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=318, Invalid=5232, Unknown=0, NotChecked=0, Total=5550 [2018-06-24 21:17:39,800 INFO ]: Start minimizeSevpa. Operand 108 states. [2018-06-24 21:17:39,811 INFO ]: Finished minimizeSevpa. Reduced states from 108 to 78. [2018-06-24 21:17:39,811 INFO ]: Start removeUnreachable. Operand 78 states. [2018-06-24 21:17:39,813 INFO ]: Finished removeUnreachable. Reduced from 78 states to 78 states and 158 transitions. [2018-06-24 21:17:39,813 INFO ]: Start accepts. Automaton has 78 states and 158 transitions. Word has length 52 [2018-06-24 21:17:39,813 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:17:39,813 INFO ]: Abstraction has 78 states and 158 transitions. [2018-06-24 21:17:39,813 INFO ]: Interpolant automaton has 40 states. [2018-06-24 21:17:39,813 INFO ]: Start isEmpty. Operand 78 states and 158 transitions. [2018-06-24 21:17:39,815 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-24 21:17:39,815 INFO ]: Found error trace [2018-06-24 21:17:39,815 INFO ]: trace histogram [8, 8, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:17:39,815 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:17:39,815 INFO ]: Analyzing trace with hash 324367505, now seen corresponding path program 12 times [2018-06-24 21:17:39,815 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:17:39,815 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:17:39,816 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:39,816 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:17:39,816 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:39,834 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:40,421 INFO ]: Checked inductivity of 178 backedges. 49 proven. 78 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-24 21:17:40,422 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:17:40,463 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:17:40,469 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:17:40,519 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-24 21:17:40,519 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:40,522 INFO ]: Computing forward predicates... [2018-06-24 21:17:40,581 INFO ]: Checked inductivity of 178 backedges. 57 proven. 70 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-24 21:17:40,613 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:17:40,613 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-06-24 21:17:40,613 INFO ]: Interpolant automaton has 23 states [2018-06-24 21:17:40,613 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-24 21:17:40,613 INFO ]: CoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2018-06-24 21:17:40,613 INFO ]: Start difference. First operand 78 states and 158 transitions. Second operand 23 states. [2018-06-24 21:17:41,021 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:17:41,021 INFO ]: Finished difference Result 88 states and 177 transitions. [2018-06-24 21:17:41,022 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-24 21:17:41,022 INFO ]: Start accepts. Automaton has 23 states. Word has length 53 [2018-06-24 21:17:41,022 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:17:41,023 INFO ]: With dead ends: 88 [2018-06-24 21:17:41,023 INFO ]: Without dead ends: 88 [2018-06-24 21:17:41,024 INFO ]: 0 DeclaredPredicates, 88 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=194, Invalid=798, Unknown=0, NotChecked=0, Total=992 [2018-06-24 21:17:41,024 INFO ]: Start minimizeSevpa. Operand 88 states. [2018-06-24 21:17:41,031 INFO ]: Finished minimizeSevpa. Reduced states from 88 to 70. [2018-06-24 21:17:41,032 INFO ]: Start removeUnreachable. Operand 70 states. [2018-06-24 21:17:41,032 INFO ]: Finished removeUnreachable. Reduced from 70 states to 70 states and 138 transitions. [2018-06-24 21:17:41,032 INFO ]: Start accepts. Automaton has 70 states and 138 transitions. Word has length 53 [2018-06-24 21:17:41,033 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:17:41,033 INFO ]: Abstraction has 70 states and 138 transitions. [2018-06-24 21:17:41,033 INFO ]: Interpolant automaton has 23 states. [2018-06-24 21:17:41,033 INFO ]: Start isEmpty. Operand 70 states and 138 transitions. [2018-06-24 21:17:41,035 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-24 21:17:41,035 INFO ]: Found error trace [2018-06-24 21:17:41,035 INFO ]: trace histogram [9, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:17:41,035 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:17:41,035 INFO ]: Analyzing trace with hash 2145113833, now seen corresponding path program 13 times [2018-06-24 21:17:41,035 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:17:41,035 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:17:41,036 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:41,036 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:17:41,036 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:41,054 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:41,948 INFO ]: Checked inductivity of 210 backedges. 101 proven. 43 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-24 21:17:41,948 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:17:41,948 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:17:41,955 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:17:42,000 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:42,003 INFO ]: Computing forward predicates... [2018-06-24 21:17:42,029 INFO ]: Checked inductivity of 210 backedges. 101 proven. 43 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-24 21:17:42,048 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:17:42,048 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-06-24 21:17:42,048 INFO ]: Interpolant automaton has 23 states [2018-06-24 21:17:42,048 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-24 21:17:42,048 INFO ]: CoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2018-06-24 21:17:42,049 INFO ]: Start difference. First operand 70 states and 138 transitions. Second operand 23 states. [2018-06-24 21:17:42,494 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:17:42,494 INFO ]: Finished difference Result 88 states and 174 transitions. [2018-06-24 21:17:42,494 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-24 21:17:42,495 INFO ]: Start accepts. Automaton has 23 states. Word has length 57 [2018-06-24 21:17:42,495 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:17:42,496 INFO ]: With dead ends: 88 [2018-06-24 21:17:42,496 INFO ]: Without dead ends: 88 [2018-06-24 21:17:42,496 INFO ]: 0 DeclaredPredicates, 103 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=289, Invalid=1351, Unknown=0, NotChecked=0, Total=1640 [2018-06-24 21:17:42,497 INFO ]: Start minimizeSevpa. Operand 88 states. [2018-06-24 21:17:42,504 INFO ]: Finished minimizeSevpa. Reduced states from 88 to 71. [2018-06-24 21:17:42,504 INFO ]: Start removeUnreachable. Operand 71 states. [2018-06-24 21:17:42,505 INFO ]: Finished removeUnreachable. Reduced from 71 states to 71 states and 140 transitions. [2018-06-24 21:17:42,505 INFO ]: Start accepts. Automaton has 71 states and 140 transitions. Word has length 57 [2018-06-24 21:17:42,505 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:17:42,505 INFO ]: Abstraction has 71 states and 140 transitions. [2018-06-24 21:17:42,505 INFO ]: Interpolant automaton has 23 states. [2018-06-24 21:17:42,505 INFO ]: Start isEmpty. Operand 71 states and 140 transitions. [2018-06-24 21:17:42,506 INFO ]: Finished isEmpty. Found accepting run of length 59 [2018-06-24 21:17:42,506 INFO ]: Found error trace [2018-06-24 21:17:42,506 INFO ]: trace histogram [9, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:17:42,507 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:17:42,507 INFO ]: Analyzing trace with hash 382553745, now seen corresponding path program 14 times [2018-06-24 21:17:42,507 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:17:42,507 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:17:42,507 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:42,507 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:17:42,507 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:42,525 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:42,869 INFO ]: Checked inductivity of 218 backedges. 24 proven. 128 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-24 21:17:42,870 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:17:42,870 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:17:42,876 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:17:42,924 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:17:42,924 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:42,928 INFO ]: Computing forward predicates... [2018-06-24 21:17:43,742 INFO ]: Checked inductivity of 218 backedges. 24 proven. 128 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-24 21:17:43,761 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:17:43,761 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 32 [2018-06-24 21:17:43,761 INFO ]: Interpolant automaton has 32 states [2018-06-24 21:17:43,762 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-24 21:17:43,762 INFO ]: CoverageRelationStatistics Valid=69, Invalid=923, Unknown=0, NotChecked=0, Total=992 [2018-06-24 21:17:43,762 INFO ]: Start difference. First operand 71 states and 140 transitions. Second operand 32 states. [2018-06-24 21:17:45,042 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:17:45,042 INFO ]: Finished difference Result 93 states and 192 transitions. [2018-06-24 21:17:45,042 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-24 21:17:45,043 INFO ]: Start accepts. Automaton has 32 states. Word has length 58 [2018-06-24 21:17:45,043 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:17:45,044 INFO ]: With dead ends: 93 [2018-06-24 21:17:45,044 INFO ]: Without dead ends: 93 [2018-06-24 21:17:45,045 INFO ]: 0 DeclaredPredicates, 108 GetRequests, 47 SyntacticMatches, 10 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=2582, Unknown=0, NotChecked=0, Total=2756 [2018-06-24 21:17:45,045 INFO ]: Start minimizeSevpa. Operand 93 states. [2018-06-24 21:17:45,053 INFO ]: Finished minimizeSevpa. Reduced states from 93 to 82. [2018-06-24 21:17:45,053 INFO ]: Start removeUnreachable. Operand 82 states. [2018-06-24 21:17:45,054 INFO ]: Finished removeUnreachable. Reduced from 82 states to 82 states and 167 transitions. [2018-06-24 21:17:45,054 INFO ]: Start accepts. Automaton has 82 states and 167 transitions. Word has length 58 [2018-06-24 21:17:45,054 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:17:45,054 INFO ]: Abstraction has 82 states and 167 transitions. [2018-06-24 21:17:45,054 INFO ]: Interpolant automaton has 32 states. [2018-06-24 21:17:45,054 INFO ]: Start isEmpty. Operand 82 states and 167 transitions. [2018-06-24 21:17:45,056 INFO ]: Finished isEmpty. Found accepting run of length 60 [2018-06-24 21:17:45,056 INFO ]: Found error trace [2018-06-24 21:17:45,056 INFO ]: trace histogram [9, 9, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:17:45,056 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:17:45,056 INFO ]: Analyzing trace with hash 1577765865, now seen corresponding path program 15 times [2018-06-24 21:17:45,056 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:17:45,056 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:17:45,057 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:45,057 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:17:45,057 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:45,078 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:46,084 INFO ]: Checked inductivity of 227 backedges. 60 proven. 101 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-24 21:17:46,084 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:17:46,195 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:17:46,201 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:17:46,352 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-24 21:17:46,352 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:46,356 INFO ]: Computing forward predicates... [2018-06-24 21:17:46,610 INFO ]: Checked inductivity of 227 backedges. 69 proven. 92 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-24 21:17:46,642 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:17:46,642 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-06-24 21:17:46,642 INFO ]: Interpolant automaton has 25 states [2018-06-24 21:17:46,643 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 21:17:46,643 INFO ]: CoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2018-06-24 21:17:46,643 INFO ]: Start difference. First operand 82 states and 167 transitions. Second operand 25 states. [2018-06-24 21:17:47,045 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:17:47,045 INFO ]: Finished difference Result 93 states and 189 transitions. [2018-06-24 21:17:47,045 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-24 21:17:47,045 INFO ]: Start accepts. Automaton has 25 states. Word has length 59 [2018-06-24 21:17:47,045 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:17:47,046 INFO ]: With dead ends: 93 [2018-06-24 21:17:47,046 INFO ]: Without dead ends: 93 [2018-06-24 21:17:47,047 INFO ]: 0 DeclaredPredicates, 98 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=234, Invalid=956, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 21:17:47,047 INFO ]: Start minimizeSevpa. Operand 93 states. [2018-06-24 21:17:47,054 INFO ]: Finished minimizeSevpa. Reduced states from 93 to 74. [2018-06-24 21:17:47,055 INFO ]: Start removeUnreachable. Operand 74 states. [2018-06-24 21:17:47,055 INFO ]: Finished removeUnreachable. Reduced from 74 states to 74 states and 147 transitions. [2018-06-24 21:17:47,055 INFO ]: Start accepts. Automaton has 74 states and 147 transitions. Word has length 59 [2018-06-24 21:17:47,056 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:17:47,056 INFO ]: Abstraction has 74 states and 147 transitions. [2018-06-24 21:17:47,056 INFO ]: Interpolant automaton has 25 states. [2018-06-24 21:17:47,056 INFO ]: Start isEmpty. Operand 74 states and 147 transitions. [2018-06-24 21:17:47,057 INFO ]: Finished isEmpty. Found accepting run of length 64 [2018-06-24 21:17:47,057 INFO ]: Found error trace [2018-06-24 21:17:47,057 INFO ]: trace histogram [10, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:17:47,057 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:17:47,057 INFO ]: Analyzing trace with hash -679113169, now seen corresponding path program 16 times [2018-06-24 21:17:47,057 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:17:47,057 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:17:47,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:47,058 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:17:47,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:47,078 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:47,389 INFO ]: Checked inductivity of 263 backedges. 127 proven. 53 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-06-24 21:17:47,389 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:17:47,389 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:17:47,394 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:17:47,443 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:17:47,443 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:47,446 INFO ]: Computing forward predicates... [2018-06-24 21:17:47,481 INFO ]: Checked inductivity of 263 backedges. 127 proven. 53 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-06-24 21:17:47,504 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:17:47,504 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-06-24 21:17:47,504 INFO ]: Interpolant automaton has 25 states [2018-06-24 21:17:47,504 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 21:17:47,505 INFO ]: CoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2018-06-24 21:17:47,505 INFO ]: Start difference. First operand 74 states and 147 transitions. Second operand 25 states. [2018-06-24 21:17:47,914 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:17:47,914 INFO ]: Finished difference Result 93 states and 186 transitions. [2018-06-24 21:17:47,914 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-24 21:17:47,914 INFO ]: Start accepts. Automaton has 25 states. Word has length 63 [2018-06-24 21:17:47,915 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:17:47,916 INFO ]: With dead ends: 93 [2018-06-24 21:17:47,916 INFO ]: Without dead ends: 93 [2018-06-24 21:17:47,917 INFO ]: 0 DeclaredPredicates, 114 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=349, Invalid=1631, Unknown=0, NotChecked=0, Total=1980 [2018-06-24 21:17:47,917 INFO ]: Start minimizeSevpa. Operand 93 states. [2018-06-24 21:17:47,928 INFO ]: Finished minimizeSevpa. Reduced states from 93 to 75. [2018-06-24 21:17:47,928 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-24 21:17:47,929 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 149 transitions. [2018-06-24 21:17:47,929 INFO ]: Start accepts. Automaton has 75 states and 149 transitions. Word has length 63 [2018-06-24 21:17:47,929 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:17:47,929 INFO ]: Abstraction has 75 states and 149 transitions. [2018-06-24 21:17:47,929 INFO ]: Interpolant automaton has 25 states. [2018-06-24 21:17:47,929 INFO ]: Start isEmpty. Operand 75 states and 149 transitions. [2018-06-24 21:17:47,930 INFO ]: Finished isEmpty. Found accepting run of length 65 [2018-06-24 21:17:47,930 INFO ]: Found error trace [2018-06-24 21:17:47,930 INFO ]: trace histogram [10, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:17:47,931 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:17:47,931 INFO ]: Analyzing trace with hash 1918412759, now seen corresponding path program 17 times [2018-06-24 21:17:47,931 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:17:47,931 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:17:47,931 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:47,931 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:17:47,931 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:47,952 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:48,523 INFO ]: Checked inductivity of 272 backedges. 27 proven. 162 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-06-24 21:17:48,523 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:17:48,523 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:17:48,529 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:17:48,635 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-24 21:17:48,635 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:48,639 INFO ]: Computing forward predicates... [2018-06-24 21:17:49,750 INFO ]: Checked inductivity of 272 backedges. 27 proven. 169 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-06-24 21:17:49,768 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:17:49,768 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 29] total 48 [2018-06-24 21:17:49,769 INFO ]: Interpolant automaton has 48 states [2018-06-24 21:17:49,769 INFO ]: Constructing interpolant automaton starting with 48 interpolants. [2018-06-24 21:17:49,769 INFO ]: CoverageRelationStatistics Valid=102, Invalid=2154, Unknown=0, NotChecked=0, Total=2256 [2018-06-24 21:17:49,769 INFO ]: Start difference. First operand 75 states and 149 transitions. Second operand 48 states. [2018-06-24 21:17:53,449 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:17:53,449 INFO ]: Finished difference Result 124 states and 265 transitions. [2018-06-24 21:17:53,449 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-06-24 21:17:53,449 INFO ]: Start accepts. Automaton has 48 states. Word has length 64 [2018-06-24 21:17:53,449 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:17:53,451 INFO ]: With dead ends: 124 [2018-06-24 21:17:53,451 INFO ]: Without dead ends: 124 [2018-06-24 21:17:53,453 INFO ]: 0 DeclaredPredicates, 139 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1443 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=396, Invalid=7794, Unknown=0, NotChecked=0, Total=8190 [2018-06-24 21:17:53,453 INFO ]: Start minimizeSevpa. Operand 124 states. [2018-06-24 21:17:53,463 INFO ]: Finished minimizeSevpa. Reduced states from 124 to 86. [2018-06-24 21:17:53,463 INFO ]: Start removeUnreachable. Operand 86 states. [2018-06-24 21:17:53,463 INFO ]: Finished removeUnreachable. Reduced from 86 states to 86 states and 176 transitions. [2018-06-24 21:17:53,464 INFO ]: Start accepts. Automaton has 86 states and 176 transitions. Word has length 64 [2018-06-24 21:17:53,464 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:17:53,464 INFO ]: Abstraction has 86 states and 176 transitions. [2018-06-24 21:17:53,464 INFO ]: Interpolant automaton has 48 states. [2018-06-24 21:17:53,464 INFO ]: Start isEmpty. Operand 86 states and 176 transitions. [2018-06-24 21:17:53,465 INFO ]: Finished isEmpty. Found accepting run of length 66 [2018-06-24 21:17:53,465 INFO ]: Found error trace [2018-06-24 21:17:53,465 INFO ]: trace histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:17:53,465 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:17:53,466 INFO ]: Analyzing trace with hash 837337903, now seen corresponding path program 18 times [2018-06-24 21:17:53,466 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:17:53,466 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:17:53,467 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:53,467 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:17:53,467 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:53,496 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:53,988 INFO ]: Checked inductivity of 282 backedges. 72 proven. 127 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-06-24 21:17:53,988 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:17:53,988 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:17:54,007 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:17:54,070 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-24 21:17:54,070 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:54,073 INFO ]: Computing forward predicates... [2018-06-24 21:17:54,104 INFO ]: Checked inductivity of 282 backedges. 82 proven. 117 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-06-24 21:17:54,124 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:17:54,124 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-06-24 21:17:54,124 INFO ]: Interpolant automaton has 27 states [2018-06-24 21:17:54,124 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-24 21:17:54,124 INFO ]: CoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2018-06-24 21:17:54,125 INFO ]: Start difference. First operand 86 states and 176 transitions. Second operand 27 states. [2018-06-24 21:17:54,540 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:17:54,540 INFO ]: Finished difference Result 98 states and 201 transitions. [2018-06-24 21:17:54,540 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-24 21:17:54,541 INFO ]: Start accepts. Automaton has 27 states. Word has length 65 [2018-06-24 21:17:54,541 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:17:54,542 INFO ]: With dead ends: 98 [2018-06-24 21:17:54,542 INFO ]: Without dead ends: 98 [2018-06-24 21:17:54,543 INFO ]: 0 DeclaredPredicates, 108 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=278, Invalid=1128, Unknown=0, NotChecked=0, Total=1406 [2018-06-24 21:17:54,543 INFO ]: Start minimizeSevpa. Operand 98 states. [2018-06-24 21:17:54,552 INFO ]: Finished minimizeSevpa. Reduced states from 98 to 78. [2018-06-24 21:17:54,552 INFO ]: Start removeUnreachable. Operand 78 states. [2018-06-24 21:17:54,553 INFO ]: Finished removeUnreachable. Reduced from 78 states to 78 states and 156 transitions. [2018-06-24 21:17:54,553 INFO ]: Start accepts. Automaton has 78 states and 156 transitions. Word has length 65 [2018-06-24 21:17:54,553 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:17:54,553 INFO ]: Abstraction has 78 states and 156 transitions. [2018-06-24 21:17:54,553 INFO ]: Interpolant automaton has 27 states. [2018-06-24 21:17:54,553 INFO ]: Start isEmpty. Operand 78 states and 156 transitions. [2018-06-24 21:17:54,555 INFO ]: Finished isEmpty. Found accepting run of length 70 [2018-06-24 21:17:54,555 INFO ]: Found error trace [2018-06-24 21:17:54,555 INFO ]: trace histogram [11, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:17:54,555 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:17:54,555 INFO ]: Analyzing trace with hash 1876060747, now seen corresponding path program 19 times [2018-06-24 21:17:54,555 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:17:54,555 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:17:54,555 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:54,555 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:17:54,555 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:54,576 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:55,348 INFO ]: Checked inductivity of 322 backedges. 156 proven. 64 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-06-24 21:17:55,348 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:17:55,348 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:17:55,353 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:17:55,406 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:55,410 INFO ]: Computing forward predicates... [2018-06-24 21:17:55,463 INFO ]: Checked inductivity of 322 backedges. 156 proven. 64 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-06-24 21:17:55,482 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:17:55,482 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-06-24 21:17:55,482 INFO ]: Interpolant automaton has 27 states [2018-06-24 21:17:55,482 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-24 21:17:55,483 INFO ]: CoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2018-06-24 21:17:55,483 INFO ]: Start difference. First operand 78 states and 156 transitions. Second operand 27 states. [2018-06-24 21:17:55,969 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:17:55,969 INFO ]: Finished difference Result 98 states and 198 transitions. [2018-06-24 21:17:55,969 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-06-24 21:17:55,969 INFO ]: Start accepts. Automaton has 27 states. Word has length 69 [2018-06-24 21:17:55,970 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:17:55,970 INFO ]: With dead ends: 98 [2018-06-24 21:17:55,970 INFO ]: Without dead ends: 98 [2018-06-24 21:17:55,971 INFO ]: 0 DeclaredPredicates, 125 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=415, Invalid=1937, Unknown=0, NotChecked=0, Total=2352 [2018-06-24 21:17:55,971 INFO ]: Start minimizeSevpa. Operand 98 states. [2018-06-24 21:17:55,980 INFO ]: Finished minimizeSevpa. Reduced states from 98 to 79. [2018-06-24 21:17:55,980 INFO ]: Start removeUnreachable. Operand 79 states. [2018-06-24 21:17:55,981 INFO ]: Finished removeUnreachable. Reduced from 79 states to 79 states and 158 transitions. [2018-06-24 21:17:55,981 INFO ]: Start accepts. Automaton has 79 states and 158 transitions. Word has length 69 [2018-06-24 21:17:55,981 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:17:55,981 INFO ]: Abstraction has 79 states and 158 transitions. [2018-06-24 21:17:55,981 INFO ]: Interpolant automaton has 27 states. [2018-06-24 21:17:55,981 INFO ]: Start isEmpty. Operand 79 states and 158 transitions. [2018-06-24 21:17:55,983 INFO ]: Finished isEmpty. Found accepting run of length 71 [2018-06-24 21:17:55,983 INFO ]: Found error trace [2018-06-24 21:17:55,983 INFO ]: trace histogram [11, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:17:55,983 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:17:55,983 INFO ]: Analyzing trace with hash -1824152077, now seen corresponding path program 20 times [2018-06-24 21:17:55,983 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:17:55,983 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:17:55,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:55,983 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:17:55,983 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:56,004 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:56,908 INFO ]: Checked inductivity of 332 backedges. 30 proven. 200 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-06-24 21:17:56,908 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:17:56,908 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:17:56,915 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:17:56,971 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:17:56,971 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:56,976 INFO ]: Computing forward predicates... [2018-06-24 21:17:57,428 INFO ]: Checked inductivity of 332 backedges. 30 proven. 200 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-06-24 21:17:57,447 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:17:57,447 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 38 [2018-06-24 21:17:57,447 INFO ]: Interpolant automaton has 38 states [2018-06-24 21:17:57,447 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-24 21:17:57,448 INFO ]: CoverageRelationStatistics Valid=83, Invalid=1323, Unknown=0, NotChecked=0, Total=1406 [2018-06-24 21:17:57,448 INFO ]: Start difference. First operand 79 states and 158 transitions. Second operand 38 states. [2018-06-24 21:17:59,273 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:17:59,274 INFO ]: Finished difference Result 103 states and 216 transitions. [2018-06-24 21:17:59,274 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-24 21:17:59,274 INFO ]: Start accepts. Automaton has 38 states. Word has length 70 [2018-06-24 21:17:59,274 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:17:59,275 INFO ]: With dead ends: 103 [2018-06-24 21:17:59,275 INFO ]: Without dead ends: 103 [2018-06-24 21:17:59,276 INFO ]: 0 DeclaredPredicates, 130 GetRequests, 57 SyntacticMatches, 12 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=208, Invalid=3698, Unknown=0, NotChecked=0, Total=3906 [2018-06-24 21:17:59,276 INFO ]: Start minimizeSevpa. Operand 103 states. [2018-06-24 21:17:59,283 INFO ]: Finished minimizeSevpa. Reduced states from 103 to 90. [2018-06-24 21:17:59,283 INFO ]: Start removeUnreachable. Operand 90 states. [2018-06-24 21:17:59,285 INFO ]: Finished removeUnreachable. Reduced from 90 states to 90 states and 185 transitions. [2018-06-24 21:17:59,285 INFO ]: Start accepts. Automaton has 90 states and 185 transitions. Word has length 70 [2018-06-24 21:17:59,285 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:17:59,285 INFO ]: Abstraction has 90 states and 185 transitions. [2018-06-24 21:17:59,285 INFO ]: Interpolant automaton has 38 states. [2018-06-24 21:17:59,285 INFO ]: Start isEmpty. Operand 90 states and 185 transitions. [2018-06-24 21:17:59,287 INFO ]: Finished isEmpty. Found accepting run of length 72 [2018-06-24 21:17:59,287 INFO ]: Found error trace [2018-06-24 21:17:59,287 INFO ]: trace histogram [11, 11, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:17:59,287 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:17:59,287 INFO ]: Analyzing trace with hash -566632629, now seen corresponding path program 21 times [2018-06-24 21:17:59,287 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:17:59,287 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:17:59,291 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:59,291 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:17:59,291 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:17:59,311 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:59,642 INFO ]: Checked inductivity of 343 backedges. 85 proven. 156 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-06-24 21:17:59,642 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:17:59,642 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:17:59,647 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:17:59,714 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-06-24 21:17:59,714 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:17:59,718 INFO ]: Computing forward predicates... [2018-06-24 21:17:59,744 INFO ]: Checked inductivity of 343 backedges. 96 proven. 145 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-06-24 21:17:59,762 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:17:59,762 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-06-24 21:17:59,762 INFO ]: Interpolant automaton has 29 states [2018-06-24 21:17:59,762 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-24 21:17:59,762 INFO ]: CoverageRelationStatistics Valid=167, Invalid=645, Unknown=0, NotChecked=0, Total=812 [2018-06-24 21:17:59,762 INFO ]: Start difference. First operand 90 states and 185 transitions. Second operand 29 states. [2018-06-24 21:18:00,214 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:00,214 INFO ]: Finished difference Result 103 states and 213 transitions. [2018-06-24 21:18:00,217 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-24 21:18:00,217 INFO ]: Start accepts. Automaton has 29 states. Word has length 71 [2018-06-24 21:18:00,217 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:00,218 INFO ]: With dead ends: 103 [2018-06-24 21:18:00,218 INFO ]: Without dead ends: 103 [2018-06-24 21:18:00,218 INFO ]: 0 DeclaredPredicates, 118 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=326, Invalid=1314, Unknown=0, NotChecked=0, Total=1640 [2018-06-24 21:18:00,218 INFO ]: Start minimizeSevpa. Operand 103 states. [2018-06-24 21:18:00,225 INFO ]: Finished minimizeSevpa. Reduced states from 103 to 82. [2018-06-24 21:18:00,225 INFO ]: Start removeUnreachable. Operand 82 states. [2018-06-24 21:18:00,226 INFO ]: Finished removeUnreachable. Reduced from 82 states to 82 states and 165 transitions. [2018-06-24 21:18:00,226 INFO ]: Start accepts. Automaton has 82 states and 165 transitions. Word has length 71 [2018-06-24 21:18:00,226 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:00,226 INFO ]: Abstraction has 82 states and 165 transitions. [2018-06-24 21:18:00,226 INFO ]: Interpolant automaton has 29 states. [2018-06-24 21:18:00,226 INFO ]: Start isEmpty. Operand 82 states and 165 transitions. [2018-06-24 21:18:00,228 INFO ]: Finished isEmpty. Found accepting run of length 76 [2018-06-24 21:18:00,228 INFO ]: Found error trace [2018-06-24 21:18:00,228 INFO ]: trace histogram [12, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:00,228 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:00,228 INFO ]: Analyzing trace with hash 59082957, now seen corresponding path program 22 times [2018-06-24 21:18:00,228 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:00,228 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:00,228 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:00,228 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:18:00,228 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:00,248 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:00,582 INFO ]: Checked inductivity of 387 backedges. 188 proven. 76 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-06-24 21:18:00,582 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:18:00,582 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:18:00,589 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:18:00,646 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:18:00,646 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:00,650 INFO ]: Computing forward predicates... [2018-06-24 21:18:00,720 INFO ]: Checked inductivity of 387 backedges. 188 proven. 76 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-06-24 21:18:00,755 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:18:00,755 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-06-24 21:18:00,755 INFO ]: Interpolant automaton has 29 states [2018-06-24 21:18:00,755 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-24 21:18:00,755 INFO ]: CoverageRelationStatistics Valid=176, Invalid=636, Unknown=0, NotChecked=0, Total=812 [2018-06-24 21:18:00,755 INFO ]: Start difference. First operand 82 states and 165 transitions. Second operand 29 states. [2018-06-24 21:18:01,425 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:01,425 INFO ]: Finished difference Result 103 states and 210 transitions. [2018-06-24 21:18:01,426 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-06-24 21:18:01,426 INFO ]: Start accepts. Automaton has 29 states. Word has length 75 [2018-06-24 21:18:01,426 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:01,426 INFO ]: With dead ends: 103 [2018-06-24 21:18:01,426 INFO ]: Without dead ends: 103 [2018-06-24 21:18:01,427 INFO ]: 0 DeclaredPredicates, 136 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=487, Invalid=2269, Unknown=0, NotChecked=0, Total=2756 [2018-06-24 21:18:01,427 INFO ]: Start minimizeSevpa. Operand 103 states. [2018-06-24 21:18:01,437 INFO ]: Finished minimizeSevpa. Reduced states from 103 to 83. [2018-06-24 21:18:01,437 INFO ]: Start removeUnreachable. Operand 83 states. [2018-06-24 21:18:01,439 INFO ]: Finished removeUnreachable. Reduced from 83 states to 83 states and 167 transitions. [2018-06-24 21:18:01,439 INFO ]: Start accepts. Automaton has 83 states and 167 transitions. Word has length 75 [2018-06-24 21:18:01,440 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:01,440 INFO ]: Abstraction has 83 states and 167 transitions. [2018-06-24 21:18:01,440 INFO ]: Interpolant automaton has 29 states. [2018-06-24 21:18:01,440 INFO ]: Start isEmpty. Operand 83 states and 167 transitions. [2018-06-24 21:18:01,441 INFO ]: Finished isEmpty. Found accepting run of length 77 [2018-06-24 21:18:01,441 INFO ]: Found error trace [2018-06-24 21:18:01,441 INFO ]: trace histogram [12, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:01,441 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:01,441 INFO ]: Analyzing trace with hash 1266116213, now seen corresponding path program 23 times [2018-06-24 21:18:01,441 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:01,441 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:01,442 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:01,442 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:18:01,442 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:01,462 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:02,071 INFO ]: Checked inductivity of 398 backedges. 33 proven. 242 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-06-24 21:18:02,071 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:18:02,071 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:18:02,078 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:18:02,158 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-06-24 21:18:02,158 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:02,163 INFO ]: Computing forward predicates... [2018-06-24 21:18:03,033 INFO ]: Checked inductivity of 398 backedges. 33 proven. 251 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-06-24 21:18:03,053 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:18:03,053 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 33] total 56 [2018-06-24 21:18:03,053 INFO ]: Interpolant automaton has 56 states [2018-06-24 21:18:03,053 INFO ]: Constructing interpolant automaton starting with 56 interpolants. [2018-06-24 21:18:03,054 INFO ]: CoverageRelationStatistics Valid=120, Invalid=2960, Unknown=0, NotChecked=0, Total=3080 [2018-06-24 21:18:03,054 INFO ]: Start difference. First operand 83 states and 167 transitions. Second operand 56 states. [2018-06-24 21:18:07,708 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:07,708 INFO ]: Finished difference Result 140 states and 303 transitions. [2018-06-24 21:18:07,708 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-06-24 21:18:07,708 INFO ]: Start accepts. Automaton has 56 states. Word has length 76 [2018-06-24 21:18:07,708 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:07,709 INFO ]: With dead ends: 140 [2018-06-24 21:18:07,709 INFO ]: Without dead ends: 140 [2018-06-24 21:18:07,710 INFO ]: 0 DeclaredPredicates, 165 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2045 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=474, Invalid=10868, Unknown=0, NotChecked=0, Total=11342 [2018-06-24 21:18:07,710 INFO ]: Start minimizeSevpa. Operand 140 states. [2018-06-24 21:18:07,721 INFO ]: Finished minimizeSevpa. Reduced states from 140 to 94. [2018-06-24 21:18:07,721 INFO ]: Start removeUnreachable. Operand 94 states. [2018-06-24 21:18:07,722 INFO ]: Finished removeUnreachable. Reduced from 94 states to 94 states and 194 transitions. [2018-06-24 21:18:07,722 INFO ]: Start accepts. Automaton has 94 states and 194 transitions. Word has length 76 [2018-06-24 21:18:07,722 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:07,722 INFO ]: Abstraction has 94 states and 194 transitions. [2018-06-24 21:18:07,722 INFO ]: Interpolant automaton has 56 states. [2018-06-24 21:18:07,722 INFO ]: Start isEmpty. Operand 94 states and 194 transitions. [2018-06-24 21:18:07,724 INFO ]: Finished isEmpty. Found accepting run of length 78 [2018-06-24 21:18:07,724 INFO ]: Found error trace [2018-06-24 21:18:07,724 INFO ]: trace histogram [12, 12, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:07,724 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:07,724 INFO ]: Analyzing trace with hash 29441485, now seen corresponding path program 24 times [2018-06-24 21:18:07,724 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:07,724 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:07,725 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:07,725 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:18:07,725 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:07,745 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:08,183 INFO ]: Checked inductivity of 410 backedges. 99 proven. 188 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-06-24 21:18:08,183 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:18:08,183 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:18:08,189 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:18:08,264 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-06-24 21:18:08,264 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:08,268 INFO ]: Computing forward predicates... [2018-06-24 21:18:08,339 INFO ]: Checked inductivity of 410 backedges. 111 proven. 176 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-06-24 21:18:08,371 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:18:08,371 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-06-24 21:18:08,371 INFO ]: Interpolant automaton has 31 states [2018-06-24 21:18:08,371 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-24 21:18:08,371 INFO ]: CoverageRelationStatistics Valid=193, Invalid=737, Unknown=0, NotChecked=0, Total=930 [2018-06-24 21:18:08,372 INFO ]: Start difference. First operand 94 states and 194 transitions. Second operand 31 states. [2018-06-24 21:18:08,907 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:08,907 INFO ]: Finished difference Result 108 states and 225 transitions. [2018-06-24 21:18:08,907 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-06-24 21:18:08,907 INFO ]: Start accepts. Automaton has 31 states. Word has length 77 [2018-06-24 21:18:08,908 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:08,908 INFO ]: With dead ends: 108 [2018-06-24 21:18:08,908 INFO ]: Without dead ends: 108 [2018-06-24 21:18:08,908 INFO ]: 0 DeclaredPredicates, 128 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=1514, Unknown=0, NotChecked=0, Total=1892 [2018-06-24 21:18:08,909 INFO ]: Start minimizeSevpa. Operand 108 states. [2018-06-24 21:18:08,916 INFO ]: Finished minimizeSevpa. Reduced states from 108 to 86. [2018-06-24 21:18:08,916 INFO ]: Start removeUnreachable. Operand 86 states. [2018-06-24 21:18:08,917 INFO ]: Finished removeUnreachable. Reduced from 86 states to 86 states and 174 transitions. [2018-06-24 21:18:08,917 INFO ]: Start accepts. Automaton has 86 states and 174 transitions. Word has length 77 [2018-06-24 21:18:08,917 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:08,917 INFO ]: Abstraction has 86 states and 174 transitions. [2018-06-24 21:18:08,917 INFO ]: Interpolant automaton has 31 states. [2018-06-24 21:18:08,917 INFO ]: Start isEmpty. Operand 86 states and 174 transitions. [2018-06-24 21:18:08,918 INFO ]: Finished isEmpty. Found accepting run of length 82 [2018-06-24 21:18:08,918 INFO ]: Found error trace [2018-06-24 21:18:08,918 INFO ]: trace histogram [13, 12, 12, 12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:08,919 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:08,919 INFO ]: Analyzing trace with hash -1459494483, now seen corresponding path program 25 times [2018-06-24 21:18:08,919 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:08,919 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:08,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:08,919 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:18:08,919 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:08,943 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:09,651 INFO ]: Checked inductivity of 458 backedges. 223 proven. 89 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-06-24 21:18:09,651 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:18:09,651 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:18:09,656 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:09,718 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:09,722 INFO ]: Computing forward predicates... [2018-06-24 21:18:09,771 INFO ]: Checked inductivity of 458 backedges. 223 proven. 89 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-06-24 21:18:09,794 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:18:09,794 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-06-24 21:18:09,795 INFO ]: Interpolant automaton has 31 states [2018-06-24 21:18:09,795 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-24 21:18:09,795 INFO ]: CoverageRelationStatistics Valid=203, Invalid=727, Unknown=0, NotChecked=0, Total=930 [2018-06-24 21:18:09,795 INFO ]: Start difference. First operand 86 states and 174 transitions. Second operand 31 states. [2018-06-24 21:18:10,244 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:18:10,244 INFO ]: Finished difference Result 108 states and 222 transitions. [2018-06-24 21:18:10,247 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-06-24 21:18:10,247 INFO ]: Start accepts. Automaton has 31 states. Word has length 81 [2018-06-24 21:18:10,247 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:18:10,248 INFO ]: With dead ends: 108 [2018-06-24 21:18:10,248 INFO ]: Without dead ends: 108 [2018-06-24 21:18:10,249 INFO ]: 0 DeclaredPredicates, 147 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=565, Invalid=2627, Unknown=0, NotChecked=0, Total=3192 [2018-06-24 21:18:10,249 INFO ]: Start minimizeSevpa. Operand 108 states. [2018-06-24 21:18:10,256 INFO ]: Finished minimizeSevpa. Reduced states from 108 to 87. [2018-06-24 21:18:10,256 INFO ]: Start removeUnreachable. Operand 87 states. [2018-06-24 21:18:10,257 INFO ]: Finished removeUnreachable. Reduced from 87 states to 87 states and 176 transitions. [2018-06-24 21:18:10,257 INFO ]: Start accepts. Automaton has 87 states and 176 transitions. Word has length 81 [2018-06-24 21:18:10,257 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:18:10,257 INFO ]: Abstraction has 87 states and 176 transitions. [2018-06-24 21:18:10,257 INFO ]: Interpolant automaton has 31 states. [2018-06-24 21:18:10,257 INFO ]: Start isEmpty. Operand 87 states and 176 transitions. [2018-06-24 21:18:10,258 INFO ]: Finished isEmpty. Found accepting run of length 83 [2018-06-24 21:18:10,258 INFO ]: Found error trace [2018-06-24 21:18:10,259 INFO ]: trace histogram [13, 12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:18:10,259 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:18:10,259 INFO ]: Analyzing trace with hash -261037739, now seen corresponding path program 26 times [2018-06-24 21:18:10,259 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:18:10,259 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:18:10,259 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:10,259 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:18:10,259 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:18:10,282 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:10,980 INFO ]: Checked inductivity of 470 backedges. 36 proven. 288 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-06-24 21:18:10,980 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:18:10,980 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:18:10,986 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:18:11,054 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:18:11,054 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:18:11,059 INFO ]: Computing forward predicates... Received shutdown request... [2018-06-24 21:18:11,287 INFO ]: Timeout while computing interpolants [2018-06-24 21:18:11,487 WARN ]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:18:11,487 WARN ]: Verification canceled [2018-06-24 21:18:11,490 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:18:11,497 WARN ]: Timeout [2018-06-24 21:18:11,497 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:18:11 BasicIcfg [2018-06-24 21:18:11,497 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:18:11,498 INFO ]: Toolchain (without parser) took 57189.91 ms. Allocated memory was 304.6 MB in the beginning and 876.6 MB in the end (delta: 572.0 MB). Free memory was 260.1 MB in the beginning and 721.1 MB in the end (delta: -461.0 MB). Peak memory consumption was 111.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:18:11,499 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 304.6 MB. Free memory is still 270.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:18:11,499 INFO ]: ChcToBoogie took 59.44 ms. Allocated memory is still 304.6 MB. Free memory was 260.1 MB in the beginning and 258.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:18:11,500 INFO ]: Boogie Preprocessor took 41.99 ms. Allocated memory is still 304.6 MB. Free memory was 258.1 MB in the beginning and 256.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:18:11,500 INFO ]: RCFGBuilder took 339.61 ms. Allocated memory is still 304.6 MB. Free memory was 256.1 MB in the beginning and 246.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:18:11,500 INFO ]: BlockEncodingV2 took 124.50 ms. Allocated memory is still 304.6 MB. Free memory was 246.1 MB in the beginning and 241.1 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:18:11,501 INFO ]: TraceAbstraction took 56615.64 ms. Allocated memory was 304.6 MB in the beginning and 876.6 MB in the end (delta: 572.0 MB). Free memory was 241.1 MB in the beginning and 721.1 MB in the end (delta: -480.0 MB). Peak memory consumption was 92.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:18:11,503 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 18 locations, 27 edges - StatisticsResult: Encoded RCFG 11 locations, 20 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 304.6 MB. Free memory is still 270.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 59.44 ms. Allocated memory is still 304.6 MB. Free memory was 260.1 MB in the beginning and 258.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 41.99 ms. Allocated memory is still 304.6 MB. Free memory was 258.1 MB in the beginning and 256.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 339.61 ms. Allocated memory is still 304.6 MB. Free memory was 256.1 MB in the beginning and 246.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 124.50 ms. Allocated memory is still 304.6 MB. Free memory was 246.1 MB in the beginning and 241.1 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 56615.64 ms. Allocated memory was 304.6 MB in the beginning and 876.6 MB in the end (delta: 572.0 MB). Free memory was 241.1 MB in the beginning and 721.1 MB in the end (delta: -480.0 MB). Peak memory consumption was 92.0 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 83 with TraceHistMax 13, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 32 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 11 locations, 1 error locations. TIMEOUT Result, 56.5s OverallTime, 36 OverallIterations, 13 TraceHistogramMax, 29.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 843 SDtfs, 941 SDslu, 10056 SDs, 0 SdLazy, 30882 SolverSat, 1516 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2668 GetRequests, 1393 SyntacticMatches, 44 SemanticMatches, 1231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13148 ImplicationChecksByTransitivity, 28.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 35 MinimizatonAttempts, 524 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 21.5s InterpolantComputationTime, 2871 NumberOfCodeBlocks, 2871 NumberOfCodeBlocksAsserted, 161 NumberOfCheckSat, 2806 ConstructedInterpolants, 0 QuantifiedInterpolants, 621030 SizeOfPredicates, 546 NumberOfNonLiveVariables, 11368 ConjunctsInSsa, 1701 ConjunctsInUnsatCore, 65 InterpolantComputations, 6 PerfectInterpolantSequences, 6343/10547 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/enc-zipmap.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-18-11-520.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/enc-zipmap.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-18-11-520.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/enc-zipmap.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-18-11-520.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/enc-zipmap.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-18-11-520.csv Completed graceful shutdown