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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-29 22:47:09,594 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 22:47:09,596 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 22:47:09,609 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 22:47:09,610 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 22:47:09,611 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 22:47:09,612 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 22:47:09,613 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 22:47:09,615 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 22:47:09,616 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 22:47:09,617 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 22:47:09,617 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 22:47:09,617 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 22:47:09,618 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 22:47:09,619 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 22:47:09,621 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 22:47:09,623 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 22:47:09,625 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 22:47:09,626 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 22:47:09,628 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 22:47:09,630 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 22:47:09,630 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 22:47:09,630 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 22:47:09,631 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 22:47:09,632 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 22:47:09,633 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 22:47:09,634 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 22:47:09,634 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 22:47:09,634 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 22:47:09,635 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 22:47:09,635 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 22:47:09,635 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-29 22:47:09,645 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 22:47:09,645 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 22:47:09,646 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 22:47:09,646 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 22:47:09,647 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 22:47:09,647 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 22:47:09,647 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 22:47:09,647 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 22:47:09,648 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 22:47:09,648 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 22:47:09,648 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 22:47:09,648 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 22:47:09,648 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 22:47:09,649 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 22:47:09,649 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 22:47:09,649 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 22:47:09,649 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 22:47:09,649 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 22:47:09,650 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 22:47:09,650 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 22:47:09,650 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 22:47:09,650 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 22:47:09,650 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 22:47:09,651 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 22:47:09,651 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 22:47:09,651 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 22:47:09,651 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 22:47:09,652 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 22:47:09,652 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 22:47:09,652 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 22:47:09,652 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 22:47:09,652 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 22:47:09,653 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 22:47:09,653 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 22:47:09,687 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 22:47:09,697 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 22:47:09,700 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 22:47:09,701 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 22:47:09,701 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 22:47:09,702 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-01-29 22:47:09,845 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 22:47:09,849 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 22:47:09,850 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 22:47:09,850 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 22:47:09,854 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 22:47:09,855 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:47:09" (1/1) ... [2018-01-29 22:47:09,857 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21e00d92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:47:09, skipping insertion in model container [2018-01-29 22:47:09,857 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:47:09" (1/1) ... [2018-01-29 22:47:09,875 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 22:47:09,915 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 22:47:10,028 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 22:47:10,045 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 22:47:10,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:47:10 WrapperNode [2018-01-29 22:47:10,053 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 22:47:10,054 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 22:47:10,054 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 22:47:10,054 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 22:47:10,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:47:10" (1/1) ... [2018-01-29 22:47:10,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:47:10" (1/1) ... [2018-01-29 22:47:10,081 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:47:10" (1/1) ... [2018-01-29 22:47:10,081 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:47:10" (1/1) ... [2018-01-29 22:47:10,085 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:47:10" (1/1) ... [2018-01-29 22:47:10,088 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:47:10" (1/1) ... [2018-01-29 22:47:10,089 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:47:10" (1/1) ... [2018-01-29 22:47:10,090 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 22:47:10,091 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 22:47:10,091 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 22:47:10,091 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 22:47:10,092 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:47:10" (1/1) ... No working directory specified, using /storage/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-01-29 22:47:10,135 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 22:47:10,135 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 22:47:10,135 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncat [2018-01-29 22:47:10,135 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 22:47:10,135 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-29 22:47:10,135 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-29 22:47:10,135 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 22:47:10,135 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 22:47:10,136 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 22:47:10,136 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-29 22:47:10,136 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncat [2018-01-29 22:47:10,136 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 22:47:10,136 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 22:47:10,136 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 22:47:10,390 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 22:47:10,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:47:10 BoogieIcfgContainer [2018-01-29 22:47:10,391 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 22:47:10,391 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 22:47:10,391 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 22:47:10,394 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 22:47:10,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:47:09" (1/3) ... [2018-01-29 22:47:10,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dc0a51b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:47:10, skipping insertion in model container [2018-01-29 22:47:10,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:47:10" (2/3) ... [2018-01-29 22:47:10,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dc0a51b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:47:10, skipping insertion in model container [2018-01-29 22:47:10,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:47:10" (3/3) ... [2018-01-29 22:47:10,396 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-01-29 22:47:10,405 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 22:47:10,411 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-29 22:47:10,460 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 22:47:10,461 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 22:47:10,461 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 22:47:10,461 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 22:47:10,461 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 22:47:10,461 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 22:47:10,461 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 22:47:10,462 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 22:47:10,462 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 22:47:10,483 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2018-01-29 22:47:10,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-29 22:47:10,490 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:47:10,491 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:47:10,491 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-29 22:47:10,496 INFO L82 PathProgramCache]: Analyzing trace with hash 690857739, now seen corresponding path program 1 times [2018-01-29 22:47:10,498 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:47:10,499 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:47:10,546 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:47:10,547 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:47:10,547 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:47:10,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:47:10,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:47:10,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:47:10,667 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:47:10,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-29 22:47:10,669 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 22:47:10,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 22:47:10,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 22:47:10,770 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 3 states. [2018-01-29 22:47:10,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:47:10,871 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2018-01-29 22:47:10,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 22:47:10,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-01-29 22:47:10,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:47:10,885 INFO L225 Difference]: With dead ends: 129 [2018-01-29 22:47:10,885 INFO L226 Difference]: Without dead ends: 85 [2018-01-29 22:47:10,889 INFO L553 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-01-29 22:47:10,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-29 22:47:10,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-29 22:47:10,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-29 22:47:10,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2018-01-29 22:47:10,934 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 21 [2018-01-29 22:47:10,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:47:10,935 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2018-01-29 22:47:10,935 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 22:47:10,935 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2018-01-29 22:47:10,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-29 22:47:10,936 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:47:10,936 INFO L350 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] [2018-01-29 22:47:10,936 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-29 22:47:10,936 INFO L82 PathProgramCache]: Analyzing trace with hash -81738253, now seen corresponding path program 1 times [2018-01-29 22:47:10,937 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:47:10,937 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:47:10,938 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:47:10,938 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:47:10,938 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:47:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:47:10,960 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:47:11,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:47:11,031 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:47:11,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 22:47:11,033 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 22:47:11,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 22:47:11,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 22:47:11,034 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 4 states. [2018-01-29 22:47:11,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:47:11,107 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-01-29 22:47:11,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 22:47:11,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-01-29 22:47:11,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:47:11,108 INFO L225 Difference]: With dead ends: 85 [2018-01-29 22:47:11,108 INFO L226 Difference]: Without dead ends: 84 [2018-01-29 22:47:11,109 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:47:11,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-01-29 22:47:11,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-01-29 22:47:11,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-29 22:47:11,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2018-01-29 22:47:11,116 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 24 [2018-01-29 22:47:11,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:47:11,116 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2018-01-29 22:47:11,116 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 22:47:11,116 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2018-01-29 22:47:11,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-29 22:47:11,117 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:47:11,117 INFO L350 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] [2018-01-29 22:47:11,117 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-29 22:47:11,117 INFO L82 PathProgramCache]: Analyzing trace with hash -81738252, now seen corresponding path program 1 times [2018-01-29 22:47:11,117 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:47:11,117 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:47:11,118 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:47:11,118 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:47:11,118 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:47:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:47:11,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:47:11,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:47:11,261 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:47:11,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-29 22:47:11,261 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 22:47:11,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 22:47:11,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-29 22:47:11,262 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 8 states. [2018-01-29 22:47:11,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:47:11,406 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2018-01-29 22:47:11,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 22:47:11,407 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-01-29 22:47:11,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:47:11,408 INFO L225 Difference]: With dead ends: 84 [2018-01-29 22:47:11,409 INFO L226 Difference]: Without dead ends: 83 [2018-01-29 22:47:11,409 INFO L553 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-01-29 22:47:11,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-29 22:47:11,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-01-29 22:47:11,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-29 22:47:11,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2018-01-29 22:47:11,417 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 24 [2018-01-29 22:47:11,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:47:11,418 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2018-01-29 22:47:11,418 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 22:47:11,418 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2018-01-29 22:47:11,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-29 22:47:11,419 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:47:11,419 INFO L350 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-01-29 22:47:11,419 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-29 22:47:11,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1761081471, now seen corresponding path program 1 times [2018-01-29 22:47:11,419 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:47:11,420 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:47:11,421 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:47:11,421 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:47:11,421 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:47:11,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:47:11,434 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:47:11,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:47:11,473 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:47:11,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 22:47:11,473 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 22:47:11,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 22:47:11,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 22:47:11,474 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 4 states. [2018-01-29 22:47:11,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:47:11,532 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2018-01-29 22:47:11,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 22:47:11,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-01-29 22:47:11,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:47:11,534 INFO L225 Difference]: With dead ends: 83 [2018-01-29 22:47:11,534 INFO L226 Difference]: Without dead ends: 82 [2018-01-29 22:47:11,535 INFO L553 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-01-29 22:47:11,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-29 22:47:11,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-01-29 22:47:11,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-29 22:47:11,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2018-01-29 22:47:11,543 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 25 [2018-01-29 22:47:11,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:47:11,544 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2018-01-29 22:47:11,544 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 22:47:11,544 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2018-01-29 22:47:11,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-29 22:47:11,545 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:47:11,545 INFO L350 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-01-29 22:47:11,545 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-29 22:47:11,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1761081472, now seen corresponding path program 1 times [2018-01-29 22:47:11,545 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:47:11,546 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:47:11,547 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:47:11,547 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:47:11,547 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:47:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:47:11,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:47:11,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:47:11,630 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:47:11,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 22:47:11,630 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 22:47:11,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 22:47:11,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:47:11,631 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand 5 states. [2018-01-29 22:47:11,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:47:11,711 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2018-01-29 22:47:11,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 22:47:11,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-29 22:47:11,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:47:11,712 INFO L225 Difference]: With dead ends: 82 [2018-01-29 22:47:11,713 INFO L226 Difference]: Without dead ends: 81 [2018-01-29 22:47:11,713 INFO L553 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-01-29 22:47:11,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-29 22:47:11,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-01-29 22:47:11,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-29 22:47:11,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-01-29 22:47:11,718 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 25 [2018-01-29 22:47:11,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:47:11,718 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-01-29 22:47:11,718 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 22:47:11,718 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-01-29 22:47:11,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-29 22:47:11,719 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:47:11,719 INFO L350 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] [2018-01-29 22:47:11,719 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-29 22:47:11,720 INFO L82 PathProgramCache]: Analyzing trace with hash -664390989, now seen corresponding path program 1 times [2018-01-29 22:47:11,720 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:47:11,720 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:47:11,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:47:11,721 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:47:11,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:47:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:47:11,737 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:47:11,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:47:11,784 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:47:11,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 22:47:11,785 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 22:47:11,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 22:47:11,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:47:11,785 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 6 states. [2018-01-29 22:47:11,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:47:11,881 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2018-01-29 22:47:11,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 22:47:11,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-01-29 22:47:11,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:47:11,886 INFO L225 Difference]: With dead ends: 100 [2018-01-29 22:47:11,886 INFO L226 Difference]: Without dead ends: 97 [2018-01-29 22:47:11,886 INFO L553 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-01-29 22:47:11,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-29 22:47:11,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2018-01-29 22:47:11,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-29 22:47:11,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2018-01-29 22:47:11,895 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 34 [2018-01-29 22:47:11,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:47:11,895 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2018-01-29 22:47:11,895 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 22:47:11,895 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2018-01-29 22:47:11,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-29 22:47:11,897 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:47:11,897 INFO L350 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] [2018-01-29 22:47:11,897 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-29 22:47:11,897 INFO L82 PathProgramCache]: Analyzing trace with hash -664390988, now seen corresponding path program 1 times [2018-01-29 22:47:11,897 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:47:11,897 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:47:11,898 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:47:11,898 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:47:11,899 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:47:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:47:11,913 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:47:12,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:47:12,080 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:47:12,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-29 22:47:12,080 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 22:47:12,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 22:47:12,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-29 22:47:12,081 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand 10 states. [2018-01-29 22:47:12,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:47:12,415 INFO L93 Difference]: Finished difference Result 115 states and 127 transitions. [2018-01-29 22:47:12,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-29 22:47:12,415 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-01-29 22:47:12,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:47:12,417 INFO L225 Difference]: With dead ends: 115 [2018-01-29 22:47:12,417 INFO L226 Difference]: Without dead ends: 112 [2018-01-29 22:47:12,417 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-01-29 22:47:12,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-29 22:47:12,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 100. [2018-01-29 22:47:12,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-29 22:47:12,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2018-01-29 22:47:12,426 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 34 [2018-01-29 22:47:12,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:47:12,426 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2018-01-29 22:47:12,427 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 22:47:12,427 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2018-01-29 22:47:12,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-29 22:47:12,428 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:47:12,428 INFO L350 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, 1] [2018-01-29 22:47:12,429 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-29 22:47:12,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1121195721, now seen corresponding path program 1 times [2018-01-29 22:47:12,429 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:47:12,429 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:47:12,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:47:12,430 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:47:12,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:47:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:47:12,445 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:47:12,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:47:12,599 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:47:12,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-29 22:47:12,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 22:47:12,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 22:47:12,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-29 22:47:12,600 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand 10 states. [2018-01-29 22:47:12,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:47:12,803 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2018-01-29 22:47:12,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-29 22:47:12,803 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2018-01-29 22:47:12,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:47:12,805 INFO L225 Difference]: With dead ends: 106 [2018-01-29 22:47:12,805 INFO L226 Difference]: Without dead ends: 105 [2018-01-29 22:47:12,806 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-01-29 22:47:12,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-29 22:47:12,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2018-01-29 22:47:12,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-29 22:47:12,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 112 transitions. [2018-01-29 22:47:12,815 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 112 transitions. Word has length 40 [2018-01-29 22:47:12,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:47:12,815 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 112 transitions. [2018-01-29 22:47:12,815 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 22:47:12,815 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2018-01-29 22:47:12,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-29 22:47:12,817 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:47:12,817 INFO L350 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, 1] [2018-01-29 22:47:12,817 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-29 22:47:12,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1121195722, now seen corresponding path program 1 times [2018-01-29 22:47:12,817 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:47:12,817 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:47:12,818 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:47:12,818 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:47:12,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:47:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:47:12,852 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:47:12,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:47:12,901 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:47:12,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 22:47:12,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 22:47:12,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 22:47:12,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-29 22:47:12,902 INFO L87 Difference]: Start difference. First operand 100 states and 112 transitions. Second operand 7 states. [2018-01-29 22:47:12,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:47:12,997 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2018-01-29 22:47:12,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 22:47:12,998 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-01-29 22:47:12,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:47:12,999 INFO L225 Difference]: With dead ends: 103 [2018-01-29 22:47:12,999 INFO L226 Difference]: Without dead ends: 102 [2018-01-29 22:47:13,000 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-29 22:47:13,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-29 22:47:13,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2018-01-29 22:47:13,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-29 22:47:13,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2018-01-29 22:47:13,007 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 40 [2018-01-29 22:47:13,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:47:13,008 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2018-01-29 22:47:13,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 22:47:13,008 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2018-01-29 22:47:13,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-29 22:47:13,009 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:47:13,010 INFO L350 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, 1] [2018-01-29 22:47:13,010 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-29 22:47:13,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1330644862, now seen corresponding path program 1 times [2018-01-29 22:47:13,010 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:47:13,010 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:47:13,011 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:47:13,016 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:47:13,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:47:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:47:13,033 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:47:13,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:47:13,142 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:47:13,142 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 22:47:13,143 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 22:47:13,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 22:47:13,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:47:13,143 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 6 states. [2018-01-29 22:47:13,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:47:13,284 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2018-01-29 22:47:13,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 22:47:13,285 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-01-29 22:47:13,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:47:13,285 INFO L225 Difference]: With dead ends: 99 [2018-01-29 22:47:13,285 INFO L226 Difference]: Without dead ends: 85 [2018-01-29 22:47:13,286 INFO L553 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-01-29 22:47:13,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-29 22:47:13,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-01-29 22:47:13,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-29 22:47:13,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2018-01-29 22:47:13,290 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 40 [2018-01-29 22:47:13,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:47:13,290 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2018-01-29 22:47:13,291 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 22:47:13,291 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2018-01-29 22:47:13,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-29 22:47:13,292 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:47:13,292 INFO L350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:47:13,292 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-29 22:47:13,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1951532668, now seen corresponding path program 1 times [2018-01-29 22:47:13,292 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:47:13,292 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:47:13,293 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:47:13,293 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:47:13,294 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:47:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:47:13,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:47:13,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-29 22:47:13,366 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:47:13,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 22:47:13,367 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 22:47:13,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 22:47:13,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-29 22:47:13,367 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 7 states. [2018-01-29 22:47:13,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:47:13,462 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2018-01-29 22:47:13,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 22:47:13,462 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-01-29 22:47:13,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:47:13,463 INFO L225 Difference]: With dead ends: 87 [2018-01-29 22:47:13,463 INFO L226 Difference]: Without dead ends: 86 [2018-01-29 22:47:13,464 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-29 22:47:13,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-29 22:47:13,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-01-29 22:47:13,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-29 22:47:13,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2018-01-29 22:47:13,469 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 41 [2018-01-29 22:47:13,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:47:13,470 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2018-01-29 22:47:13,470 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 22:47:13,470 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2018-01-29 22:47:13,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-29 22:47:13,471 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:47:13,471 INFO L350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:47:13,471 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-29 22:47:13,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1951532667, now seen corresponding path program 1 times [2018-01-29 22:47:13,471 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:47:13,471 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:47:13,472 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:47:13,472 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:47:13,472 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:47:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:47:13,485 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:47:13,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:47:13,665 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:47:13,665 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-29 22:47:13,670 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:47:13,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:47:13,711 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:47:13,847 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-01-29 22:47:13,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:47:13,870 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-01-29 22:47:13,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:47:13,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:47:13,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-01-29 22:47:13,982 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:47:13,983 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:47:13,986 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-01-29 22:47:13,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:47:14,003 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:47:14,004 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:47:14,005 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-01-29 22:47:14,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:47:14,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:47:14,015 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:18 [2018-01-29 22:47:14,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:47:14,368 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:47:14,368 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2018-01-29 22:47:14,368 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-29 22:47:14,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-29 22:47:14,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2018-01-29 22:47:14,369 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand 26 states. [2018-01-29 22:47:15,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:47:15,377 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2018-01-29 22:47:15,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-29 22:47:15,377 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 41 [2018-01-29 22:47:15,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:47:15,378 INFO L225 Difference]: With dead ends: 115 [2018-01-29 22:47:15,378 INFO L226 Difference]: Without dead ends: 109 [2018-01-29 22:47:15,379 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=175, Invalid=1085, Unknown=0, NotChecked=0, Total=1260 [2018-01-29 22:47:15,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-29 22:47:15,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 91. [2018-01-29 22:47:15,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-29 22:47:15,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2018-01-29 22:47:15,385 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 41 [2018-01-29 22:47:15,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:47:15,385 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2018-01-29 22:47:15,385 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-29 22:47:15,385 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2018-01-29 22:47:15,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-29 22:47:15,386 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:47:15,386 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:47:15,386 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-29 22:47:15,386 INFO L82 PathProgramCache]: Analyzing trace with hash -502196844, now seen corresponding path program 2 times [2018-01-29 22:47:15,387 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:47:15,387 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:47:15,387 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:47:15,388 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:47:15,388 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:47:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:47:15,405 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:47:15,914 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:47:15,914 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:47:15,914 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:47:15,920 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:47:15,932 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:47:15,938 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:47:15,939 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:47:15,943 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:47:15,990 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-01-29 22:47:15,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:47:15,998 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-01-29 22:47:15,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:47:16,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:47:16,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-01-29 22:47:16,054 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:47:16,054 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:47:16,055 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-01-29 22:47:16,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:47:16,067 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:47:16,067 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:47:16,068 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-01-29 22:47:16,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:47:16,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:47:16,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-01-29 22:47:16,127 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-01-29 22:47:16,129 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-01-29 22:47:16,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:47:16,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:47:16,138 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-01-29 22:47:16,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-01-29 22:47:16,186 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:47:16,190 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-01-29 22:47:16,193 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-01-29 22:47:16,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:47:16,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:47:16,208 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-01-29 22:47:16,208 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:48 [2018-01-29 22:47:16,424 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:47:16,426 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-01-29 22:47:16,439 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-01-29 22:47:16,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:47:16,452 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 20 [2018-01-29 22:47:16,453 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-29 22:47:16,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:47:16,472 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 2 xjuncts. [2018-01-29 22:47:16,472 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:55, output treesize:67 [2018-01-29 22:47:16,775 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:47:16,799 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:47:16,799 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 34 [2018-01-29 22:47:16,799 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-29 22:47:16,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-29 22:47:16,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1081, Unknown=0, NotChecked=0, Total=1190 [2018-01-29 22:47:16,800 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand 35 states. [2018-01-29 22:47:17,597 WARN L143 SmtUtils]: Spent 582ms on a formula simplification that was a NOOP. DAG size: 52 [2018-01-29 22:47:18,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:47:18,484 INFO L93 Difference]: Finished difference Result 147 states and 155 transitions. [2018-01-29 22:47:18,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-29 22:47:18,507 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 48 [2018-01-29 22:47:18,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:47:18,508 INFO L225 Difference]: With dead ends: 147 [2018-01-29 22:47:18,508 INFO L226 Difference]: Without dead ends: 141 [2018-01-29 22:47:18,509 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=335, Invalid=2421, Unknown=0, NotChecked=0, Total=2756 [2018-01-29 22:47:18,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-01-29 22:47:18,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 98. [2018-01-29 22:47:18,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-29 22:47:18,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2018-01-29 22:47:18,518 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 48 [2018-01-29 22:47:18,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:47:18,519 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2018-01-29 22:47:18,519 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-29 22:47:18,519 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2018-01-29 22:47:18,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-29 22:47:18,520 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:47:18,520 INFO L350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:47:18,520 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-29 22:47:18,520 INFO L82 PathProgramCache]: Analyzing trace with hash -386989811, now seen corresponding path program 1 times [2018-01-29 22:47:18,521 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:47:18,521 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:47:18,522 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:47:18,522 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:47:18,522 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:47:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:47:18,534 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:47:18,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:47:18,601 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:47:18,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 22:47:18,602 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 22:47:18,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 22:47:18,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-29 22:47:18,602 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand 7 states. [2018-01-29 22:47:18,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:47:18,663 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2018-01-29 22:47:18,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 22:47:18,663 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-01-29 22:47:18,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:47:18,664 INFO L225 Difference]: With dead ends: 98 [2018-01-29 22:47:18,664 INFO L226 Difference]: Without dead ends: 96 [2018-01-29 22:47:18,664 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-29 22:47:18,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-29 22:47:18,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-01-29 22:47:18,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-29 22:47:18,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2018-01-29 22:47:18,672 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 52 [2018-01-29 22:47:18,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:47:18,673 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2018-01-29 22:47:18,673 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 22:47:18,673 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2018-01-29 22:47:18,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-29 22:47:18,673 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:47:18,673 INFO L350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:47:18,673 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-29 22:47:18,673 INFO L82 PathProgramCache]: Analyzing trace with hash -386989810, now seen corresponding path program 1 times [2018-01-29 22:47:18,674 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:47:18,674 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:47:18,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:47:18,674 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:47:18,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:47:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:47:18,686 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:47:18,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:47:18,852 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:47:18,852 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-29 22:47:18,852 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-29 22:47:18,853 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-29 22:47:18,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-01-29 22:47:18,853 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand 14 states. [2018-01-29 22:47:19,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:47:19,104 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2018-01-29 22:47:19,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-29 22:47:19,104 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 52 [2018-01-29 22:47:19,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:47:19,105 INFO L225 Difference]: With dead ends: 127 [2018-01-29 22:47:19,105 INFO L226 Difference]: Without dead ends: 121 [2018-01-29 22:47:19,106 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2018-01-29 22:47:19,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-29 22:47:19,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2018-01-29 22:47:19,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-29 22:47:19,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2018-01-29 22:47:19,115 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 52 [2018-01-29 22:47:19,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:47:19,116 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2018-01-29 22:47:19,116 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-29 22:47:19,116 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2018-01-29 22:47:19,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-29 22:47:19,117 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:47:19,117 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:47:19,117 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-29 22:47:19,118 INFO L82 PathProgramCache]: Analyzing trace with hash -580379995, now seen corresponding path program 3 times [2018-01-29 22:47:19,118 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:47:19,118 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:47:19,119 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:47:19,119 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:47:19,119 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:47:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:47:19,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:47:19,662 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:47:19,663 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:47:19,663 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:47:19,667 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 22:47:19,679 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:47:19,683 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:47:19,686 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:47:19,689 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:47:19,690 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:47:19,695 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:47:19,750 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-01-29 22:47:19,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:47:19,758 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-01-29 22:47:19,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:47:19,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:47:19,765 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-01-29 22:47:19,823 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:47:19,823 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:47:19,824 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-01-29 22:47:19,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:47:19,834 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:47:19,835 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-01-29 22:47:19,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:47:19,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:47:19,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:28 [2018-01-29 22:47:19,905 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-01-29 22:47:19,907 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-01-29 22:47:19,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:47:19,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:47:19,917 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-01-29 22:47:19,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-01-29 22:47:19,955 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:47:19,958 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-01-29 22:47:19,960 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-01-29 22:47:19,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:47:19,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:47:19,978 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-01-29 22:47:19,979 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:47 [2018-01-29 22:47:20,366 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:47:20,368 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-01-29 22:47:20,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-01-29 22:47:20,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:47:20,385 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 24 treesize of output 39 [2018-01-29 22:47:20,386 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-01-29 22:47:20,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:47:20,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-01-29 22:47:20,416 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:66, output treesize:227 [2018-01-29 22:47:20,799 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:47:20,819 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:47:20,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24] total 44 [2018-01-29 22:47:20,819 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-01-29 22:47:20,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-01-29 22:47:20,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1823, Unknown=0, NotChecked=0, Total=1980 [2018-01-29 22:47:20,820 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand 45 states. [2018-01-29 22:47:22,170 WARN L146 SmtUtils]: Spent 481ms on a formula simplification. DAG size of input: 113 DAG size of output 71 [2018-01-29 22:47:22,681 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 111 DAG size of output 65 [2018-01-29 22:47:23,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:47:23,730 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2018-01-29 22:47:23,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-29 22:47:23,763 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 55 [2018-01-29 22:47:23,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:47:23,764 INFO L225 Difference]: With dead ends: 155 [2018-01-29 22:47:23,764 INFO L226 Difference]: Without dead ends: 149 [2018-01-29 22:47:23,766 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=579, Invalid=3977, Unknown=0, NotChecked=0, Total=4556 [2018-01-29 22:47:23,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-01-29 22:47:23,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 121. [2018-01-29 22:47:23,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-29 22:47:23,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2018-01-29 22:47:23,774 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 55 [2018-01-29 22:47:23,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:47:23,774 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2018-01-29 22:47:23,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-01-29 22:47:23,774 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2018-01-29 22:47:23,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-29 22:47:23,774 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:47:23,775 INFO L350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:47:23,775 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-29 22:47:23,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1033530315, now seen corresponding path program 1 times [2018-01-29 22:47:23,775 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:47:23,775 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:47:23,775 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:47:23,776 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:47:23,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:47:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:47:23,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:47:23,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:47:23,983 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:47:23,983 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:47:23,988 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:47:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:47:24,010 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:47:24,018 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-01-29 22:47:24,020 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-01-29 22:47:24,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:47:24,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:47:24,030 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-01-29 22:47:24,031 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-29 22:47:24,227 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-01-29 22:47:24,232 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-01-29 22:47:24,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:47:24,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:47:24,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:47:24,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-29 22:47:24,305 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:47:24,329 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:47:24,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2018-01-29 22:47:24,330 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-29 22:47:24,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-29 22:47:24,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2018-01-29 22:47:24,330 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand 21 states. [2018-01-29 22:47:24,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:47:24,964 INFO L93 Difference]: Finished difference Result 150 states and 162 transitions. [2018-01-29 22:47:24,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-29 22:47:24,964 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2018-01-29 22:47:24,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:47:24,965 INFO L225 Difference]: With dead ends: 150 [2018-01-29 22:47:24,965 INFO L226 Difference]: Without dead ends: 149 [2018-01-29 22:47:24,965 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=140, Invalid=852, Unknown=0, NotChecked=0, Total=992 [2018-01-29 22:47:24,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-01-29 22:47:24,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 138. [2018-01-29 22:47:24,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-29 22:47:24,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 150 transitions. [2018-01-29 22:47:24,974 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 150 transitions. Word has length 55 [2018-01-29 22:47:24,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:47:24,975 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 150 transitions. [2018-01-29 22:47:24,975 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-29 22:47:24,975 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2018-01-29 22:47:24,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-29 22:47:24,975 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:47:24,975 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:47:24,975 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-29 22:47:24,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1473571425, now seen corresponding path program 1 times [2018-01-29 22:47:24,976 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:47:24,976 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:47:24,976 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:47:24,976 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:47:24,976 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:47:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:47:24,988 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:47:25,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:47:25,439 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:47:25,439 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:47:25,449 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:47:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:47:25,472 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:47:25,475 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-01-29 22:47:25,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:47:25,483 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-01-29 22:47:25,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:47:25,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:47:25,491 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-01-29 22:47:25,544 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:47:25,544 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:47:25,545 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-01-29 22:47:25,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:47:25,554 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:47:25,555 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-01-29 22:47:25,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:47:25,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:47:25,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:19 [2018-01-29 22:47:25,608 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-01-29 22:47:25,610 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-01-29 22:47:25,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:47:25,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:47:25,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:47:25,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-01-29 22:47:25,910 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-01-29 22:47:25,915 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-01-29 22:47:25,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:47:25,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:47:25,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-29 22:47:25,925 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:55 [2018-01-29 22:47:26,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:47:26,120 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:47:26,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 40 [2018-01-29 22:47:26,121 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-29 22:47:26,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-29 22:47:26,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1528, Unknown=0, NotChecked=0, Total=1640 [2018-01-29 22:47:26,121 INFO L87 Difference]: Start difference. First operand 138 states and 150 transitions. Second operand 41 states. [2018-01-29 22:47:27,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:47:27,992 INFO L93 Difference]: Finished difference Result 172 states and 184 transitions. [2018-01-29 22:47:27,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-29 22:47:27,993 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 59 [2018-01-29 22:47:27,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:47:27,993 INFO L225 Difference]: With dead ends: 172 [2018-01-29 22:47:27,994 INFO L226 Difference]: Without dead ends: 165 [2018-01-29 22:47:27,995 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=433, Invalid=3989, Unknown=0, NotChecked=0, Total=4422 [2018-01-29 22:47:27,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-01-29 22:47:28,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 138. [2018-01-29 22:47:28,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-29 22:47:28,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 150 transitions. [2018-01-29 22:47:28,003 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 150 transitions. Word has length 59 [2018-01-29 22:47:28,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:47:28,003 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 150 transitions. [2018-01-29 22:47:28,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-29 22:47:28,004 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2018-01-29 22:47:28,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-29 22:47:28,004 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:47:28,004 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-29 22:47:28,005 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-29 22:47:28,005 INFO L82 PathProgramCache]: Analyzing trace with hash 235237492, now seen corresponding path program 4 times [2018-01-29 22:47:28,005 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:47:28,005 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:47:28,005 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:47:28,006 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:47:28,006 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:47:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:47:28,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:47:28,361 WARN L146 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 22 DAG size of output 15 [2018-01-29 22:47:29,081 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:47:29,082 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:47:29,118 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:47:29,123 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 22:47:29,141 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:47:29,146 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:47:29,213 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-01-29 22:47:29,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:47:29,221 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-01-29 22:47:29,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:47:29,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:47:29,227 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-01-29 22:47:29,291 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:47:29,292 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:47:29,292 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-01-29 22:47:29,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:47:29,302 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:47:29,303 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-01-29 22:47:29,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:47:29,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:47:29,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-01-29 22:47:29,382 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-01-29 22:47:29,384 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-01-29 22:47:29,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:47:29,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:47:29,392 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-01-29 22:47:29,393 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-01-29 22:47:29,433 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:47:29,436 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-01-29 22:47:29,438 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-01-29 22:47:29,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:47:29,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:47:29,450 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-01-29 22:47:29,450 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:48 [2018-01-29 22:47:30,220 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:47:30,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2018-01-29 22:47:30,224 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:47:30,225 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:47:30,226 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:47:30,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 73 [2018-01-29 22:47:30,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:47:30,254 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-01-29 22:47:30,255 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 22:47:30,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:47:30,288 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-01-29 22:47:30,289 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:83, output treesize:146 [2018-01-29 22:47:30,788 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:47:30,808 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:47:30,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 51 [2018-01-29 22:47:30,808 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-01-29 22:47:30,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-01-29 22:47:30,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2491, Unknown=0, NotChecked=0, Total=2652 [2018-01-29 22:47:30,809 INFO L87 Difference]: Start difference. First operand 138 states and 150 transitions. Second operand 52 states. [2018-01-29 22:47:33,841 WARN L146 SmtUtils]: Spent 2604ms on a formula simplification. DAG size of input: 89 DAG size of output 52 [2018-01-29 22:47:37,098 WARN L146 SmtUtils]: Spent 267ms on a formula simplification. DAG size of input: 100 DAG size of output 76 [2018-01-29 22:47:42,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:47:42,089 INFO L93 Difference]: Finished difference Result 197 states and 209 transitions. [2018-01-29 22:47:42,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-29 22:47:42,090 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 62 [2018-01-29 22:47:42,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:47:42,091 INFO L225 Difference]: With dead ends: 197 [2018-01-29 22:47:42,091 INFO L226 Difference]: Without dead ends: 191 [2018-01-29 22:47:42,093 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1696 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=596, Invalid=6374, Unknown=2, NotChecked=0, Total=6972 [2018-01-29 22:47:42,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-01-29 22:47:42,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 145. [2018-01-29 22:47:42,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-01-29 22:47:42,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 158 transitions. [2018-01-29 22:47:42,142 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 158 transitions. Word has length 62 [2018-01-29 22:47:42,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:47:42,142 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 158 transitions. [2018-01-29 22:47:42,142 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-01-29 22:47:42,142 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 158 transitions. [2018-01-29 22:47:42,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-29 22:47:42,143 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:47:42,143 INFO L350 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, 1, 1, 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-01-29 22:47:42,143 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-29 22:47:42,143 INFO L82 PathProgramCache]: Analyzing trace with hash -75830290, now seen corresponding path program 2 times [2018-01-29 22:47:42,143 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:47:42,143 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:47:42,144 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:47:42,144 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:47:42,144 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:47:42,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:47:42,159 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:47:42,963 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:47:42,963 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:47:42,963 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:47:42,969 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:47:42,985 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:47:42,991 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:47:42,993 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:47:42,998 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:47:43,013 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-01-29 22:47:43,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:47:43,021 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-01-29 22:47:43,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:47:43,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:47:43,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-01-29 22:47:43,131 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:47:43,139 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:47:43,140 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-01-29 22:47:43,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:47:43,160 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:47:43,161 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:47:43,162 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-01-29 22:47:43,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:47:43,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:47:43,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-01-29 22:47:43,257 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-01-29 22:47:43,258 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-01-29 22:47:43,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:47:43,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:47:43,267 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-01-29 22:47:43,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-01-29 22:47:43,306 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:47:43,309 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-01-29 22:47:43,311 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-01-29 22:47:43,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:47:43,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:47:43,324 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-01-29 22:47:43,324 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:48 [2018-01-29 22:47:44,213 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:47:44,214 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 39 [2018-01-29 22:47:44,235 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-01-29 22:47:44,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:47:44,245 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 17 [2018-01-29 22:47:44,246 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 22:47:44,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:47:44,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-29 22:47:44,291 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:76, output treesize:128 [2018-01-29 22:47:44,584 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:47:44,604 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:47:44,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 50 [2018-01-29 22:47:44,604 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-01-29 22:47:44,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-01-29 22:47:44,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2396, Unknown=0, NotChecked=0, Total=2550 [2018-01-29 22:47:44,605 INFO L87 Difference]: Start difference. First operand 145 states and 158 transitions. Second operand 51 states. [2018-01-29 22:47:45,868 WARN L146 SmtUtils]: Spent 204ms on a formula simplification. DAG size of input: 115 DAG size of output 83 [2018-01-29 22:47:47,267 WARN L146 SmtUtils]: Spent 1138ms on a formula simplification. DAG size of input: 126 DAG size of output 85 [2018-01-29 22:47:48,243 WARN L146 SmtUtils]: Spent 875ms on a formula simplification. DAG size of input: 124 DAG size of output 83 [2018-01-29 22:47:50,350 WARN L146 SmtUtils]: Spent 722ms on a formula simplification. DAG size of input: 146 DAG size of output 103 [2018-01-29 22:47:50,586 WARN L146 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 135 DAG size of output 105 [2018-01-29 22:47:51,127 WARN L146 SmtUtils]: Spent 235ms on a formula simplification. DAG size of input: 117 DAG size of output 90 [2018-01-29 22:47:56,252 WARN L146 SmtUtils]: Spent 702ms on a formula simplification. DAG size of input: 120 DAG size of output 93 [2018-01-29 22:47:56,749 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 116 DAG size of output 90 [2018-01-29 22:47:56,943 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 128 DAG size of output 95 [2018-01-29 22:48:01,980 WARN L146 SmtUtils]: Spent 290ms on a formula simplification. DAG size of input: 128 DAG size of output 100 [2018-01-29 22:48:04,765 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 127 DAG size of output 99 [2018-01-29 22:48:09,877 WARN L146 SmtUtils]: Spent 289ms on a formula simplification. DAG size of input: 110 DAG size of output 96 [2018-01-29 22:48:10,693 WARN L146 SmtUtils]: Spent 516ms on a formula simplification. DAG size of input: 98 DAG size of output 84 [2018-01-29 22:48:10,965 WARN L146 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 124 DAG size of output 101 [2018-01-29 22:48:11,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:48:11,338 INFO L93 Difference]: Finished difference Result 204 states and 217 transitions. [2018-01-29 22:48:11,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-01-29 22:48:11,339 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 66 [2018-01-29 22:48:11,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:48:11,340 INFO L225 Difference]: With dead ends: 204 [2018-01-29 22:48:11,340 INFO L226 Difference]: Without dead ends: 198 [2018-01-29 22:48:11,342 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2024 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=896, Invalid=7656, Unknown=4, NotChecked=0, Total=8556 [2018-01-29 22:48:11,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-01-29 22:48:11,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 145. [2018-01-29 22:48:11,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-01-29 22:48:11,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 158 transitions. [2018-01-29 22:48:11,359 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 158 transitions. Word has length 66 [2018-01-29 22:48:11,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:48:11,359 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 158 transitions. [2018-01-29 22:48:11,359 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-01-29 22:48:11,359 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 158 transitions. [2018-01-29 22:48:11,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-29 22:48:11,360 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:48:11,360 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:48:11,360 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-29 22:48:11,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1996873972, now seen corresponding path program 1 times [2018-01-29 22:48:11,361 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:48:11,361 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:48:11,361 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:48:11,361 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:48:11,362 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:48:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:48:11,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:48:11,779 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:48:11,780 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:48:11,780 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:48:11,784 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:48:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:48:11,806 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:48:11,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:48:11,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:48:11,815 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-01-29 22:48:11,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:48:11,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:48:11,820 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-01-29 22:48:11,863 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:48:11,864 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:48:11,864 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-01-29 22:48:11,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:48:11,872 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:48:11,873 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:48:11,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-01-29 22:48:11,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:48:11,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:48:11,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-01-29 22:48:12,334 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:48:12,354 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:48:12,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 42 [2018-01-29 22:48:12,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-01-29 22:48:12,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-01-29 22:48:12,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1690, Unknown=0, NotChecked=0, Total=1806 [2018-01-29 22:48:12,355 INFO L87 Difference]: Start difference. First operand 145 states and 158 transitions. Second operand 43 states. [2018-01-29 22:48:13,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:48:13,486 INFO L93 Difference]: Finished difference Result 193 states and 207 transitions. [2018-01-29 22:48:13,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-29 22:48:13,487 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 67 [2018-01-29 22:48:13,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:48:13,488 INFO L225 Difference]: With dead ends: 193 [2018-01-29 22:48:13,488 INFO L226 Difference]: Without dead ends: 187 [2018-01-29 22:48:13,489 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=410, Invalid=3622, Unknown=0, NotChecked=0, Total=4032 [2018-01-29 22:48:13,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-01-29 22:48:13,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 180. [2018-01-29 22:48:13,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-01-29 22:48:13,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 194 transitions. [2018-01-29 22:48:13,500 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 194 transitions. Word has length 67 [2018-01-29 22:48:13,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:48:13,500 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 194 transitions. [2018-01-29 22:48:13,500 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-01-29 22:48:13,500 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 194 transitions. [2018-01-29 22:48:13,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-29 22:48:13,501 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:48:13,501 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-29 22:48:13,501 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-29 22:48:13,501 INFO L82 PathProgramCache]: Analyzing trace with hash 633455557, now seen corresponding path program 5 times [2018-01-29 22:48:13,501 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:48:13,501 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:48:13,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:48:13,502 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:48:13,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:48:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:48:13,522 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:48:13,886 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 33 DAG size of output 24 [2018-01-29 22:48:14,741 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:48:14,741 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:48:14,742 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:48:14,746 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 22:48:14,753 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:48:14,755 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:48:14,757 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:48:14,759 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:48:14,760 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:48:14,767 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:48:14,771 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:48:14,775 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:48:14,841 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-01-29 22:48:14,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:48:14,848 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-01-29 22:48:14,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:48:14,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:48:14,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-01-29 22:48:14,920 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:48:14,920 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:48:14,921 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-01-29 22:48:14,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:48:14,930 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:48:14,930 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-01-29 22:48:14,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:48:14,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:48:14,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-01-29 22:48:15,005 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-01-29 22:48:15,006 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-01-29 22:48:15,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:48:15,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:48:15,014 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-01-29 22:48:15,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-01-29 22:48:15,054 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:48:15,057 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-01-29 22:48:15,059 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-01-29 22:48:15,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:48:15,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:48:15,070 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-01-29 22:48:15,070 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:48 [2018-01-29 22:48:16,082 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:48:16,084 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 65 treesize of output 57 [2018-01-29 22:48:16,086 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:48:16,087 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:48:16,088 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:48:16,089 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:48:16,090 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:48:16,090 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:48:16,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 113 [2018-01-29 22:48:16,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:48:16,133 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-01-29 22:48:16,133 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 22:48:16,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:48:16,174 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-01-29 22:48:16,174 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:93, output treesize:166 [2018-01-29 22:48:16,589 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:48:16,610 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:48:16,611 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31] total 59 [2018-01-29 22:48:16,611 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-01-29 22:48:16,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-01-29 22:48:16,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=3254, Unknown=0, NotChecked=0, Total=3540 [2018-01-29 22:48:16,612 INFO L87 Difference]: Start difference. First operand 180 states and 194 transitions. Second operand 60 states. [2018-01-29 22:48:21,757 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 122 DAG size of output 107 [2018-01-29 22:48:22,053 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 125 DAG size of output 110 [2018-01-29 22:48:22,463 WARN L146 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 135 DAG size of output 102 [2018-01-29 22:48:22,719 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 115 DAG size of output 95 [2018-01-29 22:48:22,954 WARN L146 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 133 DAG size of output 114 [2018-01-29 22:48:23,192 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 109 DAG size of output 94 [2018-01-29 22:48:26,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:48:26,978 INFO L93 Difference]: Finished difference Result 264 states and 282 transitions. [2018-01-29 22:48:26,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-01-29 22:48:26,998 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 69 [2018-01-29 22:48:26,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:48:26,999 INFO L225 Difference]: With dead ends: 264 [2018-01-29 22:48:26,999 INFO L226 Difference]: Without dead ends: 255 [2018-01-29 22:48:27,001 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3303 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=1101, Invalid=9819, Unknown=0, NotChecked=0, Total=10920 [2018-01-29 22:48:27,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-01-29 22:48:27,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 194. [2018-01-29 22:48:27,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-01-29 22:48:27,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 210 transitions. [2018-01-29 22:48:27,023 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 210 transitions. Word has length 69 [2018-01-29 22:48:27,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:48:27,024 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 210 transitions. [2018-01-29 22:48:27,024 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-01-29 22:48:27,024 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 210 transitions. [2018-01-29 22:48:27,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-29 22:48:27,025 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:48:27,025 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:48:27,025 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-29 22:48:27,025 INFO L82 PathProgramCache]: Analyzing trace with hash 807193975, now seen corresponding path program 2 times [2018-01-29 22:48:27,025 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:48:27,026 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:48:27,026 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:48:27,026 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:48:27,027 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:48:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:48:27,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:48:27,278 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 22 DAG size of output 18 [2018-01-29 22:48:27,605 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:48:27,606 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:48:27,606 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:48:27,611 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:48:27,625 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:48:27,632 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:48:27,635 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:48:27,637 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:48:27,640 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-01-29 22:48:27,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:48:27,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:48:27,641 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-29 22:48:27,643 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:48:27,644 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:48:27,644 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-01-29 22:48:27,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:48:27,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 6 treesize of output 5 [2018-01-29 22:48:27,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:48:27,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:48:27,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-29 22:48:27,694 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 16 treesize of output 13 [2018-01-29 22:48:27,695 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-01-29 22:48:27,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:48:27,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:48:27,701 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-01-29 22:48:27,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-29 22:48:28,023 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 24 treesize of output 25 [2018-01-29 22:48:28,025 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-01-29 22:48:28,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:48:28,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:48:28,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:48:28,036 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:26 [2018-01-29 22:48:28,164 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 22 treesize of output 18 [2018-01-29 22:48:28,169 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-01-29 22:48:28,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:48:28,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:48:28,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:48:28,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-29 22:48:28,242 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:48:28,262 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:48:28,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 35 [2018-01-29 22:48:28,263 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-29 22:48:28,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-29 22:48:28,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1179, Unknown=0, NotChecked=0, Total=1260 [2018-01-29 22:48:28,263 INFO L87 Difference]: Start difference. First operand 194 states and 210 transitions. Second operand 36 states. [2018-01-29 22:48:30,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:48:30,047 INFO L93 Difference]: Finished difference Result 199 states and 213 transitions. [2018-01-29 22:48:30,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-29 22:48:30,048 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-01-29 22:48:30,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:48:30,049 INFO L225 Difference]: With dead ends: 199 [2018-01-29 22:48:30,049 INFO L226 Difference]: Without dead ends: 198 [2018-01-29 22:48:30,049 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=297, Invalid=2783, Unknown=0, NotChecked=0, Total=3080 [2018-01-29 22:48:30,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-01-29 22:48:30,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 175. [2018-01-29 22:48:30,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-01-29 22:48:30,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 190 transitions. [2018-01-29 22:48:30,065 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 190 transitions. Word has length 70 [2018-01-29 22:48:30,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:48:30,066 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 190 transitions. [2018-01-29 22:48:30,066 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-29 22:48:30,066 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 190 transitions. [2018-01-29 22:48:30,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-29 22:48:30,067 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:48:30,067 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 3, 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, 1, 1, 1, 1, 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-01-29 22:48:30,067 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-29 22:48:30,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1800089279, now seen corresponding path program 3 times [2018-01-29 22:48:30,067 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:48:30,067 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:48:30,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:48:30,068 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:48:30,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:48:30,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:48:30,086 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:48:31,664 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:48:31,664 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:48:31,664 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:48:31,669 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 22:48:31,683 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:48:31,688 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:48:31,692 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:48:31,696 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:48:31,698 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:48:31,701 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:48:31,771 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-01-29 22:48:31,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:48:31,778 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-01-29 22:48:31,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:48:31,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:48:31,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-01-29 22:48:31,875 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:48:31,875 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:48:31,876 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-01-29 22:48:31,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:48:31,886 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:48:31,886 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-01-29 22:48:31,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:48:31,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:48:31,894 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-01-29 22:48:31,964 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-01-29 22:48:31,966 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-01-29 22:48:31,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:48:31,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:48:31,974 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-01-29 22:48:31,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-01-29 22:48:32,016 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:48:32,019 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-01-29 22:48:32,020 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-01-29 22:48:32,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:48:32,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:48:32,032 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-01-29 22:48:32,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:48 [2018-01-29 22:48:42,192 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:48:42,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2018-01-29 22:48:42,200 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-01-29 22:48:42,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:48:42,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 41 [2018-01-29 22:48:42,217 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-29 22:48:42,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:48:42,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2018-01-29 22:48:42,257 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:89, output treesize:227 [2018-01-29 22:48:42,679 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 27 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:48:42,700 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:48:42,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 31] total 55 [2018-01-29 22:48:42,701 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-01-29 22:48:42,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-01-29 22:48:42,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2929, Unknown=4, NotChecked=0, Total=3080 [2018-01-29 22:48:42,702 INFO L87 Difference]: Start difference. First operand 175 states and 190 transitions. Second operand 56 states. [2018-01-29 22:48:44,321 WARN L143 SmtUtils]: Spent 517ms on a formula simplification that was a NOOP. DAG size: 71 [2018-01-29 22:48:46,215 WARN L143 SmtUtils]: Spent 137ms on a formula simplification that was a NOOP. DAG size: 96 [2018-01-29 22:48:52,987 WARN L146 SmtUtils]: Spent 2314ms on a formula simplification. DAG size of input: 115 DAG size of output 111 [2018-01-29 22:48:56,924 WARN L146 SmtUtils]: Spent 1435ms on a formula simplification. DAG size of input: 138 DAG size of output 113 [2018-01-29 22:49:00,494 WARN L146 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 132 DAG size of output 115 [2018-01-29 22:49:02,052 WARN L146 SmtUtils]: Spent 230ms on a formula simplification. DAG size of input: 136 DAG size of output 111 [2018-01-29 22:49:03,644 WARN L146 SmtUtils]: Spent 287ms on a formula simplification. DAG size of input: 124 DAG size of output 113 [2018-01-29 22:49:12,114 WARN L146 SmtUtils]: Spent 5584ms on a formula simplification. DAG size of input: 158 DAG size of output 135 [2018-01-29 22:49:14,888 WARN L146 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 149 DAG size of output 137 [2018-01-29 22:49:16,070 WARN L146 SmtUtils]: Spent 987ms on a formula simplification. DAG size of input: 127 DAG size of output 121 [2018-01-29 22:49:16,366 WARN L146 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 112 DAG size of output 101 [2018-01-29 22:49:17,219 WARN L146 SmtUtils]: Spent 683ms on a formula simplification. DAG size of input: 130 DAG size of output 118 [2018-01-29 22:49:18,724 WARN L146 SmtUtils]: Spent 273ms on a formula simplification. DAG size of input: 132 DAG size of output 111 [2018-01-29 22:49:20,687 WARN L146 SmtUtils]: Spent 687ms on a formula simplification. DAG size of input: 147 DAG size of output 126 [2018-01-29 22:49:20,940 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 130 DAG size of output 109 [2018-01-29 22:49:22,295 WARN L146 SmtUtils]: Spent 171ms on a formula simplification. DAG size of input: 143 DAG size of output 124 [2018-01-29 22:49:23,529 WARN L146 SmtUtils]: Spent 380ms on a formula simplification. DAG size of input: 149 DAG size of output 128 [2018-01-29 22:49:24,049 WARN L146 SmtUtils]: Spent 359ms on a formula simplification. DAG size of input: 160 DAG size of output 143 [2018-01-29 22:49:24,545 WARN L146 SmtUtils]: Spent 236ms on a formula simplification. DAG size of input: 155 DAG size of output 140 [2018-01-29 22:49:26,885 WARN L146 SmtUtils]: Spent 332ms on a formula simplification. DAG size of input: 140 DAG size of output 123 [2018-01-29 22:49:27,558 WARN L146 SmtUtils]: Spent 510ms on a formula simplification. DAG size of input: 135 DAG size of output 129 [2018-01-29 22:49:28,382 WARN L146 SmtUtils]: Spent 195ms on a formula simplification. DAG size of input: 161 DAG size of output 143 [2018-01-29 22:49:30,883 WARN L146 SmtUtils]: Spent 208ms on a formula simplification. DAG size of input: 144 DAG size of output 125 [2018-01-29 22:49:32,493 WARN L146 SmtUtils]: Spent 170ms on a formula simplification. DAG size of input: 141 DAG size of output 125 [2018-01-29 22:49:34,306 WARN L146 SmtUtils]: Spent 297ms on a formula simplification. DAG size of input: 139 DAG size of output 123 Received shutdown request... [2018-01-29 22:49:35,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-01-29 22:49:35,372 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-29 22:49:35,376 WARN L185 ceAbstractionStarter]: Timeout [2018-01-29 22:49:35,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 10:49:35 BoogieIcfgContainer [2018-01-29 22:49:35,377 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 22:49:35,377 INFO L168 Benchmark]: Toolchain (without parser) took 145532.19 ms. Allocated memory was 305.7 MB in the beginning and 588.3 MB in the end (delta: 282.6 MB). Free memory was 265.7 MB in the beginning and 471.7 MB in the end (delta: -206.0 MB). Peak memory consumption was 76.6 MB. Max. memory is 5.3 GB. [2018-01-29 22:49:35,378 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 305.7 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 22:49:35,378 INFO L168 Benchmark]: CACSL2BoogieTranslator took 203.81 ms. Allocated memory is still 305.7 MB. Free memory was 264.7 MB in the beginning and 254.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-29 22:49:35,379 INFO L168 Benchmark]: Boogie Preprocessor took 36.48 ms. Allocated memory is still 305.7 MB. Free memory was 254.7 MB in the beginning and 252.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-29 22:49:35,379 INFO L168 Benchmark]: RCFGBuilder took 300.16 ms. Allocated memory is still 305.7 MB. Free memory was 252.7 MB in the beginning and 230.0 MB in the end (delta: 22.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 5.3 GB. [2018-01-29 22:49:35,379 INFO L168 Benchmark]: TraceAbstraction took 144985.45 ms. Allocated memory was 305.7 MB in the beginning and 588.3 MB in the end (delta: 282.6 MB). Free memory was 229.0 MB in the beginning and 471.7 MB in the end (delta: -242.7 MB). Peak memory consumption was 39.9 MB. Max. memory is 5.3 GB. [2018-01-29 22:49:35,381 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.11 ms. Allocated memory is still 305.7 MB. Free memory is still 271.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 203.81 ms. Allocated memory is still 305.7 MB. Free memory was 264.7 MB in the beginning and 254.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.48 ms. Allocated memory is still 305.7 MB. Free memory was 254.7 MB in the beginning and 252.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 300.16 ms. Allocated memory is still 305.7 MB. Free memory was 252.7 MB in the beginning and 230.0 MB in the end (delta: 22.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 144985.45 ms. Allocated memory was 305.7 MB in the beginning and 588.3 MB in the end (delta: 282.6 MB). Free memory was 229.0 MB in the beginning and 471.7 MB in the end (delta: -242.7 MB). Peak memory consumption was 39.9 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 574). Cancelled while BasicCegarLoop was constructing difference of abstraction (175states) and interpolant automaton (currently 45 states, 56 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 171. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (175states) and interpolant automaton (currently 45 states, 56 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 171. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 574). Cancelled while BasicCegarLoop was constructing difference of abstraction (175states) and interpolant automaton (currently 45 states, 56 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 171. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (175states) and interpolant automaton (currently 45 states, 56 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 171. - TimeoutResultAtElement [Line: 557]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 557). Cancelled while BasicCegarLoop was constructing difference of abstraction (175states) and interpolant automaton (currently 45 states, 56 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 171. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (175states) and interpolant automaton (currently 45 states, 56 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 171. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (175states) and interpolant automaton (currently 45 states, 56 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 171. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (175states) and interpolant automaton (currently 45 states, 56 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 171. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (175states) and interpolant automaton (currently 45 states, 56 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 171. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (175states) and interpolant automaton (currently 45 states, 56 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 171. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (175states) and interpolant automaton (currently 45 states, 56 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 171. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (175states) and interpolant automaton (currently 45 states, 56 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 171. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (175states) and interpolant automaton (currently 45 states, 56 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 171. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 89 locations, 13 error locations. TIMEOUT Result, 144.9s OverallTime, 24 OverallIterations, 6 TraceHistogramMax, 114.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1739 SDtfs, 6016 SDslu, 18058 SDs, 0 SdLazy, 10794 SolverSat, 628 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 21.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1305 GetRequests, 460 SyntacticMatches, 7 SemanticMatches, 837 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13048 ImplicationChecksByTransitivity, 115.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred in iteration=22, 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.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 356 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 29.2s InterpolantComputationTime, 1782 NumberOfCodeBlocks, 1778 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 1747 ConstructedInterpolants, 316 QuantifiedInterpolants, 1795123 SizeOfPredicates, 306 NumberOfNonLiveVariables, 1983 ConjunctsInSsa, 648 ConjunctsInUnsatCore, 35 InterpolantComputations, 13 PerfectInterpolantSequences, 2/516 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_22-49-35-388.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_22-49-35-388.csv Completed graceful shutdown