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-ccafca9-m [2018-02-03 22:47:38,421 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-03 22:47:38,423 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-03 22:47:38,435 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-03 22:47:38,435 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-03 22:47:38,435 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-03 22:47:38,436 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-03 22:47:38,438 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-03 22:47:38,440 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-03 22:47:38,440 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-03 22:47:38,441 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-03 22:47:38,442 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-03 22:47:38,442 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-03 22:47:38,444 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-03 22:47:38,444 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-03 22:47:38,446 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-03 22:47:38,448 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-03 22:47:38,449 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-03 22:47:38,450 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-03 22:47:38,451 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-03 22:47:38,453 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-03 22:47:38,453 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-03 22:47:38,454 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-03 22:47:38,455 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-03 22:47:38,455 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-03 22:47:38,456 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-03 22:47:38,456 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-03 22:47:38,457 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-03 22:47:38,457 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-03 22:47:38,457 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-03 22:47:38,458 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-03 22:47:38,458 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-03 22:47:38,471 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-03 22:47:38,472 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-03 22:47:38,473 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-03 22:47:38,473 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-03 22:47:38,473 INFO L133 SettingsManager]: * Use SBE=true [2018-02-03 22:47:38,473 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-03 22:47:38,473 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-03 22:47:38,474 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-03 22:47:38,474 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-03 22:47:38,474 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-03 22:47:38,474 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-03 22:47:38,474 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-03 22:47:38,474 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-03 22:47:38,475 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-03 22:47:38,475 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-03 22:47:38,475 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-03 22:47:38,475 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-03 22:47:38,475 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-03 22:47:38,475 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-03 22:47:38,475 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-03 22:47:38,476 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-03 22:47:38,476 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-03 22:47:38,476 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-03 22:47:38,476 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-03 22:47:38,476 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-03 22:47:38,518 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-03 22:47:38,530 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-03 22:47:38,535 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-03 22:47:38,536 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-03 22:47:38,537 INFO L276 PluginConnector]: CDTParser initialized [2018-02-03 22:47:38,537 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-03 22:47:38,669 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-03 22:47:38,671 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-03 22:47:38,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-03 22:47:38,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-03 22:47:38,677 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-03 22:47:38,678 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 10:47:38" (1/1) ... [2018-02-03 22:47:38,681 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33a17581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:38, skipping insertion in model container [2018-02-03 22:47:38,681 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 10:47:38" (1/1) ... [2018-02-03 22:47:38,693 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 22:47:38,726 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 22:47:38,808 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 22:47:38,820 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 22:47:38,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:38 WrapperNode [2018-02-03 22:47:38,824 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-03 22:47:38,825 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-03 22:47:38,825 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-03 22:47:38,825 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-03 22:47:38,833 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:38" (1/1) ... [2018-02-03 22:47:38,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:38" (1/1) ... [2018-02-03 22:47:38,839 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:38" (1/1) ... [2018-02-03 22:47:38,839 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:38" (1/1) ... [2018-02-03 22:47:38,842 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:38" (1/1) ... [2018-02-03 22:47:38,844 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:38" (1/1) ... [2018-02-03 22:47:38,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:38" (1/1) ... [2018-02-03 22:47:38,847 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-03 22:47:38,847 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-03 22:47:38,848 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-03 22:47:38,848 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-03 22:47:38,849 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:38" (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-03 22:47:38,884 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-03 22:47:38,884 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-03 22:47:38,885 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncat [2018-02-03 22:47:38,885 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-03 22:47:38,885 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-03 22:47:38,885 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-03 22:47:38,885 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-03 22:47:38,885 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-03 22:47:38,885 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-03 22:47:38,885 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-03 22:47:38,885 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncat [2018-02-03 22:47:38,885 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-03 22:47:38,885 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-03 22:47:38,885 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-03 22:47:39,122 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-03 22:47:39,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 10:47:39 BoogieIcfgContainer [2018-02-03 22:47:39,122 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-03 22:47:39,123 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-03 22:47:39,123 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-03 22:47:39,125 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-03 22:47:39,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.02 10:47:38" (1/3) ... [2018-02-03 22:47:39,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b401637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 10:47:39, skipping insertion in model container [2018-02-03 22:47:39,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:38" (2/3) ... [2018-02-03 22:47:39,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b401637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 10:47:39, skipping insertion in model container [2018-02-03 22:47:39,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 10:47:39" (3/3) ... [2018-02-03 22:47:39,128 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-02-03 22:47:39,134 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-03 22:47:39,139 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-03 22:47:39,170 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-03 22:47:39,170 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-03 22:47:39,170 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-03 22:47:39,170 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-03 22:47:39,170 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-03 22:47:39,170 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-03 22:47:39,171 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-03 22:47:39,171 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-03 22:47:39,172 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-03 22:47:39,187 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-02-03 22:47:39,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-03 22:47:39,198 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:39,202 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:39,202 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:47:39,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1927484354, now seen corresponding path program 1 times [2018-02-03 22:47:39,209 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:39,210 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:39,255 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:39,255 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:39,255 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:39,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:39,369 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-03 22:47:39,375 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:39,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-03 22:47:39,377 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-03 22:47:39,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-03 22:47:39,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 22:47:39,387 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 3 states. [2018-02-03 22:47:39,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:39,459 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2018-02-03 22:47:39,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-03 22:47:39,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-02-03 22:47:39,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:39,525 INFO L225 Difference]: With dead ends: 59 [2018-02-03 22:47:39,526 INFO L226 Difference]: Without dead ends: 55 [2018-02-03 22:47:39,527 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-03 22:47:39,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-03 22:47:39,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-02-03 22:47:39,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-03 22:47:39,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-02-03 22:47:39,553 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 11 [2018-02-03 22:47:39,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:39,554 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-02-03 22:47:39,554 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-03 22:47:39,554 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-02-03 22:47:39,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-03 22:47:39,554 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:39,554 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:39,554 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:47:39,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1621249811, now seen corresponding path program 1 times [2018-02-03 22:47:39,555 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:39,555 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:39,555 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:39,556 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:39,556 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:39,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:39,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:39,605 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-03 22:47:39,605 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:39,605 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:47:39,606 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 22:47:39,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 22:47:39,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:47:39,607 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 5 states. [2018-02-03 22:47:39,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:39,684 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-02-03 22:47:39,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 22:47:39,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-03 22:47:39,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:39,686 INFO L225 Difference]: With dead ends: 58 [2018-02-03 22:47:39,686 INFO L226 Difference]: Without dead ends: 55 [2018-02-03 22:47:39,687 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-03 22:47:39,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-03 22:47:39,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-02-03 22:47:39,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-03 22:47:39,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-02-03 22:47:39,692 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 15 [2018-02-03 22:47:39,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:39,692 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-02-03 22:47:39,692 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 22:47:39,692 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-02-03 22:47:39,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-03 22:47:39,693 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:39,693 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:39,693 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:47:39,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1993659115, now seen corresponding path program 1 times [2018-02-03 22:47:39,693 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:39,693 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:39,694 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:39,694 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:39,695 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:39,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:39,713 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:39,761 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-03 22:47:39,761 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:39,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 22:47:39,762 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 22:47:39,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 22:47:39,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 22:47:39,762 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 4 states. [2018-02-03 22:47:39,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:39,819 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-02-03 22:47:39,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 22:47:39,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-03 22:47:39,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:39,820 INFO L225 Difference]: With dead ends: 54 [2018-02-03 22:47:39,820 INFO L226 Difference]: Without dead ends: 54 [2018-02-03 22:47:39,821 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-03 22:47:39,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-03 22:47:39,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-03 22:47:39,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-03 22:47:39,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-02-03 22:47:39,823 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 15 [2018-02-03 22:47:39,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:39,823 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-02-03 22:47:39,823 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 22:47:39,824 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-02-03 22:47:39,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-03 22:47:39,826 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:39,826 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:39,826 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:47:39,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1993659114, now seen corresponding path program 1 times [2018-02-03 22:47:39,826 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:39,826 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:39,827 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:39,827 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:39,827 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:39,840 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:39,951 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-03 22:47:39,951 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:39,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-03 22:47:39,951 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 22:47:39,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 22:47:39,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:47:39,952 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 8 states. [2018-02-03 22:47:40,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:40,018 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-02-03 22:47:40,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 22:47:40,018 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-02-03 22:47:40,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:40,018 INFO L225 Difference]: With dead ends: 53 [2018-02-03 22:47:40,018 INFO L226 Difference]: Without dead ends: 53 [2018-02-03 22:47:40,019 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-02-03 22:47:40,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-03 22:47:40,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-03 22:47:40,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-03 22:47:40,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-02-03 22:47:40,022 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 15 [2018-02-03 22:47:40,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:40,022 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-02-03 22:47:40,022 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 22:47:40,022 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-02-03 22:47:40,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-03 22:47:40,022 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:40,022 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:40,022 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:47:40,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1673890416, now seen corresponding path program 1 times [2018-02-03 22:47:40,023 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:40,023 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:40,023 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:40,023 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:40,023 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:40,035 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:40,060 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-03 22:47:40,060 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:40,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 22:47:40,060 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 22:47:40,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 22:47:40,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 22:47:40,060 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 4 states. [2018-02-03 22:47:40,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:40,090 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-02-03 22:47:40,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 22:47:40,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-03 22:47:40,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:40,091 INFO L225 Difference]: With dead ends: 52 [2018-02-03 22:47:40,091 INFO L226 Difference]: Without dead ends: 52 [2018-02-03 22:47:40,091 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-03 22:47:40,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-03 22:47:40,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-03 22:47:40,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-03 22:47:40,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-02-03 22:47:40,094 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 16 [2018-02-03 22:47:40,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:40,094 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-02-03 22:47:40,094 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 22:47:40,094 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-02-03 22:47:40,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-03 22:47:40,094 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:40,094 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:40,095 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:47:40,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1673890415, now seen corresponding path program 1 times [2018-02-03 22:47:40,095 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:40,095 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:40,095 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:40,095 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:40,096 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:40,103 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:40,153 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-03 22:47:40,153 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:40,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 22:47:40,154 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 22:47:40,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 22:47:40,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:47:40,154 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-02-03 22:47:40,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:40,175 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-02-03 22:47:40,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:47:40,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-03 22:47:40,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:40,176 INFO L225 Difference]: With dead ends: 51 [2018-02-03 22:47:40,176 INFO L226 Difference]: Without dead ends: 51 [2018-02-03 22:47:40,176 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-03 22:47:40,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-03 22:47:40,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-03 22:47:40,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-03 22:47:40,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-02-03 22:47:40,179 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 16 [2018-02-03 22:47:40,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:40,179 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-02-03 22:47:40,179 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 22:47:40,179 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-02-03 22:47:40,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-03 22:47:40,179 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:40,179 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-03 22:47:40,179 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:47:40,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1745382581, now seen corresponding path program 1 times [2018-02-03 22:47:40,179 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:40,180 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:40,180 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:40,180 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:40,180 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:40,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:40,215 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-03 22:47:40,215 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:40,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 22:47:40,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 22:47:40,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 22:47:40,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:47:40,216 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 5 states. [2018-02-03 22:47:40,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:40,254 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-02-03 22:47:40,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 22:47:40,255 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-03 22:47:40,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:40,255 INFO L225 Difference]: With dead ends: 47 [2018-02-03 22:47:40,255 INFO L226 Difference]: Without dead ends: 47 [2018-02-03 22:47:40,256 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-03 22:47:40,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-03 22:47:40,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-03 22:47:40,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-03 22:47:40,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-02-03 22:47:40,258 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 20 [2018-02-03 22:47:40,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:40,258 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-02-03 22:47:40,258 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 22:47:40,258 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-02-03 22:47:40,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-03 22:47:40,258 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:40,258 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-03 22:47:40,258 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:47:40,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1745382582, now seen corresponding path program 1 times [2018-02-03 22:47:40,259 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:40,259 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:40,259 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:40,259 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:40,260 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:40,269 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:40,355 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-03 22:47:40,356 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:40,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 22:47:40,356 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 22:47:40,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 22:47:40,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-03 22:47:40,357 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 9 states. [2018-02-03 22:47:40,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:40,514 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2018-02-03 22:47:40,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-03 22:47:40,514 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-02-03 22:47:40,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:40,516 INFO L225 Difference]: With dead ends: 65 [2018-02-03 22:47:40,516 INFO L226 Difference]: Without dead ends: 65 [2018-02-03 22:47:40,517 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-02-03 22:47:40,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-03 22:47:40,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2018-02-03 22:47:40,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-03 22:47:40,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2018-02-03 22:47:40,521 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 20 [2018-02-03 22:47:40,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:40,522 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2018-02-03 22:47:40,522 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 22:47:40,522 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2018-02-03 22:47:40,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-03 22:47:40,522 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:40,522 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-03 22:47:40,523 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:47:40,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1818413707, now seen corresponding path program 1 times [2018-02-03 22:47:40,523 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:40,523 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:40,524 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:40,524 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:40,524 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:40,536 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:40,655 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-03 22:47:40,655 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:47:40,655 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-03 22:47:40,662 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:40,685 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:47:40,740 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-03 22:47:40,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:40,751 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-03 22:47:40,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:40,759 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-03 22:47:40,760 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-02-03 22:47:40,806 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:47:40,807 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:47:40,809 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-03 22:47:40,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:40,818 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:47:40,819 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:47:40,820 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-03 22:47:40,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:40,825 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-03 22:47:40,826 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:18 [2018-02-03 22:47:40,950 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-03 22:47:40,969 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:47:40,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2018-02-03 22:47:40,969 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-03 22:47:40,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-03 22:47:40,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-02-03 22:47:40,970 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand 22 states. [2018-02-03 22:47:41,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:41,417 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2018-02-03 22:47:41,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-03 22:47:41,417 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 23 [2018-02-03 22:47:41,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:41,418 INFO L225 Difference]: With dead ends: 83 [2018-02-03 22:47:41,418 INFO L226 Difference]: Without dead ends: 83 [2018-02-03 22:47:41,419 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-03 22:47:41,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-03 22:47:41,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 70. [2018-02-03 22:47:41,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-03 22:47:41,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2018-02-03 22:47:41,422 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 23 [2018-02-03 22:47:41,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:41,423 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2018-02-03 22:47:41,423 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-03 22:47:41,423 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2018-02-03 22:47:41,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-03 22:47:41,424 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:41,424 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-03 22:47:41,424 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:47:41,424 INFO L82 PathProgramCache]: Analyzing trace with hash -557502487, now seen corresponding path program 1 times [2018-02-03 22:47:41,425 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:41,425 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:41,426 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:41,426 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:41,426 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:41,435 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:41,461 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-03 22:47:41,461 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:41,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:47:41,462 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:47:41,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:47:41,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:47:41,462 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand 6 states. [2018-02-03 22:47:41,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:41,503 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2018-02-03 22:47:41,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:47:41,504 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-03 22:47:41,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:41,506 INFO L225 Difference]: With dead ends: 72 [2018-02-03 22:47:41,506 INFO L226 Difference]: Without dead ends: 72 [2018-02-03 22:47:41,511 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-03 22:47:41,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-03 22:47:41,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2018-02-03 22:47:41,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-02-03 22:47:41,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2018-02-03 22:47:41,516 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 83 transitions. Word has length 25 [2018-02-03 22:47:41,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:41,516 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 83 transitions. [2018-02-03 22:47:41,517 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:47:41,517 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2018-02-03 22:47:41,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-03 22:47:41,517 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:41,517 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-03 22:47:41,518 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:47:41,518 INFO L82 PathProgramCache]: Analyzing trace with hash -557502486, now seen corresponding path program 1 times [2018-02-03 22:47:41,518 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:41,518 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:41,519 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:41,519 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:41,519 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:41,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:41,652 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-03 22:47:41,653 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:41,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 22:47:41,653 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 22:47:41,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 22:47:41,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-03 22:47:41,653 INFO L87 Difference]: Start difference. First operand 69 states and 83 transitions. Second operand 9 states. [2018-02-03 22:47:41,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:41,729 INFO L93 Difference]: Finished difference Result 98 states and 120 transitions. [2018-02-03 22:47:41,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-03 22:47:41,729 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-02-03 22:47:41,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:41,729 INFO L225 Difference]: With dead ends: 98 [2018-02-03 22:47:41,729 INFO L226 Difference]: Without dead ends: 98 [2018-02-03 22:47:41,730 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-02-03 22:47:41,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-02-03 22:47:41,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 80. [2018-02-03 22:47:41,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-03 22:47:41,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 98 transitions. [2018-02-03 22:47:41,733 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 98 transitions. Word has length 25 [2018-02-03 22:47:41,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:41,733 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 98 transitions. [2018-02-03 22:47:41,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 22:47:41,733 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2018-02-03 22:47:41,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-03 22:47:41,733 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:41,733 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-03 22:47:41,733 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:47:41,734 INFO L82 PathProgramCache]: Analyzing trace with hash -59760490, now seen corresponding path program 2 times [2018-02-03 22:47:41,734 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:41,734 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:41,734 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:41,734 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:41,734 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:41,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:41,751 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:41,966 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-03 22:47:41,966 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:47:41,966 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-03 22:47:41,972 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:47:41,988 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 22:47:41,988 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:47:41,990 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:47:42,012 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-03 22:47:42,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:42,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:42,015 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-02-03 22:47:42,046 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:47:42,046 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:47:42,047 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-03 22:47:42,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:42,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:42,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:16 [2018-02-03 22:47:42,097 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-03 22:47:42,099 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-03 22:47:42,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:42,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:42,109 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-03 22:47:42,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:38 [2018-02-03 22:47:42,142 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-03 22:47:42,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 11 treesize of output 10 [2018-02-03 22:47:42,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:42,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:42,155 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-03 22:47:42,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:52, output treesize:48 [2018-02-03 22:47:44,321 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-03 22:47:44,324 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-03 22:47:44,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:44,330 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:47:44,336 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-03 22:47:44,337 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-03 22:47:44,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:47:44,357 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-03 22:47:44,358 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:66, output treesize:43 [2018-02-03 22:47:44,410 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-03 22:47:44,429 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:47:44,429 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 25 [2018-02-03 22:47:44,429 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-03 22:47:44,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-03 22:47:44,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=586, Unknown=1, NotChecked=0, Total=650 [2018-02-03 22:47:44,430 INFO L87 Difference]: Start difference. First operand 80 states and 98 transitions. Second operand 26 states. [2018-02-03 22:47:45,052 WARN L146 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 60 DAG size of output 58 [2018-02-03 22:47:49,855 WARN L146 SmtUtils]: Spent 611ms on a formula simplification. DAG size of input: 49 DAG size of output 48 [2018-02-03 22:47:53,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:53,105 INFO L93 Difference]: Finished difference Result 187 states and 226 transitions. [2018-02-03 22:47:53,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-03 22:47:53,105 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-02-03 22:47:53,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:53,106 INFO L225 Difference]: With dead ends: 187 [2018-02-03 22:47:53,106 INFO L226 Difference]: Without dead ends: 187 [2018-02-03 22:47:53,107 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=337, Invalid=2013, Unknown=2, NotChecked=0, Total=2352 [2018-02-03 22:47:53,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-03 22:47:53,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 83. [2018-02-03 22:47:53,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-03 22:47:53,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2018-02-03 22:47:53,112 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 102 transitions. Word has length 26 [2018-02-03 22:47:53,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:53,112 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 102 transitions. [2018-02-03 22:47:53,112 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-03 22:47:53,112 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 102 transitions. [2018-02-03 22:47:53,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-03 22:47:53,112 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:53,113 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:53,113 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:47:53,113 INFO L82 PathProgramCache]: Analyzing trace with hash 2086668971, now seen corresponding path program 3 times [2018-02-03 22:47:53,113 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:53,113 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:53,114 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:53,114 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:47:53,114 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:53,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:53,125 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:53,479 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-03 22:47:53,479 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:47:53,479 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-03 22:47:53,494 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-03 22:47:53,527 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-03 22:47:53,527 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:47:53,531 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:47:53,542 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-03 22:47:53,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:53,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:53,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-02-03 22:47:53,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-02-03 22:47:53,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-02-03 22:47:53,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:47:53,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:45 [2018-02-03 22:47:53,672 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 33 treesize of output 30 [2018-02-03 22:47:53,674 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-03 22:47:53,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:53,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:53,698 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 34 treesize of output 31 [2018-02-03 22:47:53,699 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-03 22:47:53,700 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:53,706 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:53,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-02-03 22:47:53,721 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:68, output treesize:60 [2018-02-03 22:47:53,758 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 41 treesize of output 36 [2018-02-03 22:47:53,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 24 treesize of output 25 [2018-02-03 22:47:53,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:53,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:53,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 55 [2018-02-03 22:47:53,799 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:47:53,800 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 41 treesize of output 58 [2018-02-03 22:47:53,800 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:53,833 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 40 treesize of output 39 [2018-02-03 22:47:53,833 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:53,846 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:53,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-03 22:47:53,860 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:85, output treesize:77 [2018-02-03 22:47:54,183 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 64 treesize of output 56 [2018-02-03 22:47:54,187 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:47:54,197 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 59 [2018-02-03 22:47:54,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:47:54,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:47:54,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 66 [2018-02-03 22:47:54,260 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:47:54,265 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 62 treesize of output 75 [2018-02-03 22:47:54,266 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-03 22:47:54,305 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 61 treesize of output 51 [2018-02-03 22:47:54,306 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:54,307 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 53 treesize of output 43 [2018-02-03 22:47:54,308 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:54,347 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:47:54,356 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 85 [2018-02-03 22:47:54,357 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-02-03 22:47:54,387 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:47:54,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-02-03 22:47:54,433 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 8 variables, input treesize:131, output treesize:106 [2018-02-03 22:47:54,524 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-03 22:47:54,543 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:47:54,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2018-02-03 22:47:54,543 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-03 22:47:54,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-03 22:47:54,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2018-02-03 22:47:54,544 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. Second operand 26 states. [2018-02-03 22:47:55,967 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 88 DAG size of output 73 [2018-02-03 22:47:56,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:56,693 INFO L93 Difference]: Finished difference Result 243 states and 298 transitions. [2018-02-03 22:47:56,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-03 22:47:56,693 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 29 [2018-02-03 22:47:56,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:56,695 INFO L225 Difference]: With dead ends: 243 [2018-02-03 22:47:56,695 INFO L226 Difference]: Without dead ends: 243 [2018-02-03 22:47:56,696 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=341, Invalid=2415, Unknown=0, NotChecked=0, Total=2756 [2018-02-03 22:47:56,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-03 22:47:56,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 163. [2018-02-03 22:47:56,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-03 22:47:56,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 211 transitions. [2018-02-03 22:47:56,703 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 211 transitions. Word has length 29 [2018-02-03 22:47:56,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:56,704 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 211 transitions. [2018-02-03 22:47:56,704 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-03 22:47:56,704 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 211 transitions. [2018-02-03 22:47:56,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-03 22:47:56,705 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:56,706 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:56,706 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:47:56,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1785596499, now seen corresponding path program 1 times [2018-02-03 22:47:56,706 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:56,706 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:56,707 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:56,707 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:47:56,707 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:56,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:56,721 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:57,152 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-03 22:47:57,152 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:47:57,152 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-03 22:47:57,159 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:57,179 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:47:57,252 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-03 22:47:57,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:57,262 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-03 22:47:57,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:57,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:57,276 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-02-03 22:47:57,312 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:47:57,313 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:47:57,313 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-03 22:47:57,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:57,321 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:47:57,321 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-03 22:47:57,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:57,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:57,329 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-02-03 22:47:57,370 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-03 22:47:57,372 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-03 22:47:57,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:57,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:57,384 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-03 22:47:57,385 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-02-03 22:47:57,418 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:47:57,421 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-03 22:47:57,423 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-03 22:47:57,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:57,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:57,433 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-03 22:47:57,433 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:48 [2018-02-03 22:47:57,616 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:47:57,617 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 45 treesize of output 41 [2018-02-03 22:47:57,618 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-03 22:47:57,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:57,626 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:47:57,630 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-03 22:47:57,630 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-03 22:47:57,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:47:57,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-03 22:47:57,653 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:73, output treesize:122 [2018-02-03 22:47:57,795 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-03 22:47:57,813 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:47:57,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 31 [2018-02-03 22:47:57,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-03 22:47:57,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-03 22:47:57,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=885, Unknown=0, NotChecked=0, Total=992 [2018-02-03 22:47:57,814 INFO L87 Difference]: Start difference. First operand 163 states and 211 transitions. Second operand 32 states. [2018-02-03 22:47:59,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:59,226 INFO L93 Difference]: Finished difference Result 391 states and 485 transitions. [2018-02-03 22:47:59,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-03 22:47:59,226 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 29 [2018-02-03 22:47:59,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:59,228 INFO L225 Difference]: With dead ends: 391 [2018-02-03 22:47:59,228 INFO L226 Difference]: Without dead ends: 391 [2018-02-03 22:47:59,229 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 769 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=405, Invalid=2901, Unknown=0, NotChecked=0, Total=3306 [2018-02-03 22:47:59,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-02-03 22:47:59,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 191. [2018-02-03 22:47:59,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-03 22:47:59,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 248 transitions. [2018-02-03 22:47:59,238 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 248 transitions. Word has length 29 [2018-02-03 22:47:59,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:59,239 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 248 transitions. [2018-02-03 22:47:59,239 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-03 22:47:59,239 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 248 transitions. [2018-02-03 22:47:59,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-03 22:47:59,240 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:59,240 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-03 22:47:59,240 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:47:59,240 INFO L82 PathProgramCache]: Analyzing trace with hash 933708271, now seen corresponding path program 1 times [2018-02-03 22:47:59,240 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:59,240 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:59,241 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:59,241 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:59,241 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:59,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:59,290 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-03 22:47:59,290 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:47:59,291 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-03 22:47:59,295 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:59,308 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:47:59,312 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-03 22:47:59,329 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:47:59,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-02-03 22:47:59,329 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-03 22:47:59,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-03 22:47:59,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-03 22:47:59,329 INFO L87 Difference]: Start difference. First operand 191 states and 248 transitions. Second operand 7 states. [2018-02-03 22:47:59,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:59,372 INFO L93 Difference]: Finished difference Result 208 states and 246 transitions. [2018-02-03 22:47:59,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-03 22:47:59,373 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-02-03 22:47:59,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:59,373 INFO L225 Difference]: With dead ends: 208 [2018-02-03 22:47:59,373 INFO L226 Difference]: Without dead ends: 208 [2018-02-03 22:47:59,373 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-03 22:47:59,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-02-03 22:47:59,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 137. [2018-02-03 22:47:59,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-02-03 22:47:59,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 166 transitions. [2018-02-03 22:47:59,376 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 166 transitions. Word has length 32 [2018-02-03 22:47:59,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:59,376 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 166 transitions. [2018-02-03 22:47:59,376 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-03 22:47:59,376 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 166 transitions. [2018-02-03 22:47:59,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-03 22:47:59,376 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:59,376 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-03 22:47:59,377 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:47:59,377 INFO L82 PathProgramCache]: Analyzing trace with hash 799694765, now seen corresponding path program 1 times [2018-02-03 22:47:59,377 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:59,377 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:59,377 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:59,377 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:59,377 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:59,383 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:59,525 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-03 22:47:59,525 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:47:59,525 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-03 22:47:59,532 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:59,550 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:47:59,556 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-03 22:47:59,557 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-03 22:47:59,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:59,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:59,562 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-03 22:47:59,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-02-03 22:47:59,644 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-03 22:47:59,650 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-03 22:47:59,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:47:59,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:47:59,660 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-03 22:47:59,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-02-03 22:47:59,745 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-03 22:47:59,762 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:47:59,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2018-02-03 22:47:59,762 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-03 22:47:59,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-03 22:47:59,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-02-03 22:47:59,763 INFO L87 Difference]: Start difference. First operand 137 states and 166 transitions. Second operand 19 states. [2018-02-03 22:48:00,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:48:00,280 INFO L93 Difference]: Finished difference Result 203 states and 240 transitions. [2018-02-03 22:48:00,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-03 22:48:00,280 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2018-02-03 22:48:00,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:48:00,281 INFO L225 Difference]: With dead ends: 203 [2018-02-03 22:48:00,281 INFO L226 Difference]: Without dead ends: 203 [2018-02-03 22:48:00,281 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=756, Unknown=0, NotChecked=0, Total=870 [2018-02-03 22:48:00,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-02-03 22:48:00,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 147. [2018-02-03 22:48:00,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-03 22:48:00,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 179 transitions. [2018-02-03 22:48:00,285 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 179 transitions. Word has length 32 [2018-02-03 22:48:00,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:48:00,285 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 179 transitions. [2018-02-03 22:48:00,285 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-03 22:48:00,285 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 179 transitions. [2018-02-03 22:48:00,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-03 22:48:00,286 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:48:00,286 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:48:00,286 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:48:00,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1535342028, now seen corresponding path program 2 times [2018-02-03 22:48:00,287 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:48:00,287 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:48:00,287 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:00,288 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:48:00,288 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:48:00,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:48:00,621 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-03 22:48:00,621 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:48:00,621 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-03 22:48:00,629 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:48:00,642 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 22:48:00,642 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:48:00,644 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:48:00,696 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-03 22:48:00,696 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:00,702 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-03 22:48:00,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:00,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:00,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-02-03 22:48:00,763 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:00,764 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:00,764 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-03 22:48:00,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:00,771 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:00,771 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-03 22:48:00,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:00,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:00,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-02-03 22:48:00,819 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-03 22:48:00,820 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-03 22:48:00,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:00,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:00,827 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-03 22:48:00,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-02-03 22:48:00,852 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:00,854 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-03 22:48:00,856 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-03 22:48:00,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:00,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:00,865 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-03 22:48:00,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:48 [2018-02-03 22:48:01,122 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:01,123 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 50 treesize of output 44 [2018-02-03 22:48:01,125 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-03 22:48:01,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:01,132 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:01,133 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:01,138 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 30 treesize of output 54 [2018-02-03 22:48:01,139 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-03 22:48:01,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:48:01,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-03 22:48:01,168 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:70, output treesize:204 [2018-02-03 22:48:01,355 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-03 22:48:01,386 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:48:01,386 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 34 [2018-02-03 22:48:01,387 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-03 22:48:01,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-03 22:48:01,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1080, Unknown=0, NotChecked=0, Total=1190 [2018-02-03 22:48:01,388 INFO L87 Difference]: Start difference. First operand 147 states and 179 transitions. Second operand 35 states. [2018-02-03 22:48:02,025 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 51 DAG size of output 32 [2018-02-03 22:48:03,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:48:03,408 INFO L93 Difference]: Finished difference Result 352 states and 416 transitions. [2018-02-03 22:48:03,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-03 22:48:03,408 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 32 [2018-02-03 22:48:03,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:48:03,409 INFO L225 Difference]: With dead ends: 352 [2018-02-03 22:48:03,409 INFO L226 Difference]: Without dead ends: 352 [2018-02-03 22:48:03,410 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 769 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=345, Invalid=2961, Unknown=0, NotChecked=0, Total=3306 [2018-02-03 22:48:03,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-02-03 22:48:03,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 153. [2018-02-03 22:48:03,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-02-03 22:48:03,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 187 transitions. [2018-02-03 22:48:03,416 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 187 transitions. Word has length 32 [2018-02-03 22:48:03,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:48:03,416 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 187 transitions. [2018-02-03 22:48:03,416 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-03 22:48:03,416 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 187 transitions. [2018-02-03 22:48:03,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-03 22:48:03,417 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:48:03,417 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:48:03,417 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:48:03,417 INFO L82 PathProgramCache]: Analyzing trace with hash 2027344973, now seen corresponding path program 3 times [2018-02-03 22:48:03,417 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:48:03,417 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:48:03,418 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:03,424 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:48:03,424 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:48:03,434 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:48:04,045 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:48:04,045 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:48:04,045 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-03 22:48:04,051 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-03 22:48:04,070 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-02-03 22:48:04,070 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:48:04,072 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:48:04,102 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-03 22:48:04,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:04,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:04,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-02-03 22:48:04,144 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 17 treesize of output 14 [2018-02-03 22:48:04,146 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-03 22:48:04,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:04,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:04,169 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-03 22:48:04,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:39 [2018-02-03 22:48:04,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 42 [2018-02-03 22:48:04,212 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 31 treesize of output 30 [2018-02-03 22:48:04,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:04,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:04,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-03 22:48:04,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:57, output treesize:53 [2018-02-03 22:48:04,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 59 [2018-02-03 22:48:04,893 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 55 treesize of output 165 [2018-02-03 22:48:04,893 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2018-02-03 22:48:05,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1088 xjuncts. [2018-02-03 22:48:18,912 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 74 treesize of output 64 [2018-02-03 22:48:18,912 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:18,914 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 69 treesize of output 59 [2018-02-03 22:48:18,914 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:19,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 51 treesize of output 200 [2018-02-03 22:48:19,004 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-02-03 22:48:19,842 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1088 xjuncts. [2018-02-03 22:48:32,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:48:33,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 41 dim-0 vars, and 2 xjuncts. [2018-02-03 22:48:33,024 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 10 variables, input treesize:125, output treesize:2597 [2018-02-03 22:48:33,514 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 647 DAG size of output 35 [2018-02-03 22:48:33,559 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:48:33,578 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:48:33,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2018-02-03 22:48:33,578 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-03 22:48:33,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-03 22:48:33,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1302, Unknown=0, NotChecked=0, Total=1406 [2018-02-03 22:48:33,579 INFO L87 Difference]: Start difference. First operand 153 states and 187 transitions. Second operand 38 states. [2018-02-03 22:48:34,663 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 140 DAG size of output 87 [2018-02-03 22:48:35,298 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 133 DAG size of output 105 [2018-02-03 22:48:35,478 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 128 DAG size of output 89 [2018-02-03 22:48:35,737 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 131 DAG size of output 100 [2018-02-03 22:48:36,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:48:36,983 INFO L93 Difference]: Finished difference Result 412 states and 488 transitions. [2018-02-03 22:48:36,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-03 22:48:36,983 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 35 [2018-02-03 22:48:36,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:48:36,984 INFO L225 Difference]: With dead ends: 412 [2018-02-03 22:48:36,984 INFO L226 Difference]: Without dead ends: 412 [2018-02-03 22:48:36,985 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1290 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=498, Invalid=4332, Unknown=0, NotChecked=0, Total=4830 [2018-02-03 22:48:36,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-02-03 22:48:36,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 159. [2018-02-03 22:48:36,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-03 22:48:36,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 195 transitions. [2018-02-03 22:48:36,990 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 195 transitions. Word has length 35 [2018-02-03 22:48:36,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:48:36,990 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 195 transitions. [2018-02-03 22:48:36,991 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-03 22:48:36,991 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 195 transitions. [2018-02-03 22:48:36,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-03 22:48:36,991 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:48:36,991 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-03 22:48:36,991 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:48:36,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1376138118, now seen corresponding path program 1 times [2018-02-03 22:48:36,992 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:48:36,992 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:48:36,992 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:36,992 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:48:36,992 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:36,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:48:36,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:48:37,022 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-03 22:48:37,023 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:48:37,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-03 22:48:37,023 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:48:37,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:48:37,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:48:37,023 INFO L87 Difference]: Start difference. First operand 159 states and 195 transitions. Second operand 6 states. [2018-02-03 22:48:37,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:48:37,053 INFO L93 Difference]: Finished difference Result 197 states and 236 transitions. [2018-02-03 22:48:37,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-03 22:48:37,053 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-02-03 22:48:37,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:48:37,054 INFO L225 Difference]: With dead ends: 197 [2018-02-03 22:48:37,054 INFO L226 Difference]: Without dead ends: 183 [2018-02-03 22:48:37,055 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-03 22:48:37,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-02-03 22:48:37,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 163. [2018-02-03 22:48:37,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-03 22:48:37,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 196 transitions. [2018-02-03 22:48:37,058 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 196 transitions. Word has length 36 [2018-02-03 22:48:37,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:48:37,058 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 196 transitions. [2018-02-03 22:48:37,058 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:48:37,058 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 196 transitions. [2018-02-03 22:48:37,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-03 22:48:37,059 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:48:37,059 INFO L351 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:48:37,059 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:48:37,059 INFO L82 PathProgramCache]: Analyzing trace with hash 803973012, now seen corresponding path program 4 times [2018-02-03 22:48:37,059 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:48:37,059 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:48:37,060 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:37,060 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:48:37,060 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:48:37,072 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:48:37,748 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:48:37,766 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:48:37,766 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-03 22:48:37,770 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-03 22:48:37,782 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-03 22:48:37,782 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:48:37,785 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:48:37,837 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-03 22:48:37,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:37,842 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-03 22:48:37,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:37,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:37,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-02-03 22:48:37,887 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:37,887 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:37,887 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-03 22:48:37,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:37,896 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:37,896 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:37,897 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-03 22:48:37,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:37,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:37,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-02-03 22:48:37,949 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-03 22:48:37,950 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-03 22:48:37,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:37,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:37,956 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-03 22:48:37,957 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-02-03 22:48:37,984 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:37,986 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-03 22:48:37,987 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-03 22:48:37,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:37,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:37,996 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-03 22:48:37,996 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:48 [2018-02-03 22:48:38,498 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:38,499 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 75 treesize of output 65 [2018-02-03 22:48:38,500 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-03 22:48:38,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:38,510 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:38,510 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:38,511 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:38,511 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:38,512 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:38,512 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:38,513 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:38,513 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:38,514 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:38,514 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:38,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 161 [2018-02-03 22:48:38,525 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-03 22:48:38,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:48:38,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-03 22:48:38,589 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:103, output treesize:190 [2018-02-03 22:48:38,771 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:48:38,790 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:48:38,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 42 [2018-02-03 22:48:38,790 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-03 22:48:38,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-03 22:48:38,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1614, Unknown=0, NotChecked=0, Total=1806 [2018-02-03 22:48:38,791 INFO L87 Difference]: Start difference. First operand 163 states and 196 transitions. Second operand 43 states. [2018-02-03 22:48:41,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:48:41,938 INFO L93 Difference]: Finished difference Result 506 states and 582 transitions. [2018-02-03 22:48:41,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-03 22:48:41,938 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 38 [2018-02-03 22:48:41,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:48:41,939 INFO L225 Difference]: With dead ends: 506 [2018-02-03 22:48:41,939 INFO L226 Difference]: Without dead ends: 494 [2018-02-03 22:48:41,941 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2131 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=780, Invalid=6360, Unknown=0, NotChecked=0, Total=7140 [2018-02-03 22:48:41,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-02-03 22:48:41,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 181. [2018-02-03 22:48:41,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-02-03 22:48:41,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 220 transitions. [2018-02-03 22:48:41,945 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 220 transitions. Word has length 38 [2018-02-03 22:48:41,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:48:41,945 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 220 transitions. [2018-02-03 22:48:41,945 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-03 22:48:41,945 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 220 transitions. [2018-02-03 22:48:41,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-03 22:48:41,945 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:48:41,946 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-03 22:48:41,946 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:48:41,946 INFO L82 PathProgramCache]: Analyzing trace with hash 336762589, now seen corresponding path program 1 times [2018-02-03 22:48:41,946 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:48:41,946 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:48:41,947 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:41,947 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:48:41,947 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:48:41,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:48:42,011 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-03 22:48:42,011 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:48:42,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:48:42,011 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:48:42,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:48:42,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:48:42,012 INFO L87 Difference]: Start difference. First operand 181 states and 220 transitions. Second operand 6 states. [2018-02-03 22:48:42,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:48:42,115 INFO L93 Difference]: Finished difference Result 180 states and 219 transitions. [2018-02-03 22:48:42,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 22:48:42,115 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-02-03 22:48:42,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:48:42,116 INFO L225 Difference]: With dead ends: 180 [2018-02-03 22:48:42,116 INFO L226 Difference]: Without dead ends: 150 [2018-02-03 22:48:42,117 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-03 22:48:42,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-02-03 22:48:42,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 142. [2018-02-03 22:48:42,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-03 22:48:42,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 160 transitions. [2018-02-03 22:48:42,120 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 160 transitions. Word has length 39 [2018-02-03 22:48:42,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:48:42,120 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 160 transitions. [2018-02-03 22:48:42,120 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:48:42,120 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 160 transitions. [2018-02-03 22:48:42,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-03 22:48:42,121 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:48:42,121 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-03 22:48:42,121 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:48:42,121 INFO L82 PathProgramCache]: Analyzing trace with hash -2098962228, now seen corresponding path program 2 times [2018-02-03 22:48:42,121 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:48:42,121 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:48:42,122 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:42,122 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:48:42,122 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:42,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:48:42,131 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:48:42,410 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-03 22:48:42,410 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:48:42,410 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-03 22:48:42,415 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:48:42,433 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 22:48:42,433 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:48:42,436 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:48:42,455 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-03 22:48:42,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:42,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:42,457 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-03 22:48:42,488 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:42,488 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:42,489 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-03 22:48:42,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:42,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:42,491 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-03 22:48:42,523 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-03 22:48:42,524 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-03 22:48:42,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:42,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:42,530 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-03 22:48:42,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-02-03 22:48:42,722 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-03 22:48:42,724 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-03 22:48:42,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:42,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:42,769 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-03 22:48:42,769 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:53, output treesize:49 [2018-02-03 22:48:42,964 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-03 22:48:42,965 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:42,970 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2018-02-03 22:48:42,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:48:42,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 25 treesize of output 23 [2018-02-03 22:48:42,983 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:42,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 19 treesize of output 17 [2018-02-03 22:48:42,984 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:42,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:48:42,999 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-03 22:48:42,999 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:65, output treesize:43 [2018-02-03 22:48:43,089 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-03 22:48:43,121 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:48:43,122 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 32 [2018-02-03 22:48:43,122 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-03 22:48:43,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-03 22:48:43,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=977, Unknown=0, NotChecked=0, Total=1056 [2018-02-03 22:48:43,122 INFO L87 Difference]: Start difference. First operand 142 states and 160 transitions. Second operand 33 states. [2018-02-03 22:48:44,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:48:44,679 INFO L93 Difference]: Finished difference Result 190 states and 208 transitions. [2018-02-03 22:48:44,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-03 22:48:44,680 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 39 [2018-02-03 22:48:44,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:48:44,681 INFO L225 Difference]: With dead ends: 190 [2018-02-03 22:48:44,681 INFO L226 Difference]: Without dead ends: 190 [2018-02-03 22:48:44,682 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=253, Invalid=2717, Unknown=0, NotChecked=0, Total=2970 [2018-02-03 22:48:44,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-02-03 22:48:44,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 149. [2018-02-03 22:48:44,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-03 22:48:44,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 170 transitions. [2018-02-03 22:48:44,684 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 170 transitions. Word has length 39 [2018-02-03 22:48:44,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:48:44,684 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 170 transitions. [2018-02-03 22:48:44,684 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-03 22:48:44,684 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 170 transitions. [2018-02-03 22:48:44,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-03 22:48:44,685 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:48:44,685 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-03 22:48:44,685 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:48:44,685 INFO L82 PathProgramCache]: Analyzing trace with hash -643319614, now seen corresponding path program 1 times [2018-02-03 22:48:44,685 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:48:44,685 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:48:44,685 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:44,685 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:48:44,685 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:44,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:48:44,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:48:44,945 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-03 22:48:44,945 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:48:44,945 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-03 22:48:44,950 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:48:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:48:44,971 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:48:44,975 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-03 22:48:44,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:44,977 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-03 22:48:44,978 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:7 [2018-02-03 22:48:45,225 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-03 22:48:45,247 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:48:45,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 30 [2018-02-03 22:48:45,247 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-03 22:48:45,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-03 22:48:45,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=841, Unknown=0, NotChecked=0, Total=930 [2018-02-03 22:48:45,248 INFO L87 Difference]: Start difference. First operand 149 states and 170 transitions. Second operand 31 states. [2018-02-03 22:48:45,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:48:45,743 INFO L93 Difference]: Finished difference Result 194 states and 215 transitions. [2018-02-03 22:48:45,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-03 22:48:45,743 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 40 [2018-02-03 22:48:45,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:48:45,744 INFO L225 Difference]: With dead ends: 194 [2018-02-03 22:48:45,744 INFO L226 Difference]: Without dead ends: 184 [2018-02-03 22:48:45,744 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-03 22:48:45,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-02-03 22:48:45,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 176. [2018-02-03 22:48:45,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-03 22:48:45,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 200 transitions. [2018-02-03 22:48:45,746 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 200 transitions. Word has length 40 [2018-02-03 22:48:45,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:48:45,747 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 200 transitions. [2018-02-03 22:48:45,747 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-03 22:48:45,747 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 200 transitions. [2018-02-03 22:48:45,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-03 22:48:45,747 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:48:45,747 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-03 22:48:45,747 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:48:45,747 INFO L82 PathProgramCache]: Analyzing trace with hash -643310578, now seen corresponding path program 1 times [2018-02-03 22:48:45,747 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:48:45,747 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:48:45,748 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:45,748 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:48:45,748 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:48:45,753 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:48:45,983 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-03 22:48:45,984 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:48:45,984 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-03 22:48:45,990 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:48:46,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:48:46,008 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:48:46,011 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-03 22:48:46,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:46,016 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-03 22:48:46,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:46,021 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-03 22:48:46,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-02-03 22:48:46,053 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:46,054 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:46,054 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-03 22:48:46,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:46,060 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-03 22:48:46,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:46,065 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-03 22:48:46,065 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:17 [2018-02-03 22:48:46,363 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-03 22:48:46,381 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:48:46,381 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2018-02-03 22:48:46,382 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-03 22:48:46,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-03 22:48:46,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1030, Unknown=0, NotChecked=0, Total=1122 [2018-02-03 22:48:46,382 INFO L87 Difference]: Start difference. First operand 176 states and 200 transitions. Second operand 34 states. [2018-02-03 22:48:47,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:48:47,222 INFO L93 Difference]: Finished difference Result 182 states and 203 transitions. [2018-02-03 22:48:47,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-03 22:48:47,222 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 40 [2018-02-03 22:48:47,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:48:47,222 INFO L225 Difference]: With dead ends: 182 [2018-02-03 22:48:47,223 INFO L226 Difference]: Without dead ends: 178 [2018-02-03 22:48:47,223 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=304, Invalid=2452, Unknown=0, NotChecked=0, Total=2756 [2018-02-03 22:48:47,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-02-03 22:48:47,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 174. [2018-02-03 22:48:47,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-03 22:48:47,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 196 transitions. [2018-02-03 22:48:47,226 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 196 transitions. Word has length 40 [2018-02-03 22:48:47,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:48:47,226 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 196 transitions. [2018-02-03 22:48:47,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-03 22:48:47,227 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 196 transitions. [2018-02-03 22:48:47,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-03 22:48:47,227 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:48:47,227 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-03 22:48:47,227 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:48:47,227 INFO L82 PathProgramCache]: Analyzing trace with hash -154740261, now seen corresponding path program 1 times [2018-02-03 22:48:47,227 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:48:47,228 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:48:47,228 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:47,228 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:48:47,228 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:48:47,236 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:48:47,561 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-03 22:48:47,561 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:48:47,561 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-03 22:48:47,566 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:48:47,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:48:47,581 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:48:47,583 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-03 22:48:47,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:47,589 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-03 22:48:47,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:47,593 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-03 22:48:47,593 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-02-03 22:48:47,624 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:47,625 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:47,625 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-03 22:48:47,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:47,630 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:47,631 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-03 22:48:47,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:47,636 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-03 22:48:47,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-02-03 22:48:47,886 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-03 22:48:47,906 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:48:47,918 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 38 [2018-02-03 22:48:47,918 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-03 22:48:47,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-03 22:48:47,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1340, Unknown=0, NotChecked=0, Total=1482 [2018-02-03 22:48:47,918 INFO L87 Difference]: Start difference. First operand 174 states and 196 transitions. Second operand 39 states. [2018-02-03 22:48:48,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:48:48,906 INFO L93 Difference]: Finished difference Result 221 states and 243 transitions. [2018-02-03 22:48:48,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-03 22:48:48,906 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 43 [2018-02-03 22:48:48,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:48:48,907 INFO L225 Difference]: With dead ends: 221 [2018-02-03 22:48:48,907 INFO L226 Difference]: Without dead ends: 215 [2018-02-03 22:48:48,907 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1146 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=444, Invalid=3216, Unknown=0, NotChecked=0, Total=3660 [2018-02-03 22:48:48,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-03 22:48:48,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 199. [2018-02-03 22:48:48,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-03 22:48:48,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 224 transitions. [2018-02-03 22:48:48,909 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 224 transitions. Word has length 43 [2018-02-03 22:48:48,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:48:48,910 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 224 transitions. [2018-02-03 22:48:48,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-03 22:48:48,910 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 224 transitions. [2018-02-03 22:48:48,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-03 22:48:48,910 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:48:48,910 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-03 22:48:48,910 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:48:48,910 INFO L82 PathProgramCache]: Analyzing trace with hash -154731225, now seen corresponding path program 1 times [2018-02-03 22:48:48,910 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:48:48,910 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:48:48,911 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:48,911 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:48:48,911 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:48,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:48:48,916 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:48:49,177 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-03 22:48:49,177 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:48:49,177 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-03 22:48:49,182 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:48:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:48:49,200 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:48:49,210 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-03 22:48:49,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:49,216 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-03 22:48:49,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:49,221 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-03 22:48:49,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-02-03 22:48:49,253 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:49,254 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:49,254 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-03 22:48:49,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:49,260 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-03 22:48:49,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:49,264 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-03 22:48:49,264 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:17 [2018-02-03 22:48:49,582 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-03 22:48:49,600 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:48:49,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 35 [2018-02-03 22:48:49,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-03 22:48:49,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-03 22:48:49,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1159, Unknown=0, NotChecked=0, Total=1260 [2018-02-03 22:48:49,601 INFO L87 Difference]: Start difference. First operand 199 states and 224 transitions. Second operand 36 states. [2018-02-03 22:48:51,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:48:51,205 INFO L93 Difference]: Finished difference Result 222 states and 244 transitions. [2018-02-03 22:48:51,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-03 22:48:51,206 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 43 [2018-02-03 22:48:51,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:48:51,206 INFO L225 Difference]: With dead ends: 222 [2018-02-03 22:48:51,207 INFO L226 Difference]: Without dead ends: 214 [2018-02-03 22:48:51,208 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1132 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=566, Invalid=4126, Unknown=0, NotChecked=0, Total=4692 [2018-02-03 22:48:51,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-02-03 22:48:51,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 174. [2018-02-03 22:48:51,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-03 22:48:51,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 196 transitions. [2018-02-03 22:48:51,211 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 196 transitions. Word has length 43 [2018-02-03 22:48:51,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:48:51,211 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 196 transitions. [2018-02-03 22:48:51,211 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-03 22:48:51,211 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 196 transitions. [2018-02-03 22:48:51,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-03 22:48:51,211 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:48:51,212 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:48:51,212 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:48:51,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1876668109, now seen corresponding path program 3 times [2018-02-03 22:48:51,212 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:48:51,212 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:48:51,213 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:51,213 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:48:51,213 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:48:51,221 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:48:51,490 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-03 22:48:51,491 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:48:51,491 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-03 22:48:51,502 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-03 22:48:51,537 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-03 22:48:51,538 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:48:51,540 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:48:51,560 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-03 22:48:51,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:51,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:51,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-03 22:48:51,589 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 16 treesize of output 13 [2018-02-03 22:48:51,590 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-03 22:48:51,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:51,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:51,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:51,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-02-03 22:48:51,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 41 [2018-02-03 22:48:51,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 36 treesize of output 30 [2018-02-03 22:48:51,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:51,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:48:51,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:48:51,746 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:67 [2018-02-03 22:48:51,833 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 42 treesize of output 41 [2018-02-03 22:48:51,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 23 [2018-02-03 22:48:51,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:48:51,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:48:51,855 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-03 22:48:51,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:60 [2018-02-03 22:48:51,922 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 29 treesize of output 23 [2018-02-03 22:48:51,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 37 [2018-02-03 22:48:51,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-02-03 22:48:51,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:48:51,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:48:51,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:42 [2018-02-03 22:48:52,010 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:48:52,028 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:48:52,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22] total 36 [2018-02-03 22:48:52,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-03 22:48:52,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-03 22:48:52,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1221, Unknown=0, NotChecked=0, Total=1332 [2018-02-03 22:48:52,029 INFO L87 Difference]: Start difference. First operand 174 states and 196 transitions. Second operand 37 states. [2018-02-03 22:48:53,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:48:53,421 INFO L93 Difference]: Finished difference Result 210 states and 228 transitions. [2018-02-03 22:48:53,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-03 22:48:53,422 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 46 [2018-02-03 22:48:53,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:48:53,422 INFO L225 Difference]: With dead ends: 210 [2018-02-03 22:48:53,422 INFO L226 Difference]: Without dead ends: 160 [2018-02-03 22:48:53,423 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 976 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=497, Invalid=4059, Unknown=0, NotChecked=0, Total=4556 [2018-02-03 22:48:53,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-02-03 22:48:53,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 123. [2018-02-03 22:48:53,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-03 22:48:53,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 135 transitions. [2018-02-03 22:48:53,425 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 135 transitions. Word has length 46 [2018-02-03 22:48:53,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:48:53,425 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 135 transitions. [2018-02-03 22:48:53,425 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-03 22:48:53,425 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 135 transitions. [2018-02-03 22:48:53,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-03 22:48:53,426 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:48:53,426 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-03 22:48:53,426 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:48:53,426 INFO L82 PathProgramCache]: Analyzing trace with hash -531401182, now seen corresponding path program 2 times [2018-02-03 22:48:53,426 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:48:53,426 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:48:53,427 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:53,427 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:48:53,427 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:48:53,434 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:48:53,775 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-03 22:48:53,775 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:48:53,775 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-03 22:48:53,780 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:48:53,796 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 22:48:53,797 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:48:53,798 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:48:53,801 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-03 22:48:53,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:53,806 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-03 22:48:53,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:53,810 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-03 22:48:53,810 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-02-03 22:48:53,845 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:53,846 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:53,846 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-03 22:48:53,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:53,853 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:53,854 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:53,854 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-03 22:48:53,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:53,858 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-03 22:48:53,858 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-02-03 22:48:54,107 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-03 22:48:54,124 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:48:54,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 37 [2018-02-03 22:48:54,124 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-02-03 22:48:54,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-02-03 22:48:54,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1288, Unknown=0, NotChecked=0, Total=1406 [2018-02-03 22:48:54,125 INFO L87 Difference]: Start difference. First operand 123 states and 135 transitions. Second operand 38 states. [2018-02-03 22:48:55,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:48:55,034 INFO L93 Difference]: Finished difference Result 167 states and 179 transitions. [2018-02-03 22:48:55,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-03 22:48:55,034 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 46 [2018-02-03 22:48:55,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:48:55,035 INFO L225 Difference]: With dead ends: 167 [2018-02-03 22:48:55,035 INFO L226 Difference]: Without dead ends: 157 [2018-02-03 22:48:55,035 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1084 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=390, Invalid=3392, Unknown=0, NotChecked=0, Total=3782 [2018-02-03 22:48:55,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-02-03 22:48:55,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 142. [2018-02-03 22:48:55,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-03 22:48:55,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 155 transitions. [2018-02-03 22:48:55,037 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 155 transitions. Word has length 46 [2018-02-03 22:48:55,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:48:55,037 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 155 transitions. [2018-02-03 22:48:55,037 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-02-03 22:48:55,037 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 155 transitions. [2018-02-03 22:48:55,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-03 22:48:55,037 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:48:55,037 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:48:55,037 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:48:55,037 INFO L82 PathProgramCache]: Analyzing trace with hash -531392146, now seen corresponding path program 2 times [2018-02-03 22:48:55,037 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:48:55,038 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:48:55,038 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:55,038 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:48:55,038 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:48:55,047 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:48:55,550 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:48:55,550 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:48:55,550 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-03 22:48:55,555 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:48:55,569 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 22:48:55,569 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:48:55,571 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:48:55,608 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-03 22:48:55,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:55,613 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-03 22:48:55,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:55,617 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-03 22:48:55,617 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-02-03 22:48:55,656 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:55,657 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:55,657 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-03 22:48:55,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:55,665 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:55,666 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:55,666 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-03 22:48:55,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:55,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:55,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-02-03 22:48:55,716 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 15 treesize of output 12 [2018-02-03 22:48:55,716 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-03 22:48:55,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:55,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:55,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:55,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-02-03 22:48:55,901 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:48:55,903 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 23 treesize of output 24 [2018-02-03 22:48:55,904 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-03 22:48:55,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:48:55,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:55,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:48:55,912 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2018-02-03 22:48:56,021 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 19 treesize of output 15 [2018-02-03 22:48:56,025 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 15 treesize of output 12 [2018-02-03 22:48:56,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:48:56,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:48:56,034 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 2 xjuncts. [2018-02-03 22:48:56,034 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:45 [2018-02-03 22:48:56,172 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:48:56,189 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:48:56,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 40 [2018-02-03 22:48:56,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-03 22:48:56,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-03 22:48:56,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1537, Unknown=0, NotChecked=0, Total=1640 [2018-02-03 22:48:56,190 INFO L87 Difference]: Start difference. First operand 142 states and 155 transitions. Second operand 41 states. [2018-02-03 22:48:57,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:48:57,884 INFO L93 Difference]: Finished difference Result 172 states and 184 transitions. [2018-02-03 22:48:57,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-03 22:48:57,884 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 46 [2018-02-03 22:48:57,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:48:57,885 INFO L225 Difference]: With dead ends: 172 [2018-02-03 22:48:57,885 INFO L226 Difference]: Without dead ends: 140 [2018-02-03 22:48:57,885 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=337, Invalid=3569, Unknown=0, NotChecked=0, Total=3906 [2018-02-03 22:48:57,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-02-03 22:48:57,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 123. [2018-02-03 22:48:57,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-03 22:48:57,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2018-02-03 22:48:57,887 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 46 [2018-02-03 22:48:57,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:48:57,887 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2018-02-03 22:48:57,888 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-03 22:48:57,888 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2018-02-03 22:48:57,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-03 22:48:57,888 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:48:57,888 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:48:57,888 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:48:57,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1596860813, now seen corresponding path program 5 times [2018-02-03 22:48:57,889 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:48:57,889 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:48:57,889 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:57,889 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:48:57,889 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:48:57,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:48:57,906 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:48:58,766 WARN L146 SmtUtils]: Spent 205ms on a formula simplification. DAG size of input: 151 DAG size of output 99 [2018-02-03 22:48:58,966 WARN L146 SmtUtils]: Spent 174ms on a formula simplification. DAG size of input: 135 DAG size of output 92 [2018-02-03 22:48:59,154 WARN L146 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 126 DAG size of output 62 [2018-02-03 22:48:59,312 WARN L146 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 126 DAG size of output 62 [2018-02-03 22:48:59,489 WARN L146 SmtUtils]: Spent 147ms on a formula simplification. DAG size of input: 129 DAG size of output 65 [2018-02-03 22:48:59,743 WARN L146 SmtUtils]: Spent 214ms on a formula simplification. DAG size of input: 148 DAG size of output 71 [2018-02-03 22:49:00,018 WARN L146 SmtUtils]: Spent 216ms on a formula simplification. DAG size of input: 151 DAG size of output 74 [2018-02-03 22:49:00,323 WARN L146 SmtUtils]: Spent 247ms on a formula simplification. DAG size of input: 132 DAG size of output 78 [2018-02-03 22:49:00,649 WARN L146 SmtUtils]: Spent 255ms on a formula simplification. DAG size of input: 135 DAG size of output 75 [2018-02-03 22:49:00,872 WARN L146 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 127 DAG size of output 57 [2018-02-03 22:49:01,083 WARN L146 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 130 DAG size of output 60 [2018-02-03 22:49:01,633 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:49:01,633 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:49:01,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 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-03 22:49:01,638 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-03 22:49:01,658 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-02-03 22:49:01,658 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:49:01,660 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:49:01,664 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-03 22:49:01,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:01,672 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-03 22:49:01,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:01,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:49:01,677 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-02-03 22:49:01,732 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:01,732 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:01,733 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-03 22:49:01,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:01,739 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:01,739 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-03 22:49:01,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:01,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:49:01,745 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-02-03 22:49:01,808 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-03 22:49:01,809 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-03 22:49:01,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:01,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:49:01,817 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-03 22:49:01,817 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-02-03 22:49:01,853 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:01,855 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-03 22:49:01,856 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-03 22:49:01,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:01,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:49:01,865 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-03 22:49:01,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:48 [2018-02-03 22:49:03,233 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:03,234 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 105 treesize of output 89 [2018-02-03 22:49:03,235 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-03 22:49:03,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:03,248 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:03,249 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:03,249 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:03,249 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:03,250 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:03,250 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:03,251 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:03,251 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:03,252 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:03,252 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:03,253 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:03,253 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:03,254 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:03,254 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:03,255 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:03,255 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:03,256 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:03,256 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:03,257 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:03,258 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:03,258 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:03,259 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:03,259 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:03,260 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:03,260 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:03,261 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:03,261 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:03,262 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:03,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 42 disjoint index pairs (out of 36 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 353 [2018-02-03 22:49:03,286 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-03 22:49:03,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:49:03,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-03 22:49:03,457 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:133, output treesize:262 [2018-02-03 22:49:03,679 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:49:03,695 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:49:03,695 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 55 [2018-02-03 22:49:03,696 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-03 22:49:03,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-03 22:49:03,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=2703, Unknown=0, NotChecked=0, Total=3080 [2018-02-03 22:49:03,696 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand 56 states. [2018-02-03 22:49:04,227 WARN L146 SmtUtils]: Spent 217ms on a formula simplification. DAG size of input: 149 DAG size of output 132 [2018-02-03 22:49:04,616 WARN L146 SmtUtils]: Spent 312ms on a formula simplification. DAG size of input: 157 DAG size of output 140 [2018-02-03 22:49:07,511 WARN L146 SmtUtils]: Spent 177ms on a formula simplification. DAG size of input: 137 DAG size of output 125 [2018-02-03 22:49:08,052 WARN L146 SmtUtils]: Spent 408ms on a formula simplification. DAG size of input: 208 DAG size of output 185 [2018-02-03 22:49:08,385 WARN L146 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 128 DAG size of output 114 [2018-02-03 22:49:08,734 WARN L146 SmtUtils]: Spent 183ms on a formula simplification. DAG size of input: 145 DAG size of output 129 [2018-02-03 22:49:08,981 WARN L146 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 112 DAG size of output 107 [2018-02-03 22:49:09,200 WARN L146 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 122 DAG size of output 116 [2018-02-03 22:49:09,435 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 92 DAG size of output 86 [2018-02-03 22:49:09,875 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 95 DAG size of output 89 [2018-02-03 22:49:10,044 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 85 DAG size of output 80 [2018-02-03 22:49:10,524 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 88 DAG size of output 83 [2018-02-03 22:49:11,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:49:11,292 INFO L93 Difference]: Finished difference Result 334 states and 360 transitions. [2018-02-03 22:49:11,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-03 22:49:11,292 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 47 [2018-02-03 22:49:11,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:49:11,293 INFO L225 Difference]: With dead ends: 334 [2018-02-03 22:49:11,293 INFO L226 Difference]: Without dead ends: 251 [2018-02-03 22:49:11,294 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2804 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=1110, Invalid=7820, Unknown=0, NotChecked=0, Total=8930 [2018-02-03 22:49:11,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-02-03 22:49:11,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 159. [2018-02-03 22:49:11,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-02-03 22:49:11,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 176 transitions. [2018-02-03 22:49:11,295 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 176 transitions. Word has length 47 [2018-02-03 22:49:11,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:49:11,295 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 176 transitions. [2018-02-03 22:49:11,295 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-03 22:49:11,295 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 176 transitions. [2018-02-03 22:49:11,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-03 22:49:11,296 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:49:11,296 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-03 22:49:11,296 INFO L371 AbstractCegarLoop]: === Iteration 31 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:49:11,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1112645755, now seen corresponding path program 3 times [2018-02-03 22:49:11,296 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:49:11,296 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:49:11,297 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:11,297 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:49:11,297 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:49:11,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:49:11,685 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-03 22:49:11,686 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:49:11,686 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-03 22:49:11,691 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-03 22:49:11,718 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-03 22:49:11,718 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:49:11,721 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:49:11,724 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-03 22:49:11,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:11,730 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-03 22:49:11,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:11,734 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-03 22:49:11,734 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-02-03 22:49:11,770 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:11,770 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:11,771 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-03 22:49:11,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:11,779 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:11,779 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-03 22:49:11,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:11,785 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-03 22:49:11,785 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:19 [2018-02-03 22:49:12,133 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-03 22:49:12,152 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:49:12,152 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 42 [2018-02-03 22:49:12,152 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-03 22:49:12,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-03 22:49:12,153 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1622, Unknown=0, NotChecked=0, Total=1806 [2018-02-03 22:49:12,153 INFO L87 Difference]: Start difference. First operand 159 states and 176 transitions. Second operand 43 states. [2018-02-03 22:49:13,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:49:13,261 INFO L93 Difference]: Finished difference Result 203 states and 220 transitions. [2018-02-03 22:49:13,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-03 22:49:13,261 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 49 [2018-02-03 22:49:13,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:49:13,261 INFO L225 Difference]: With dead ends: 203 [2018-02-03 22:49:13,261 INFO L226 Difference]: Without dead ends: 193 [2018-02-03 22:49:13,262 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1533 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=542, Invalid=4150, Unknown=0, NotChecked=0, Total=4692 [2018-02-03 22:49:13,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-03 22:49:13,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 178. [2018-02-03 22:49:13,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-03 22:49:13,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 196 transitions. [2018-02-03 22:49:13,263 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 196 transitions. Word has length 49 [2018-02-03 22:49:13,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:49:13,264 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 196 transitions. [2018-02-03 22:49:13,264 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-03 22:49:13,264 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 196 transitions. [2018-02-03 22:49:13,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-03 22:49:13,264 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:49:13,264 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:49:13,264 INFO L371 AbstractCegarLoop]: === Iteration 32 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:49:13,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1112654791, now seen corresponding path program 3 times [2018-02-03 22:49:13,264 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:49:13,264 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:49:13,265 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:13,265 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:49:13,265 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:49:13,273 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:49:13,644 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:49:13,644 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:49:13,644 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-03 22:49:13,649 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-03 22:49:13,673 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-03 22:49:13,673 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:49:13,675 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:49:13,677 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-03 22:49:13,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:13,680 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-03 22:49:13,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:13,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:49:13,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-03 22:49:13,687 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:13,687 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:13,688 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-03 22:49:13,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:13,692 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-03 22:49:13,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:13,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:49:13,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-03 22:49:13,728 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-03 22:49:13,729 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-03 22:49:13,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:13,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:49:13,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:49:13,732 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-02-03 22:49:13,752 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-03 22:49:13,754 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-03 22:49:13,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:13,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:49:13,760 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-03 22:49:13,760 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:31 [2018-02-03 22:49:13,836 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-03 22:49:13,840 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-03 22:49:13,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:49:13,845 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-03 22:49:13,846 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:13,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:49:13,851 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-03 22:49:13,852 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:15 [2018-02-03 22:49:13,976 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-03 22:49:13,992 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:49:13,992 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 30 [2018-02-03 22:49:13,992 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-03 22:49:13,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-03 22:49:13,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=851, Unknown=0, NotChecked=0, Total=930 [2018-02-03 22:49:13,993 INFO L87 Difference]: Start difference. First operand 178 states and 196 transitions. Second operand 31 states. [2018-02-03 22:49:15,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:49:15,056 INFO L93 Difference]: Finished difference Result 190 states and 207 transitions. [2018-02-03 22:49:15,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-03 22:49:15,056 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 49 [2018-02-03 22:49:15,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:49:15,057 INFO L225 Difference]: With dead ends: 190 [2018-02-03 22:49:15,057 INFO L226 Difference]: Without dead ends: 99 [2018-02-03 22:49:15,058 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=361, Invalid=2291, Unknown=0, NotChecked=0, Total=2652 [2018-02-03 22:49:15,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-03 22:49:15,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 86. [2018-02-03 22:49:15,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-03 22:49:15,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2018-02-03 22:49:15,059 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 49 [2018-02-03 22:49:15,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:49:15,060 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2018-02-03 22:49:15,060 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-03 22:49:15,060 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2018-02-03 22:49:15,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-03 22:49:15,060 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:49:15,060 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-03 22:49:15,060 INFO L371 AbstractCegarLoop]: === Iteration 33 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:49:15,060 INFO L82 PathProgramCache]: Analyzing trace with hash -892097662, now seen corresponding path program 4 times [2018-02-03 22:49:15,060 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:49:15,060 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:49:15,061 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:15,061 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:49:15,061 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:49:15,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:49:15,721 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-03 22:49:15,721 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:49:15,721 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-03 22:49:15,732 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-03 22:49:15,750 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-03 22:49:15,750 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:49:15,753 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:49:15,755 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-03 22:49:15,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:15,761 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-03 22:49:15,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:15,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:49:15,765 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-02-03 22:49:15,813 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:15,813 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:15,813 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-03 22:49:15,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:15,820 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:15,821 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-03 22:49:15,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:15,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:49:15,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-02-03 22:49:15,871 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-03 22:49:15,872 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-03 22:49:15,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:15,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:49:15,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:49:15,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-02-03 22:49:15,912 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:15,914 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-03 22:49:15,916 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-03 22:49:15,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:15,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:49:15,924 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-03 22:49:15,925 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:43 [2018-02-03 22:49:16,153 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:16,154 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 35 treesize of output 33 [2018-02-03 22:49:16,160 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 19 treesize of output 16 [2018-02-03 22:49:16,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:49:16,169 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-03 22:49:16,169 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:16,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:49:16,182 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-03 22:49:16,182 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:58, output treesize:63 [2018-02-03 22:49:16,843 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-03 22:49:16,861 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:49:16,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 49 [2018-02-03 22:49:16,862 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-03 22:49:16,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-03 22:49:16,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=2283, Unknown=0, NotChecked=0, Total=2450 [2018-02-03 22:49:16,862 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand 50 states. [2018-02-03 22:49:17,705 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 99 DAG size of output 72 [2018-02-03 22:49:19,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:49:19,210 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2018-02-03 22:49:19,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-03 22:49:19,210 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 52 [2018-02-03 22:49:19,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:49:19,211 INFO L225 Difference]: With dead ends: 133 [2018-02-03 22:49:19,211 INFO L226 Difference]: Without dead ends: 91 [2018-02-03 22:49:19,211 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1970 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=569, Invalid=5911, Unknown=0, NotChecked=0, Total=6480 [2018-02-03 22:49:19,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-03 22:49:19,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2018-02-03 22:49:19,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-03 22:49:19,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2018-02-03 22:49:19,212 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 52 [2018-02-03 22:49:19,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:49:19,212 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2018-02-03 22:49:19,212 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-03 22:49:19,213 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2018-02-03 22:49:19,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-03 22:49:19,213 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:49:19,213 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-03 22:49:19,213 INFO L371 AbstractCegarLoop]: === Iteration 34 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:49:19,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1441683682, now seen corresponding path program 5 times [2018-02-03 22:49:19,213 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:49:19,213 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:49:19,214 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:19,214 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:49:19,214 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:49:19,225 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:49:19,578 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 66 DAG size of output 55 [2018-02-03 22:49:20,454 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-03 22:49:20,455 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:49:20,455 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:49:20,460 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-03 22:49:20,490 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-02-03 22:49:20,490 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:49:20,493 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:49:20,496 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-03 22:49:20,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:20,501 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-03 22:49:20,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:20,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:49:20,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-02-03 22:49:20,513 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:20,514 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:20,514 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-03 22:49:20,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:20,531 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:20,532 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:20,532 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-03 22:49:20,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:20,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:49:20,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-02-03 22:49:20,600 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-03 22:49:20,601 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-03 22:49:20,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:20,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:49:20,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:49:20,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-02-03 22:49:20,642 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:20,644 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-03 22:49:20,646 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-03 22:49:20,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:20,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:49:20,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:49:20,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2018-02-03 22:49:21,055 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:21,056 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 50 treesize of output 44 [2018-02-03 22:49:21,058 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:21,059 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:21,064 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 30 treesize of output 54 [2018-02-03 22:49:21,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:49:21,081 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-03 22:49:21,081 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:21,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:49:21,102 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-03 22:49:21,102 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:71, output treesize:97 [2018-02-03 22:49:21,725 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-03 22:49:21,744 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:49:21,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 52 [2018-02-03 22:49:21,744 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-02-03 22:49:21,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-02-03 22:49:21,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=2604, Unknown=0, NotChecked=0, Total=2756 [2018-02-03 22:49:21,745 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand 53 states. [2018-02-03 22:49:23,236 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 107 DAG size of output 88 [2018-02-03 22:49:23,627 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 105 DAG size of output 92 [2018-02-03 22:49:24,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:49:24,973 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2018-02-03 22:49:24,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-02-03 22:49:24,973 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 58 [2018-02-03 22:49:24,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:49:24,974 INFO L225 Difference]: With dead ends: 139 [2018-02-03 22:49:24,974 INFO L226 Difference]: Without dead ends: 91 [2018-02-03 22:49:24,974 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2039 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=494, Invalid=7162, Unknown=0, NotChecked=0, Total=7656 [2018-02-03 22:49:24,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-03 22:49:24,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2018-02-03 22:49:24,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-03 22:49:24,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2018-02-03 22:49:24,976 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 58 [2018-02-03 22:49:24,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:49:24,976 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2018-02-03 22:49:24,977 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-02-03 22:49:24,977 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2018-02-03 22:49:24,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-03 22:49:24,977 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:49:24,977 INFO L351 BasicCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:49:24,977 INFO L371 AbstractCegarLoop]: === Iteration 35 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:49:24,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1616455021, now seen corresponding path program 6 times [2018-02-03 22:49:24,977 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:49:24,978 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:49:24,978 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:24,978 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:49:24,978 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:49:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:49:25,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:49:29,418 WARN L146 SmtUtils]: Spent 1082ms on a formula simplification. DAG size of input: 309 DAG size of output 151 [2018-02-03 22:49:30,421 WARN L146 SmtUtils]: Spent 924ms on a formula simplification. DAG size of input: 311 DAG size of output 100 [2018-02-03 22:49:31,633 WARN L146 SmtUtils]: Spent 1173ms on a formula simplification. DAG size of input: 311 DAG size of output 102 [2018-02-03 22:49:32,840 WARN L146 SmtUtils]: Spent 1155ms on a formula simplification. DAG size of input: 314 DAG size of output 105 [2018-02-03 22:49:34,235 WARN L146 SmtUtils]: Spent 1305ms on a formula simplification. DAG size of input: 333 DAG size of output 111 [2018-02-03 22:49:35,618 WARN L146 SmtUtils]: Spent 1278ms on a formula simplification. DAG size of input: 336 DAG size of output 114 [2018-02-03 22:49:37,115 WARN L146 SmtUtils]: Spent 1397ms on a formula simplification. DAG size of input: 293 DAG size of output 107 [2018-02-03 22:49:38,620 WARN L146 SmtUtils]: Spent 1384ms on a formula simplification. DAG size of input: 296 DAG size of output 111 [2018-02-03 22:49:39,831 WARN L146 SmtUtils]: Spent 1104ms on a formula simplification. DAG size of input: 282 DAG size of output 106 [2018-02-03 22:49:41,214 WARN L146 SmtUtils]: Spent 1250ms on a formula simplification. DAG size of input: 285 DAG size of output 109 [2018-02-03 22:49:42,632 WARN L146 SmtUtils]: Spent 1280ms on a formula simplification. DAG size of input: 269 DAG size of output 98 [2018-02-03 22:49:44,207 WARN L146 SmtUtils]: Spent 1391ms on a formula simplification. DAG size of input: 272 DAG size of output 100 [2018-02-03 22:49:45,381 WARN L146 SmtUtils]: Spent 1018ms on a formula simplification. DAG size of input: 258 DAG size of output 91 [2018-02-03 22:49:46,626 WARN L146 SmtUtils]: Spent 1074ms on a formula simplification. DAG size of input: 261 DAG size of output 94 [2018-02-03 22:49:47,537 WARN L146 SmtUtils]: Spent 770ms on a formula simplification. DAG size of input: 254 DAG size of output 79 [2018-02-03 22:49:48,596 WARN L146 SmtUtils]: Spent 889ms on a formula simplification. DAG size of input: 257 DAG size of output 84 [2018-02-03 22:49:48,962 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 127 DAG size of output 45 [2018-02-03 22:49:49,875 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:49:49,875 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:49:49,875 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:49:49,880 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-03 22:49:49,944 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-02-03 22:49:49,944 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:49:49,948 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:49:50,046 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-03 22:49:50,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:50,054 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-03 22:49:50,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:50,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:49:50,059 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-02-03 22:49:50,147 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:50,148 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:50,149 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-03 22:49:50,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:50,167 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:50,167 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:50,168 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-03 22:49:50,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:50,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:49:50,176 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:28 [2018-02-03 22:49:50,274 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-03 22:49:50,275 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-03 22:49:50,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:50,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:49:50,284 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-03 22:49:50,285 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-02-03 22:49:50,347 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:49:50,349 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-03 22:49:50,351 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-03 22:49:50,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:49:50,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:49:50,362 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-03 22:49:50,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:47 Received shutdown request... [2018-02-03 22:50:55,094 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-03 22:50:55,095 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-03 22:50:55,098 WARN L185 ceAbstractionStarter]: Timeout [2018-02-03 22:50:55,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.02 10:50:55 BoogieIcfgContainer [2018-02-03 22:50:55,098 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-03 22:50:55,098 INFO L168 Benchmark]: Toolchain (without parser) took 196428.82 ms. Allocated memory was 395.3 MB in the beginning and 1.1 GB in the end (delta: 713.6 MB). Free memory was 353.3 MB in the beginning and 917.6 MB in the end (delta: -564.3 MB). Peak memory consumption was 149.3 MB. Max. memory is 5.3 GB. [2018-02-03 22:50:55,099 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 395.3 MB. Free memory is still 358.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-03 22:50:55,099 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.35 ms. Allocated memory is still 395.3 MB. Free memory was 352.0 MB in the beginning and 341.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-03 22:50:55,100 INFO L168 Benchmark]: Boogie Preprocessor took 22.29 ms. Allocated memory is still 395.3 MB. Free memory was 341.4 MB in the beginning and 340.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-03 22:50:55,100 INFO L168 Benchmark]: RCFGBuilder took 275.11 ms. Allocated memory is still 395.3 MB. Free memory was 340.0 MB in the beginning and 317.5 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. [2018-02-03 22:50:55,100 INFO L168 Benchmark]: TraceAbstraction took 195974.98 ms. Allocated memory was 395.3 MB in the beginning and 1.1 GB in the end (delta: 713.6 MB). Free memory was 317.5 MB in the beginning and 917.6 MB in the end (delta: -600.1 MB). Peak memory consumption was 113.4 MB. Max. memory is 5.3 GB. [2018-02-03 22:50:55,101 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.16 ms. Allocated memory is still 395.3 MB. Free memory is still 358.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 153.35 ms. Allocated memory is still 395.3 MB. Free memory was 352.0 MB in the beginning and 341.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 22.29 ms. Allocated memory is still 395.3 MB. Free memory was 341.4 MB in the beginning and 340.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 275.11 ms. Allocated memory is still 395.3 MB. Free memory was 340.0 MB in the beginning and 317.5 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 195974.98 ms. Allocated memory was 395.3 MB in the beginning and 1.1 GB in the end (delta: 713.6 MB). Free memory was 317.5 MB in the beginning and 917.6 MB in the end (delta: -600.1 MB). Peak memory consumption was 113.4 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 66 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 553]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 16, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 67 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 58 locations, 15 error locations. TIMEOUT Result, 195.9s OverallTime, 35 OverallIterations, 16 TraceHistogramMax, 47.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1478 SDtfs, 5531 SDslu, 16235 SDs, 0 SdLazy, 19606 SolverSat, 1640 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 15.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1901 GetRequests, 545 SyntacticMatches, 19 SemanticMatches, 1337 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21728 ImplicationChecksByTransitivity, 53.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=199occurred in iteration=25, 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.1s AutomataMinimizationTime, 34 MinimizatonAttempts, 1651 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 56.4s InterpolantComputationTime, 2001 NumberOfCodeBlocks, 1999 NumberOfCodeBlocksAsserted, 93 NumberOfCheckSat, 1945 ConstructedInterpolants, 224 QuantifiedInterpolants, 1780148 SizeOfPredicates, 350 NumberOfNonLiveVariables, 4016 ConjunctsInSsa, 1292 ConjunctsInUnsatCore, 56 InterpolantComputations, 12 PerfectInterpolantSequences, 51/1318 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-03_22-50-55-107.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-03_22-50-55-107.csv Completed graceful shutdown