java -Xss1g -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.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/a-copy-print.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 01:38:39,897 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 01:38:39,899 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 01:38:39,910 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 01:38:39,911 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 01:38:39,912 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 01:38:39,914 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 01:38:39,916 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 01:38:39,917 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 01:38:39,919 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 01:38:39,920 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 01:38:39,920 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 01:38:39,921 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 01:38:39,922 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 01:38:39,923 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 01:38:39,924 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 01:38:39,925 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 01:38:39,927 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 01:38:39,929 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 01:38:39,930 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 01:38:39,931 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 01:38:39,934 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 01:38:39,934 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 01:38:39,934 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 01:38:39,935 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 01:38:39,936 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 01:38:39,937 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 01:38:39,937 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 01:38:39,938 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 01:38:39,939 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 01:38:39,939 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 01:38:39,940 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 01:38:39,940 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 01:38:39,941 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 01:38:39,941 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 01:38:39,942 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-22 01:38:39,955 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 01:38:39,955 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 01:38:39,956 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 01:38:39,956 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 01:38:39,957 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 01:38:39,957 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 01:38:39,957 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 01:38:39,957 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 01:38:39,958 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 01:38:39,958 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 01:38:39,958 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 01:38:39,958 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 01:38:39,959 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 01:38:39,959 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 01:38:39,959 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 01:38:39,959 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 01:38:39,960 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 01:38:39,961 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 01:38:39,961 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 01:38:40,010 INFO ]: Repository-Root is: /tmp [2018-06-22 01:38:40,026 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 01:38:40,033 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 01:38:40,034 INFO ]: Initializing SmtParser... [2018-06-22 01:38:40,035 INFO ]: SmtParser initialized [2018-06-22 01:38:40,035 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/a-copy-print.smt2 [2018-06-22 01:38:40,036 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-22 01:38:40,124 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/a-copy-print.smt2 unknown [2018-06-22 01:38:40,659 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/a-copy-print.smt2 [2018-06-22 01:38:40,663 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 01:38:40,671 INFO ]: Walking toolchain with 4 elements. [2018-06-22 01:38:40,671 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 01:38:40,671 INFO ]: Initializing ChcToBoogie... [2018-06-22 01:38:40,671 INFO ]: ChcToBoogie initialized [2018-06-22 01:38:40,674 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:38:40" (1/1) ... [2018-06-22 01:38:40,791 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:38:40 Unit [2018-06-22 01:38:40,792 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 01:38:40,792 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 01:38:40,792 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 01:38:40,792 INFO ]: Boogie Preprocessor initialized [2018-06-22 01:38:40,823 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:38:40" (1/1) ... [2018-06-22 01:38:40,855 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:38:40" (1/1) ... [2018-06-22 01:38:40,874 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:38:40" (1/1) ... [2018-06-22 01:38:40,874 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:38:40" (1/1) ... [2018-06-22 01:38:40,888 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:38:40" (1/1) ... [2018-06-22 01:38:40,894 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:38:40" (1/1) ... [2018-06-22 01:38:40,897 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:38:40" (1/1) ... [2018-06-22 01:38:40,902 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 01:38:40,902 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 01:38:40,902 INFO ]: Initializing RCFGBuilder... [2018-06-22 01:38:40,902 INFO ]: RCFGBuilder initialized [2018-06-22 01:38:40,903 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:38:40" (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-22 01:38:40,913 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-22 01:38:40,913 INFO ]: Found specification of procedure gotoProc [2018-06-22 01:38:40,913 INFO ]: Found implementation of procedure gotoProc [2018-06-22 01:38:40,913 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 01:38:40,913 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 01:38:40,913 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-22 01:38:42,385 INFO ]: Using library mode [2018-06-22 01:38:42,386 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:38:42 BoogieIcfgContainer [2018-06-22 01:38:42,386 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 01:38:42,388 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 01:38:42,388 INFO ]: Initializing TraceAbstraction... [2018-06-22 01:38:42,396 INFO ]: TraceAbstraction initialized [2018-06-22 01:38:42,396 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 01:38:40" (1/3) ... [2018-06-22 01:38:42,397 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea15917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 01:38:42, skipping insertion in model container [2018-06-22 01:38:42,397 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 01:38:40" (2/3) ... [2018-06-22 01:38:42,397 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea15917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 01:38:42, skipping insertion in model container [2018-06-22 01:38:42,397 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 01:38:42" (3/3) ... [2018-06-22 01:38:42,399 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 01:38:42,405 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 01:38:42,412 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 01:38:42,446 INFO ]: Using default assertion order modulation [2018-06-22 01:38:42,447 INFO ]: Interprodecural is true [2018-06-22 01:38:42,447 INFO ]: Hoare is false [2018-06-22 01:38:42,447 INFO ]: Compute interpolants for FPandBP [2018-06-22 01:38:42,447 INFO ]: Backedges is TWOTRACK [2018-06-22 01:38:42,447 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 01:38:42,447 INFO ]: Difference is false [2018-06-22 01:38:42,447 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 01:38:42,447 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 01:38:42,473 INFO ]: Start isEmpty. Operand 171 states. [2018-06-22 01:38:42,486 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-22 01:38:42,486 INFO ]: Found error trace [2018-06-22 01:38:42,486 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:38:42,487 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:38:42,490 INFO ]: Analyzing trace with hash -1437899495, now seen corresponding path program 1 times [2018-06-22 01:38:42,491 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:38:42,492 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:38:42,525 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:38:42,525 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:38:42,525 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:38:42,559 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:38:42,661 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:38:42,664 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:38:42,664 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:38:42,666 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:38:42,681 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:38:42,681 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:38:42,685 INFO ]: Start difference. First operand 171 states. Second operand 4 states. [2018-06-22 01:38:45,790 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:38:45,790 INFO ]: Finished difference Result 335 states and 557 transitions. [2018-06-22 01:38:45,791 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:38:45,792 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-22 01:38:45,793 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:38:45,838 INFO ]: With dead ends: 335 [2018-06-22 01:38:45,838 INFO ]: Without dead ends: 323 [2018-06-22 01:38:45,840 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:38:45,858 INFO ]: Start minimizeSevpa. Operand 323 states. [2018-06-22 01:38:45,980 INFO ]: Finished minimizeSevpa. Reduced states from 323 to 323. [2018-06-22 01:38:45,982 INFO ]: Start removeUnreachable. Operand 323 states. [2018-06-22 01:38:46,002 INFO ]: Finished removeUnreachable. Reduced from 323 states to 323 states and 537 transitions. [2018-06-22 01:38:46,003 INFO ]: Start accepts. Automaton has 323 states and 537 transitions. Word has length 8 [2018-06-22 01:38:46,003 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:38:46,003 INFO ]: Abstraction has 323 states and 537 transitions. [2018-06-22 01:38:46,004 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:38:46,004 INFO ]: Start isEmpty. Operand 323 states and 537 transitions. [2018-06-22 01:38:46,006 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-22 01:38:46,006 INFO ]: Found error trace [2018-06-22 01:38:46,006 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:38:46,006 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:38:46,006 INFO ]: Analyzing trace with hash 393727319, now seen corresponding path program 1 times [2018-06-22 01:38:46,006 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:38:46,006 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:38:46,007 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:38:46,007 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:38:46,007 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:38:46,012 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:38:46,123 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:38:46,124 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:38:46,124 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:38:46,125 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:38:46,125 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:38:46,125 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:38:46,126 INFO ]: Start difference. First operand 323 states and 537 transitions. Second operand 4 states. [2018-06-22 01:38:47,787 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:38:47,787 INFO ]: Finished difference Result 482 states and 803 transitions. [2018-06-22 01:38:47,787 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:38:47,787 INFO ]: Start accepts. Automaton has 4 states. Word has length 11 [2018-06-22 01:38:47,787 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:38:47,820 INFO ]: With dead ends: 482 [2018-06-22 01:38:47,820 INFO ]: Without dead ends: 482 [2018-06-22 01:38:47,821 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:38:47,821 INFO ]: Start minimizeSevpa. Operand 482 states. [2018-06-22 01:38:47,882 INFO ]: Finished minimizeSevpa. Reduced states from 482 to 482. [2018-06-22 01:38:47,882 INFO ]: Start removeUnreachable. Operand 482 states. [2018-06-22 01:38:47,899 INFO ]: Finished removeUnreachable. Reduced from 482 states to 482 states and 803 transitions. [2018-06-22 01:38:47,899 INFO ]: Start accepts. Automaton has 482 states and 803 transitions. Word has length 11 [2018-06-22 01:38:47,900 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:38:47,900 INFO ]: Abstraction has 482 states and 803 transitions. [2018-06-22 01:38:47,900 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:38:47,900 INFO ]: Start isEmpty. Operand 482 states and 803 transitions. [2018-06-22 01:38:47,902 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-22 01:38:47,902 INFO ]: Found error trace [2018-06-22 01:38:47,902 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:38:47,902 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:38:47,902 INFO ]: Analyzing trace with hash 2114931906, now seen corresponding path program 1 times [2018-06-22 01:38:47,902 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:38:47,902 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:38:47,903 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:38:47,903 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:38:47,903 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:38:47,910 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:38:48,004 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:38:48,004 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:38:48,004 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:38:48,004 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:38:48,004 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:38:48,004 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:38:48,005 INFO ]: Start difference. First operand 482 states and 803 transitions. Second operand 4 states. [2018-06-22 01:38:49,117 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:38:49,117 INFO ]: Finished difference Result 641 states and 1069 transitions. [2018-06-22 01:38:49,118 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:38:49,118 INFO ]: Start accepts. Automaton has 4 states. Word has length 14 [2018-06-22 01:38:49,118 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:38:49,156 INFO ]: With dead ends: 641 [2018-06-22 01:38:49,156 INFO ]: Without dead ends: 641 [2018-06-22 01:38:49,156 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:38:49,157 INFO ]: Start minimizeSevpa. Operand 641 states. [2018-06-22 01:38:49,217 INFO ]: Finished minimizeSevpa. Reduced states from 641 to 641. [2018-06-22 01:38:49,218 INFO ]: Start removeUnreachable. Operand 641 states. [2018-06-22 01:38:49,243 INFO ]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1069 transitions. [2018-06-22 01:38:49,243 INFO ]: Start accepts. Automaton has 641 states and 1069 transitions. Word has length 14 [2018-06-22 01:38:49,243 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:38:49,243 INFO ]: Abstraction has 641 states and 1069 transitions. [2018-06-22 01:38:49,243 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:38:49,243 INFO ]: Start isEmpty. Operand 641 states and 1069 transitions. [2018-06-22 01:38:49,250 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-22 01:38:49,250 INFO ]: Found error trace [2018-06-22 01:38:49,251 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:38:49,251 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:38:49,251 INFO ]: Analyzing trace with hash -1724222140, now seen corresponding path program 1 times [2018-06-22 01:38:49,251 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:38:49,251 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:38:49,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:38:49,252 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:38:49,252 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:38:49,258 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:38:49,364 INFO ]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:38:49,364 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:38:49,364 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-22 01:38:49,375 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:38:49,407 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:38:49,415 INFO ]: Computing forward predicates... [2018-06-22 01:38:49,439 INFO ]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:38:49,471 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:38:49,471 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:38:49,472 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:38:49,472 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:38:49,472 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:38:49,472 INFO ]: Start difference. First operand 641 states and 1069 transitions. Second operand 4 states. [2018-06-22 01:38:51,486 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:38:51,486 INFO ]: Finished difference Result 800 states and 1335 transitions. [2018-06-22 01:38:51,494 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:38:51,494 INFO ]: Start accepts. Automaton has 4 states. Word has length 24 [2018-06-22 01:38:51,494 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:38:51,575 INFO ]: With dead ends: 800 [2018-06-22 01:38:51,575 INFO ]: Without dead ends: 800 [2018-06-22 01:38:51,576 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:38:51,577 INFO ]: Start minimizeSevpa. Operand 800 states. [2018-06-22 01:38:51,669 INFO ]: Finished minimizeSevpa. Reduced states from 800 to 800. [2018-06-22 01:38:51,670 INFO ]: Start removeUnreachable. Operand 800 states. [2018-06-22 01:38:51,702 INFO ]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1335 transitions. [2018-06-22 01:38:51,702 INFO ]: Start accepts. Automaton has 800 states and 1335 transitions. Word has length 24 [2018-06-22 01:38:51,702 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:38:51,702 INFO ]: Abstraction has 800 states and 1335 transitions. [2018-06-22 01:38:51,702 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:38:51,702 INFO ]: Start isEmpty. Operand 800 states and 1335 transitions. [2018-06-22 01:38:51,710 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 01:38:51,710 INFO ]: Found error trace [2018-06-22 01:38:51,710 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:38:51,710 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:38:51,710 INFO ]: Analyzing trace with hash -848454701, now seen corresponding path program 1 times [2018-06-22 01:38:51,710 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:38:51,710 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:38:51,711 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:38:51,711 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:38:51,711 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:38:51,721 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:38:51,882 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:38:51,882 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:38:51,882 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:38:51,883 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:38:51,883 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:38:51,883 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:38:51,883 INFO ]: Start difference. First operand 800 states and 1335 transitions. Second operand 4 states. [2018-06-22 01:38:54,853 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:38:54,853 INFO ]: Finished difference Result 918 states and 1535 transitions. [2018-06-22 01:38:54,853 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:38:54,853 INFO ]: Start accepts. Automaton has 4 states. Word has length 25 [2018-06-22 01:38:54,853 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:38:54,932 INFO ]: With dead ends: 918 [2018-06-22 01:38:54,932 INFO ]: Without dead ends: 918 [2018-06-22 01:38:54,932 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:38:54,933 INFO ]: Start minimizeSevpa. Operand 918 states. [2018-06-22 01:38:55,026 INFO ]: Finished minimizeSevpa. Reduced states from 918 to 918. [2018-06-22 01:38:55,026 INFO ]: Start removeUnreachable. Operand 918 states. [2018-06-22 01:38:55,063 INFO ]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1535 transitions. [2018-06-22 01:38:55,063 INFO ]: Start accepts. Automaton has 918 states and 1535 transitions. Word has length 25 [2018-06-22 01:38:55,063 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:38:55,063 INFO ]: Abstraction has 918 states and 1535 transitions. [2018-06-22 01:38:55,063 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:38:55,063 INFO ]: Start isEmpty. Operand 918 states and 1535 transitions. [2018-06-22 01:38:55,072 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-22 01:38:55,072 INFO ]: Found error trace [2018-06-22 01:38:55,072 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:38:55,073 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:38:55,073 INFO ]: Analyzing trace with hash -917441013, now seen corresponding path program 1 times [2018-06-22 01:38:55,073 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:38:55,073 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:38:55,073 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:38:55,073 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:38:55,073 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:38:55,090 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:38:55,202 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 01:38:55,202 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:38:55,202 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:38:55,202 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:38:55,203 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:38:55,203 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:38:55,203 INFO ]: Start difference. First operand 918 states and 1535 transitions. Second operand 4 states. [2018-06-22 01:38:56,514 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:38:56,514 INFO ]: Finished difference Result 1019 states and 1705 transitions. [2018-06-22 01:38:56,515 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:38:56,515 INFO ]: Start accepts. Automaton has 4 states. Word has length 30 [2018-06-22 01:38:56,515 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:38:56,573 INFO ]: With dead ends: 1019 [2018-06-22 01:38:56,573 INFO ]: Without dead ends: 1019 [2018-06-22 01:38:56,573 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:38:56,574 INFO ]: Start minimizeSevpa. Operand 1019 states. [2018-06-22 01:38:56,672 INFO ]: Finished minimizeSevpa. Reduced states from 1019 to 1019. [2018-06-22 01:38:56,672 INFO ]: Start removeUnreachable. Operand 1019 states. [2018-06-22 01:38:56,712 INFO ]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1705 transitions. [2018-06-22 01:38:56,712 INFO ]: Start accepts. Automaton has 1019 states and 1705 transitions. Word has length 30 [2018-06-22 01:38:56,712 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:38:56,712 INFO ]: Abstraction has 1019 states and 1705 transitions. [2018-06-22 01:38:56,712 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:38:56,712 INFO ]: Start isEmpty. Operand 1019 states and 1705 transitions. [2018-06-22 01:38:56,738 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-22 01:38:56,738 INFO ]: Found error trace [2018-06-22 01:38:56,738 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:38:56,738 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:38:56,738 INFO ]: Analyzing trace with hash -1031925697, now seen corresponding path program 1 times [2018-06-22 01:38:56,739 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:38:56,739 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:38:56,739 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:38:56,739 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:38:56,739 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:38:56,753 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:38:56,918 INFO ]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:38:56,918 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:38:56,918 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-22 01:38:56,929 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:38:56,966 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:38:56,968 INFO ]: Computing forward predicates... [2018-06-22 01:38:56,979 INFO ]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 01:38:57,010 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:38:57,010 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:38:57,010 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:38:57,011 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:38:57,011 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:38:57,011 INFO ]: Start difference. First operand 1019 states and 1705 transitions. Second operand 4 states. [2018-06-22 01:38:57,636 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:38:57,636 INFO ]: Finished difference Result 1120 states and 1875 transitions. [2018-06-22 01:38:57,637 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:38:57,637 INFO ]: Start accepts. Automaton has 4 states. Word has length 42 [2018-06-22 01:38:57,637 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:38:57,696 INFO ]: With dead ends: 1120 [2018-06-22 01:38:57,696 INFO ]: Without dead ends: 1120 [2018-06-22 01:38:57,697 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:38:57,697 INFO ]: Start minimizeSevpa. Operand 1120 states. [2018-06-22 01:38:57,777 INFO ]: Finished minimizeSevpa. Reduced states from 1120 to 1120. [2018-06-22 01:38:57,777 INFO ]: Start removeUnreachable. Operand 1120 states. [2018-06-22 01:38:57,818 INFO ]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1875 transitions. [2018-06-22 01:38:57,818 INFO ]: Start accepts. Automaton has 1120 states and 1875 transitions. Word has length 42 [2018-06-22 01:38:57,819 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:38:57,819 INFO ]: Abstraction has 1120 states and 1875 transitions. [2018-06-22 01:38:57,819 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:38:57,819 INFO ]: Start isEmpty. Operand 1120 states and 1875 transitions. [2018-06-22 01:38:57,863 INFO ]: Finished isEmpty. Found accepting run of length 45 [2018-06-22 01:38:57,863 INFO ]: Found error trace [2018-06-22 01:38:57,863 INFO ]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:38:57,864 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:38:57,864 INFO ]: Analyzing trace with hash -1882199573, now seen corresponding path program 1 times [2018-06-22 01:38:57,864 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:38:57,864 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:38:57,864 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:38:57,864 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:38:57,864 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:38:57,883 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:38:58,109 INFO ]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 01:38:58,109 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:38:58,109 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-22 01:38:58,110 INFO ]: Interpolant automaton has 6 states [2018-06-22 01:38:58,110 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-22 01:38:58,110 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-22 01:38:58,110 INFO ]: Start difference. First operand 1120 states and 1875 transitions. Second operand 6 states. [2018-06-22 01:39:00,312 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:00,312 INFO ]: Finished difference Result 3664 states and 17330 transitions. [2018-06-22 01:39:00,313 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 01:39:00,313 INFO ]: Start accepts. Automaton has 6 states. Word has length 44 [2018-06-22 01:39:00,313 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:01,122 INFO ]: With dead ends: 3664 [2018-06-22 01:39:01,122 INFO ]: Without dead ends: 3664 [2018-06-22 01:39:01,122 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-06-22 01:39:01,124 INFO ]: Start minimizeSevpa. Operand 3664 states. [2018-06-22 01:39:02,246 INFO ]: Finished minimizeSevpa. Reduced states from 3664 to 1168. [2018-06-22 01:39:02,246 INFO ]: Start removeUnreachable. Operand 1168 states. [2018-06-22 01:39:02,278 INFO ]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1963 transitions. [2018-06-22 01:39:02,278 INFO ]: Start accepts. Automaton has 1168 states and 1963 transitions. Word has length 44 [2018-06-22 01:39:02,278 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:02,278 INFO ]: Abstraction has 1168 states and 1963 transitions. [2018-06-22 01:39:02,278 INFO ]: Interpolant automaton has 6 states. [2018-06-22 01:39:02,278 INFO ]: Start isEmpty. Operand 1168 states and 1963 transitions. [2018-06-22 01:39:02,510 INFO ]: Finished isEmpty. Found accepting run of length 106 [2018-06-22 01:39:02,510 INFO ]: Found error trace [2018-06-22 01:39:02,510 INFO ]: trace histogram [6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:02,510 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:02,511 INFO ]: Analyzing trace with hash -892994511, now seen corresponding path program 1 times [2018-06-22 01:39:02,511 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:02,511 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:02,511 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:02,511 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:02,511 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:02,546 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:02,728 INFO ]: Checked inductivity of 126 backedges. 42 proven. 15 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-06-22 01:39:02,729 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:39:02,729 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) [2018-06-22 01:39:02,740 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:39:02,800 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:02,805 INFO ]: Computing forward predicates... [2018-06-22 01:39:02,820 INFO ]: Checked inductivity of 126 backedges. 66 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-06-22 01:39:02,852 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:39:02,852 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:39:02,853 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:39:02,853 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:39:02,853 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:39:02,853 INFO ]: Start difference. First operand 1168 states and 1963 transitions. Second operand 4 states. [2018-06-22 01:39:03,952 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:03,952 INFO ]: Finished difference Result 1333 states and 2240 transitions. [2018-06-22 01:39:03,952 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:39:03,953 INFO ]: Start accepts. Automaton has 4 states. Word has length 105 [2018-06-22 01:39:03,953 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:04,097 INFO ]: With dead ends: 1333 [2018-06-22 01:39:04,097 INFO ]: Without dead ends: 1333 [2018-06-22 01:39:04,098 INFO ]: 0 DeclaredPredicates, 110 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:39:04,098 INFO ]: Start minimizeSevpa. Operand 1333 states. [2018-06-22 01:39:04,196 INFO ]: Finished minimizeSevpa. Reduced states from 1333 to 1333. [2018-06-22 01:39:04,196 INFO ]: Start removeUnreachable. Operand 1333 states. [2018-06-22 01:39:04,250 INFO ]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 2240 transitions. [2018-06-22 01:39:04,250 INFO ]: Start accepts. Automaton has 1333 states and 2240 transitions. Word has length 105 [2018-06-22 01:39:04,250 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:04,250 INFO ]: Abstraction has 1333 states and 2240 transitions. [2018-06-22 01:39:04,250 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:39:04,250 INFO ]: Start isEmpty. Operand 1333 states and 2240 transitions. [2018-06-22 01:39:04,330 INFO ]: Finished isEmpty. Found accepting run of length 80 [2018-06-22 01:39:04,330 INFO ]: Found error trace [2018-06-22 01:39:04,330 INFO ]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:04,330 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:04,330 INFO ]: Analyzing trace with hash -758782927, now seen corresponding path program 1 times [2018-06-22 01:39:04,330 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:04,330 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:04,331 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:04,331 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:04,331 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:04,347 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:04,445 INFO ]: Checked inductivity of 52 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-06-22 01:39:04,470 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:39:04,470 INFO ]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-06-22 01:39:04,470 INFO ]: Interpolant automaton has 8 states [2018-06-22 01:39:04,470 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 01:39:04,470 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-22 01:39:04,471 INFO ]: Start difference. First operand 1333 states and 2240 transitions. Second operand 8 states. [2018-06-22 01:39:05,022 WARN ]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-06-22 01:39:06,524 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:06,524 INFO ]: Finished difference Result 3916 states and 19985 transitions. [2018-06-22 01:39:06,524 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 01:39:06,525 INFO ]: Start accepts. Automaton has 8 states. Word has length 79 [2018-06-22 01:39:06,525 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:07,918 INFO ]: With dead ends: 3916 [2018-06-22 01:39:07,918 INFO ]: Without dead ends: 3916 [2018-06-22 01:39:07,918 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-06-22 01:39:07,920 INFO ]: Start minimizeSevpa. Operand 3916 states. [2018-06-22 01:39:08,887 INFO ]: Finished minimizeSevpa. Reduced states from 3916 to 1432. [2018-06-22 01:39:08,887 INFO ]: Start removeUnreachable. Operand 1432 states. [2018-06-22 01:39:09,232 INFO ]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 2402 transitions. [2018-06-22 01:39:09,232 INFO ]: Start accepts. Automaton has 1432 states and 2402 transitions. Word has length 79 [2018-06-22 01:39:09,232 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:09,232 INFO ]: Abstraction has 1432 states and 2402 transitions. [2018-06-22 01:39:09,232 INFO ]: Interpolant automaton has 8 states. [2018-06-22 01:39:09,232 INFO ]: Start isEmpty. Operand 1432 states and 2402 transitions. [2018-06-22 01:39:09,355 INFO ]: Finished isEmpty. Found accepting run of length 92 [2018-06-22 01:39:09,355 INFO ]: Found error trace [2018-06-22 01:39:09,355 INFO ]: trace histogram [5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:09,355 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:09,356 INFO ]: Analyzing trace with hash -117078136, now seen corresponding path program 1 times [2018-06-22 01:39:09,356 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:09,356 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:09,356 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:09,356 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:09,356 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:09,374 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:09,555 INFO ]: Checked inductivity of 84 backedges. 47 proven. 5 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-06-22 01:39:09,555 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:39:09,555 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) [2018-06-22 01:39:09,567 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 01:39:09,615 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:09,619 INFO ]: Computing forward predicates... [2018-06-22 01:39:09,639 INFO ]: Checked inductivity of 84 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-22 01:39:09,674 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:39:09,674 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-06-22 01:39:09,675 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:39:09,675 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:39:09,675 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:39:09,675 INFO ]: Start difference. First operand 1432 states and 2402 transitions. Second operand 4 states. [2018-06-22 01:39:11,034 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:11,035 INFO ]: Finished difference Result 2053 states and 3418 transitions. [2018-06-22 01:39:11,035 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:39:11,035 INFO ]: Start accepts. Automaton has 4 states. Word has length 91 [2018-06-22 01:39:11,035 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:11,172 INFO ]: With dead ends: 2053 [2018-06-22 01:39:11,172 INFO ]: Without dead ends: 1567 [2018-06-22 01:39:11,172 INFO ]: 0 DeclaredPredicates, 96 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:39:11,173 INFO ]: Start minimizeSevpa. Operand 1567 states. [2018-06-22 01:39:11,326 INFO ]: Finished minimizeSevpa. Reduced states from 1567 to 1567. [2018-06-22 01:39:11,326 INFO ]: Start removeUnreachable. Operand 1567 states. [2018-06-22 01:39:11,401 INFO ]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2565 transitions. [2018-06-22 01:39:11,401 INFO ]: Start accepts. Automaton has 1567 states and 2565 transitions. Word has length 91 [2018-06-22 01:39:11,402 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:11,402 INFO ]: Abstraction has 1567 states and 2565 transitions. [2018-06-22 01:39:11,402 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:39:11,402 INFO ]: Start isEmpty. Operand 1567 states and 2565 transitions. [2018-06-22 01:39:11,569 INFO ]: Finished isEmpty. Found accepting run of length 100 [2018-06-22 01:39:11,569 INFO ]: Found error trace [2018-06-22 01:39:11,569 INFO ]: trace histogram [6, 6, 6, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:11,569 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:11,570 INFO ]: Analyzing trace with hash -79464422, now seen corresponding path program 1 times [2018-06-22 01:39:11,570 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:11,570 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:11,570 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:11,570 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:11,570 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:11,613 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:11,782 INFO ]: Checked inductivity of 109 backedges. 49 proven. 7 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-06-22 01:39:11,782 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:39:11,782 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-22 01:39:12,356 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:12,432 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:12,437 INFO ]: Computing forward predicates... [2018-06-22 01:39:12,467 INFO ]: Checked inductivity of 109 backedges. 72 proven. 2 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-06-22 01:39:12,536 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:39:12,536 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:39:12,536 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:39:12,536 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:39:12,536 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:39:12,537 INFO ]: Start difference. First operand 1567 states and 2565 transitions. Second operand 4 states. [2018-06-22 01:39:13,680 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:13,680 INFO ]: Finished difference Result 1776 states and 2914 transitions. [2018-06-22 01:39:13,681 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:39:13,681 INFO ]: Start accepts. Automaton has 4 states. Word has length 99 [2018-06-22 01:39:13,681 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:13,817 INFO ]: With dead ends: 1776 [2018-06-22 01:39:13,817 INFO ]: Without dead ends: 1702 [2018-06-22 01:39:13,817 INFO ]: 0 DeclaredPredicates, 104 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:39:13,818 INFO ]: Start minimizeSevpa. Operand 1702 states. [2018-06-22 01:39:13,943 INFO ]: Finished minimizeSevpa. Reduced states from 1702 to 1702. [2018-06-22 01:39:13,943 INFO ]: Start removeUnreachable. Operand 1702 states. [2018-06-22 01:39:14,032 INFO ]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 2788 transitions. [2018-06-22 01:39:14,032 INFO ]: Start accepts. Automaton has 1702 states and 2788 transitions. Word has length 99 [2018-06-22 01:39:14,032 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:14,032 INFO ]: Abstraction has 1702 states and 2788 transitions. [2018-06-22 01:39:14,032 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:39:14,032 INFO ]: Start isEmpty. Operand 1702 states and 2788 transitions. [2018-06-22 01:39:14,156 INFO ]: Finished isEmpty. Found accepting run of length 139 [2018-06-22 01:39:14,156 INFO ]: Found error trace [2018-06-22 01:39:14,156 INFO ]: trace histogram [8, 8, 8, 7, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:14,156 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:14,156 INFO ]: Analyzing trace with hash 647232276, now seen corresponding path program 1 times [2018-06-22 01:39:14,156 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:14,157 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:14,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:14,164 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:14,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:14,192 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:14,276 INFO ]: Checked inductivity of 241 backedges. 64 proven. 32 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-06-22 01:39:14,276 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:39:14,276 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-22 01:39:14,284 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:14,325 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:14,330 INFO ]: Computing forward predicates... [2018-06-22 01:39:14,351 INFO ]: Checked inductivity of 241 backedges. 99 proven. 27 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-06-22 01:39:14,376 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:39:14,376 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:39:14,377 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:39:14,377 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:39:14,377 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:39:14,377 INFO ]: Start difference. First operand 1702 states and 2788 transitions. Second operand 4 states. [2018-06-22 01:39:15,784 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:15,784 INFO ]: Finished difference Result 1919 states and 3151 transitions. [2018-06-22 01:39:15,784 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:39:15,785 INFO ]: Start accepts. Automaton has 4 states. Word has length 138 [2018-06-22 01:39:15,785 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:15,933 INFO ]: With dead ends: 1919 [2018-06-22 01:39:15,933 INFO ]: Without dead ends: 1837 [2018-06-22 01:39:15,933 INFO ]: 0 DeclaredPredicates, 143 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:39:15,934 INFO ]: Start minimizeSevpa. Operand 1837 states. [2018-06-22 01:39:16,073 INFO ]: Finished minimizeSevpa. Reduced states from 1837 to 1837. [2018-06-22 01:39:16,073 INFO ]: Start removeUnreachable. Operand 1837 states. [2018-06-22 01:39:16,281 INFO ]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 3008 transitions. [2018-06-22 01:39:16,281 INFO ]: Start accepts. Automaton has 1837 states and 3008 transitions. Word has length 138 [2018-06-22 01:39:16,282 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:16,282 INFO ]: Abstraction has 1837 states and 3008 transitions. [2018-06-22 01:39:16,282 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:39:16,282 INFO ]: Start isEmpty. Operand 1837 states and 3008 transitions. [2018-06-22 01:39:16,431 INFO ]: Finished isEmpty. Found accepting run of length 191 [2018-06-22 01:39:16,431 INFO ]: Found error trace [2018-06-22 01:39:16,431 INFO ]: trace histogram [11, 11, 11, 10, 7, 7, 7, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:16,431 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:16,431 INFO ]: Analyzing trace with hash 1504432410, now seen corresponding path program 1 times [2018-06-22 01:39:16,431 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:16,431 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:16,432 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:16,432 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:16,432 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:16,470 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:16,564 INFO ]: Checked inductivity of 493 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2018-06-22 01:39:16,564 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 01:39:16,564 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 01:39:16,565 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:39:16,565 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:39:16,565 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:39:16,565 INFO ]: Start difference. First operand 1837 states and 3008 transitions. Second operand 4 states. [2018-06-22 01:39:17,197 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:17,197 INFO ]: Finished difference Result 2367 states and 3871 transitions. [2018-06-22 01:39:17,197 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:39:17,197 INFO ]: Start accepts. Automaton has 4 states. Word has length 190 [2018-06-22 01:39:17,198 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:17,354 INFO ]: With dead ends: 2367 [2018-06-22 01:39:17,354 INFO ]: Without dead ends: 1911 [2018-06-22 01:39:17,354 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:39:17,356 INFO ]: Start minimizeSevpa. Operand 1911 states. [2018-06-22 01:39:17,460 INFO ]: Finished minimizeSevpa. Reduced states from 1911 to 1911. [2018-06-22 01:39:17,460 INFO ]: Start removeUnreachable. Operand 1911 states. [2018-06-22 01:39:17,525 INFO ]: Finished removeUnreachable. Reduced from 1911 states to 1911 states and 3067 transitions. [2018-06-22 01:39:17,525 INFO ]: Start accepts. Automaton has 1911 states and 3067 transitions. Word has length 190 [2018-06-22 01:39:17,525 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:17,525 INFO ]: Abstraction has 1911 states and 3067 transitions. [2018-06-22 01:39:17,525 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:39:17,525 INFO ]: Start isEmpty. Operand 1911 states and 3067 transitions. [2018-06-22 01:39:17,616 INFO ]: Finished isEmpty. Found accepting run of length 145 [2018-06-22 01:39:17,616 INFO ]: Found error trace [2018-06-22 01:39:17,616 INFO ]: trace histogram [8, 8, 8, 7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:17,617 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:17,617 INFO ]: Analyzing trace with hash 40497673, now seen corresponding path program 1 times [2018-06-22 01:39:17,617 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:17,617 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:17,617 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:17,617 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:17,617 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:17,639 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:17,772 INFO ]: Checked inductivity of 244 backedges. 48 proven. 19 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-06-22 01:39:17,772 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:39:17,772 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-22 01:39:17,778 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:17,818 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:17,822 INFO ]: Computing forward predicates... [2018-06-22 01:39:17,841 INFO ]: Checked inductivity of 244 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-06-22 01:39:17,864 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-22 01:39:17,865 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2018-06-22 01:39:17,865 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:39:17,865 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:39:17,865 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:39:17,865 INFO ]: Start difference. First operand 1911 states and 3067 transitions. Second operand 4 states. [2018-06-22 01:39:18,740 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:18,740 INFO ]: Finished difference Result 2103 states and 3378 transitions. [2018-06-22 01:39:18,740 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:39:18,740 INFO ]: Start accepts. Automaton has 4 states. Word has length 144 [2018-06-22 01:39:18,741 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:18,879 INFO ]: With dead ends: 2103 [2018-06-22 01:39:18,879 INFO ]: Without dead ends: 1987 [2018-06-22 01:39:18,883 INFO ]: 0 DeclaredPredicates, 149 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:39:18,884 INFO ]: Start minimizeSevpa. Operand 1987 states. [2018-06-22 01:39:18,969 INFO ]: Finished minimizeSevpa. Reduced states from 1987 to 1987. [2018-06-22 01:39:18,969 INFO ]: Start removeUnreachable. Operand 1987 states. [2018-06-22 01:39:19,028 INFO ]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 3169 transitions. [2018-06-22 01:39:19,028 INFO ]: Start accepts. Automaton has 1987 states and 3169 transitions. Word has length 144 [2018-06-22 01:39:19,028 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:19,028 INFO ]: Abstraction has 1987 states and 3169 transitions. [2018-06-22 01:39:19,028 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:39:19,028 INFO ]: Start isEmpty. Operand 1987 states and 3169 transitions. [2018-06-22 01:39:19,117 INFO ]: Finished isEmpty. Found accepting run of length 146 [2018-06-22 01:39:19,117 INFO ]: Found error trace [2018-06-22 01:39:19,117 INFO ]: trace histogram [8, 8, 8, 8, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:19,117 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:19,117 INFO ]: Analyzing trace with hash -1442910563, now seen corresponding path program 1 times [2018-06-22 01:39:19,117 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:19,117 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:19,118 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:19,118 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:19,118 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:19,158 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:19,370 INFO ]: Checked inductivity of 255 backedges. 38 proven. 25 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-06-22 01:39:19,370 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:39:19,370 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-22 01:39:19,377 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:19,439 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:19,445 INFO ]: Computing forward predicates... [2018-06-22 01:39:19,599 INFO ]: Checked inductivity of 255 backedges. 143 proven. 1 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-06-22 01:39:19,632 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:39:19,633 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-22 01:39:19,633 INFO ]: Interpolant automaton has 9 states [2018-06-22 01:39:19,633 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-22 01:39:19,633 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-22 01:39:19,633 INFO ]: Start difference. First operand 1987 states and 3169 transitions. Second operand 9 states. [2018-06-22 01:39:22,298 WARN ]: Spent 149.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2018-06-22 01:39:27,852 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:27,852 INFO ]: Finished difference Result 6466 states and 31256 transitions. [2018-06-22 01:39:27,853 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-22 01:39:27,853 INFO ]: Start accepts. Automaton has 9 states. Word has length 145 [2018-06-22 01:39:27,853 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:29,027 INFO ]: With dead ends: 6466 [2018-06-22 01:39:29,027 INFO ]: Without dead ends: 6295 [2018-06-22 01:39:29,027 INFO ]: 0 DeclaredPredicates, 186 GetRequests, 160 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=184, Invalid=518, Unknown=0, NotChecked=0, Total=702 [2018-06-22 01:39:29,031 INFO ]: Start minimizeSevpa. Operand 6295 states. [2018-06-22 01:39:30,793 INFO ]: Finished minimizeSevpa. Reduced states from 6295 to 2005. [2018-06-22 01:39:30,793 INFO ]: Start removeUnreachable. Operand 2005 states. [2018-06-22 01:39:30,874 INFO ]: Finished removeUnreachable. Reduced from 2005 states to 2005 states and 3352 transitions. [2018-06-22 01:39:30,874 INFO ]: Start accepts. Automaton has 2005 states and 3352 transitions. Word has length 145 [2018-06-22 01:39:30,875 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:30,875 INFO ]: Abstraction has 2005 states and 3352 transitions. [2018-06-22 01:39:30,875 INFO ]: Interpolant automaton has 9 states. [2018-06-22 01:39:30,875 INFO ]: Start isEmpty. Operand 2005 states and 3352 transitions. [2018-06-22 01:39:31,002 INFO ]: Finished isEmpty. Found accepting run of length 159 [2018-06-22 01:39:31,002 INFO ]: Found error trace [2018-06-22 01:39:31,002 INFO ]: trace histogram [9, 9, 9, 9, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:31,003 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:31,003 INFO ]: Analyzing trace with hash -2141358459, now seen corresponding path program 1 times [2018-06-22 01:39:31,003 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:31,003 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:31,005 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:31,005 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:31,005 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:31,022 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:31,133 INFO ]: Checked inductivity of 321 backedges. 77 proven. 53 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2018-06-22 01:39:31,133 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 01:39:31,133 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-22 01:39:31,139 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:31,199 INFO ]: Conjunction of SSA is unsat [2018-06-22 01:39:31,204 INFO ]: Computing forward predicates... [2018-06-22 01:39:31,241 INFO ]: Checked inductivity of 321 backedges. 218 proven. 2 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-06-22 01:39:31,275 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 01:39:31,275 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-22 01:39:31,275 INFO ]: Interpolant automaton has 4 states [2018-06-22 01:39:31,275 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 01:39:31,275 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 01:39:31,275 INFO ]: Start difference. First operand 2005 states and 3352 transitions. Second operand 4 states. [2018-06-22 01:39:31,848 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 01:39:31,848 INFO ]: Finished difference Result 2124 states and 3554 transitions. [2018-06-22 01:39:31,848 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-22 01:39:31,848 INFO ]: Start accepts. Automaton has 4 states. Word has length 158 [2018-06-22 01:39:31,848 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 01:39:31,931 INFO ]: With dead ends: 2124 [2018-06-22 01:39:31,931 INFO ]: Without dead ends: 1988 [2018-06-22 01:39:31,931 INFO ]: 0 DeclaredPredicates, 163 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-22 01:39:31,932 INFO ]: Start minimizeSevpa. Operand 1988 states. [2018-06-22 01:39:32,044 INFO ]: Finished minimizeSevpa. Reduced states from 1988 to 1988. [2018-06-22 01:39:32,044 INFO ]: Start removeUnreachable. Operand 1988 states. [2018-06-22 01:39:32,101 INFO ]: Finished removeUnreachable. Reduced from 1988 states to 1988 states and 3286 transitions. [2018-06-22 01:39:32,101 INFO ]: Start accepts. Automaton has 1988 states and 3286 transitions. Word has length 158 [2018-06-22 01:39:32,101 INFO ]: Finished accepts. word is rejected. [2018-06-22 01:39:32,101 INFO ]: Abstraction has 1988 states and 3286 transitions. [2018-06-22 01:39:32,101 INFO ]: Interpolant automaton has 4 states. [2018-06-22 01:39:32,101 INFO ]: Start isEmpty. Operand 1988 states and 3286 transitions. [2018-06-22 01:39:32,160 INFO ]: Finished isEmpty. Found accepting run of length 156 [2018-06-22 01:39:32,160 INFO ]: Found error trace [2018-06-22 01:39:32,160 INFO ]: trace histogram [9, 9, 9, 9, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 01:39:32,160 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 01:39:32,160 INFO ]: Analyzing trace with hash -797780178, now seen corresponding path program 1 times [2018-06-22 01:39:32,160 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 01:39:32,160 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 01:39:32,161 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:32,161 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 01:39:32,161 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 01:39:32,185 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-22 01:39:32,703 WARN ]: Verification canceled [2018-06-22 01:39:32,708 WARN ]: Timeout [2018-06-22 01:39:32,708 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 01:39:32 BoogieIcfgContainer [2018-06-22 01:39:32,708 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 01:39:32,709 INFO ]: Toolchain (without parser) took 52045.00 ms. Allocated memory was 308.8 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 245.3 MB in the beginning and 1.2 GB in the end (delta: -923.6 MB). Peak memory consumption was 234.1 MB. Max. memory is 3.6 GB. [2018-06-22 01:39:32,710 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 01:39:32,710 INFO ]: ChcToBoogie took 120.79 ms. Allocated memory is still 308.8 MB. Free memory was 245.3 MB in the beginning and 243.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:39:32,710 INFO ]: Boogie Preprocessor took 109.58 ms. Allocated memory is still 308.8 MB. Free memory was 243.3 MB in the beginning and 241.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 01:39:32,710 INFO ]: RCFGBuilder took 1483.49 ms. Allocated memory was 308.8 MB in the beginning and 324.5 MB in the end (delta: 15.7 MB). Free memory was 241.3 MB in the beginning and 293.3 MB in the end (delta: -52.1 MB). Peak memory consumption was 59.9 MB. Max. memory is 3.6 GB. [2018-06-22 01:39:32,712 INFO ]: TraceAbstraction took 50320.53 ms. Allocated memory was 324.5 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 293.3 MB in the beginning and 1.2 GB in the end (delta: -875.5 MB). Peak memory consumption was 266.4 MB. Max. memory is 3.6 GB. [2018-06-22 01:39:32,714 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 308.8 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 120.79 ms. Allocated memory is still 308.8 MB. Free memory was 245.3 MB in the beginning and 243.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 109.58 ms. Allocated memory is still 308.8 MB. Free memory was 243.3 MB in the beginning and 241.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 1483.49 ms. Allocated memory was 308.8 MB in the beginning and 324.5 MB in the end (delta: 15.7 MB). Free memory was 241.3 MB in the beginning and 293.3 MB in the end (delta: -52.1 MB). Peak memory consumption was 59.9 MB. Max. memory is 3.6 GB. * TraceAbstraction took 50320.53 ms. Allocated memory was 324.5 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 293.3 MB in the beginning and 1.2 GB in the end (delta: -875.5 MB). Peak memory consumption was 266.4 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 (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 156 with TraceHistMax 9, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 5 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 171 locations, 1 error locations. TIMEOUT Result, 50.2s OverallTime, 18 OverallIterations, 11 TraceHistogramMax, 37.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7740 SDtfs, 5293 SDslu, 21102 SDs, 0 SdLazy, 9325 SolverSat, 4797 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1095 GetRequests, 1003 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2005occurred in iteration=16, 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: 6.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 9270 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2293 NumberOfCodeBlocks, 2293 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2267 ConstructedInterpolants, 0 QuantifiedInterpolants, 382167 SizeOfPredicates, 17 NumberOfNonLiveVariables, 2816 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 26 InterpolantComputations, 10 PerfectInterpolantSequences, 3129/3335 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/a-copy-print.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_01-39-32-728.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/a-copy-print.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_01-39-32-728.csv Completed graceful shutdown