java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrncat-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 12:03:28,994 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 12:03:28,996 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 12:03:29,007 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 12:03:29,007 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 12:03:29,008 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 12:03:29,008 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 12:03:29,010 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 12:03:29,012 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 12:03:29,012 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 12:03:29,013 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 12:03:29,013 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 12:03:29,014 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 12:03:29,015 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 12:03:29,016 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 12:03:29,018 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 12:03:29,019 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 12:03:29,021 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 12:03:29,022 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 12:03:29,023 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 12:03:29,025 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 12:03:29,025 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 12:03:29,025 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 12:03:29,026 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 12:03:29,027 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 12:03:29,028 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 12:03:29,028 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 12:03:29,029 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 12:03:29,029 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 12:03:29,029 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 12:03:29,030 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 12:03:29,030 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 12:03:29,039 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 12:03:29,040 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 12:03:29,041 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 12:03:29,041 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 12:03:29,041 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 12:03:29,041 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 12:03:29,041 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 12:03:29,042 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 12:03:29,042 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 12:03:29,042 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 12:03:29,042 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 12:03:29,042 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 12:03:29,042 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 12:03:29,043 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 12:03:29,043 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 12:03:29,043 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 12:03:29,043 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 12:03:29,043 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 12:03:29,043 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 12:03:29,043 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:03:29,044 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 12:03:29,044 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 12:03:29,044 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 12:03:29,044 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 12:03:29,073 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 12:03:29,083 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 12:03:29,086 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 12:03:29,088 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 12:03:29,088 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 12:03:29,089 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-02-04 12:03:29,265 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 12:03:29,266 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 12:03:29,268 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 12:03:29,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 12:03:29,273 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 12:03:29,274 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:03:29" (1/1) ... [2018-02-04 12:03:29,276 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@272d5371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:29, skipping insertion in model container [2018-02-04 12:03:29,276 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:03:29" (1/1) ... [2018-02-04 12:03:29,292 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:03:29,324 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:03:29,421 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:03:29,440 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:03:29,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:29 WrapperNode [2018-02-04 12:03:29,446 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 12:03:29,447 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 12:03:29,447 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 12:03:29,447 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 12:03:29,463 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:29" (1/1) ... [2018-02-04 12:03:29,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:29" (1/1) ... [2018-02-04 12:03:29,472 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:29" (1/1) ... [2018-02-04 12:03:29,472 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:29" (1/1) ... [2018-02-04 12:03:29,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:29" (1/1) ... [2018-02-04 12:03:29,477 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:29" (1/1) ... [2018-02-04 12:03:29,478 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:29" (1/1) ... [2018-02-04 12:03:29,479 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 12:03:29,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 12:03:29,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 12:03:29,480 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 12:03:29,481 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:29" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:03:29,519 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 12:03:29,519 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 12:03:29,519 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncat [2018-02-04 12:03:29,519 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 12:03:29,520 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 12:03:29,520 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 12:03:29,520 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 12:03:29,520 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 12:03:29,520 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 12:03:29,520 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 12:03:29,520 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncat [2018-02-04 12:03:29,520 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 12:03:29,520 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 12:03:29,520 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 12:03:29,731 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 12:03:29,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:03:29 BoogieIcfgContainer [2018-02-04 12:03:29,731 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 12:03:29,732 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 12:03:29,732 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 12:03:29,733 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 12:03:29,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:03:29" (1/3) ... [2018-02-04 12:03:29,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d4fa570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:03:29, skipping insertion in model container [2018-02-04 12:03:29,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:03:29" (2/3) ... [2018-02-04 12:03:29,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d4fa570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:03:29, skipping insertion in model container [2018-02-04 12:03:29,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:03:29" (3/3) ... [2018-02-04 12:03:29,735 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-02-04 12:03:29,740 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 12:03:29,744 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-04 12:03:29,764 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 12:03:29,764 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 12:03:29,764 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 12:03:29,764 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 12:03:29,764 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 12:03:29,764 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 12:03:29,764 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 12:03:29,764 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 12:03:29,765 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 12:03:29,772 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-02-04 12:03:29,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-04 12:03:29,777 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:29,778 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:03:29,778 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:03:29,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1927484354, now seen corresponding path program 1 times [2018-02-04 12:03:29,781 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:29,782 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:29,809 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:29,809 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:29,809 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:29,848 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:29,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:03:29,902 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:29,902 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 12:03:29,903 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 12:03:29,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 12:03:29,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 12:03:29,913 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 3 states. [2018-02-04 12:03:29,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:29,986 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2018-02-04 12:03:29,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 12:03:30,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-02-04 12:03:30,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:30,047 INFO L225 Difference]: With dead ends: 59 [2018-02-04 12:03:30,048 INFO L226 Difference]: Without dead ends: 55 [2018-02-04 12:03:30,049 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-02-04 12:03:30,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-04 12:03:30,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-02-04 12:03:30,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 12:03:30,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-02-04 12:03:30,081 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 11 [2018-02-04 12:03:30,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:30,081 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-02-04 12:03:30,081 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 12:03:30,081 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-02-04 12:03:30,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 12:03:30,082 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:30,082 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:03:30,082 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:03:30,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1621249811, now seen corresponding path program 1 times [2018-02-04 12:03:30,083 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:30,083 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:30,084 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:30,084 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:30,084 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:30,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:30,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:03:30,124 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:30,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:03:30,125 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:03:30,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:03:30,126 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:03:30,126 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 5 states. [2018-02-04 12:03:30,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:30,194 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-02-04 12:03:30,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:03:30,195 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-04 12:03:30,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:30,195 INFO L225 Difference]: With dead ends: 58 [2018-02-04 12:03:30,196 INFO L226 Difference]: Without dead ends: 55 [2018-02-04 12:03:30,196 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:03:30,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-04 12:03:30,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-02-04 12:03:30,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 12:03:30,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-02-04 12:03:30,206 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 15 [2018-02-04 12:03:30,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:30,206 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-02-04 12:03:30,207 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:03:30,207 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-02-04 12:03:30,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 12:03:30,207 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:30,207 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:03:30,207 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:03:30,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1993659115, now seen corresponding path program 1 times [2018-02-04 12:03:30,207 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:30,208 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:30,208 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:30,208 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:30,208 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:30,225 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:30,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:03:30,278 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:30,278 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:03:30,278 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:03:30,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:03:30,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:03:30,279 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 4 states. [2018-02-04 12:03:30,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:30,331 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-02-04 12:03:30,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:03:30,331 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-04 12:03:30,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:30,332 INFO L225 Difference]: With dead ends: 54 [2018-02-04 12:03:30,332 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 12:03:30,332 INFO L554 BasicCegarLoop]: 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-02-04 12:03:30,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 12:03:30,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-04 12:03:30,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 12:03:30,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-02-04 12:03:30,335 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 15 [2018-02-04 12:03:30,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:30,335 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-02-04 12:03:30,335 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:03:30,335 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-02-04 12:03:30,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 12:03:30,335 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:30,335 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:03:30,336 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:03:30,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1993659114, now seen corresponding path program 1 times [2018-02-04 12:03:30,336 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:30,336 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:30,336 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:30,336 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:30,337 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:30,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:30,353 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:30,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:03:30,443 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:30,443 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:03:30,443 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:03:30,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:03:30,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:03:30,444 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 8 states. [2018-02-04 12:03:30,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:30,524 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-02-04 12:03:30,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:03:30,524 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-02-04 12:03:30,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:30,525 INFO L225 Difference]: With dead ends: 53 [2018-02-04 12:03:30,525 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 12:03:30,525 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-02-04 12:03:30,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 12:03:30,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-04 12:03:30,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 12:03:30,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-02-04 12:03:30,527 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 15 [2018-02-04 12:03:30,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:30,528 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-02-04 12:03:30,528 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:03:30,528 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-02-04 12:03:30,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 12:03:30,528 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:30,528 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:03:30,528 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:03:30,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1673890416, now seen corresponding path program 1 times [2018-02-04 12:03:30,528 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:30,528 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:30,529 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:30,529 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:30,529 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:30,536 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:30,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:03:30,576 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:30,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:03:30,577 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:03:30,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:03:30,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:03:30,577 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 4 states. [2018-02-04 12:03:30,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:30,618 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-02-04 12:03:30,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:03:30,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-04 12:03:30,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:30,619 INFO L225 Difference]: With dead ends: 52 [2018-02-04 12:03:30,619 INFO L226 Difference]: Without dead ends: 52 [2018-02-04 12:03:30,620 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-02-04 12:03:30,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-04 12:03:30,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-04 12:03:30,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 12:03:30,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-02-04 12:03:30,623 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 16 [2018-02-04 12:03:30,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:30,623 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-02-04 12:03:30,623 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:03:30,623 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-02-04 12:03:30,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-04 12:03:30,624 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:30,624 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:03:30,624 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:03:30,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1673890415, now seen corresponding path program 1 times [2018-02-04 12:03:30,624 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:30,624 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:30,625 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:30,625 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:30,625 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:30,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:30,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:03:30,688 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:30,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:03:30,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:03:30,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:03:30,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:03:30,689 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-02-04 12:03:30,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:30,723 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-02-04 12:03:30,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:03:30,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-04 12:03:30,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:30,724 INFO L225 Difference]: With dead ends: 51 [2018-02-04 12:03:30,725 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 12:03:30,725 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:03:30,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 12:03:30,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-04 12:03:30,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 12:03:30,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-02-04 12:03:30,728 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 16 [2018-02-04 12:03:30,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:30,728 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-02-04 12:03:30,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:03:30,728 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-02-04 12:03:30,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 12:03:30,729 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:30,729 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:03:30,729 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:03:30,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1745382581, now seen corresponding path program 1 times [2018-02-04 12:03:30,729 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:30,729 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:30,730 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:30,730 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:30,730 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:30,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:30,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:30,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:03:30,767 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:30,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:03:30,767 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:03:30,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:03:30,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:03:30,768 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 5 states. [2018-02-04 12:03:30,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:30,820 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-02-04 12:03:30,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:03:30,820 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-04 12:03:30,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:30,820 INFO L225 Difference]: With dead ends: 47 [2018-02-04 12:03:30,820 INFO L226 Difference]: Without dead ends: 47 [2018-02-04 12:03:30,820 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:03:30,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-04 12:03:30,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-04 12:03:30,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-04 12:03:30,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-02-04 12:03:30,822 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 20 [2018-02-04 12:03:30,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:30,823 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-02-04 12:03:30,823 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:03:30,823 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-02-04 12:03:30,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 12:03:30,823 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:30,823 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:03:30,823 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:03:30,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1745382582, now seen corresponding path program 1 times [2018-02-04 12:03:30,824 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:30,824 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:30,824 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:30,824 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:30,824 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:30,831 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:30,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:03:30,907 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:30,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 12:03:30,907 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 12:03:30,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 12:03:30,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 12:03:30,908 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 9 states. [2018-02-04 12:03:31,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:31,037 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2018-02-04 12:03:31,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 12:03:31,037 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-02-04 12:03:31,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:31,041 INFO L225 Difference]: With dead ends: 65 [2018-02-04 12:03:31,042 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 12:03:31,042 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-02-04 12:03:31,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 12:03:31,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2018-02-04 12:03:31,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-04 12:03:31,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2018-02-04 12:03:31,045 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 20 [2018-02-04 12:03:31,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:31,045 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2018-02-04 12:03:31,045 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 12:03:31,045 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2018-02-04 12:03:31,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 12:03:31,045 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:31,045 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:03:31,045 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:03:31,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1818413707, now seen corresponding path program 1 times [2018-02-04 12:03:31,046 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:31,046 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:31,046 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:31,046 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:31,046 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:31,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:31,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:03:31,160 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:03:31,160 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:03:31,168 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:31,201 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:03:31,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:03:31,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:31,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:03:31,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:31,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:03:31,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-02-04 12:03:31,311 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:03:31,312 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:03:31,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-02-04 12:03:31,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:31,324 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:03:31,324 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:03:31,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:03:31,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:31,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:03:31,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:18 [2018-02-04 12:03:31,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:03:31,484 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:03:31,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2018-02-04 12:03:31,485 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 12:03:31,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 12:03:31,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-02-04 12:03:31,485 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand 22 states. [2018-02-04 12:03:31,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:31,950 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2018-02-04 12:03:31,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 12:03:31,950 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 23 [2018-02-04 12:03:31,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:31,951 INFO L225 Difference]: With dead ends: 83 [2018-02-04 12:03:31,951 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 12:03:31,952 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2018-02-04 12:03:31,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 12:03:31,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 70. [2018-02-04 12:03:31,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 12:03:31,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2018-02-04 12:03:31,957 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 23 [2018-02-04 12:03:31,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:31,957 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2018-02-04 12:03:31,957 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 12:03:31,957 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2018-02-04 12:03:31,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 12:03:31,958 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:31,958 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:03:31,958 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:03:31,959 INFO L82 PathProgramCache]: Analyzing trace with hash -557502487, now seen corresponding path program 1 times [2018-02-04 12:03:31,959 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:31,959 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:31,959 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:31,960 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:31,960 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:31,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:32,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:03:32,009 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:32,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:03:32,010 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:03:32,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:03:32,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:03:32,010 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand 6 states. [2018-02-04 12:03:32,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:32,089 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2018-02-04 12:03:32,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:03:32,089 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-04 12:03:32,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:32,090 INFO L225 Difference]: With dead ends: 72 [2018-02-04 12:03:32,090 INFO L226 Difference]: Without dead ends: 72 [2018-02-04 12:03:32,090 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:03:32,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-04 12:03:32,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2018-02-04 12:03:32,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-04 12:03:32,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2018-02-04 12:03:32,094 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 83 transitions. Word has length 25 [2018-02-04 12:03:32,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:32,095 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 83 transitions. [2018-02-04 12:03:32,095 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:03:32,095 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2018-02-04 12:03:32,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 12:03:32,095 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:32,096 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:03:32,096 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:03:32,096 INFO L82 PathProgramCache]: Analyzing trace with hash -557502486, now seen corresponding path program 1 times [2018-02-04 12:03:32,096 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:32,096 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:32,097 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:32,097 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:32,097 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:32,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:32,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:32,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:03:32,176 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:03:32,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 12:03:32,176 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 12:03:32,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 12:03:32,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 12:03:32,177 INFO L87 Difference]: Start difference. First operand 69 states and 83 transitions. Second operand 9 states. [2018-02-04 12:03:32,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:03:32,258 INFO L93 Difference]: Finished difference Result 98 states and 120 transitions. [2018-02-04 12:03:32,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 12:03:32,258 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-02-04 12:03:32,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:03:32,259 INFO L225 Difference]: With dead ends: 98 [2018-02-04 12:03:32,259 INFO L226 Difference]: Without dead ends: 98 [2018-02-04 12:03:32,259 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-02-04 12:03:32,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-04 12:03:32,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 80. [2018-02-04 12:03:32,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 12:03:32,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 98 transitions. [2018-02-04 12:03:32,261 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 98 transitions. Word has length 25 [2018-02-04 12:03:32,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:03:32,262 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 98 transitions. [2018-02-04 12:03:32,262 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 12:03:32,262 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2018-02-04 12:03:32,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 12:03:32,262 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:03:32,262 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:03:32,262 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:03:32,262 INFO L82 PathProgramCache]: Analyzing trace with hash -59760490, now seen corresponding path program 2 times [2018-02-04 12:03:32,262 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:03:32,262 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:03:32,263 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:32,263 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:03:32,263 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:03:32,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:03:32,271 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:03:32,495 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:03:32,495 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:03:32,495 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:03:32,503 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:03:32,520 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:03:32,520 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:03:32,524 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:03:32,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:03:32,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:32,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:03:32,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-02-04 12:03:32,611 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:03:32,612 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:03:32,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:03:32,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:32,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:03:32,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:16 [2018-02-04 12:03:32,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-02-04 12:03:32,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-02-04 12:03:32,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:32,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:03:32,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 12:03:32,756 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:38 [2018-02-04 12:03:32,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-02-04 12:03:32,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-04 12:03:32,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:32,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:03:32,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-02-04 12:03:32,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:52, output treesize:48 [2018-02-04 12:03:35,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-02-04 12:03:35,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-02-04 12:03:35,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:03:35,022 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:03:35,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 37 [2018-02-04 12:03:35,027 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 12:03:35,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:03:35,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:03:35,047 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:66, output treesize:43 [2018-02-04 12:03:35,116 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:03:35,134 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:03:35,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 25 [2018-02-04 12:03:35,134 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 12:03:35,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 12:03:35,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=586, Unknown=1, NotChecked=0, Total=650 [2018-02-04 12:03:35,135 INFO L87 Difference]: Start difference. First operand 80 states and 98 transitions. Second operand 26 states. [2018-02-04 12:03:44,709 WARN L146 SmtUtils]: Spent 2052ms on a formula simplification. DAG size of input: 60 DAG size of output 51 [2018-02-04 12:03:48,820 WARN L146 SmtUtils]: Spent 4066ms on a formula simplification. DAG size of input: 63 DAG size of output 55 [2018-02-04 12:03:57,993 WARN L146 SmtUtils]: Spent 4588ms on a formula simplification. DAG size of input: 61 DAG size of output 50 [2018-02-04 12:04:06,249 WARN L146 SmtUtils]: Spent 8049ms on a formula simplification. DAG size of input: 70 DAG size of output 60 [2018-02-04 12:04:11,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:11,515 INFO L93 Difference]: Finished difference Result 163 states and 198 transitions. [2018-02-04 12:04:11,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 12:04:11,515 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-02-04 12:04:11,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:11,516 INFO L225 Difference]: With dead ends: 163 [2018-02-04 12:04:11,516 INFO L226 Difference]: Without dead ends: 163 [2018-02-04 12:04:11,517 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 27.1s TimeCoverageRelationStatistics Valid=343, Invalid=2204, Unknown=3, NotChecked=0, Total=2550 [2018-02-04 12:04:11,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-04 12:04:11,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 79. [2018-02-04 12:04:11,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-04 12:04:11,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2018-02-04 12:04:11,521 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 26 [2018-02-04 12:04:11,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:11,521 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2018-02-04 12:04:11,521 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 12:04:11,521 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2018-02-04 12:04:11,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 12:04:11,522 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:11,522 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 12:04:11,522 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:04:11,522 INFO L82 PathProgramCache]: Analyzing trace with hash 933708271, now seen corresponding path program 1 times [2018-02-04 12:04:11,522 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:11,522 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:11,523 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:11,523 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:04:11,523 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:11,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:11,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:11,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:11,588 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:04:11,588 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:04:11,596 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:11,613 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:04:11,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:11,651 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:04:11,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-02-04 12:04:11,652 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 12:04:11,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 12:04:11,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:04:11,652 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand 7 states. [2018-02-04 12:04:11,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:11,703 INFO L93 Difference]: Finished difference Result 142 states and 165 transitions. [2018-02-04 12:04:11,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 12:04:11,703 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-02-04 12:04:11,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:11,704 INFO L225 Difference]: With dead ends: 142 [2018-02-04 12:04:11,704 INFO L226 Difference]: Without dead ends: 142 [2018-02-04 12:04:11,704 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-02-04 12:04:11,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-04 12:04:11,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 123. [2018-02-04 12:04:11,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 12:04:11,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 148 transitions. [2018-02-04 12:04:11,714 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 148 transitions. Word has length 32 [2018-02-04 12:04:11,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:11,715 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 148 transitions. [2018-02-04 12:04:11,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 12:04:11,715 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 148 transitions. [2018-02-04 12:04:11,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 12:04:11,716 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:11,716 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 12:04:11,716 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:04:11,716 INFO L82 PathProgramCache]: Analyzing trace with hash 799694765, now seen corresponding path program 1 times [2018-02-04 12:04:11,716 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:11,716 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:11,717 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:11,717 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:11,717 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:11,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:11,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:11,891 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:11,891 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:04:11,891 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:04:11,900 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:11,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:11,920 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:04:11,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-02-04 12:04:11,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-04 12:04:11,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:11,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:11,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:04:11,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-02-04 12:04:12,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-02-04 12:04:12,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-04 12:04:12,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:04:12,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:04:12,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:04:12,072 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-02-04 12:04:12,115 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:12,135 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:04:12,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2018-02-04 12:04:12,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 12:04:12,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 12:04:12,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-02-04 12:04:12,136 INFO L87 Difference]: Start difference. First operand 123 states and 148 transitions. Second operand 19 states. [2018-02-04 12:04:14,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:14,994 INFO L93 Difference]: Finished difference Result 173 states and 204 transitions. [2018-02-04 12:04:14,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 12:04:14,994 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2018-02-04 12:04:14,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:14,995 INFO L225 Difference]: With dead ends: 173 [2018-02-04 12:04:14,995 INFO L226 Difference]: Without dead ends: 173 [2018-02-04 12:04:14,995 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2018-02-04 12:04:14,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-02-04 12:04:14,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 130. [2018-02-04 12:04:14,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-04 12:04:14,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 156 transitions. [2018-02-04 12:04:14,998 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 156 transitions. Word has length 32 [2018-02-04 12:04:14,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:14,999 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 156 transitions. [2018-02-04 12:04:14,999 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 12:04:14,999 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 156 transitions. [2018-02-04 12:04:15,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 12:04:15,000 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:15,000 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:04:15,000 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:04:15,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1376138118, now seen corresponding path program 1 times [2018-02-04 12:04:15,001 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:15,001 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:15,001 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:15,001 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:15,002 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:15,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:15,008 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:15,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:15,041 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:04:15,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 12:04:15,041 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:04:15,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:04:15,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:04:15,041 INFO L87 Difference]: Start difference. First operand 130 states and 156 transitions. Second operand 6 states. [2018-02-04 12:04:15,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:15,075 INFO L93 Difference]: Finished difference Result 156 states and 184 transitions. [2018-02-04 12:04:15,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 12:04:15,075 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-02-04 12:04:15,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:15,076 INFO L225 Difference]: With dead ends: 156 [2018-02-04 12:04:15,076 INFO L226 Difference]: Without dead ends: 142 [2018-02-04 12:04:15,076 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:04:15,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-02-04 12:04:15,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 130. [2018-02-04 12:04:15,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-02-04 12:04:15,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 152 transitions. [2018-02-04 12:04:15,079 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 152 transitions. Word has length 36 [2018-02-04 12:04:15,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:15,079 INFO L432 AbstractCegarLoop]: Abstraction has 130 states and 152 transitions. [2018-02-04 12:04:15,079 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:04:15,079 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 152 transitions. [2018-02-04 12:04:15,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 12:04:15,083 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:15,083 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:04:15,083 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:04:15,083 INFO L82 PathProgramCache]: Analyzing trace with hash 336762589, now seen corresponding path program 1 times [2018-02-04 12:04:15,084 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:15,084 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:15,084 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:15,084 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:15,084 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:15,091 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:15,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:15,141 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:04:15,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:04:15,142 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:04:15,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:04:15,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:04:15,142 INFO L87 Difference]: Start difference. First operand 130 states and 152 transitions. Second operand 6 states. [2018-02-04 12:04:15,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:15,221 INFO L93 Difference]: Finished difference Result 129 states and 151 transitions. [2018-02-04 12:04:15,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:04:15,221 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-02-04 12:04:15,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:15,222 INFO L225 Difference]: With dead ends: 129 [2018-02-04 12:04:15,222 INFO L226 Difference]: Without dead ends: 99 [2018-02-04 12:04:15,222 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:04:15,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-04 12:04:15,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-02-04 12:04:15,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 12:04:15,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2018-02-04 12:04:15,224 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 39 [2018-02-04 12:04:15,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:15,224 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2018-02-04 12:04:15,224 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:04:15,224 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-02-04 12:04:15,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 12:04:15,225 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:15,225 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-02-04 12:04:15,226 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:04:15,226 INFO L82 PathProgramCache]: Analyzing trace with hash 2118432619, now seen corresponding path program 1 times [2018-02-04 12:04:15,226 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:15,226 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:15,226 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:15,227 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:15,227 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:15,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:15,240 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:15,567 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:15,567 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:04:15,567 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:04:15,572 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:15,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:15,586 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:04:15,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:04:15,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:15,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:04:15,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:15,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:15,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2018-02-04 12:04:15,622 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:04:15,623 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:04:15,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:04:15,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:15,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 12:04:15,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:15,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:15,638 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-02-04 12:04:15,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-02-04 12:04:15,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-02-04 12:04:15,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:15,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:15,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:04:15,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-02-04 12:04:15,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-02-04 12:04:15,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-04 12:04:15,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:15,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:15,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 12:04:15,713 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:37 [2018-02-04 12:04:15,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-02-04 12:04:15,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-02-04 12:04:15,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:04:15,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-02-04 12:04:15,938 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:15,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:04:15,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:04:15,949 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:47, output treesize:27 [2018-02-04 12:04:16,148 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:16,180 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:04:16,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 27 [2018-02-04 12:04:16,180 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 12:04:16,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 12:04:16,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=684, Unknown=0, NotChecked=0, Total=756 [2018-02-04 12:04:16,181 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 28 states. [2018-02-04 12:04:22,801 WARN L146 SmtUtils]: Spent 2061ms on a formula simplification. DAG size of input: 68 DAG size of output 50 [2018-02-04 12:04:22,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:22,985 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2018-02-04 12:04:22,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-04 12:04:22,985 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 39 [2018-02-04 12:04:22,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:22,986 INFO L225 Difference]: With dead ends: 109 [2018-02-04 12:04:22,986 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 12:04:22,986 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=272, Invalid=1708, Unknown=0, NotChecked=0, Total=1980 [2018-02-04 12:04:22,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 12:04:22,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-02-04 12:04:22,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 12:04:22,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-02-04 12:04:22,987 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 39 [2018-02-04 12:04:22,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:22,987 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-02-04 12:04:22,987 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 12:04:22,987 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-02-04 12:04:22,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 12:04:22,988 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:22,988 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 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-02-04 12:04:22,988 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:04:22,988 INFO L82 PathProgramCache]: Analyzing trace with hash -2098962228, now seen corresponding path program 2 times [2018-02-04 12:04:22,988 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:22,988 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:22,989 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:22,989 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:22,989 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:22,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:22,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:23,216 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:23,216 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:04:23,216 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:04:23,221 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:04:23,236 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:04:23,236 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:04:23,238 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:04:23,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:04:23,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:23,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:23,251 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 12:04:23,274 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:04:23,274 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:04:23,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:04:23,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:23,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:23,277 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-04 12:04:23,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-02-04 12:04:23,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-04 12:04:23,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:23,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:23,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:04:23,307 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-02-04 12:04:23,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-02-04 12:04:23,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 12:04:23,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:23,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:23,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 12:04:23,452 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:53, output treesize:49 [2018-02-04 12:04:23,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-02-04 12:04:23,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-02-04 12:04:23,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:23,714 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:04:23,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 35 [2018-02-04 12:04:23,718 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 12:04:23,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:04:23,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:04:23,735 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:65, output treesize:43 [2018-02-04 12:04:23,800 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:23,817 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:04:23,817 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 32 [2018-02-04 12:04:23,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 12:04:23,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 12:04:23,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=977, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 12:04:23,817 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 33 states. [2018-02-04 12:04:25,054 WARN L146 SmtUtils]: Spent 643ms on a formula simplification. DAG size of input: 67 DAG size of output 50 [2018-02-04 12:04:25,219 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 76 DAG size of output 57 [2018-02-04 12:04:27,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:27,970 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-02-04 12:04:27,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 12:04:27,970 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 39 [2018-02-04 12:04:27,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:27,971 INFO L225 Difference]: With dead ends: 81 [2018-02-04 12:04:27,971 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 12:04:27,971 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=266, Invalid=2596, Unknown=0, NotChecked=0, Total=2862 [2018-02-04 12:04:27,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 12:04:27,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 55. [2018-02-04 12:04:27,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 12:04:27,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-02-04 12:04:27,973 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 39 [2018-02-04 12:04:27,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:27,973 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-02-04 12:04:27,973 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 12:04:27,973 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-02-04 12:04:27,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 12:04:27,974 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:27,974 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 12:04:27,974 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:04:27,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1474943839, now seen corresponding path program 1 times [2018-02-04 12:04:27,975 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:27,975 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:27,975 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:27,975 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:04:27,975 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:27,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:28,302 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:28,303 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:04:28,303 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:04:28,313 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:28,333 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:04:28,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:04:28,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:28,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:04:28,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:28,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:28,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-02-04 12:04:28,403 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:04:28,404 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:04:28,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-02-04 12:04:28,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:28,412 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:04:28,413 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:04:28,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:04:28,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:28,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:28,420 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-02-04 12:04:28,686 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:28,716 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:04:28,717 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 35 [2018-02-04 12:04:28,717 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 12:04:28,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 12:04:28,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1147, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 12:04:28,718 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 36 states. [2018-02-04 12:04:29,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:29,828 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2018-02-04 12:04:29,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 12:04:29,828 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 39 [2018-02-04 12:04:29,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:29,829 INFO L225 Difference]: With dead ends: 94 [2018-02-04 12:04:29,829 INFO L226 Difference]: Without dead ends: 89 [2018-02-04 12:04:29,829 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=388, Invalid=3152, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 12:04:29,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-02-04 12:04:29,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 70. [2018-02-04 12:04:29,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 12:04:29,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-02-04 12:04:29,831 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 39 [2018-02-04 12:04:29,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:29,831 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-02-04 12:04:29,831 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 12:04:29,831 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-02-04 12:04:29,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 12:04:29,831 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:29,831 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-02-04 12:04:29,831 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:04:29,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1474934803, now seen corresponding path program 1 times [2018-02-04 12:04:29,831 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:29,831 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:29,832 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:29,832 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:29,832 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:29,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:29,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:30,194 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:30,194 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:04:30,194 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:04:30,203 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:30,223 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:04:30,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:04:30,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:30,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:04:30,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:30,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:30,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 12:04:30,267 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:04:30,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-04 12:04:30,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:30,284 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:04:30,284 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:04:30,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:04:30,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:30,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:30,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 12:04:30,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-02-04 12:04:30,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-02-04 12:04:30,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:30,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:30,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:30,342 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-02-04 12:04:30,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-02-04 12:04:30,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-04 12:04:30,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:30,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:30,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 12:04:30,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:31 [2018-02-04 12:04:30,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-02-04 12:04:30,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-02-04 12:04:30,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:30,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-02-04 12:04:30,511 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 12:04:30,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:04:30,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:04:30,519 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:23 [2018-02-04 12:04:30,658 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:30,676 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:04:30,676 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 32 [2018-02-04 12:04:30,676 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-04 12:04:30,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-04 12:04:30,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=971, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 12:04:30,677 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 33 states. [2018-02-04 12:04:39,076 WARN L146 SmtUtils]: Spent 8054ms on a formula simplification. DAG size of input: 56 DAG size of output 55 [2018-02-04 12:04:43,183 WARN L143 SmtUtils]: Spent 4025ms on a formula simplification that was a NOOP. DAG size: 58 [2018-02-04 12:04:46,610 WARN L146 SmtUtils]: Spent 3401ms on a formula simplification. DAG size of input: 69 DAG size of output 65 [2018-02-04 12:04:46,834 WARN L146 SmtUtils]: Spent 205ms on a formula simplification. DAG size of input: 62 DAG size of output 52 [2018-02-04 12:04:53,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:53,748 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2018-02-04 12:04:53,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-04 12:04:53,748 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 39 [2018-02-04 12:04:53,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:53,749 INFO L225 Difference]: With dead ends: 105 [2018-02-04 12:04:53,749 INFO L226 Difference]: Without dead ends: 99 [2018-02-04 12:04:53,750 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 873 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=419, Invalid=3363, Unknown=0, NotChecked=0, Total=3782 [2018-02-04 12:04:53,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-04 12:04:53,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 77. [2018-02-04 12:04:53,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 12:04:53,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2018-02-04 12:04:53,751 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 39 [2018-02-04 12:04:53,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:53,752 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2018-02-04 12:04:53,752 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-04 12:04:53,752 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-02-04 12:04:53,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 12:04:53,752 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:53,752 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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-02-04 12:04:53,752 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:04:53,753 INFO L82 PathProgramCache]: Analyzing trace with hash -643319614, now seen corresponding path program 1 times [2018-02-04 12:04:53,753 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:53,753 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:53,753 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:53,753 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:53,754 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:53,762 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:54,024 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:54,024 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:04:54,024 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:04:54,029 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:54,047 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:04:54,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:04:54,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:54,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:54,054 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:7 [2018-02-04 12:04:54,253 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:54,274 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:04:54,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 30 [2018-02-04 12:04:54,274 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-04 12:04:54,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-04 12:04:54,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=841, Unknown=0, NotChecked=0, Total=930 [2018-02-04 12:04:54,275 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 31 states. [2018-02-04 12:04:54,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:54,852 INFO L93 Difference]: Finished difference Result 121 states and 128 transitions. [2018-02-04 12:04:54,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 12:04:54,852 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 40 [2018-02-04 12:04:54,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:54,853 INFO L225 Difference]: With dead ends: 121 [2018-02-04 12:04:54,853 INFO L226 Difference]: Without dead ends: 111 [2018-02-04 12:04:54,853 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=274, Invalid=2078, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 12:04:54,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-04 12:04:54,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 96. [2018-02-04 12:04:54,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 12:04:54,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2018-02-04 12:04:54,855 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 40 [2018-02-04 12:04:54,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:54,855 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2018-02-04 12:04:54,855 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-04 12:04:54,855 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2018-02-04 12:04:54,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 12:04:54,856 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:54,856 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 12:04:54,856 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:04:54,856 INFO L82 PathProgramCache]: Analyzing trace with hash -643310578, now seen corresponding path program 1 times [2018-02-04 12:04:54,856 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:54,856 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:54,856 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:54,856 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:54,856 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:54,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:54,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:55,090 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:55,090 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:04:55,090 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:04:55,095 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:55,113 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:04:55,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:04:55,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:55,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:04:55,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:55,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:55,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-02-04 12:04:55,167 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:04:55,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-02-04 12:04:55,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:55,175 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:04:55,176 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:04:55,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:04:55,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:55,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:55,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:17 [2018-02-04 12:04:55,568 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:55,601 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:04:55,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2018-02-04 12:04:55,601 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 12:04:55,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 12:04:55,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1030, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 12:04:55,602 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 34 states. [2018-02-04 12:04:56,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:04:56,793 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2018-02-04 12:04:56,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 12:04:56,793 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 40 [2018-02-04 12:04:56,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:04:56,793 INFO L225 Difference]: With dead ends: 109 [2018-02-04 12:04:56,794 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 12:04:56,794 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=304, Invalid=2452, Unknown=0, NotChecked=0, Total=2756 [2018-02-04 12:04:56,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 12:04:56,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-02-04 12:04:56,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 12:04:56,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-02-04 12:04:56,796 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 40 [2018-02-04 12:04:56,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:04:56,796 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-02-04 12:04:56,796 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 12:04:56,796 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-02-04 12:04:56,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 12:04:56,796 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:04:56,796 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 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-02-04 12:04:56,796 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:04:56,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1450310760, now seen corresponding path program 2 times [2018-02-04 12:04:56,796 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:04:56,796 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:04:56,797 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:56,797 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:04:56,797 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:04:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:04:56,806 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:04:57,494 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:57,494 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:04:57,494 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:04:57,507 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:04:57,526 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:04:57,526 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:04:57,529 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:04:57,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:04:57,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:57,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:04:57,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:57,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:57,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-02-04 12:04:57,577 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:04:57,577 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:04:57,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 12:04:57,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:57,588 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:04:57,589 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:04:57,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:04:57,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:57,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:57,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-02-04 12:04:57,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-02-04 12:04:57,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-02-04 12:04:57,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:57,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:57,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:57,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-02-04 12:04:57,700 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:04:57,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-02-04 12:04:57,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-04 12:04:57,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:57,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:04:57,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:04:57,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:43 [2018-02-04 12:04:57,863 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:04:57,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-02-04 12:04:57,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-02-04 12:04:57,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:04:57,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-02-04 12:04:57,873 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 12:04:57,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:04:57,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:04:57,880 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:49, output treesize:47 [2018-02-04 12:04:58,251 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:04:58,269 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:04:58,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 38 [2018-02-04 12:04:58,269 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 12:04:58,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 12:04:58,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1381, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 12:04:58,270 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 39 states. [2018-02-04 12:05:00,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:05:00,261 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2018-02-04 12:05:00,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-04 12:05:00,262 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 42 [2018-02-04 12:05:00,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:05:00,262 INFO L225 Difference]: With dead ends: 105 [2018-02-04 12:05:00,262 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 12:05:00,263 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 704 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=309, Invalid=3351, Unknown=0, NotChecked=0, Total=3660 [2018-02-04 12:05:00,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 12:05:00,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 80. [2018-02-04 12:05:00,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 12:05:00,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2018-02-04 12:05:00,264 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 42 [2018-02-04 12:05:00,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:05:00,264 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2018-02-04 12:05:00,264 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 12:05:00,264 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2018-02-04 12:05:00,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 12:05:00,265 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:05:00,265 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 12:05:00,265 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:05:00,265 INFO L82 PathProgramCache]: Analyzing trace with hash -154740261, now seen corresponding path program 3 times [2018-02-04 12:05:00,265 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:05:00,265 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:05:00,265 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:00,266 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:05:00,266 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:00,271 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:05:00,571 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:05:00,571 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:05:00,571 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:05:00,577 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 12:05:00,595 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-04 12:05:00,595 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:05:00,597 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:05:00,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:05:00,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:00,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:05:00,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:00,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:00,613 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-02-04 12:05:00,660 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:00,660 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:00,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:05:00,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:00,666 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:00,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-02-04 12:05:00,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:00,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:00,672 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-02-04 12:05:00,979 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:05:01,003 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:05:01,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 38 [2018-02-04 12:05:01,004 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-04 12:05:01,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-04 12:05:01,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1337, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 12:05:01,004 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 39 states. [2018-02-04 12:05:02,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:05:02,453 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2018-02-04 12:05:02,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 12:05:02,453 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 43 [2018-02-04 12:05:02,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:05:02,454 INFO L225 Difference]: With dead ends: 99 [2018-02-04 12:05:02,454 INFO L226 Difference]: Without dead ends: 93 [2018-02-04 12:05:02,454 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=412, Invalid=3128, Unknown=0, NotChecked=0, Total=3540 [2018-02-04 12:05:02,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-04 12:05:02,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 76. [2018-02-04 12:05:02,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 12:05:02,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2018-02-04 12:05:02,456 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 43 [2018-02-04 12:05:02,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:05:02,456 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2018-02-04 12:05:02,456 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-04 12:05:02,456 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2018-02-04 12:05:02,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 12:05:02,456 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:05:02,457 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:05:02,457 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:05:02,457 INFO L82 PathProgramCache]: Analyzing trace with hash -154731225, now seen corresponding path program 2 times [2018-02-04 12:05:02,457 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:05:02,457 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:05:02,457 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:02,457 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:05:02,458 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:02,464 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:05:02,736 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:05:02,736 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:05:02,736 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:05:02,743 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:05:02,764 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:05:02,764 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:05:02,767 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:05:02,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:05:02,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:02,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:05:02,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:02,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:02,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-02-04 12:05:02,954 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:02,955 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:02,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-02-04 12:05:02,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:02,965 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:02,966 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:02,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:05:02,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:02,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:02,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-02-04 12:05:03,302 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:05:03,335 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:05:03,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 35 [2018-02-04 12:05:03,335 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 12:05:03,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 12:05:03,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1163, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 12:05:03,336 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 36 states. [2018-02-04 12:05:04,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:05:04,282 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-02-04 12:05:04,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 12:05:04,283 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 43 [2018-02-04 12:05:04,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:05:04,283 INFO L225 Difference]: With dead ends: 89 [2018-02-04 12:05:04,283 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 12:05:04,284 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=358, Invalid=2834, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 12:05:04,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 12:05:04,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-04 12:05:04,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 12:05:04,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-02-04 12:05:04,286 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 43 [2018-02-04 12:05:04,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:05:04,286 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-02-04 12:05:04,286 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 12:05:04,286 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-02-04 12:05:04,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 12:05:04,287 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:05:04,287 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 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-02-04 12:05:04,287 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:05:04,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1471333567, now seen corresponding path program 4 times [2018-02-04 12:05:04,287 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:05:04,287 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:05:04,288 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:04,288 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:05:04,288 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:04,304 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:05:04,610 WARN L146 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 40 DAG size of output 34 [2018-02-04 12:05:05,297 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:05:05,297 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:05:05,297 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:05:05,302 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 12:05:05,319 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 12:05:05,320 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:05:05,322 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:05:05,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:05:05,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:05,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:05:05,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:05,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:05,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-02-04 12:05:05,396 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:05,397 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:05,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 12:05:05,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:05,407 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:05,407 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:05,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:05:05,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:05,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:05,414 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-02-04 12:05:05,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-02-04 12:05:05,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-02-04 12:05:05,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:05,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:05,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:05,474 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-02-04 12:05:05,506 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:05,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-02-04 12:05:05,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 12:05:05,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:05,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:05,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:05,532 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2018-02-04 12:05:05,791 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:05,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2018-02-04 12:05:05,795 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:05,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 41 [2018-02-04 12:05:05,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:05:05,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-02-04 12:05:05,808 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:05,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:05:05,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:05:05,824 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:67, output treesize:99 [2018-02-04 12:05:06,333 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:05:06,351 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:05:06,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 45 [2018-02-04 12:05:06,352 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 12:05:06,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 12:05:06,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1941, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 12:05:06,352 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 46 states. [2018-02-04 12:05:07,542 WARN L146 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 122 DAG size of output 95 [2018-02-04 12:05:07,884 WARN L146 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 87 DAG size of output 62 [2018-02-04 12:05:08,062 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 90 DAG size of output 64 [2018-02-04 12:05:09,135 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 93 DAG size of output 73 [2018-02-04 12:05:09,987 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 77 DAG size of output 75 [2018-02-04 12:05:10,181 WARN L146 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 87 DAG size of output 83 [2018-02-04 12:05:10,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:05:10,496 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-02-04 12:05:10,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 12:05:10,496 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2018-02-04 12:05:10,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:05:10,497 INFO L225 Difference]: With dead ends: 95 [2018-02-04 12:05:10,497 INFO L226 Difference]: Without dead ends: 95 [2018-02-04 12:05:10,498 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1462 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=577, Invalid=5585, Unknown=0, NotChecked=0, Total=6162 [2018-02-04 12:05:10,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-04 12:05:10,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 56. [2018-02-04 12:05:10,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 12:05:10,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-02-04 12:05:10,499 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 45 [2018-02-04 12:05:10,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:05:10,499 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-02-04 12:05:10,499 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-04 12:05:10,500 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-02-04 12:05:10,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 12:05:10,500 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:05:10,500 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-02-04 12:05:10,500 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:05:10,500 INFO L82 PathProgramCache]: Analyzing trace with hash -531401182, now seen corresponding path program 5 times [2018-02-04 12:05:10,500 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:05:10,500 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:05:10,501 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:10,501 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:05:10,501 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:10,507 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:05:11,112 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:05:11,112 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:05:11,112 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:05:11,118 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 12:05:11,138 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-02-04 12:05:11,138 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:05:11,141 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:05:11,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:05:11,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:11,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:05:11,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:11,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:11,159 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-02-04 12:05:11,200 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:11,200 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:11,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-02-04 12:05:11,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:11,210 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:11,211 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:11,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:05:11,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:11,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:11,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:19 [2018-02-04 12:05:11,527 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:05:11,546 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:05:11,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 36 [2018-02-04 12:05:11,546 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-04 12:05:11,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-04 12:05:11,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1217, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 12:05:11,547 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 37 states. [2018-02-04 12:05:12,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:05:12,351 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-02-04 12:05:12,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 12:05:12,352 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 46 [2018-02-04 12:05:12,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:05:12,352 INFO L225 Difference]: With dead ends: 84 [2018-02-04 12:05:12,352 INFO L226 Difference]: Without dead ends: 56 [2018-02-04 12:05:12,353 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 854 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=313, Invalid=2767, Unknown=0, NotChecked=0, Total=3080 [2018-02-04 12:05:12,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-04 12:05:12,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-02-04 12:05:12,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-04 12:05:12,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-02-04 12:05:12,354 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 46 [2018-02-04 12:05:12,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:05:12,354 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-02-04 12:05:12,354 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-04 12:05:12,354 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-02-04 12:05:12,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 12:05:12,354 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:05:12,354 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 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-02-04 12:05:12,354 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:05:12,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1629741512, now seen corresponding path program 6 times [2018-02-04 12:05:12,354 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:05:12,354 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:05:12,355 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:12,355 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:05:12,355 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:12,363 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:05:13,273 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:05:13,273 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:05:13,274 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:05:13,278 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-04 12:05:13,304 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-02-04 12:05:13,304 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:05:13,307 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:05:13,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:05:13,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:13,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:05:13,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:13,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:13,323 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-02-04 12:05:13,388 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:13,389 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:13,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 12:05:13,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:13,402 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:13,403 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:13,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:05:13,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:13,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:13,410 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-02-04 12:05:13,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-02-04 12:05:13,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-02-04 12:05:13,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:13,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:13,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:13,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-02-04 12:05:13,506 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:13,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-02-04 12:05:13,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-04 12:05:13,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:13,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:13,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:13,524 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2018-02-04 12:05:14,108 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:14,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2018-02-04 12:05:14,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 73 [2018-02-04 12:05:14,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 10 xjuncts. [2018-02-04 12:05:14,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-02-04 12:05:14,158 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:14,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:05:14,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:05:14,195 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:87, output treesize:331 [2018-02-04 12:05:14,807 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:05:14,826 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:05:14,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 48 [2018-02-04 12:05:14,826 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-04 12:05:14,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-04 12:05:14,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=2200, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 12:05:14,827 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 49 states. [2018-02-04 12:05:15,584 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 128 DAG size of output 76 [2018-02-04 12:05:15,773 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 135 DAG size of output 79 [2018-02-04 12:05:15,991 WARN L146 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 145 DAG size of output 87 [2018-02-04 12:05:16,182 WARN L146 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 149 DAG size of output 89 [2018-02-04 12:05:16,384 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 135 DAG size of output 85 [2018-02-04 12:05:16,581 WARN L146 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 139 DAG size of output 88 [2018-02-04 12:05:16,814 WARN L146 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 141 DAG size of output 91 [2018-02-04 12:05:17,128 WARN L146 SmtUtils]: Spent 220ms on a formula simplification. DAG size of input: 152 DAG size of output 111 [2018-02-04 12:05:17,855 WARN L146 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 110 DAG size of output 77 [2018-02-04 12:05:18,100 WARN L146 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 113 DAG size of output 80 [2018-02-04 12:05:18,344 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 125 DAG size of output 97 [2018-02-04 12:05:18,546 WARN L146 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 98 DAG size of output 72 [2018-02-04 12:05:18,874 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 104 DAG size of output 78 [2018-02-04 12:05:19,389 WARN L146 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 97 DAG size of output 75 [2018-02-04 12:05:19,596 WARN L146 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 66 DAG size of output 57 [2018-02-04 12:05:20,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:05:20,236 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2018-02-04 12:05:20,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-04 12:05:20,236 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2018-02-04 12:05:20,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:05:20,236 INFO L225 Difference]: With dead ends: 100 [2018-02-04 12:05:20,236 INFO L226 Difference]: Without dead ends: 100 [2018-02-04 12:05:20,237 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1576 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=571, Invalid=6071, Unknown=0, NotChecked=0, Total=6642 [2018-02-04 12:05:20,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-04 12:05:20,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 62. [2018-02-04 12:05:20,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 12:05:20,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-02-04 12:05:20,239 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 48 [2018-02-04 12:05:20,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:05:20,239 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-02-04 12:05:20,239 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-04 12:05:20,239 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-02-04 12:05:20,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 12:05:20,239 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:05:20,239 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:05:20,239 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:05:20,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1112645755, now seen corresponding path program 7 times [2018-02-04 12:05:20,239 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:05:20,240 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:05:20,240 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:20,240 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:05:20,240 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:20,245 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:05:20,668 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:05:20,669 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:05:20,669 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:05:20,673 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:05:20,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:20,689 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:05:20,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:05:20,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:20,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:05:20,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:20,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:20,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-02-04 12:05:20,737 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:20,738 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:20,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:05:20,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:20,744 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:20,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-02-04 12:05:20,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:20,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:20,750 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-02-04 12:05:21,083 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:05:21,099 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:05:21,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 43 [2018-02-04 12:05:21,099 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 12:05:21,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 12:05:21,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1727, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 12:05:21,100 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 44 states. [2018-02-04 12:05:22,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:05:22,118 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2018-02-04 12:05:22,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-04 12:05:22,118 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 49 [2018-02-04 12:05:22,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:05:22,119 INFO L225 Difference]: With dead ends: 90 [2018-02-04 12:05:22,119 INFO L226 Difference]: Without dead ends: 62 [2018-02-04 12:05:22,119 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1441 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=480, Invalid=4076, Unknown=0, NotChecked=0, Total=4556 [2018-02-04 12:05:22,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-04 12:05:22,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-02-04 12:05:22,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 12:05:22,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2018-02-04 12:05:22,120 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 49 [2018-02-04 12:05:22,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:05:22,120 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2018-02-04 12:05:22,120 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-04 12:05:22,120 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2018-02-04 12:05:22,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 12:05:22,121 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:05:22,121 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:05:22,121 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:05:22,121 INFO L82 PathProgramCache]: Analyzing trace with hash -892097662, now seen corresponding path program 8 times [2018-02-04 12:05:22,121 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:05:22,121 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:05:22,121 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:22,122 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:05:22,122 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:22,127 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:05:22,754 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:05:22,755 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:05:22,755 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:05:22,760 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:05:22,781 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:05:22,781 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:05:22,784 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:05:22,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:05:22,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:22,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:05:22,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:22,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:22,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-02-04 12:05:22,807 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:22,808 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:22,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:05:22,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:22,814 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:22,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 12:05:22,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:22,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:22,820 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-02-04 12:05:22,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-02-04 12:05:22,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-02-04 12:05:22,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:22,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:22,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:22,870 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-02-04 12:05:22,902 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:22,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-02-04 12:05:22,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-04 12:05:22,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:22,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:22,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:05:22,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:43 [2018-02-04 12:05:23,092 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:23,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-02-04 12:05:23,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-02-04 12:05:23,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:05:23,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-02-04 12:05:23,106 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:23,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:05:23,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:05:23,116 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:49, output treesize:47 [2018-02-04 12:05:23,634 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:05:23,653 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:05:23,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 46 [2018-02-04 12:05:23,653 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-02-04 12:05:23,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-02-04 12:05:23,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2008, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 12:05:23,654 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 47 states. [2018-02-04 12:05:24,420 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 100 DAG size of output 64 [2018-02-04 12:05:25,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:05:25,541 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2018-02-04 12:05:25,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-04 12:05:25,541 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 52 [2018-02-04 12:05:25,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:05:25,541 INFO L225 Difference]: With dead ends: 109 [2018-02-04 12:05:25,541 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 12:05:25,542 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1683 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=550, Invalid=5302, Unknown=0, NotChecked=0, Total=5852 [2018-02-04 12:05:25,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 12:05:25,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2018-02-04 12:05:25,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 12:05:25,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2018-02-04 12:05:25,543 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 52 [2018-02-04 12:05:25,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:05:25,543 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2018-02-04 12:05:25,543 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-02-04 12:05:25,543 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2018-02-04 12:05:25,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 12:05:25,543 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:05:25,543 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 7, 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-02-04 12:05:25,543 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:05:25,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1402192088, now seen corresponding path program 9 times [2018-02-04 12:05:25,544 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:05:25,544 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:05:25,544 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:25,544 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:05:25,544 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:05:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:05:25,557 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:05:25,918 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 91 DAG size of output 78 [2018-02-04 12:05:26,988 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:05:26,988 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:05:26,988 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:05:26,993 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 12:05:27,031 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-02-04 12:05:27,031 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:05:27,034 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:05:27,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:05:27,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:27,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:05:27,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:27,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:27,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-02-04 12:05:27,116 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:27,117 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:27,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 12:05:27,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:27,128 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:27,128 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:27,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:05:27,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:27,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:27,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-02-04 12:05:27,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-02-04 12:05:27,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-02-04 12:05:27,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:27,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:27,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:27,239 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-02-04 12:05:27,278 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:27,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-02-04 12:05:27,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-04 12:05:27,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:27,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:27,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:05:27,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2018-02-04 12:05:37,902 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:05:37,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 57 [2018-02-04 12:05:37,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-02-04 12:05:37,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:05:37,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 43 treesize of output 161 [2018-02-04 12:05:37,970 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2018-02-04 12:05:38,523 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1088 xjuncts. [2018-02-04 12:05:51,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:05:51,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:05:51,873 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:113, output treesize:1493 [2018-02-04 12:05:52,257 WARN L146 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 93 DAG size of output 32 [2018-02-04 12:05:52,906 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:05:52,924 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:05:52,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 55 [2018-02-04 12:05:52,924 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-04 12:05:52,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-04 12:05:52,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2896, Unknown=1, NotChecked=0, Total=3080 [2018-02-04 12:05:52,924 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 56 states. [2018-02-04 12:05:53,846 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 149 DAG size of output 78 [2018-02-04 12:05:54,087 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 156 DAG size of output 81 [2018-02-04 12:05:54,342 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 166 DAG size of output 92 [2018-02-04 12:05:54,585 WARN L146 SmtUtils]: Spent 161ms on a formula simplification. DAG size of input: 169 DAG size of output 94 [2018-02-04 12:05:54,813 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 152 DAG size of output 85 [2018-02-04 12:05:55,032 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 156 DAG size of output 87 [2018-02-04 12:05:55,280 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 165 DAG size of output 95 [2018-02-04 12:05:55,575 WARN L146 SmtUtils]: Spent 183ms on a formula simplification. DAG size of input: 169 DAG size of output 99 [2018-02-04 12:05:55,839 WARN L146 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 177 DAG size of output 102 [2018-02-04 12:05:56,109 WARN L146 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 181 DAG size of output 104 [2018-02-04 12:05:56,393 WARN L146 SmtUtils]: Spent 145ms on a formula simplification. DAG size of input: 186 DAG size of output 111 [2018-02-04 12:05:56,757 WARN L146 SmtUtils]: Spent 248ms on a formula simplification. DAG size of input: 199 DAG size of output 119 [2018-02-04 12:05:57,016 WARN L146 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 156 DAG size of output 97 [2018-02-04 12:05:57,266 WARN L146 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 159 DAG size of output 106 [2018-02-04 12:05:57,521 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 143 DAG size of output 93 [2018-02-04 12:05:57,787 WARN L146 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 146 DAG size of output 102 [2018-02-04 12:05:58,484 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 124 DAG size of output 82 [2018-02-04 12:06:00,373 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 67 DAG size of output 61 [2018-02-04 12:06:00,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:06:00,801 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2018-02-04 12:06:00,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-04 12:06:00,803 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 54 [2018-02-04 12:06:00,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:06:00,804 INFO L225 Difference]: With dead ends: 121 [2018-02-04 12:06:00,804 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 12:06:00,805 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2366 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=726, Invalid=9373, Unknown=1, NotChecked=0, Total=10100 [2018-02-04 12:06:00,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 12:06:00,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 77. [2018-02-04 12:06:00,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 12:06:00,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-02-04 12:06:00,806 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 54 [2018-02-04 12:06:00,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:06:00,807 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-02-04 12:06:00,807 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-04 12:06:00,807 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-02-04 12:06:00,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-04 12:06:00,807 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:06:00,807 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:06:00,807 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:06:00,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1441683682, now seen corresponding path program 10 times [2018-02-04 12:06:00,808 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:06:00,808 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:06:00,808 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:00,808 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:06:00,809 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:06:00,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:06:01,206 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 66 DAG size of output 55 [2018-02-04 12:06:01,359 WARN L146 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 60 DAG size of output 48 [2018-02-04 12:06:01,493 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 55 DAG size of output 44 [2018-02-04 12:06:02,632 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 3 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:06:02,632 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:06:02,633 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:06:02,638 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 12:06:02,659 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 12:06:02,659 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:06:02,662 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:06:02,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:06:02,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:02,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:06:02,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:02,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:02,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-02-04 12:06:02,791 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:02,792 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:02,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 12:06:02,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:02,801 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:02,802 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:02,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:06:02,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:02,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:02,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-02-04 12:06:02,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-02-04 12:06:02,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-02-04 12:06:02,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:02,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:02,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:02,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-02-04 12:06:02,931 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:02,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-02-04 12:06:02,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-04 12:06:02,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:02,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:02,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 12:06:02,949 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:43 [2018-02-04 12:06:03,459 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:03,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2018-02-04 12:06:03,462 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:03,463 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:03,464 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:03,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 73 [2018-02-04 12:06:03,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:06:03,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-02-04 12:06:03,488 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:03,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:06:03,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:06:03,510 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:78, output treesize:127 [2018-02-04 12:06:04,381 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:06:04,399 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:06:04,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30] total 56 [2018-02-04 12:06:04,400 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-02-04 12:06:04,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-02-04 12:06:04,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=3024, Unknown=0, NotChecked=0, Total=3192 [2018-02-04 12:06:04,400 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 57 states. [2018-02-04 12:06:06,066 WARN L146 SmtUtils]: Spent 147ms on a formula simplification. DAG size of input: 117 DAG size of output 80 [2018-02-04 12:06:06,383 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 112 DAG size of output 78 [2018-02-04 12:06:06,551 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 115 DAG size of output 81 [2018-02-04 12:06:07,943 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 69 DAG size of output 63 [2018-02-04 12:06:08,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:06:08,385 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-02-04 12:06:08,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-04 12:06:08,385 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 58 [2018-02-04 12:06:08,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:06:08,385 INFO L225 Difference]: With dead ends: 130 [2018-02-04 12:06:08,385 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 12:06:08,386 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2387 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=569, Invalid=7987, Unknown=0, NotChecked=0, Total=8556 [2018-02-04 12:06:08,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 12:06:08,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2018-02-04 12:06:08,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 12:06:08,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-02-04 12:06:08,388 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 58 [2018-02-04 12:06:08,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:06:08,388 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-02-04 12:06:08,388 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-02-04 12:06:08,388 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-02-04 12:06:08,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-04 12:06:08,389 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:06:08,389 INFO L351 BasicCegarLoop]: trace histogram [13, 13, 12, 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-02-04 12:06:08,389 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:06:08,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1976231361, now seen corresponding path program 11 times [2018-02-04 12:06:08,389 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:06:08,389 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:06:08,389 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:08,389 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:06:08,390 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:06:08,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:06:10,534 WARN L146 SmtUtils]: Spent 398ms on a formula simplification. DAG size of input: 168 DAG size of output 123 [2018-02-04 12:06:10,884 WARN L146 SmtUtils]: Spent 316ms on a formula simplification. DAG size of input: 162 DAG size of output 117 [2018-02-04 12:06:11,384 WARN L146 SmtUtils]: Spent 466ms on a formula simplification. DAG size of input: 207 DAG size of output 95 [2018-02-04 12:06:11,987 WARN L146 SmtUtils]: Spent 565ms on a formula simplification. DAG size of input: 208 DAG size of output 105 [2018-02-04 12:06:12,499 WARN L146 SmtUtils]: Spent 463ms on a formula simplification. DAG size of input: 233 DAG size of output 106 [2018-02-04 12:06:13,087 WARN L146 SmtUtils]: Spent 520ms on a formula simplification. DAG size of input: 236 DAG size of output 112 [2018-02-04 12:06:13,816 WARN L146 SmtUtils]: Spent 644ms on a formula simplification. DAG size of input: 204 DAG size of output 109 [2018-02-04 12:06:14,658 WARN L146 SmtUtils]: Spent 757ms on a formula simplification. DAG size of input: 207 DAG size of output 112 [2018-02-04 12:06:15,402 WARN L146 SmtUtils]: Spent 644ms on a formula simplification. DAG size of input: 193 DAG size of output 106 [2018-02-04 12:06:16,045 WARN L146 SmtUtils]: Spent 536ms on a formula simplification. DAG size of input: 196 DAG size of output 109 [2018-02-04 12:06:16,590 WARN L146 SmtUtils]: Spent 415ms on a formula simplification. DAG size of input: 184 DAG size of output 89 [2018-02-04 12:06:17,185 WARN L146 SmtUtils]: Spent 456ms on a formula simplification. DAG size of input: 187 DAG size of output 92 [2018-02-04 12:06:17,620 WARN L146 SmtUtils]: Spent 305ms on a formula simplification. DAG size of input: 177 DAG size of output 82 [2018-02-04 12:06:18,068 WARN L146 SmtUtils]: Spent 331ms on a formula simplification. DAG size of input: 180 DAG size of output 85 [2018-02-04 12:06:18,259 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 118 DAG size of output 58 [2018-02-04 12:06:18,453 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 121 DAG size of output 61 [2018-02-04 12:06:19,840 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 239 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:06:19,840 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:06:19,840 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-04 12:06:19,845 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 12:06:19,874 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-02-04 12:06:19,874 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:06:19,879 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:06:19,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:06:19,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:19,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:06:19,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:20,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:20,069 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-02-04 12:06:20,129 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:20,130 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:20,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-04 12:06:20,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:20,140 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:20,140 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:20,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:06:20,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:20,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:20,145 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-02-04 12:06:20,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-02-04 12:06:20,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-02-04 12:06:20,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:20,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:20,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:20,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-02-04 12:06:20,311 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:20,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-02-04 12:06:20,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-04 12:06:20,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:20,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:20,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:06:20,324 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2018-02-04 12:06:22,241 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:22,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 86 [2018-02-04 12:06:22,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-02-04 12:06:22,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:06:22,270 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:22,271 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:22,272 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:22,272 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:22,273 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:22,274 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:22,274 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:22,275 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:22,275 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:06:22,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 63 disjoint index pairs (out of 55 index pairs), introduced 9 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 187 [2018-02-04 12:06:22,305 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 12:06:22,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:06:22,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:06:22,391 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:127, output treesize:251 [2018-02-04 12:06:23,635 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 239 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:06:23,653 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:06:23,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38] total 74 [2018-02-04 12:06:23,653 INFO L409 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-02-04 12:06:23,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-02-04 12:06:23,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=5326, Unknown=0, NotChecked=0, Total=5550 [2018-02-04 12:06:23,654 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 75 states. [2018-02-04 12:06:25,161 WARN L146 SmtUtils]: Spent 251ms on a formula simplification. DAG size of input: 215 DAG size of output 125 [2018-02-04 12:06:25,568 WARN L146 SmtUtils]: Spent 243ms on a formula simplification. DAG size of input: 226 DAG size of output 127 [2018-02-04 12:06:26,026 WARN L146 SmtUtils]: Spent 262ms on a formula simplification. DAG size of input: 234 DAG size of output 139 [2018-02-04 12:06:26,444 WARN L146 SmtUtils]: Spent 264ms on a formula simplification. DAG size of input: 241 DAG size of output 142 [2018-02-04 12:06:27,049 WARN L146 SmtUtils]: Spent 389ms on a formula simplification. DAG size of input: 240 DAG size of output 147 [2018-02-04 12:06:27,628 WARN L146 SmtUtils]: Spent 424ms on a formula simplification. DAG size of input: 258 DAG size of output 144 [2018-02-04 12:06:28,107 WARN L146 SmtUtils]: Spent 267ms on a formula simplification. DAG size of input: 241 DAG size of output 145 [2018-02-04 12:06:28,618 WARN L146 SmtUtils]: Spent 358ms on a formula simplification. DAG size of input: 274 DAG size of output 139 [2018-02-04 12:06:29,076 WARN L146 SmtUtils]: Spent 244ms on a formula simplification. DAG size of input: 263 DAG size of output 138 [2018-02-04 12:06:29,605 WARN L146 SmtUtils]: Spent 351ms on a formula simplification. DAG size of input: 303 DAG size of output 134 [2018-02-04 12:06:30,082 WARN L146 SmtUtils]: Spent 247ms on a formula simplification. DAG size of input: 275 DAG size of output 133 [2018-02-04 12:06:30,629 WARN L146 SmtUtils]: Spent 375ms on a formula simplification. DAG size of input: 318 DAG size of output 131 [2018-02-04 12:06:31,065 WARN L146 SmtUtils]: Spent 242ms on a formula simplification. DAG size of input: 238 DAG size of output 131 [2018-02-04 12:06:31,551 WARN L146 SmtUtils]: Spent 342ms on a formula simplification. DAG size of input: 270 DAG size of output 129 [2018-02-04 12:06:32,053 WARN L146 SmtUtils]: Spent 331ms on a formula simplification. DAG size of input: 227 DAG size of output 157 [2018-02-04 12:06:32,741 WARN L146 SmtUtils]: Spent 553ms on a formula simplification. DAG size of input: 243 DAG size of output 133 [2018-02-04 12:06:33,196 WARN L146 SmtUtils]: Spent 274ms on a formula simplification. DAG size of input: 216 DAG size of output 150 [2018-02-04 12:06:33,696 WARN L146 SmtUtils]: Spent 355ms on a formula simplification. DAG size of input: 227 DAG size of output 136 [2018-02-04 12:06:34,155 WARN L146 SmtUtils]: Spent 279ms on a formula simplification. DAG size of input: 204 DAG size of output 149 [2018-02-04 12:06:34,673 WARN L146 SmtUtils]: Spent 361ms on a formula simplification. DAG size of input: 216 DAG size of output 140 [2018-02-04 12:06:35,060 WARN L146 SmtUtils]: Spent 231ms on a formula simplification. DAG size of input: 195 DAG size of output 148 [2018-02-04 12:06:35,621 WARN L146 SmtUtils]: Spent 415ms on a formula simplification. DAG size of input: 239 DAG size of output 152 [2018-02-04 12:06:36,125 WARN L146 SmtUtils]: Spent 334ms on a formula simplification. DAG size of input: 202 DAG size of output 143 [2018-02-04 12:06:36,472 WARN L146 SmtUtils]: Spent 191ms on a formula simplification. DAG size of input: 177 DAG size of output 132 [2018-02-04 12:06:37,029 WARN L146 SmtUtils]: Spent 391ms on a formula simplification. DAG size of input: 184 DAG size of output 126 [2018-02-04 12:06:37,415 WARN L146 SmtUtils]: Spent 224ms on a formula simplification. DAG size of input: 186 DAG size of output 134 [2018-02-04 12:06:37,767 WARN L146 SmtUtils]: Spent 204ms on a formula simplification. DAG size of input: 170 DAG size of output 126 [2018-02-04 12:06:38,413 WARN L146 SmtUtils]: Spent 230ms on a formula simplification. DAG size of input: 178 DAG size of output 126 [2018-02-04 12:06:38,736 WARN L146 SmtUtils]: Spent 197ms on a formula simplification. DAG size of input: 178 DAG size of output 127 [2018-02-04 12:06:39,227 WARN L146 SmtUtils]: Spent 236ms on a formula simplification. DAG size of input: 162 DAG size of output 151 [2018-02-04 12:06:39,721 WARN L146 SmtUtils]: Spent 218ms on a formula simplification. DAG size of input: 180 DAG size of output 127 [2018-02-04 12:06:40,287 WARN L146 SmtUtils]: Spent 180ms on a formula simplification. DAG size of input: 117 DAG size of output 116 [2018-02-04 12:06:40,756 WARN L146 SmtUtils]: Spent 248ms on a formula simplification. DAG size of input: 164 DAG size of output 151 [2018-02-04 12:06:41,229 WARN L146 SmtUtils]: Spent 189ms on a formula simplification. DAG size of input: 122 DAG size of output 121 [2018-02-04 12:06:41,575 WARN L146 SmtUtils]: Spent 227ms on a formula simplification. DAG size of input: 153 DAG size of output 144 [2018-02-04 12:06:41,997 WARN L146 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 112 DAG size of output 107 [2018-02-04 12:06:42,393 WARN L146 SmtUtils]: Spent 257ms on a formula simplification. DAG size of input: 191 DAG size of output 154 [2018-02-04 12:06:42,826 WARN L146 SmtUtils]: Spent 294ms on a formula simplification. DAG size of input: 203 DAG size of output 164 [2018-02-04 12:06:43,265 WARN L146 SmtUtils]: Spent 285ms on a formula simplification. DAG size of input: 201 DAG size of output 160 [2018-02-04 12:06:43,694 WARN L146 SmtUtils]: Spent 257ms on a formula simplification. DAG size of input: 168 DAG size of output 155 [2018-02-04 12:06:43,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:06:43,786 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2018-02-04 12:06:43,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-04 12:06:43,787 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 69 [2018-02-04 12:06:43,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:06:43,787 INFO L225 Difference]: With dead ends: 119 [2018-02-04 12:06:43,787 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 12:06:43,788 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3951 ImplicationChecksByTransitivity, 30.0s TimeCoverageRelationStatistics Valid=1012, Invalid=14488, Unknown=0, NotChecked=0, Total=15500 [2018-02-04 12:06:43,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 12:06:43,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 80. [2018-02-04 12:06:43,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 12:06:43,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2018-02-04 12:06:43,790 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 69 [2018-02-04 12:06:43,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:06:43,790 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2018-02-04 12:06:43,790 INFO L433 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-02-04 12:06:43,790 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2018-02-04 12:06:43,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-04 12:06:43,790 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:06:43,790 INFO L351 BasicCegarLoop]: trace histogram [11, 11, 10, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:06:43,790 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-04 12:06:43,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1031070814, now seen corresponding path program 12 times [2018-02-04 12:06:43,791 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:06:43,791 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:06:43,791 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:43,791 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:06:43,791 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:06:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:06:43,808 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:06:44,998 WARN L146 SmtUtils]: Spent 432ms on a formula simplification. DAG size of input: 138 DAG size of output 89 [2018-02-04 12:06:45,322 WARN L146 SmtUtils]: Spent 304ms on a formula simplification. DAG size of input: 132 DAG size of output 83 [2018-02-04 12:06:45,642 WARN L146 SmtUtils]: Spent 303ms on a formula simplification. DAG size of input: 117 DAG size of output 71 [2018-02-04 12:06:45,948 WARN L146 SmtUtils]: Spent 288ms on a formula simplification. DAG size of input: 117 DAG size of output 71 [2018-02-04 12:06:46,254 WARN L146 SmtUtils]: Spent 284ms on a formula simplification. DAG size of input: 117 DAG size of output 71 [2018-02-04 12:06:46,499 WARN L146 SmtUtils]: Spent 213ms on a formula simplification. DAG size of input: 103 DAG size of output 70 Received shutdown request... [2018-02-04 12:06:46,656 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 12:06:46,659 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 12:06:46,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:06:46 BoogieIcfgContainer [2018-02-04 12:06:46,660 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 12:06:46,660 INFO L168 Benchmark]: Toolchain (without parser) took 197394.58 ms. Allocated memory was 401.1 MB in the beginning and 790.6 MB in the end (delta: 389.5 MB). Free memory was 354.9 MB in the beginning and 594.4 MB in the end (delta: -239.5 MB). Peak memory consumption was 150.0 MB. Max. memory is 5.3 GB. [2018-02-04 12:06:46,661 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 401.1 MB. Free memory is still 360.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 12:06:46,661 INFO L168 Benchmark]: CACSL2BoogieTranslator took 178.97 ms. Allocated memory is still 401.1 MB. Free memory was 354.9 MB in the beginning and 344.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 12:06:46,661 INFO L168 Benchmark]: Boogie Preprocessor took 32.14 ms. Allocated memory is still 401.1 MB. Free memory was 344.3 MB in the beginning and 341.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 12:06:46,662 INFO L168 Benchmark]: RCFGBuilder took 251.89 ms. Allocated memory is still 401.1 MB. Free memory was 341.7 MB in the beginning and 319.2 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. [2018-02-04 12:06:46,662 INFO L168 Benchmark]: TraceAbstraction took 196928.04 ms. Allocated memory was 401.1 MB in the beginning and 790.6 MB in the end (delta: 389.5 MB). Free memory was 319.2 MB in the beginning and 594.4 MB in the end (delta: -275.2 MB). Peak memory consumption was 114.3 MB. Max. memory is 5.3 GB. [2018-02-04 12:06:46,663 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 401.1 MB. Free memory is still 360.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 178.97 ms. Allocated memory is still 401.1 MB. Free memory was 354.9 MB in the beginning and 344.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.14 ms. Allocated memory is still 401.1 MB. Free memory was 344.3 MB in the beginning and 341.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 251.89 ms. Allocated memory is still 401.1 MB. Free memory was 341.7 MB in the beginning and 319.2 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 196928.04 ms. Allocated memory was 401.1 MB in the beginning and 790.6 MB in the end (delta: 389.5 MB). Free memory was 319.2 MB in the beginning and 594.4 MB in the end (delta: -275.2 MB). Peak memory consumption was 114.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 11, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 106. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 11, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 106. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 11, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 106. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 11, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 106. - TimeoutResultAtElement [Line: 553]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 11, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 106. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 11, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 106. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 11, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 106. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 11, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 106. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 11, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 106. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 11, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 106. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 11, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 106. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 11, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 106. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 11, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 106. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 11, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 106. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 71 with TraceHistMax 11, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 106. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 58 locations, 15 error locations. TIMEOUT Result, 196.8s OverallTime, 34 OverallIterations, 13 TraceHistogramMax, 127.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1180 SDtfs, 4255 SDslu, 12306 SDs, 0 SdLazy, 18148 SolverSat, 1413 SolverUnsat, 11 SolverUnknown, 0 SolverNotchecked, 35.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1907 GetRequests, 563 SyntacticMatches, 11 SemanticMatches, 1333 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23023 ImplicationChecksByTransitivity, 135.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=14, 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.0s AutomataMinimizationTime, 33 MinimizatonAttempts, 495 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 65.0s InterpolantComputationTime, 2049 NumberOfCodeBlocks, 2047 NumberOfCodeBlocksAsserted, 87 NumberOfCheckSat, 1995 ConstructedInterpolants, 190 QuantifiedInterpolants, 2622964 SizeOfPredicates, 356 NumberOfNonLiveVariables, 4097 ConjunctsInSsa, 1354 ConjunctsInUnsatCore, 54 InterpolantComputations, 12 PerfectInterpolantSequences, 26/1532 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_12-06-46-669.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_12-06-46-669.csv Completed graceful shutdown