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.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrncat-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 11:41:06,610 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 11:41:06,612 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 11:41:06,624 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 11:41:06,624 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 11:41:06,625 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 11:41:06,626 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 11:41:06,628 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 11:41:06,630 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 11:41:06,631 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 11:41:06,632 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 11:41:06,632 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 11:41:06,633 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 11:41:06,634 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 11:41:06,635 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 11:41:06,638 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 11:41:06,640 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 11:41:06,641 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 11:41:06,643 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 11:41:06,644 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 11:41:06,646 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 11:41:06,646 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 11:41:06,647 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 11:41:06,647 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 11:41:06,648 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 11:41:06,649 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 11:41:06,650 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 11:41:06,650 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 11:41:06,650 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 11:41:06,651 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 11:41:06,651 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 11:41:06,652 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.epf [2018-01-24 11:41:06,661 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 11:41:06,661 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 11:41:06,662 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 11:41:06,662 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 11:41:06,663 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 11:41:06,663 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 11:41:06,663 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 11:41:06,664 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 11:41:06,664 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 11:41:06,664 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 11:41:06,664 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 11:41:06,664 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 11:41:06,665 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 11:41:06,665 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 11:41:06,665 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 11:41:06,665 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 11:41:06,665 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 11:41:06,666 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 11:41:06,666 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 11:41:06,666 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 11:41:06,666 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 11:41:06,666 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 11:41:06,667 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 11:41:06,667 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 11:41:06,667 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 11:41:06,667 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 11:41:06,667 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 11:41:06,668 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 11:41:06,668 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 11:41:06,668 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 11:41:06,668 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 11:41:06,668 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 11:41:06,669 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 11:41:06,669 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 11:41:06,703 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 11:41:06,715 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 11:41:06,719 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 11:41:06,720 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 11:41:06,721 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 11:41:06,722 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-01-24 11:41:06,906 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 11:41:06,911 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 11:41:06,912 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 11:41:06,912 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 11:41:06,917 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 11:41:06,918 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:41:06" (1/1) ... [2018-01-24 11:41:06,921 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f3a9b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:41:06, skipping insertion in model container [2018-01-24 11:41:06,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:41:06" (1/1) ... [2018-01-24 11:41:06,939 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:41:06,979 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:41:07,089 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:41:07,106 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:41:07,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:41:07 WrapperNode [2018-01-24 11:41:07,115 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 11:41:07,116 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 11:41:07,116 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 11:41:07,116 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 11:41:07,132 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:41:07" (1/1) ... [2018-01-24 11:41:07,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:41:07" (1/1) ... [2018-01-24 11:41:07,143 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:41:07" (1/1) ... [2018-01-24 11:41:07,143 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:41:07" (1/1) ... [2018-01-24 11:41:07,147 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:41:07" (1/1) ... [2018-01-24 11:41:07,150 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:41:07" (1/1) ... [2018-01-24 11:41:07,151 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:41:07" (1/1) ... [2018-01-24 11:41:07,152 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 11:41:07,153 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 11:41:07,153 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 11:41:07,153 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 11:41:07,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:41:07" (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-24 11:41:07,202 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 11:41:07,202 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 11:41:07,203 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncat [2018-01-24 11:41:07,203 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 11:41:07,203 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 11:41:07,203 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 11:41:07,203 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 11:41:07,203 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 11:41:07,203 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 11:41:07,204 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 11:41:07,204 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncat [2018-01-24 11:41:07,204 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 11:41:07,204 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 11:41:07,204 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 11:41:07,451 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 11:41:07,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:41:07 BoogieIcfgContainer [2018-01-24 11:41:07,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 11:41:07,453 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 11:41:07,453 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 11:41:07,454 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 11:41:07,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:41:06" (1/3) ... [2018-01-24 11:41:07,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4352878c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:41:07, skipping insertion in model container [2018-01-24 11:41:07,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:41:07" (2/3) ... [2018-01-24 11:41:07,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4352878c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:41:07, skipping insertion in model container [2018-01-24 11:41:07,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:41:07" (3/3) ... [2018-01-24 11:41:07,458 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-01-24 11:41:07,465 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 11:41:07,471 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-24 11:41:07,512 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 11:41:07,512 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 11:41:07,512 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 11:41:07,512 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 11:41:07,513 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 11:41:07,513 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 11:41:07,513 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 11:41:07,513 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 11:41:07,514 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 11:41:07,535 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-01-24 11:41:07,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-24 11:41:07,542 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:41:07,544 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:41:07,544 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 11:41:07,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1927484354, now seen corresponding path program 1 times [2018-01-24 11:41:07,551 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:41:07,552 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:41:07,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:07,593 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:41:07,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:41:07,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:41:07,702 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-24 11:41:07,705 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:41:07,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 11:41:07,707 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 11:41:07,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 11:41:07,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 11:41:07,724 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 3 states. [2018-01-24 11:41:07,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:41:07,897 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2018-01-24 11:41:07,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 11:41:07,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-24 11:41:07,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:41:07,906 INFO L225 Difference]: With dead ends: 90 [2018-01-24 11:41:07,906 INFO L226 Difference]: Without dead ends: 55 [2018-01-24 11:41:07,909 INFO L525 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-24 11:41:07,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-24 11:41:07,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-24 11:41:07,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 11:41:07,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-01-24 11:41:07,941 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 11 [2018-01-24 11:41:07,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:41:07,941 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-01-24 11:41:07,941 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 11:41:07,941 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-01-24 11:41:07,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 11:41:07,942 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:41:07,942 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:41:07,942 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 11:41:07,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1621249811, now seen corresponding path program 1 times [2018-01-24 11:41:07,943 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:41:07,943 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:41:07,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:07,944 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:41:07,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:41:07,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:41:08,025 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-24 11:41:08,026 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:41:08,026 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:41:08,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:41:08,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:41:08,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:41:08,028 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 5 states. [2018-01-24 11:41:08,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:41:08,092 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2018-01-24 11:41:08,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:41:08,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-24 11:41:08,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:41:08,093 INFO L225 Difference]: With dead ends: 103 [2018-01-24 11:41:08,094 INFO L226 Difference]: Without dead ends: 55 [2018-01-24 11:41:08,095 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 11:41:08,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-24 11:41:08,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-24 11:41:08,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 11:41:08,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-01-24 11:41:08,103 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 15 [2018-01-24 11:41:08,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:41:08,103 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-01-24 11:41:08,103 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:41:08,104 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-01-24 11:41:08,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 11:41:08,104 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:41:08,105 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:41:08,105 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 11:41:08,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1993659115, now seen corresponding path program 1 times [2018-01-24 11:41:08,105 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:41:08,105 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:41:08,106 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:08,106 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:41:08,106 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:08,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:41:08,128 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:41:08,203 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-24 11:41:08,204 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:41:08,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:41:08,204 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:41:08,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:41:08,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:41:08,205 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 4 states. [2018-01-24 11:41:08,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:41:08,281 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2018-01-24 11:41:08,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 11:41:08,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-24 11:41:08,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:41:08,283 INFO L225 Difference]: With dead ends: 55 [2018-01-24 11:41:08,284 INFO L226 Difference]: Without dead ends: 54 [2018-01-24 11:41:08,284 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:41:08,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-24 11:41:08,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-24 11:41:08,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 11:41:08,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-01-24 11:41:08,290 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 15 [2018-01-24 11:41:08,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:41:08,291 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-01-24 11:41:08,291 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:41:08,291 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-01-24 11:41:08,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 11:41:08,292 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:41:08,292 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:41:08,292 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 11:41:08,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1993659114, now seen corresponding path program 1 times [2018-01-24 11:41:08,292 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:41:08,293 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:41:08,294 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:08,294 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:41:08,294 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:08,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:41:08,310 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:41:08,441 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-24 11:41:08,442 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:41:08,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 11:41:08,442 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 11:41:08,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 11:41:08,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:41:08,443 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 8 states. [2018-01-24 11:41:08,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:41:08,574 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-01-24 11:41:08,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:41:08,575 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-01-24 11:41:08,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:41:08,576 INFO L225 Difference]: With dead ends: 54 [2018-01-24 11:41:08,576 INFO L226 Difference]: Without dead ends: 53 [2018-01-24 11:41:08,576 INFO L525 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-24 11:41:08,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-24 11:41:08,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-24 11:41:08,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 11:41:08,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-01-24 11:41:08,581 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 15 [2018-01-24 11:41:08,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:41:08,581 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-01-24 11:41:08,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 11:41:08,581 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-01-24 11:41:08,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 11:41:08,582 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:41:08,582 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:41:08,582 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 11:41:08,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1673890416, now seen corresponding path program 1 times [2018-01-24 11:41:08,582 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:41:08,582 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:41:08,583 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:08,583 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:41:08,583 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:08,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:41:08,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:41:08,616 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-24 11:41:08,617 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:41:08,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:41:08,617 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:41:08,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:41:08,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:41:08,618 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 4 states. [2018-01-24 11:41:08,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:41:08,662 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-01-24 11:41:08,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 11:41:08,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 11:41:08,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:41:08,663 INFO L225 Difference]: With dead ends: 53 [2018-01-24 11:41:08,663 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 11:41:08,663 INFO L525 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-24 11:41:08,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 11:41:08,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-24 11:41:08,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 11:41:08,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-01-24 11:41:08,668 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 16 [2018-01-24 11:41:08,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:41:08,668 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-01-24 11:41:08,668 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:41:08,669 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-01-24 11:41:08,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 11:41:08,669 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:41:08,669 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:41:08,669 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 11:41:08,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1673890415, now seen corresponding path program 1 times [2018-01-24 11:41:08,670 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:41:08,670 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:41:08,671 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:08,671 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:41:08,671 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:08,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:41:08,683 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:41:08,763 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-24 11:41:08,763 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:41:08,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:41:08,764 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:41:08,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:41:08,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:41:08,764 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-01-24 11:41:08,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:41:08,791 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-01-24 11:41:08,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:41:08,791 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-01-24 11:41:08,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:41:08,792 INFO L225 Difference]: With dead ends: 52 [2018-01-24 11:41:08,792 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 11:41:08,792 INFO L525 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-24 11:41:08,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 11:41:08,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-24 11:41:08,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 11:41:08,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-01-24 11:41:08,796 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 16 [2018-01-24 11:41:08,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:41:08,796 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-01-24 11:41:08,796 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:41:08,797 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-01-24 11:41:08,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 11:41:08,797 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:41:08,797 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:41:08,797 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 11:41:08,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1745382581, now seen corresponding path program 1 times [2018-01-24 11:41:08,797 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:41:08,797 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:41:08,798 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:08,798 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:41:08,798 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:08,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:41:08,811 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:41:08,842 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-24 11:41:08,842 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:41:08,842 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:41:08,842 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:41:08,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:41:08,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:41:08,843 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 5 states. [2018-01-24 11:41:08,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:41:08,903 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-01-24 11:41:08,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:41:08,903 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-24 11:41:08,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:41:08,904 INFO L225 Difference]: With dead ends: 51 [2018-01-24 11:41:08,904 INFO L226 Difference]: Without dead ends: 47 [2018-01-24 11:41:08,904 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:41:08,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-24 11:41:08,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-24 11:41:08,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 11:41:08,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-01-24 11:41:08,908 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 20 [2018-01-24 11:41:08,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:41:08,908 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-01-24 11:41:08,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:41:08,909 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-01-24 11:41:08,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 11:41:08,909 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:41:08,909 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:41:08,909 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 11:41:08,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1745382582, now seen corresponding path program 1 times [2018-01-24 11:41:08,910 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:41:08,910 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:41:08,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:08,911 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:41:08,911 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:41:08,922 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:41:09,046 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-24 11:41:09,046 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:41:09,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 11:41:09,047 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 11:41:09,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 11:41:09,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 11:41:09,047 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 9 states. [2018-01-24 11:41:09,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:41:09,211 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2018-01-24 11:41:09,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 11:41:09,211 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-01-24 11:41:09,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:41:09,214 INFO L225 Difference]: With dead ends: 69 [2018-01-24 11:41:09,214 INFO L226 Difference]: Without dead ends: 65 [2018-01-24 11:41:09,214 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-01-24 11:41:09,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-24 11:41:09,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2018-01-24 11:41:09,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-24 11:41:09,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2018-01-24 11:41:09,220 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 20 [2018-01-24 11:41:09,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:41:09,220 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2018-01-24 11:41:09,220 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 11:41:09,220 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2018-01-24 11:41:09,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 11:41:09,221 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:41:09,221 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:41:09,221 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 11:41:09,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1818413707, now seen corresponding path program 1 times [2018-01-24 11:41:09,222 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:41:09,222 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:41:09,223 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:09,223 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:41:09,223 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:41:09,235 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:41:09,445 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-24 11:41:09,445 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:41:09,445 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-24 11:41:09,456 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:41:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:41:09,502 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:41:09,611 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-24 11:41:09,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:09,622 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-24 11:41:09,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:09,629 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-24 11:41:09,629 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-01-24 11:41:09,681 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:09,682 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:09,685 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-24 11:41:09,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:09,707 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:09,708 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:09,709 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-24 11:41:09,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:09,716 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-24 11:41:09,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:18 [2018-01-24 11:41:09,933 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-24 11:41:09,959 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:41:09,959 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2018-01-24 11:41:09,959 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-24 11:41:09,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-24 11:41:09,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-01-24 11:41:09,960 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand 22 states. [2018-01-24 11:41:10,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:41:10,574 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2018-01-24 11:41:10,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 11:41:10,603 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 23 [2018-01-24 11:41:10,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:41:10,604 INFO L225 Difference]: With dead ends: 87 [2018-01-24 11:41:10,605 INFO L226 Difference]: Without dead ends: 83 [2018-01-24 11:41:10,605 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2018-01-24 11:41:10,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-24 11:41:10,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 70. [2018-01-24 11:41:10,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-24 11:41:10,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2018-01-24 11:41:10,612 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 23 [2018-01-24 11:41:10,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:41:10,613 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2018-01-24 11:41:10,613 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-24 11:41:10,613 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2018-01-24 11:41:10,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 11:41:10,614 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:41:10,614 INFO L322 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-24 11:41:10,614 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 11:41:10,614 INFO L82 PathProgramCache]: Analyzing trace with hash -557502487, now seen corresponding path program 1 times [2018-01-24 11:41:10,615 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:41:10,615 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:41:10,616 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:10,616 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:41:10,616 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:41:10,629 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:41:10,666 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-24 11:41:10,667 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:41:10,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:41:10,667 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:41:10,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:41:10,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:41:10,668 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand 6 states. [2018-01-24 11:41:10,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:41:10,724 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2018-01-24 11:41:10,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:41:10,724 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-24 11:41:10,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:41:10,725 INFO L225 Difference]: With dead ends: 73 [2018-01-24 11:41:10,725 INFO L226 Difference]: Without dead ends: 72 [2018-01-24 11:41:10,726 INFO L525 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-24 11:41:10,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-24 11:41:10,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2018-01-24 11:41:10,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-24 11:41:10,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2018-01-24 11:41:10,732 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 83 transitions. Word has length 25 [2018-01-24 11:41:10,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:41:10,733 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 83 transitions. [2018-01-24 11:41:10,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:41:10,733 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2018-01-24 11:41:10,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 11:41:10,734 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:41:10,734 INFO L322 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-24 11:41:10,734 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 11:41:10,734 INFO L82 PathProgramCache]: Analyzing trace with hash -557502486, now seen corresponding path program 1 times [2018-01-24 11:41:10,734 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:41:10,734 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:41:10,735 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:10,735 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:41:10,735 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:41:10,747 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:41:10,809 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-24 11:41:10,809 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:41:10,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 11:41:10,809 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 11:41:10,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 11:41:10,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 11:41:10,810 INFO L87 Difference]: Start difference. First operand 69 states and 83 transitions. Second operand 9 states. [2018-01-24 11:41:10,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:41:10,899 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2018-01-24 11:41:10,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 11:41:10,900 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-01-24 11:41:10,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:41:10,900 INFO L225 Difference]: With dead ends: 99 [2018-01-24 11:41:10,900 INFO L226 Difference]: Without dead ends: 98 [2018-01-24 11:41:10,901 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-24 11:41:10,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-24 11:41:10,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 80. [2018-01-24 11:41:10,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-24 11:41:10,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 98 transitions. [2018-01-24 11:41:10,907 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 98 transitions. Word has length 25 [2018-01-24 11:41:10,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:41:10,907 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 98 transitions. [2018-01-24 11:41:10,907 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 11:41:10,907 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2018-01-24 11:41:10,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 11:41:10,908 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:41:10,908 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:41:10,908 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 11:41:10,908 INFO L82 PathProgramCache]: Analyzing trace with hash -59760490, now seen corresponding path program 2 times [2018-01-24 11:41:10,908 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:41:10,909 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:41:10,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:10,909 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:41:10,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:10,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:41:10,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:41:11,365 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:41:11,366 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:41:11,366 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-24 11:41:11,376 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 11:41:11,387 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:41:11,391 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:41:11,392 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:41:11,395 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:41:11,434 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-24 11:41:11,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:11,442 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-24 11:41:11,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:11,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:41:11,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-01-24 11:41:11,504 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:11,505 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:11,506 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-24 11:41:11,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:11,516 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:11,517 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-24 11:41:11,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:11,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:41:11,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-01-24 11:41:11,572 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-24 11:41:11,574 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-24 11:41:11,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:11,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:41:11,583 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-24 11:41:11,584 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-01-24 11:41:11,635 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:11,640 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-24 11:41:11,643 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-24 11:41:11,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:11,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:41:11,658 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-24 11:41:11,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:48 [2018-01-24 11:41:11,783 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:11,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-01-24 11:41:11,791 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 19 [2018-01-24 11:41:11,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:41:11,801 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-24 11:41:11,802 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:11,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:41:11,814 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-24 11:41:11,814 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:69 [2018-01-24 11:41:11,961 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:41:11,981 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:41:11,981 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 26 [2018-01-24 11:41:11,981 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-24 11:41:11,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-24 11:41:11,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2018-01-24 11:41:11,982 INFO L87 Difference]: Start difference. First operand 80 states and 98 transitions. Second operand 27 states. [2018-01-24 11:41:12,486 WARN L143 SmtUtils]: Spent 293ms on a formula simplification that was a NOOP. DAG size: 52 [2018-01-24 11:41:15,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:41:15,909 INFO L93 Difference]: Finished difference Result 183 states and 220 transitions. [2018-01-24 11:41:15,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-24 11:41:15,909 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-01-24 11:41:15,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:41:15,910 INFO L225 Difference]: With dead ends: 183 [2018-01-24 11:41:15,910 INFO L226 Difference]: Without dead ends: 179 [2018-01-24 11:41:15,911 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=319, Invalid=1661, Unknown=0, NotChecked=0, Total=1980 [2018-01-24 11:41:15,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-01-24 11:41:15,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 83. [2018-01-24 11:41:15,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-24 11:41:15,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2018-01-24 11:41:15,920 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 102 transitions. Word has length 26 [2018-01-24 11:41:15,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:41:15,920 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 102 transitions. [2018-01-24 11:41:15,920 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-24 11:41:15,920 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 102 transitions. [2018-01-24 11:41:15,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 11:41:15,921 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:41:15,921 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:41:15,922 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 11:41:15,922 INFO L82 PathProgramCache]: Analyzing trace with hash 2086668971, now seen corresponding path program 3 times [2018-01-24 11:41:15,922 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:41:15,922 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:41:15,923 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:15,923 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:41:15,923 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:41:15,940 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:41:16,389 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:41:16,390 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:41:16,390 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-24 11:41:16,405 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 11:41:16,419 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:41:16,422 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:41:16,425 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:41:16,428 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:41:16,429 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:41:16,432 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:41:16,437 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-24 11:41:16,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:16,444 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-24 11:41:16,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:16,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:41:16,450 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2018-01-24 11:41:16,474 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:16,475 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:16,476 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-24 11:41:16,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:16,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 11:41:16,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:16,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:41:16,494 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-01-24 11:41:16,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-01-24 11:41:16,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-01-24 11:41:16,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:16,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:41:16,552 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-24 11:41:16,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-01-24 11:41:16,580 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-24 11:41:16,582 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-24 11:41:16,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:16,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:41:16,593 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-24 11:41:16,593 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:37 [2018-01-24 11:41:16,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-01-24 11:41:16,745 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-24 11:41:16,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:41:16,752 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-24 11:41:16,753 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:16,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:41:16,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-24 11:41:16,762 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-01-24 11:41:16,808 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 11:41:16,829 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:41:16,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2018-01-24 11:41:16,829 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-01-24 11:41:16,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-01-24 11:41:16,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2018-01-24 11:41:16,830 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. Second operand 23 states. [2018-01-24 11:41:26,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:41:26,260 INFO L93 Difference]: Finished difference Result 316 states and 391 transitions. [2018-01-24 11:41:26,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-24 11:41:26,260 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2018-01-24 11:41:26,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:41:26,263 INFO L225 Difference]: With dead ends: 316 [2018-01-24 11:41:26,263 INFO L226 Difference]: Without dead ends: 312 [2018-01-24 11:41:26,264 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=339, Invalid=2110, Unknown=1, NotChecked=0, Total=2450 [2018-01-24 11:41:26,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-01-24 11:41:26,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 150. [2018-01-24 11:41:26,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-24 11:41:26,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 194 transitions. [2018-01-24 11:41:26,283 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 194 transitions. Word has length 29 [2018-01-24 11:41:26,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:41:26,283 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 194 transitions. [2018-01-24 11:41:26,283 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-01-24 11:41:26,283 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 194 transitions. [2018-01-24 11:41:26,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 11:41:26,286 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:41:26,286 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:41:26,286 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 11:41:26,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1785596499, now seen corresponding path program 1 times [2018-01-24 11:41:26,286 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:41:26,286 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:41:26,287 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:26,287 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:41:26,287 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:41:26,304 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:41:26,738 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:41:26,738 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:41:26,738 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-24 11:41:26,745 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:41:26,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:41:26,765 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:41:26,808 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-24 11:41:26,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:26,819 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-24 11:41:26,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:26,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:41:26,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-01-24 11:41:26,890 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:26,891 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:26,891 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-24 11:41:26,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:26,901 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:26,901 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-24 11:41:26,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:26,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:41:26,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-01-24 11:41:26,962 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-24 11:41:26,964 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-24 11:41:26,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:26,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:41:26,972 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-24 11:41:26,972 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-01-24 11:41:27,003 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:27,006 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-24 11:41:27,008 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-24 11:41:27,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:27,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:41:27,020 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-24 11:41:27,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:48 [2018-01-24 11:41:27,248 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:27,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2018-01-24 11:41:27,253 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:27,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 41 [2018-01-24 11:41:27,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:41:27,276 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-24 11:41:27,276 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:27,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:41:27,302 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-24 11:41:27,303 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:73, output treesize:122 [2018-01-24 11:41:27,461 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:41:27,480 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:41:27,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2018-01-24 11:41:27,481 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-24 11:41:27,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-24 11:41:27,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=889, Unknown=0, NotChecked=0, Total=992 [2018-01-24 11:41:27,481 INFO L87 Difference]: Start difference. First operand 150 states and 194 transitions. Second operand 32 states. [2018-01-24 11:41:30,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:41:30,237 INFO L93 Difference]: Finished difference Result 427 states and 537 transitions. [2018-01-24 11:41:30,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-24 11:41:30,237 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 29 [2018-01-24 11:41:30,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:41:30,239 INFO L225 Difference]: With dead ends: 427 [2018-01-24 11:41:30,239 INFO L226 Difference]: Without dead ends: 423 [2018-01-24 11:41:30,240 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=432, Invalid=2760, Unknown=0, NotChecked=0, Total=3192 [2018-01-24 11:41:30,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-01-24 11:41:30,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 181. [2018-01-24 11:41:30,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-01-24 11:41:30,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 237 transitions. [2018-01-24 11:41:30,257 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 237 transitions. Word has length 29 [2018-01-24 11:41:30,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:41:30,257 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 237 transitions. [2018-01-24 11:41:30,258 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-24 11:41:30,258 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 237 transitions. [2018-01-24 11:41:30,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 11:41:30,259 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:41:30,259 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:41:30,259 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 11:41:30,259 INFO L82 PathProgramCache]: Analyzing trace with hash 933708271, now seen corresponding path program 1 times [2018-01-24 11:41:30,259 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:41:30,260 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:41:30,260 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:30,260 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:41:30,260 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:41:30,272 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:41:30,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:41:30,345 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:41:30,345 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-24 11:41:30,361 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:41:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:41:30,378 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:41:30,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:41:30,404 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:41:30,404 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-01-24 11:41:30,404 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 11:41:30,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 11:41:30,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 11:41:30,405 INFO L87 Difference]: Start difference. First operand 181 states and 237 transitions. Second operand 7 states. [2018-01-24 11:41:30,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:41:30,472 INFO L93 Difference]: Finished difference Result 257 states and 332 transitions. [2018-01-24 11:41:30,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 11:41:30,472 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-01-24 11:41:30,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:41:30,473 INFO L225 Difference]: With dead ends: 257 [2018-01-24 11:41:30,473 INFO L226 Difference]: Without dead ends: 171 [2018-01-24 11:41:30,474 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-01-24 11:41:30,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-01-24 11:41:30,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 114. [2018-01-24 11:41:30,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-01-24 11:41:30,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 135 transitions. [2018-01-24 11:41:30,487 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 135 transitions. Word has length 32 [2018-01-24 11:41:30,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:41:30,487 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 135 transitions. [2018-01-24 11:41:30,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 11:41:30,487 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2018-01-24 11:41:30,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 11:41:30,487 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:41:30,488 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:41:30,488 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 11:41:30,488 INFO L82 PathProgramCache]: Analyzing trace with hash 799694765, now seen corresponding path program 1 times [2018-01-24 11:41:30,488 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:41:30,488 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:41:30,488 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:30,489 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:41:30,489 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:41:30,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:41:30,663 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-24 11:41:30,663 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:41:30,663 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-24 11:41:30,669 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:41:30,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:41:30,686 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:41:30,691 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-24 11:41:30,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 11:41:30,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:30,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:41:30,699 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-24 11:41:30,699 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-24 11:41:30,788 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-24 11:41:30,793 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-24 11:41:30,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:41:30,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:41:30,804 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-24 11:41:30,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-24 11:41:30,858 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-24 11:41:30,877 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:41:30,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2018-01-24 11:41:30,878 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 11:41:30,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 11:41:30,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-01-24 11:41:30,878 INFO L87 Difference]: Start difference. First operand 114 states and 135 transitions. Second operand 19 states. [2018-01-24 11:41:32,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:41:32,209 INFO L93 Difference]: Finished difference Result 175 states and 205 transitions. [2018-01-24 11:41:32,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-24 11:41:32,209 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2018-01-24 11:41:32,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:41:32,210 INFO L225 Difference]: With dead ends: 175 [2018-01-24 11:41:32,210 INFO L226 Difference]: Without dead ends: 174 [2018-01-24 11:41:32,210 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=748, Unknown=0, NotChecked=0, Total=870 [2018-01-24 11:41:32,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-01-24 11:41:32,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 124. [2018-01-24 11:41:32,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-24 11:41:32,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 148 transitions. [2018-01-24 11:41:32,223 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 148 transitions. Word has length 32 [2018-01-24 11:41:32,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:41:32,224 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 148 transitions. [2018-01-24 11:41:32,224 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 11:41:32,224 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 148 transitions. [2018-01-24 11:41:32,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 11:41:32,225 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:41:32,225 INFO L322 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:41:32,225 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 11:41:32,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1535342028, now seen corresponding path program 2 times [2018-01-24 11:41:32,225 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:41:32,225 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:41:32,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:32,226 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:41:32,226 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:32,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:41:32,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:41:32,707 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:41:32,708 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:41:32,708 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-24 11:41:32,714 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 11:41:32,725 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:41:32,732 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:41:32,735 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:41:32,739 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:41:32,808 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-24 11:41:32,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:32,819 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-24 11:41:32,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:32,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:41:32,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-01-24 11:41:32,884 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:32,885 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:32,885 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-24 11:41:32,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:32,901 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:32,902 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:32,902 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-24 11:41:32,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:32,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:41:32,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:28 [2018-01-24 11:41:32,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-24 11:41:32,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-24 11:41:32,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:32,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:41:32,976 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-24 11:41:32,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-01-24 11:41:33,009 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:33,012 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-24 11:41:33,014 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-24 11:41:33,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:33,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:41:33,026 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-24 11:41:33,026 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:47 [2018-01-24 11:41:33,310 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:33,311 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 49 treesize of output 43 [2018-01-24 11:41:33,313 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-24 11:41:33,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:33,322 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:33,322 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:33,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 54 [2018-01-24 11:41:33,329 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 11:41:33,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:41:33,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-24 11:41:33,361 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:69, output treesize:204 [2018-01-24 11:41:33,549 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:41:33,569 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:41:33,569 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 34 [2018-01-24 11:41:33,569 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-24 11:41:33,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-24 11:41:33,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1080, Unknown=0, NotChecked=0, Total=1190 [2018-01-24 11:41:33,570 INFO L87 Difference]: Start difference. First operand 124 states and 148 transitions. Second operand 35 states. [2018-01-24 11:41:34,099 WARN L143 SmtUtils]: Spent 329ms on a formula simplification that was a NOOP. DAG size: 55 [2018-01-24 11:41:35,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:41:35,817 INFO L93 Difference]: Finished difference Result 401 states and 464 transitions. [2018-01-24 11:41:35,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-01-24 11:41:35,817 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 32 [2018-01-24 11:41:35,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:41:35,818 INFO L225 Difference]: With dead ends: 401 [2018-01-24 11:41:35,818 INFO L226 Difference]: Without dead ends: 397 [2018-01-24 11:41:35,819 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1051 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=449, Invalid=3711, Unknown=0, NotChecked=0, Total=4160 [2018-01-24 11:41:35,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-01-24 11:41:35,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 127. [2018-01-24 11:41:35,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-01-24 11:41:35,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 152 transitions. [2018-01-24 11:41:35,834 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 152 transitions. Word has length 32 [2018-01-24 11:41:35,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:41:35,835 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 152 transitions. [2018-01-24 11:41:35,835 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-24 11:41:35,835 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 152 transitions. [2018-01-24 11:41:35,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 11:41:35,835 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:41:35,835 INFO L322 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:41:35,835 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 11:41:35,836 INFO L82 PathProgramCache]: Analyzing trace with hash 2027344973, now seen corresponding path program 3 times [2018-01-24 11:41:35,836 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:41:35,836 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:41:35,836 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:35,836 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:41:35,836 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:41:35,852 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:41:36,401 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:41:36,402 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:41:36,402 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-24 11:41:36,407 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 11:41:36,417 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:41:36,420 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:41:36,423 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:41:36,425 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:41:36,427 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:41:36,430 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:41:36,431 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:41:36,434 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:41:36,487 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-24 11:41:36,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:36,494 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-24 11:41:36,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:36,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:41:36,501 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-01-24 11:41:36,562 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:36,563 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:36,563 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-24 11:41:36,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:36,580 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:36,580 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:36,581 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-24 11:41:36,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:36,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:41:36,592 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:28 [2018-01-24 11:41:36,660 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-24 11:41:36,662 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-24 11:41:36,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:36,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:41:36,671 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-24 11:41:36,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-01-24 11:41:36,705 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:36,708 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-24 11:41:36,710 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-24 11:41:36,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:36,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:41:36,722 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-24 11:41:36,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:47 [2018-01-24 11:41:37,262 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:37,265 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 57 treesize of output 49 [2018-01-24 11:41:37,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 36 treesize of output 109 [2018-01-24 11:41:37,310 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-01-24 11:41:37,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 72 xjuncts. [2018-01-24 11:41:37,570 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-24 11:41:37,570 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:37,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:41:37,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 13 dim-0 vars, and 2 xjuncts. [2018-01-24 11:41:37,642 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:92, output treesize:627 [2018-01-24 11:41:38,037 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:41:38,058 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:41:38,058 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 40 [2018-01-24 11:41:38,058 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-24 11:41:38,058 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-24 11:41:38,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1465, Unknown=0, NotChecked=0, Total=1640 [2018-01-24 11:41:38,059 INFO L87 Difference]: Start difference. First operand 127 states and 152 transitions. Second operand 41 states. [2018-01-24 11:41:38,724 WARN L143 SmtUtils]: Spent 392ms on a formula simplification that was a NOOP. DAG size: 55 [2018-01-24 11:41:41,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:41:41,463 INFO L93 Difference]: Finished difference Result 498 states and 591 transitions. [2018-01-24 11:41:41,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-01-24 11:41:41,491 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 35 [2018-01-24 11:41:41,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:41:41,493 INFO L225 Difference]: With dead ends: 498 [2018-01-24 11:41:41,493 INFO L226 Difference]: Without dead ends: 494 [2018-01-24 11:41:41,494 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1503 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=736, Invalid=4666, Unknown=0, NotChecked=0, Total=5402 [2018-01-24 11:41:41,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-01-24 11:41:41,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 133. [2018-01-24 11:41:41,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-24 11:41:41,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 160 transitions. [2018-01-24 11:41:41,514 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 160 transitions. Word has length 35 [2018-01-24 11:41:41,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:41:41,514 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 160 transitions. [2018-01-24 11:41:41,514 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-24 11:41:41,514 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 160 transitions. [2018-01-24 11:41:41,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 11:41:41,515 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:41:41,515 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:41:41,515 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 11:41:41,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1376138118, now seen corresponding path program 1 times [2018-01-24 11:41:41,516 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:41:41,516 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:41:41,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:41,517 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:41:41,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:41:41,524 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:41:41,564 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-24 11:41:41,565 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:41:41,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 11:41:41,565 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:41:41,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:41:41,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:41:41,565 INFO L87 Difference]: Start difference. First operand 133 states and 160 transitions. Second operand 6 states. [2018-01-24 11:41:41,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:41:41,624 INFO L93 Difference]: Finished difference Result 178 states and 209 transitions. [2018-01-24 11:41:41,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 11:41:41,624 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-01-24 11:41:41,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:41:41,625 INFO L225 Difference]: With dead ends: 178 [2018-01-24 11:41:41,625 INFO L226 Difference]: Without dead ends: 157 [2018-01-24 11:41:41,625 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:41:41,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-01-24 11:41:41,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 137. [2018-01-24 11:41:41,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-01-24 11:41:41,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 162 transitions. [2018-01-24 11:41:41,638 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 162 transitions. Word has length 36 [2018-01-24 11:41:41,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:41:41,638 INFO L432 AbstractCegarLoop]: Abstraction has 137 states and 162 transitions. [2018-01-24 11:41:41,638 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:41:41,639 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 162 transitions. [2018-01-24 11:41:41,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-24 11:41:41,639 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:41:41,639 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:41:41,639 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 11:41:41,639 INFO L82 PathProgramCache]: Analyzing trace with hash 336762589, now seen corresponding path program 1 times [2018-01-24 11:41:41,639 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:41:41,639 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:41:41,640 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:41,640 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:41:41,640 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:41:41,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:41:41,920 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-24 11:41:41,920 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:41:41,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 11:41:41,921 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 11:41:41,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 11:41:41,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-24 11:41:41,921 INFO L87 Difference]: Start difference. First operand 137 states and 162 transitions. Second operand 7 states. [2018-01-24 11:41:42,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:41:42,254 INFO L93 Difference]: Finished difference Result 137 states and 162 transitions. [2018-01-24 11:41:42,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 11:41:42,254 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-01-24 11:41:42,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:41:42,255 INFO L225 Difference]: With dead ends: 137 [2018-01-24 11:41:42,255 INFO L226 Difference]: Without dead ends: 94 [2018-01-24 11:41:42,255 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-01-24 11:41:42,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-24 11:41:42,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2018-01-24 11:41:42,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-01-24 11:41:42,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2018-01-24 11:41:42,266 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 104 transitions. Word has length 39 [2018-01-24 11:41:42,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:41:42,266 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 104 transitions. [2018-01-24 11:41:42,266 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 11:41:42,267 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 104 transitions. [2018-01-24 11:41:42,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-24 11:41:42,267 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:41:42,267 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:41:42,267 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 11:41:42,268 INFO L82 PathProgramCache]: Analyzing trace with hash -2098962228, now seen corresponding path program 2 times [2018-01-24 11:41:42,268 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:41:42,268 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:41:42,268 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:42,269 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:41:42,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:41:42,282 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:41:42,660 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:41:42,660 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:41:42,660 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-24 11:41:42,666 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 11:41:42,678 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:41:42,685 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:41:42,687 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:41:42,692 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:41:42,767 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-24 11:41:42,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:42,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:41:42,770 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 11:41:42,810 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:42,810 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:42,811 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-24 11:41:42,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:42,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:41:42,814 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-24 11:41:42,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 11:41:42,861 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-24 11:41:42,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:42,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:41:42,870 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-24 11:41:42,870 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-24 11:41:43,075 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-24 11:41:43,078 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-24 11:41:43,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:43,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:41:43,102 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-24 11:41:43,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:53, output treesize:49 [2018-01-24 11:41:43,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-01-24 11:41:43,469 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:43,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2018-01-24 11:41:43,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:41:43,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-01-24 11:41:43,498 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:43,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-01-24 11:41:43,500 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:43,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:41:43,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:41:43,529 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:65, output treesize:43 [2018-01-24 11:41:43,632 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:41:43,663 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:41:43,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 32 [2018-01-24 11:41:43,664 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-24 11:41:43,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-24 11:41:43,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=977, Unknown=0, NotChecked=0, Total=1056 [2018-01-24 11:41:43,665 INFO L87 Difference]: Start difference. First operand 90 states and 104 transitions. Second operand 33 states. [2018-01-24 11:41:45,581 WARN L146 SmtUtils]: Spent 232ms on a formula simplification. DAG size of input: 78 DAG size of output 54 [2018-01-24 11:41:47,933 WARN L146 SmtUtils]: Spent 2043ms on a formula simplification. DAG size of input: 61 DAG size of output 41 [2018-01-24 11:41:52,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:41:52,573 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2018-01-24 11:41:52,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-24 11:41:52,574 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 39 [2018-01-24 11:41:52,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:41:52,575 INFO L225 Difference]: With dead ends: 112 [2018-01-24 11:41:52,575 INFO L226 Difference]: Without dead ends: 111 [2018-01-24 11:41:52,576 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=286, Invalid=2794, Unknown=0, NotChecked=0, Total=3080 [2018-01-24 11:41:52,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-24 11:41:52,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 71. [2018-01-24 11:41:52,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-24 11:41:52,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2018-01-24 11:41:52,588 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 39 [2018-01-24 11:41:52,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:41:52,588 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2018-01-24 11:41:52,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-24 11:41:52,588 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2018-01-24 11:41:52,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-24 11:41:52,589 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:41:52,589 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:41:52,589 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 11:41:52,589 INFO L82 PathProgramCache]: Analyzing trace with hash -643319614, now seen corresponding path program 1 times [2018-01-24 11:41:52,589 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:41:52,589 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:41:52,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:52,590 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:41:52,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:41:52,599 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:41:52,938 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:41:52,938 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:41:52,948 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-24 11:41:52,955 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:41:52,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:41:52,983 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:41:52,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-24 11:41:52,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:52,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:41:52,995 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:7 [2018-01-24 11:41:53,360 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:41:53,393 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:41:53,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 30 [2018-01-24 11:41:53,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-24 11:41:53,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-24 11:41:53,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=841, Unknown=0, NotChecked=0, Total=930 [2018-01-24 11:41:53,395 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand 31 states. [2018-01-24 11:41:54,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:41:54,296 INFO L93 Difference]: Finished difference Result 118 states and 133 transitions. [2018-01-24 11:41:54,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 11:41:54,296 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 40 [2018-01-24 11:41:54,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:41:54,297 INFO L225 Difference]: With dead ends: 118 [2018-01-24 11:41:54,297 INFO L226 Difference]: Without dead ends: 105 [2018-01-24 11:41:54,298 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=274, Invalid=2078, Unknown=0, NotChecked=0, Total=2352 [2018-01-24 11:41:54,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-24 11:41:54,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 90. [2018-01-24 11:41:54,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-01-24 11:41:54,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2018-01-24 11:41:54,314 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 40 [2018-01-24 11:41:54,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:41:54,314 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2018-01-24 11:41:54,314 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-24 11:41:54,315 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2018-01-24 11:41:54,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-24 11:41:54,315 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:41:54,315 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:41:54,315 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 11:41:54,315 INFO L82 PathProgramCache]: Analyzing trace with hash -643310578, now seen corresponding path program 1 times [2018-01-24 11:41:54,315 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:41:54,315 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:41:54,316 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:54,316 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:41:54,316 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:41:54,323 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:41:55,069 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:41:55,069 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:41:55,069 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-24 11:41:55,075 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:41:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:41:55,094 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:41:55,097 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-24 11:41:55,098 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:55,104 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-24 11:41:55,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:55,109 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-24 11:41:55,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-01-24 11:41:55,143 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:55,143 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:55,144 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-24 11:41:55,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:55,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-01-24 11:41:55,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:55,155 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-24 11:41:55,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:17 [2018-01-24 11:41:55,496 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:41:55,516 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:41:55,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2018-01-24 11:41:55,516 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-24 11:41:55,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-24 11:41:55,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1030, Unknown=0, NotChecked=0, Total=1122 [2018-01-24 11:41:55,517 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand 34 states. [2018-01-24 11:41:56,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:41:56,660 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2018-01-24 11:41:56,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 11:41:56,660 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 40 [2018-01-24 11:41:56,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:41:56,661 INFO L225 Difference]: With dead ends: 104 [2018-01-24 11:41:56,661 INFO L226 Difference]: Without dead ends: 71 [2018-01-24 11:41:56,662 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=304, Invalid=2452, Unknown=0, NotChecked=0, Total=2756 [2018-01-24 11:41:56,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-24 11:41:56,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-01-24 11:41:56,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-24 11:41:56,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2018-01-24 11:41:56,677 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 40 [2018-01-24 11:41:56,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:41:56,677 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2018-01-24 11:41:56,677 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-24 11:41:56,677 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2018-01-24 11:41:56,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-24 11:41:56,678 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:41:56,678 INFO L322 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:41:56,678 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr9RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr8RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-01-24 11:41:56,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1872610579, now seen corresponding path program 4 times [2018-01-24 11:41:56,679 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:41:56,679 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:41:56,679 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:56,679 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:41:56,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:41:56,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:41:56,697 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:41:57,239 WARN L146 SmtUtils]: Spent 204ms on a formula simplification. DAG size of input: 89 DAG size of output 68 [2018-01-24 11:41:57,717 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 73 DAG size of output 49 [2018-01-24 11:41:57,857 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 76 DAG size of output 52 [2018-01-24 11:41:58,211 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:41:58,211 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:41:58,246 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:41:58,251 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-24 11:41:58,269 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:41:58,272 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:41:58,328 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-24 11:41:58,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:58,335 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-24 11:41:58,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:58,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:41:58,341 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-01-24 11:41:58,397 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:58,398 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:58,398 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-24 11:41:58,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:58,407 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:58,407 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-24 11:41:58,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:58,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:41:58,416 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-01-24 11:41:58,475 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-24 11:41:58,477 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-24 11:41:58,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:58,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:41:58,485 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-24 11:41:58,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-01-24 11:41:58,521 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:58,524 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-24 11:41:58,525 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-24 11:41:58,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:58,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:41:58,537 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-24 11:41:58,537 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:48 [2018-01-24 11:41:59,327 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:59,329 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 85 treesize of output 73 [2018-01-24 11:41:59,336 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:59,337 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:59,337 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:59,338 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:59,339 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:59,340 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:59,340 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:59,341 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:59,342 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:59,344 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:59,344 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:59,345 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:59,346 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:59,346 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:59,347 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:41:59,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 25 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 217 [2018-01-24 11:41:59,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:41:59,446 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-24 11:41:59,446 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 11:41:59,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:41:59,508 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-24 11:41:59,508 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:113, output treesize:214 [2018-01-24 11:41:59,732 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:41:59,751 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:41:59,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 47 [2018-01-24 11:41:59,752 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-01-24 11:41:59,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-01-24 11:41:59,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1992, Unknown=0, NotChecked=0, Total=2256 [2018-01-24 11:41:59,752 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand 48 states. Received shutdown request... [2018-01-24 11:42:02,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-24 11:42:02,652 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 11:42:02,656 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 11:42:02,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:42:02 BoogieIcfgContainer [2018-01-24 11:42:02,656 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 11:42:02,657 INFO L168 Benchmark]: Toolchain (without parser) took 55750.51 ms. Allocated memory was 303.6 MB in the beginning and 667.9 MB in the end (delta: 364.4 MB). Free memory was 262.6 MB in the beginning and 407.7 MB in the end (delta: -145.1 MB). Peak memory consumption was 219.3 MB. Max. memory is 5.3 GB. [2018-01-24 11:42:02,658 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 303.6 MB. Free memory is still 268.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 11:42:02,659 INFO L168 Benchmark]: CACSL2BoogieTranslator took 203.00 ms. Allocated memory is still 303.6 MB. Free memory was 262.6 MB in the beginning and 252.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:42:02,659 INFO L168 Benchmark]: Boogie Preprocessor took 37.05 ms. Allocated memory is still 303.6 MB. Free memory was 252.6 MB in the beginning and 250.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:42:02,659 INFO L168 Benchmark]: RCFGBuilder took 299.20 ms. Allocated memory is still 303.6 MB. Free memory was 250.6 MB in the beginning and 230.1 MB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 5.3 GB. [2018-01-24 11:42:02,660 INFO L168 Benchmark]: TraceAbstraction took 55203.57 ms. Allocated memory was 303.6 MB in the beginning and 667.9 MB in the end (delta: 364.4 MB). Free memory was 230.1 MB in the beginning and 407.7 MB in the end (delta: -177.6 MB). Peak memory consumption was 186.8 MB. Max. memory is 5.3 GB. [2018-01-24 11:42:02,661 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.22 ms. Allocated memory is still 303.6 MB. Free memory is still 268.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 203.00 ms. Allocated memory is still 303.6 MB. Free memory was 262.6 MB in the beginning and 252.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.05 ms. Allocated memory is still 303.6 MB. Free memory was 252.6 MB in the beginning and 250.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 299.20 ms. Allocated memory is still 303.6 MB. Free memory was 250.6 MB in the beginning and 230.1 MB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 55203.57 ms. Allocated memory was 303.6 MB in the beginning and 667.9 MB in the end (delta: 364.4 MB). Free memory was 230.1 MB in the beginning and 407.7 MB in the end (delta: -177.6 MB). Peak memory consumption was 186.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (71states) and interpolant automaton (currently 25 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 150. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was constructing difference of abstraction (71states) and interpolant automaton (currently 25 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 150. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (71states) and interpolant automaton (currently 25 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 150. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was constructing difference of abstraction (71states) and interpolant automaton (currently 25 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 150. - TimeoutResultAtElement [Line: 553]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (71states) and interpolant automaton (currently 25 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 150. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (71states) and interpolant automaton (currently 25 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 150. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (71states) and interpolant automaton (currently 25 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 150. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (71states) and interpolant automaton (currently 25 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 150. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (71states) and interpolant automaton (currently 25 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 150. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (71states) and interpolant automaton (currently 25 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 150. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (71states) and interpolant automaton (currently 25 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 150. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (71states) and interpolant automaton (currently 25 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 150. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (71states) and interpolant automaton (currently 25 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 150. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (71states) and interpolant automaton (currently 25 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 150. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (71states) and interpolant automaton (currently 25 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 150. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 58 locations, 15 error locations. TIMEOUT Result, 55.1s OverallTime, 24 OverallIterations, 8 TraceHistogramMax, 39.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1076 SDtfs, 3830 SDslu, 8523 SDs, 0 SdLazy, 8530 SolverSat, 1062 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 20.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 901 GetRequests, 253 SyntacticMatches, 11 SemanticMatches, 636 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7352 ImplicationChecksByTransitivity, 28.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=181occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 1356 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 14.6s InterpolantComputationTime, 1049 NumberOfCodeBlocks, 1048 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 1013 ConstructedInterpolants, 139 QuantifiedInterpolants, 564259 SizeOfPredicates, 155 NumberOfNonLiveVariables, 1878 ConjunctsInSsa, 550 ConjunctsInUnsatCore, 36 InterpolantComputations, 12 PerfectInterpolantSequences, 7/474 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: 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/cstrncat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_11-42-02-670.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_11-42-02-670.csv Completed graceful shutdown