java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 08:27:30,798 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:27:30,800 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:27:30,824 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:27:30,824 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:27:30,825 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:27:30,827 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:27:30,829 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:27:30,831 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:27:30,832 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:27:30,840 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:27:30,840 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:27:30,841 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:27:30,842 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:27:30,843 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:27:30,849 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:27:30,851 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:27:30,855 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:27:30,856 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:27:30,860 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:27:30,862 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:27:30,863 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:27:30,864 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:27:30,865 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:27:30,865 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:27:30,867 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:27:30,867 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:27:30,872 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:27:30,872 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:27:30,872 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:27:30,873 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:27:30,873 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 08:27:30,887 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:27:30,887 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:27:30,888 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:27:30,888 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:27:30,888 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:27:30,888 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:27:30,888 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:27:30,889 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:27:30,889 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:27:30,889 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 08:27:30,889 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:27:30,889 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:27:30,890 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:27:30,890 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 08:27:30,890 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 08:27:30,890 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 08:27:30,890 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:27:30,891 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:27:30,891 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:27:30,891 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:27:30,891 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:27:30,891 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:27:30,891 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:27:30,892 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:27:30,892 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:27:30,892 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:27:30,892 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:27:30,892 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:27:30,892 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:27:30,893 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:27:30,893 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:27:30,893 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:27:30,894 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:27:30,894 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:27:30,943 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:27:30,956 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:27:30,959 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:27:30,960 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:27:30,961 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:27:30,961 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-01-31 08:27:31,133 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:27:31,145 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:27:31,146 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:27:31,146 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:27:31,153 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:27:31,154 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:27:31" (1/1) ... [2018-01-31 08:27:31,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3de28e04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:27:31, skipping insertion in model container [2018-01-31 08:27:31,158 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:27:31" (1/1) ... [2018-01-31 08:27:31,176 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:27:31,238 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:27:31,402 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:27:31,442 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:27:31,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:27:31 WrapperNode [2018-01-31 08:27:31,451 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:27:31,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:27:31,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:27:31,452 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:27:31,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:27:31" (1/1) ... [2018-01-31 08:27:31,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:27:31" (1/1) ... [2018-01-31 08:27:31,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:27:31" (1/1) ... [2018-01-31 08:27:31,479 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:27:31" (1/1) ... [2018-01-31 08:27:31,487 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:27:31" (1/1) ... [2018-01-31 08:27:31,491 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:27:31" (1/1) ... [2018-01-31 08:27:31,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:27:31" (1/1) ... [2018-01-31 08:27:31,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:27:31,499 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:27:31,499 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:27:31,499 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:27:31,500 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:27:31" (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-31 08:27:31,565 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:27:31,565 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:27:31,565 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcat [2018-01-31 08:27:31,566 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:27:31,566 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 08:27:31,566 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 08:27:31,566 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:27:31,566 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:27:31,566 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:27:31,567 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 08:27:31,567 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcat [2018-01-31 08:27:31,567 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:27:31,567 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:27:31,567 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:27:32,153 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:27:32,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:27:32 BoogieIcfgContainer [2018-01-31 08:27:32,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:27:32,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:27:32,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:27:32,161 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:27:32,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:27:31" (1/3) ... [2018-01-31 08:27:32,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6222f59a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:27:32, skipping insertion in model container [2018-01-31 08:27:32,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:27:31" (2/3) ... [2018-01-31 08:27:32,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6222f59a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:27:32, skipping insertion in model container [2018-01-31 08:27:32,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:27:32" (3/3) ... [2018-01-31 08:27:32,165 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-01-31 08:27:32,174 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:27:32,182 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-01-31 08:27:32,230 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:27:32,231 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:27:32,231 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:27:32,231 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:27:32,231 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:27:32,231 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:27:32,232 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:27:32,232 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:27:32,232 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:27:32,256 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2018-01-31 08:27:32,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-31 08:27:32,264 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:27:32,265 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:27:32,265 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:27:32,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1358649906, now seen corresponding path program 1 times [2018-01-31 08:27:32,276 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:27:32,276 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:27:32,331 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:32,332 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:27:32,332 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:27:32,385 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:27:32,456 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-31 08:27:32,459 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:27:32,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 08:27:32,475 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 08:27:32,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 08:27:32,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:27:32,486 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 3 states. [2018-01-31 08:27:32,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:27:32,812 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2018-01-31 08:27:32,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 08:27:32,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-01-31 08:27:32,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:27:32,823 INFO L225 Difference]: With dead ends: 112 [2018-01-31 08:27:32,823 INFO L226 Difference]: Without dead ends: 75 [2018-01-31 08:27:32,827 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:27:32,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-31 08:27:32,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-01-31 08:27:32,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-31 08:27:32,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-01-31 08:27:32,866 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 21 [2018-01-31 08:27:32,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:27:32,866 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-01-31 08:27:32,867 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 08:27:32,867 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-01-31 08:27:32,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-31 08:27:32,868 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:27:32,869 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:27:32,869 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:27:32,870 INFO L82 PathProgramCache]: Analyzing trace with hash 291143110, now seen corresponding path program 1 times [2018-01-31 08:27:32,870 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:27:32,870 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:27:32,871 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:32,871 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:27:32,872 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:32,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:27:32,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:27:33,059 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-31 08:27:33,060 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:27:33,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:27:33,061 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:27:33,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:27:33,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:27:33,062 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 4 states. [2018-01-31 08:27:33,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:27:33,317 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-01-31 08:27:33,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:27:33,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-01-31 08:27:33,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:27:33,319 INFO L225 Difference]: With dead ends: 75 [2018-01-31 08:27:33,320 INFO L226 Difference]: Without dead ends: 74 [2018-01-31 08:27:33,321 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:27:33,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-31 08:27:33,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-31 08:27:33,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-31 08:27:33,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-01-31 08:27:33,329 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 24 [2018-01-31 08:27:33,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:27:33,330 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-01-31 08:27:33,330 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:27:33,330 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-01-31 08:27:33,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-31 08:27:33,331 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:27:33,331 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:27:33,331 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:27:33,331 INFO L82 PathProgramCache]: Analyzing trace with hash 291143111, now seen corresponding path program 1 times [2018-01-31 08:27:33,332 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:27:33,332 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:27:33,333 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:33,333 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:27:33,333 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:27:33,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:27:33,587 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-31 08:27:33,587 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:27:33,587 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:27:33,588 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:27:33,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:27:33,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:27:33,591 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 6 states. [2018-01-31 08:27:33,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:27:33,798 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2018-01-31 08:27:33,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:27:33,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-31 08:27:33,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:27:33,803 INFO L225 Difference]: With dead ends: 74 [2018-01-31 08:27:33,803 INFO L226 Difference]: Without dead ends: 73 [2018-01-31 08:27:33,803 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:27:33,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-31 08:27:33,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-01-31 08:27:33,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-31 08:27:33,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-01-31 08:27:33,814 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 24 [2018-01-31 08:27:33,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:27:33,814 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-01-31 08:27:33,815 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:27:33,815 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-01-31 08:27:33,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-31 08:27:33,816 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:27:33,816 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:27:33,816 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:27:33,816 INFO L82 PathProgramCache]: Analyzing trace with hash 435501890, now seen corresponding path program 1 times [2018-01-31 08:27:33,816 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:27:33,817 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:27:33,817 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:33,818 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:27:33,818 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:27:33,831 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:27:33,900 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-31 08:27:33,900 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:27:33,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:27:33,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:27:33,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:27:33,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:27:33,902 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 4 states. [2018-01-31 08:27:34,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:27:34,114 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-01-31 08:27:34,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:27:34,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-01-31 08:27:34,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:27:34,115 INFO L225 Difference]: With dead ends: 73 [2018-01-31 08:27:34,115 INFO L226 Difference]: Without dead ends: 72 [2018-01-31 08:27:34,116 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:27:34,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-31 08:27:34,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-01-31 08:27:34,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-31 08:27:34,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-01-31 08:27:34,125 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 25 [2018-01-31 08:27:34,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:27:34,126 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-01-31 08:27:34,126 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:27:34,126 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-01-31 08:27:34,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-31 08:27:34,127 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:27:34,127 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:27:34,127 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:27:34,127 INFO L82 PathProgramCache]: Analyzing trace with hash 435501891, now seen corresponding path program 1 times [2018-01-31 08:27:34,127 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:27:34,128 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:27:34,129 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:34,129 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:27:34,129 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:27:34,142 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:27:34,439 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-31 08:27:34,440 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:27:34,440 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:27:34,440 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:27:34,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:27:34,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:27:34,441 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 6 states. [2018-01-31 08:27:34,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:27:34,586 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-01-31 08:27:34,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:27:34,586 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-31 08:27:34,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:27:34,587 INFO L225 Difference]: With dead ends: 72 [2018-01-31 08:27:34,587 INFO L226 Difference]: Without dead ends: 71 [2018-01-31 08:27:34,588 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:27:34,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-31 08:27:34,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-01-31 08:27:34,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-31 08:27:34,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-01-31 08:27:34,595 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 25 [2018-01-31 08:27:34,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:27:34,595 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-01-31 08:27:34,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:27:34,595 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-01-31 08:27:34,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-31 08:27:34,596 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:27:34,596 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:27:34,596 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:27:34,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1440353201, now seen corresponding path program 1 times [2018-01-31 08:27:34,597 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:27:34,597 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:27:34,598 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:34,598 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:27:34,598 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:27:34,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:27:34,685 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-31 08:27:34,686 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:27:34,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:27:34,686 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:27:34,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:27:34,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:27:34,687 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 5 states. [2018-01-31 08:27:34,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:27:34,771 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2018-01-31 08:27:34,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 08:27:34,771 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-01-31 08:27:34,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:27:34,772 INFO L225 Difference]: With dead ends: 74 [2018-01-31 08:27:34,772 INFO L226 Difference]: Without dead ends: 73 [2018-01-31 08:27:34,773 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:27:34,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-31 08:27:34,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2018-01-31 08:27:34,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-31 08:27:34,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2018-01-31 08:27:34,783 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 31 [2018-01-31 08:27:34,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:27:34,783 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2018-01-31 08:27:34,783 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:27:34,784 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-01-31 08:27:34,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-31 08:27:34,784 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:27:34,784 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:27:34,784 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:27:34,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1440353202, now seen corresponding path program 1 times [2018-01-31 08:27:34,785 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:27:34,785 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:27:34,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:34,786 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:27:34,786 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:27:34,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:27:34,973 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-31 08:27:34,973 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:27:34,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:27:34,974 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:27:34,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:27:34,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:27:34,974 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 7 states. [2018-01-31 08:27:35,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:27:35,322 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-01-31 08:27:35,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:27:35,322 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-01-31 08:27:35,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:27:35,323 INFO L225 Difference]: With dead ends: 81 [2018-01-31 08:27:35,323 INFO L226 Difference]: Without dead ends: 80 [2018-01-31 08:27:35,323 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:27:35,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-31 08:27:35,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 72. [2018-01-31 08:27:35,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-31 08:27:35,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-01-31 08:27:35,334 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 31 [2018-01-31 08:27:35,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:27:35,335 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-01-31 08:27:35,335 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:27:35,335 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-01-31 08:27:35,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-31 08:27:35,336 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:27:35,336 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:27:35,336 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:27:35,337 INFO L82 PathProgramCache]: Analyzing trace with hash 846262760, now seen corresponding path program 1 times [2018-01-31 08:27:35,337 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:27:35,337 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:27:35,338 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:35,338 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:27:35,338 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:27:35,355 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:27:35,625 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-31 08:27:35,625 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:27:35,625 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-31 08:27:35,642 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:27:35,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:27:35,703 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:27:35,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:27:35,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:27:35,768 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-31 08:27:35,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-01-31 08:27:35,951 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-31 08:27:35,971 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:27:35,971 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2018-01-31 08:27:35,971 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-31 08:27:35,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-31 08:27:35,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:27:35,972 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 13 states. [2018-01-31 08:27:36,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:27:36,554 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2018-01-31 08:27:36,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:27:36,554 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-01-31 08:27:36,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:27:36,555 INFO L225 Difference]: With dead ends: 92 [2018-01-31 08:27:36,555 INFO L226 Difference]: Without dead ends: 91 [2018-01-31 08:27:36,556 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2018-01-31 08:27:36,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-31 08:27:36,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2018-01-31 08:27:36,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-31 08:27:36,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-01-31 08:27:36,563 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 38 [2018-01-31 08:27:36,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:27:36,563 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-01-31 08:27:36,563 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-31 08:27:36,564 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-01-31 08:27:36,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-31 08:27:36,565 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:27:36,565 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:27:36,565 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:27:36,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1400971126, now seen corresponding path program 1 times [2018-01-31 08:27:36,565 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:27:36,566 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:27:36,567 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:36,567 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:27:36,567 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:36,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:27:36,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:27:36,927 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-31 08:27:36,927 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:27:36,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:27:36,928 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:27:36,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:27:36,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:27:36,929 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 6 states. [2018-01-31 08:27:37,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:27:37,101 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2018-01-31 08:27:37,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:27:37,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-01-31 08:27:37,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:27:37,104 INFO L225 Difference]: With dead ends: 79 [2018-01-31 08:27:37,104 INFO L226 Difference]: Without dead ends: 78 [2018-01-31 08:27:37,104 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:27:37,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-31 08:27:37,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-01-31 08:27:37,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-31 08:27:37,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-01-31 08:27:37,112 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 39 [2018-01-31 08:27:37,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:27:37,113 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-01-31 08:27:37,113 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:27:37,113 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-01-31 08:27:37,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-31 08:27:37,114 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:27:37,114 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:27:37,114 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:27:37,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1400971127, now seen corresponding path program 1 times [2018-01-31 08:27:37,115 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:27:37,115 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:27:37,116 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:37,116 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:27:37,116 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:27:37,140 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:27:37,430 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-31 08:27:37,430 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:27:37,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 08:27:37,430 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 08:27:37,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 08:27:37,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:27:37,431 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 9 states. [2018-01-31 08:27:37,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:27:37,666 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2018-01-31 08:27:37,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 08:27:37,666 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-01-31 08:27:37,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:27:37,667 INFO L225 Difference]: With dead ends: 93 [2018-01-31 08:27:37,667 INFO L226 Difference]: Without dead ends: 92 [2018-01-31 08:27:37,668 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-01-31 08:27:37,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-31 08:27:37,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2018-01-31 08:27:37,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-31 08:27:37,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-01-31 08:27:37,674 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 39 [2018-01-31 08:27:37,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:27:37,675 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-01-31 08:27:37,675 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 08:27:37,675 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-01-31 08:27:37,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-31 08:27:37,676 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:27:37,676 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:27:37,676 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:27:37,677 INFO L82 PathProgramCache]: Analyzing trace with hash 480431954, now seen corresponding path program 1 times [2018-01-31 08:27:37,677 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:27:37,677 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:27:37,678 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:37,678 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:27:37,678 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:27:37,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:27:37,747 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-31 08:27:37,748 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:27:37,748 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:27:37,748 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:27:37,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:27:37,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:27:37,749 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 6 states. [2018-01-31 08:27:37,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:27:37,823 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-01-31 08:27:37,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:27:37,823 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-01-31 08:27:37,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:27:37,824 INFO L225 Difference]: With dead ends: 84 [2018-01-31 08:27:37,824 INFO L226 Difference]: Without dead ends: 83 [2018-01-31 08:27:37,824 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:27:37,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-31 08:27:37,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-01-31 08:27:37,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-31 08:27:37,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-01-31 08:27:37,833 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 40 [2018-01-31 08:27:37,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:27:37,833 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-01-31 08:27:37,833 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:27:37,833 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-01-31 08:27:37,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-31 08:27:37,834 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:27:37,834 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:27:37,834 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:27:37,835 INFO L82 PathProgramCache]: Analyzing trace with hash 480431955, now seen corresponding path program 1 times [2018-01-31 08:27:37,835 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:27:37,835 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:27:37,836 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:37,836 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:27:37,836 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:37,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:27:37,848 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:27:37,959 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-31 08:27:37,959 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:27:37,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 08:27:37,960 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:27:37,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:27:37,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:27:37,961 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 8 states. [2018-01-31 08:27:38,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:27:38,110 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2018-01-31 08:27:38,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 08:27:38,110 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-01-31 08:27:38,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:27:38,111 INFO L225 Difference]: With dead ends: 95 [2018-01-31 08:27:38,111 INFO L226 Difference]: Without dead ends: 94 [2018-01-31 08:27:38,111 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-01-31 08:27:38,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-31 08:27:38,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-01-31 08:27:38,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-31 08:27:38,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2018-01-31 08:27:38,117 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 40 [2018-01-31 08:27:38,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:27:38,117 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2018-01-31 08:27:38,118 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:27:38,118 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2018-01-31 08:27:38,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-31 08:27:38,119 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:27:38,119 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:27:38,119 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:27:38,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1491780338, now seen corresponding path program 2 times [2018-01-31 08:27:38,119 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:27:38,120 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:27:38,120 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:38,121 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:27:38,121 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:27:38,136 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:27:38,428 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:27:38,428 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:27:38,428 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-31 08:27:38,441 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:27:38,459 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:27:38,476 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:27:38,484 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:27:38,488 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:27:38,512 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-31 08:27:38,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:27:38,625 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-31 08:27:38,626 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-31 08:27:38,977 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-31 08:27:38,979 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-31 08:27:38,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:27:38,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:27:38,987 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-31 08:27:38,988 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-31 08:27:39,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-01-31 08:27:39,233 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 13 treesize of output 14 [2018-01-31 08:27:39,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:27:39,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:27:39,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:27:39,247 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:40 [2018-01-31 08:27:39,360 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:27:39,389 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:27:39,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2018-01-31 08:27:39,390 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-31 08:27:39,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-31 08:27:39,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2018-01-31 08:27:39,390 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand 21 states. [2018-01-31 08:27:40,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:27:40,410 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2018-01-31 08:27:40,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-31 08:27:40,410 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 45 [2018-01-31 08:27:40,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:27:40,411 INFO L225 Difference]: With dead ends: 113 [2018-01-31 08:27:40,412 INFO L226 Difference]: Without dead ends: 112 [2018-01-31 08:27:40,412 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=133, Invalid=797, Unknown=0, NotChecked=0, Total=930 [2018-01-31 08:27:40,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-31 08:27:40,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 98. [2018-01-31 08:27:40,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-31 08:27:40,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-01-31 08:27:40,421 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 45 [2018-01-31 08:27:40,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:27:40,421 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-01-31 08:27:40,421 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-31 08:27:40,421 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-01-31 08:27:40,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-31 08:27:40,422 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:27:40,422 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:27:40,423 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:27:40,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1947433507, now seen corresponding path program 1 times [2018-01-31 08:27:40,423 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:27:40,423 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:27:40,424 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:40,424 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:27:40,424 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:27:40,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:27:41,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:27:41,172 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:27:41,172 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-31 08:27:41,177 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:27:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:27:41,199 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:27:41,206 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-31 08:27:41,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:27:41,210 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-31 08:27:41,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-01-31 08:27:41,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:27:41,314 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:27:41,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2018-01-31 08:27:41,314 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-31 08:27:41,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-31 08:27:41,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-01-31 08:27:41,315 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 15 states. [2018-01-31 08:27:41,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:27:41,626 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2018-01-31 08:27:41,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 08:27:41,626 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2018-01-31 08:27:41,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:27:41,627 INFO L225 Difference]: With dead ends: 110 [2018-01-31 08:27:41,627 INFO L226 Difference]: Without dead ends: 109 [2018-01-31 08:27:41,627 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2018-01-31 08:27:41,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-31 08:27:41,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 98. [2018-01-31 08:27:41,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-31 08:27:41,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-01-31 08:27:41,634 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 47 [2018-01-31 08:27:41,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:27:41,634 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-01-31 08:27:41,634 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-31 08:27:41,634 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-01-31 08:27:41,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-31 08:27:41,635 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:27:41,635 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:27:41,636 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:27:41,636 INFO L82 PathProgramCache]: Analyzing trace with hash 2030048057, now seen corresponding path program 1 times [2018-01-31 08:27:41,636 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:27:41,636 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:27:41,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:41,637 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:27:41,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:41,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:27:41,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:27:42,045 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:27:42,046 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:27:42,046 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-31 08:27:42,051 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:27:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:27:42,096 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:27:42,116 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-31 08:27:42,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:27:42,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:27:42,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:27:42,182 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:27:42,183 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:27:42,186 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-31 08:27:42,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:27:42,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:27:42,198 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-31 08:27:42,255 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-31 08:27:42,266 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-31 08:27:42,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:27:42,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:27:42,274 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-31 08:27:42,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-31 08:27:42,328 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 25 treesize of output 26 [2018-01-31 08:27:42,330 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-31 08:27:42,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:27:42,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:27:42,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-31 08:27:42,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-31 08:27:43,105 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 30 treesize of output 28 [2018-01-31 08:27:43,112 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-31 08:27:43,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:27:43,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-01-31 08:27:43,121 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:27:43,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:27:43,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:27:43,135 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-01-31 08:27:43,232 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:27:43,260 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:27:43,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 25 [2018-01-31 08:27:43,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-31 08:27:43,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-31 08:27:43,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=587, Unknown=0, NotChecked=0, Total=650 [2018-01-31 08:27:43,261 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 26 states. [2018-01-31 08:27:44,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:27:44,306 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2018-01-31 08:27:44,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-31 08:27:44,306 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-01-31 08:27:44,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:27:44,307 INFO L225 Difference]: With dead ends: 121 [2018-01-31 08:27:44,307 INFO L226 Difference]: Without dead ends: 120 [2018-01-31 08:27:44,307 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=214, Invalid=1508, Unknown=0, NotChecked=0, Total=1722 [2018-01-31 08:27:44,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-31 08:27:44,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 109. [2018-01-31 08:27:44,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-31 08:27:44,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2018-01-31 08:27:44,316 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 50 [2018-01-31 08:27:44,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:27:44,316 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2018-01-31 08:27:44,316 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-31 08:27:44,317 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2018-01-31 08:27:44,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-31 08:27:44,317 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:27:44,317 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:27:44,317 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:27:44,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1493019695, now seen corresponding path program 1 times [2018-01-31 08:27:44,318 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:27:44,318 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:27:44,318 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:44,318 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:27:44,319 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:27:44,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:27:44,995 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-31 08:27:44,996 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:27:44,996 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-31 08:27:45,004 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:27:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:27:45,028 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:27:45,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:27:45,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:27:45,055 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-31 08:27:45,055 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-01-31 08:27:45,453 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-31 08:27:45,473 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:27:45,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-01-31 08:27:45,473 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-31 08:27:45,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-31 08:27:45,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-01-31 08:27:45,474 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 19 states. [2018-01-31 08:27:45,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:27:45,777 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2018-01-31 08:27:45,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-31 08:27:45,778 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2018-01-31 08:27:45,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:27:45,781 INFO L225 Difference]: With dead ends: 140 [2018-01-31 08:27:45,781 INFO L226 Difference]: Without dead ends: 139 [2018-01-31 08:27:45,782 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2018-01-31 08:27:45,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-31 08:27:45,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 128. [2018-01-31 08:27:45,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-01-31 08:27:45,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2018-01-31 08:27:45,791 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 51 [2018-01-31 08:27:45,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:27:45,792 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2018-01-31 08:27:45,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-31 08:27:45,792 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2018-01-31 08:27:45,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-31 08:27:45,793 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:27:45,793 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:27:45,793 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:27:45,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1933602136, now seen corresponding path program 3 times [2018-01-31 08:27:45,793 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:27:45,793 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:27:45,794 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:45,794 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:27:45,794 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:27:45,813 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:27:46,327 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:27:46,327 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:27:46,327 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-31 08:27:46,332 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:27:46,344 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:27:46,347 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:27:46,350 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:27:46,354 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:27:46,355 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:27:46,359 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:27:46,370 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-31 08:27:46,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:27:46,403 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-31 08:27:46,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-31 08:27:46,439 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-31 08:27:46,441 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-31 08:27:46,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:27:46,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:27:46,447 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-31 08:27:46,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-31 08:27:46,728 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 26 treesize of output 20 [2018-01-31 08:27:46,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-01-31 08:27:46,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-01-31 08:27:46,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:27:46,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:27:46,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:47 [2018-01-31 08:27:46,944 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:27:46,966 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:27:46,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2018-01-31 08:27:46,967 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-31 08:27:46,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-31 08:27:46,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=832, Unknown=0, NotChecked=0, Total=930 [2018-01-31 08:27:46,967 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand 31 states. [2018-01-31 08:27:48,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:27:48,252 INFO L93 Difference]: Finished difference Result 149 states and 159 transitions. [2018-01-31 08:27:48,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-31 08:27:48,253 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 52 [2018-01-31 08:27:48,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:27:48,254 INFO L225 Difference]: With dead ends: 149 [2018-01-31 08:27:48,254 INFO L226 Difference]: Without dead ends: 148 [2018-01-31 08:27:48,254 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=288, Invalid=1782, Unknown=0, NotChecked=0, Total=2070 [2018-01-31 08:27:48,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-31 08:27:48,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 135. [2018-01-31 08:27:48,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-31 08:27:48,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 145 transitions. [2018-01-31 08:27:48,263 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 145 transitions. Word has length 52 [2018-01-31 08:27:48,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:27:48,263 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 145 transitions. [2018-01-31 08:27:48,263 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-31 08:27:48,263 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 145 transitions. [2018-01-31 08:27:48,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-31 08:27:48,264 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:27:48,264 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:27:48,264 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:27:48,264 INFO L82 PathProgramCache]: Analyzing trace with hash 499925011, now seen corresponding path program 2 times [2018-01-31 08:27:48,264 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:27:48,264 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:27:48,265 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:48,265 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:27:48,265 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:27:48,279 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:27:48,491 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:27:48,492 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:27:48,492 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-31 08:27:48,497 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:27:48,510 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:27:48,513 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:27:48,514 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:27:48,540 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-31 08:27:48,559 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:27:48,559 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2018-01-31 08:27:48,560 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-31 08:27:48,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-31 08:27:48,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-01-31 08:27:48,560 INFO L87 Difference]: Start difference. First operand 135 states and 145 transitions. Second operand 12 states. [2018-01-31 08:27:48,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:27:48,828 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2018-01-31 08:27:48,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-31 08:27:48,834 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2018-01-31 08:27:48,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:27:48,834 INFO L225 Difference]: With dead ends: 155 [2018-01-31 08:27:48,834 INFO L226 Difference]: Without dead ends: 154 [2018-01-31 08:27:48,835 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2018-01-31 08:27:48,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-31 08:27:48,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 127. [2018-01-31 08:27:48,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-01-31 08:27:48,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2018-01-31 08:27:48,843 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 54 [2018-01-31 08:27:48,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:27:48,843 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2018-01-31 08:27:48,843 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-31 08:27:48,843 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2018-01-31 08:27:48,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-31 08:27:48,844 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:27:48,844 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:27:48,844 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:27:48,844 INFO L82 PathProgramCache]: Analyzing trace with hash 353173611, now seen corresponding path program 1 times [2018-01-31 08:27:48,844 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:27:48,845 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:27:48,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:48,845 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:27:48,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:27:48,856 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:27:49,093 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-31 08:27:49,094 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:27:49,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:27:49,094 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:27:49,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:27:49,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:27:49,095 INFO L87 Difference]: Start difference. First operand 127 states and 136 transitions. Second operand 6 states. [2018-01-31 08:27:49,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:27:49,557 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2018-01-31 08:27:49,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:27:49,557 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-01-31 08:27:49,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:27:49,558 INFO L225 Difference]: With dead ends: 127 [2018-01-31 08:27:49,558 INFO L226 Difference]: Without dead ends: 113 [2018-01-31 08:27:49,559 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:27:49,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-31 08:27:49,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-01-31 08:27:49,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-31 08:27:49,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2018-01-31 08:27:49,570 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 54 [2018-01-31 08:27:49,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:27:49,570 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2018-01-31 08:27:49,570 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:27:49,571 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2018-01-31 08:27:49,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-31 08:27:49,571 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:27:49,571 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:27:49,571 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:27:49,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1903035143, now seen corresponding path program 1 times [2018-01-31 08:27:49,571 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:27:49,571 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:27:49,572 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:49,572 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:27:49,572 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:27:49,588 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:27:50,085 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:27:50,086 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:27:50,086 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-31 08:27:50,091 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:27:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:27:50,126 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:27:50,137 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-31 08:27:50,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:27:50,142 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-31 08:27:50,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:27:50,146 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-31 08:27:50,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-01-31 08:27:50,189 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:27:50,189 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:27:50,190 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-31 08:27:50,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:27:50,196 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:27:50,196 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-31 08:27:50,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:27:50,202 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-31 08:27:50,202 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-01-31 08:27:50,714 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:27:50,734 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:27:50,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 38 [2018-01-31 08:27:50,734 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-31 08:27:50,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-31 08:27:50,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1386, Unknown=0, NotChecked=0, Total=1482 [2018-01-31 08:27:50,735 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand 39 states. [2018-01-31 08:27:52,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:27:52,583 INFO L93 Difference]: Finished difference Result 141 states and 148 transitions. [2018-01-31 08:27:52,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-31 08:27:52,583 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 58 [2018-01-31 08:27:52,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:27:52,584 INFO L225 Difference]: With dead ends: 141 [2018-01-31 08:27:52,584 INFO L226 Difference]: Without dead ends: 140 [2018-01-31 08:27:52,586 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 841 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=419, Invalid=4273, Unknown=0, NotChecked=0, Total=4692 [2018-01-31 08:27:52,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-31 08:27:52,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 113. [2018-01-31 08:27:52,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-31 08:27:52,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2018-01-31 08:27:52,597 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 58 [2018-01-31 08:27:52,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:27:52,597 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2018-01-31 08:27:52,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-31 08:27:52,597 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2018-01-31 08:27:52,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-31 08:27:52,598 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:27:52,598 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:27:52,598 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:27:52,599 INFO L82 PathProgramCache]: Analyzing trace with hash 264882738, now seen corresponding path program 4 times [2018-01-31 08:27:52,599 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:27:52,599 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:27:52,599 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:52,600 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:27:52,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:52,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:27:52,620 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:27:53,473 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 28 DAG size of output 19 [2018-01-31 08:27:53,833 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:27:53,833 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:27:53,833 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-31 08:27:53,843 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-31 08:27:53,863 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:27:53,865 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:27:53,879 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-31 08:27:53,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:27:53,884 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-31 08:27:53,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-31 08:27:53,928 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-31 08:27:53,930 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-31 08:27:53,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:27:53,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:27:53,937 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-31 08:27:53,937 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-31 08:27:54,313 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 38 treesize of output 30 [2018-01-31 08:27:54,325 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:27:54,326 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:27:54,327 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:27:54,344 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 58 [2018-01-31 08:27:54,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:27:54,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:27:54,381 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-31 08:27:54,382 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:63 [2018-01-31 08:27:54,681 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:27:54,700 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:27:54,700 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 34 [2018-01-31 08:27:54,700 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-31 08:27:54,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-31 08:27:54,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1092, Unknown=0, NotChecked=0, Total=1190 [2018-01-31 08:27:54,701 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand 35 states. [2018-01-31 08:27:56,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:27:56,339 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2018-01-31 08:27:56,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-31 08:27:56,339 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 59 [2018-01-31 08:27:56,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:27:56,341 INFO L225 Difference]: With dead ends: 141 [2018-01-31 08:27:56,341 INFO L226 Difference]: Without dead ends: 140 [2018-01-31 08:27:56,342 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=286, Invalid=2684, Unknown=0, NotChecked=0, Total=2970 [2018-01-31 08:27:56,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-31 08:27:56,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 120. [2018-01-31 08:27:56,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-31 08:27:56,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-01-31 08:27:56,356 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 59 [2018-01-31 08:27:56,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:27:56,356 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-01-31 08:27:56,356 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-31 08:27:56,356 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-01-31 08:27:56,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-31 08:27:56,357 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:27:56,357 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:27:56,357 INFO L371 AbstractCegarLoop]: === Iteration 22 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:27:56,357 INFO L82 PathProgramCache]: Analyzing trace with hash 224039479, now seen corresponding path program 2 times [2018-01-31 08:27:56,358 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:27:56,358 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:27:56,358 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:56,358 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:27:56,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:27:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:27:56,372 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:27:57,136 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:27:57,136 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:27:57,136 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-31 08:27:57,141 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:27:57,156 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:27:57,163 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:27:57,165 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:27:57,170 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:27:57,179 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-31 08:27:57,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:27:57,254 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-31 08:27:57,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:27:57,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:27:57,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-31 08:27:57,307 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:27:57,308 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:27:57,309 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-31 08:27:57,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:27:57,315 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-31 08:27:57,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:27:57,320 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-31 08:27:57,320 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-31 08:27:57,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-31 08:27:57,375 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-31 08:27:57,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:27:57,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:27:57,381 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-31 08:27:57,381 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-31 08:27:57,418 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 27 treesize of output 28 [2018-01-31 08:27:57,420 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-31 08:27:57,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:27:57,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:27:57,432 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-31 08:27:57,432 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:33 [2018-01-31 08:27:58,522 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 34 treesize of output 33 [2018-01-31 08:27:58,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25 [2018-01-31 08:27:58,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:27:58,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:27:58,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-01-31 08:27:58,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:47, output treesize:59 [2018-01-31 08:27:58,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-01-31 08:27:58,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 15 [2018-01-31 08:27:58,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:27:58,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:27:58,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:27:58,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-31 08:27:58,866 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:27:58,886 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:27:58,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2018-01-31 08:27:58,886 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-31 08:27:58,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-31 08:27:58,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1248, Unknown=0, NotChecked=0, Total=1332 [2018-01-31 08:27:58,887 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 37 states. [2018-01-31 08:28:00,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:28:00,947 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-01-31 08:28:00,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-31 08:28:00,949 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 61 [2018-01-31 08:28:00,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:28:00,950 INFO L225 Difference]: With dead ends: 138 [2018-01-31 08:28:00,950 INFO L226 Difference]: Without dead ends: 137 [2018-01-31 08:28:00,951 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=273, Invalid=2919, Unknown=0, NotChecked=0, Total=3192 [2018-01-31 08:28:00,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-31 08:28:00,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 131. [2018-01-31 08:28:00,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-01-31 08:28:00,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2018-01-31 08:28:00,962 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 61 [2018-01-31 08:28:00,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:28:00,962 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2018-01-31 08:28:00,962 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-31 08:28:00,962 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2018-01-31 08:28:00,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-31 08:28:00,963 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:28:00,963 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:28:00,963 INFO L371 AbstractCegarLoop]: === Iteration 23 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:28:00,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1644710765, now seen corresponding path program 2 times [2018-01-31 08:28:00,963 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:28:00,963 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:28:00,964 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:28:00,964 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:28:00,964 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:28:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:28:00,976 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:28:01,366 WARN L143 SmtUtils]: Spent 118ms on a formula simplification that was a NOOP. DAG size: 16 [2018-01-31 08:28:01,740 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:28:01,740 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:28:01,740 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-31 08:28:01,745 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:28:01,759 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:28:01,766 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:28:01,768 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:28:01,771 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:28:01,775 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-31 08:28:01,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:28:01,780 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-31 08:28:01,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:28:01,784 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-31 08:28:01,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-01-31 08:28:02,158 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:28:02,159 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:28:02,159 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-31 08:28:02,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:28:02,168 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:28:02,169 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:28:02,170 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-31 08:28:02,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:28:02,174 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-31 08:28:02,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-01-31 08:28:04,257 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:28:04,277 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:28:04,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 44 [2018-01-31 08:28:04,277 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-01-31 08:28:04,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-01-31 08:28:04,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1861, Unknown=0, NotChecked=0, Total=1980 [2018-01-31 08:28:04,278 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand 45 states. [2018-01-31 08:28:05,745 WARN L143 SmtUtils]: Spent 307ms on a formula simplification that was a NOOP. DAG size: 42 [2018-01-31 08:28:06,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:28:06,471 INFO L93 Difference]: Finished difference Result 176 states and 186 transitions. [2018-01-31 08:28:06,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-31 08:28:06,471 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 62 [2018-01-31 08:28:06,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:28:06,472 INFO L225 Difference]: With dead ends: 176 [2018-01-31 08:28:06,472 INFO L226 Difference]: Without dead ends: 175 [2018-01-31 08:28:06,473 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1053 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=452, Invalid=4950, Unknown=0, NotChecked=0, Total=5402 [2018-01-31 08:28:06,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-01-31 08:28:06,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2018-01-31 08:28:06,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-01-31 08:28:06,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 181 transitions. [2018-01-31 08:28:06,487 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 181 transitions. Word has length 62 [2018-01-31 08:28:06,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:28:06,487 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 181 transitions. [2018-01-31 08:28:06,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-01-31 08:28:06,488 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 181 transitions. [2018-01-31 08:28:06,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-31 08:28:06,488 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:28:06,489 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:28:06,489 INFO L371 AbstractCegarLoop]: === Iteration 24 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:28:06,489 INFO L82 PathProgramCache]: Analyzing trace with hash -3216623, now seen corresponding path program 2 times [2018-01-31 08:28:06,489 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:28:06,489 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:28:06,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:28:06,490 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:28:06,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:28:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:28:06,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:28:07,008 WARN L143 SmtUtils]: Spent 142ms on a formula simplification that was a NOOP. DAG size: 18 [2018-01-31 08:28:07,507 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:28:07,507 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:28:07,507 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-31 08:28:07,513 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:28:07,527 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:28:07,534 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:28:07,536 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:28:07,539 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:28:07,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:28:07,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:28:07,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:28:07,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-01-31 08:28:07,681 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:28:07,681 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:28:07,682 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-31 08:28:07,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:28:07,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:28:07,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:28:07,699 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-31 08:28:07,699 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2018-01-31 08:28:07,803 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-31 08:28:07,805 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-31 08:28:07,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:28:07,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:28:07,815 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-31 08:28:07,815 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2018-01-31 08:28:07,943 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 25 treesize of output 26 [2018-01-31 08:28:07,953 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-31 08:28:07,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:28:08,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:28:08,262 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-31 08:28:08,262 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:44 [2018-01-31 08:28:08,958 WARN L143 SmtUtils]: Spent 115ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-31 08:28:10,212 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 30 [2018-01-31 08:28:10,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-31 08:28:10,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:28:10,226 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 13 treesize of output 10 [2018-01-31 08:28:10,226 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-31 08:28:10,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:28:10,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:28:10,245 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:37 [2018-01-31 08:28:10,417 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:28:10,436 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:28:10,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 47 [2018-01-31 08:28:10,437 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-01-31 08:28:10,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-01-31 08:28:10,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2120, Unknown=0, NotChecked=0, Total=2256 [2018-01-31 08:28:10,437 INFO L87 Difference]: Start difference. First operand 171 states and 181 transitions. Second operand 48 states. [2018-01-31 08:28:11,525 WARN L146 SmtUtils]: Spent 549ms on a formula simplification. DAG size of input: 68 DAG size of output 57 [2018-01-31 08:28:12,724 WARN L146 SmtUtils]: Spent 985ms on a formula simplification. DAG size of input: 71 DAG size of output 69 [2018-01-31 08:28:12,896 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 75 DAG size of output 72 [2018-01-31 08:28:13,973 WARN L146 SmtUtils]: Spent 1031ms on a formula simplification. DAG size of input: 74 DAG size of output 66 [2018-01-31 08:28:14,360 WARN L146 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 72 DAG size of output 64 [2018-01-31 08:28:15,416 WARN L146 SmtUtils]: Spent 174ms on a formula simplification. DAG size of input: 62 DAG size of output 61 [2018-01-31 08:28:15,946 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 105 DAG size of output 92 [2018-01-31 08:28:16,327 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 98 DAG size of output 90 [2018-01-31 08:28:17,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:28:17,355 INFO L93 Difference]: Finished difference Result 224 states and 235 transitions. [2018-01-31 08:28:17,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-01-31 08:28:17,355 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 65 [2018-01-31 08:28:17,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:28:17,356 INFO L225 Difference]: With dead ends: 224 [2018-01-31 08:28:17,356 INFO L226 Difference]: Without dead ends: 223 [2018-01-31 08:28:17,357 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1847 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=642, Invalid=7014, Unknown=0, NotChecked=0, Total=7656 [2018-01-31 08:28:17,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-01-31 08:28:17,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 171. [2018-01-31 08:28:17,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-01-31 08:28:17,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 181 transitions. [2018-01-31 08:28:17,369 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 181 transitions. Word has length 65 [2018-01-31 08:28:17,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:28:17,370 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 181 transitions. [2018-01-31 08:28:17,370 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-01-31 08:28:17,370 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 181 transitions. [2018-01-31 08:28:17,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-31 08:28:17,370 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:28:17,371 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:28:17,371 INFO L371 AbstractCegarLoop]: === Iteration 25 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:28:17,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1300620136, now seen corresponding path program 5 times [2018-01-31 08:28:17,371 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:28:17,371 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:28:17,372 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:28:17,372 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:28:17,372 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:28:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:28:17,388 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:28:18,534 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:28:18,535 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:28:18,535 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:28:18,539 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-31 08:28:18,547 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:28:18,549 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:28:18,551 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:28:18,553 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:28:18,554 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:28:18,561 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:28:18,564 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:28:18,567 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:28:18,570 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-31 08:28:18,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:28:18,575 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-31 08:28:18,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-31 08:28:18,616 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-31 08:28:18,618 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-31 08:28:18,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:28:18,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:28:18,624 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-31 08:28:18,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-31 08:28:20,219 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 48 treesize of output 38 [2018-01-31 08:28:20,221 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:28:20,222 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:28:20,223 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:28:20,224 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:28:20,225 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:28:20,225 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:28:20,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 93 [2018-01-31 08:28:20,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:28:20,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:28:20,288 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-31 08:28:20,289 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:73 [2018-01-31 08:28:20,501 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:28:20,521 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:28:20,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 41 [2018-01-31 08:28:20,522 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-01-31 08:28:20,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-01-31 08:28:20,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1512, Unknown=2, NotChecked=0, Total=1722 [2018-01-31 08:28:20,522 INFO L87 Difference]: Start difference. First operand 171 states and 181 transitions. Second operand 42 states. [2018-01-31 08:28:21,269 WARN L146 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 65 DAG size of output 44 [2018-01-31 08:28:22,675 WARN L146 SmtUtils]: Spent 736ms on a formula simplification. DAG size of input: 81 DAG size of output 61 [2018-01-31 08:28:23,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:28:23,417 INFO L93 Difference]: Finished difference Result 210 states and 224 transitions. [2018-01-31 08:28:23,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-31 08:28:23,417 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 66 [2018-01-31 08:28:23,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:28:23,418 INFO L225 Difference]: With dead ends: 210 [2018-01-31 08:28:23,418 INFO L226 Difference]: Without dead ends: 209 [2018-01-31 08:28:23,420 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1236 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=632, Invalid=4336, Unknown=2, NotChecked=0, Total=4970 [2018-01-31 08:28:23,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-01-31 08:28:23,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 185. [2018-01-31 08:28:23,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-31 08:28:23,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 197 transitions. [2018-01-31 08:28:23,438 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 197 transitions. Word has length 66 [2018-01-31 08:28:23,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:28:23,438 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 197 transitions. [2018-01-31 08:28:23,438 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-01-31 08:28:23,438 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 197 transitions. [2018-01-31 08:28:23,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-31 08:28:23,439 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:28:23,439 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:28:23,439 INFO L371 AbstractCegarLoop]: === Iteration 26 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:28:23,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1036941411, now seen corresponding path program 3 times [2018-01-31 08:28:23,440 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:28:23,440 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:28:23,441 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:28:23,441 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:28:23,441 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:28:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:28:23,454 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:28:23,943 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:28:23,943 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:28:23,943 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:28:23,948 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:28:23,963 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:28:23,969 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:28:23,974 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:28:23,976 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:28:23,979 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:28:23,982 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-31 08:28:23,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:28:23,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:28:23,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:28:24,041 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-31 08:28:24,041 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-01-31 08:28:24,090 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:28:24,090 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:28:24,091 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-31 08:28:24,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:28:24,100 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:28:24,101 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:28:24,101 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-31 08:28:24,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:28:24,106 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-31 08:28:24,106 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-01-31 08:28:24,698 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:28:24,717 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:28:24,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 46 [2018-01-31 08:28:24,718 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-01-31 08:28:24,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-01-31 08:28:24,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=2044, Unknown=0, NotChecked=0, Total=2162 [2018-01-31 08:28:24,719 INFO L87 Difference]: Start difference. First operand 185 states and 197 transitions. Second operand 47 states. [2018-01-31 08:28:27,100 WARN L146 SmtUtils]: Spent 445ms on a formula simplification. DAG size of input: 53 DAG size of output 40 [2018-01-31 08:28:28,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:28:28,991 INFO L93 Difference]: Finished difference Result 233 states and 246 transitions. [2018-01-31 08:28:28,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-01-31 08:28:28,991 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 69 [2018-01-31 08:28:28,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:28:28,992 INFO L225 Difference]: With dead ends: 233 [2018-01-31 08:28:28,992 INFO L226 Difference]: Without dead ends: 232 [2018-01-31 08:28:28,994 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1615 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=704, Invalid=7668, Unknown=0, NotChecked=0, Total=8372 [2018-01-31 08:28:28,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-01-31 08:28:29,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 185. [2018-01-31 08:28:29,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-31 08:28:29,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 197 transitions. [2018-01-31 08:28:29,011 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 197 transitions. Word has length 69 [2018-01-31 08:28:29,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:28:29,012 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 197 transitions. [2018-01-31 08:28:29,012 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-01-31 08:28:29,012 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 197 transitions. [2018-01-31 08:28:29,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-31 08:28:29,013 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:28:29,013 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:28:29,013 INFO L371 AbstractCegarLoop]: === Iteration 27 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:28:29,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1528511545, now seen corresponding path program 4 times [2018-01-31 08:28:29,013 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:28:29,013 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:28:29,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:28:29,016 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:28:29,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:28:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:28:29,034 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:28:30,099 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:28:30,100 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:28:30,100 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:28:30,105 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-31 08:28:30,128 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:28:30,131 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:28:30,217 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-31 08:28:30,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:28:30,221 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-31 08:28:30,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-31 08:28:30,283 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-31 08:28:30,284 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-31 08:28:30,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:28:30,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:28:30,290 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-31 08:28:30,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-31 08:28:30,720 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 38 treesize of output 30 [2018-01-31 08:28:30,722 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:28:30,722 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:28:30,723 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:28:30,730 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 58 [2018-01-31 08:28:30,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:28:30,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:28:30,766 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-31 08:28:30,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:63 [2018-01-31 08:28:31,025 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:28:31,045 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:28:31,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 21] total 48 [2018-01-31 08:28:31,045 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-01-31 08:28:31,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-01-31 08:28:31,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2199, Unknown=0, NotChecked=0, Total=2352 [2018-01-31 08:28:31,046 INFO L87 Difference]: Start difference. First operand 185 states and 197 transitions. Second operand 49 states. [2018-01-31 08:28:34,401 WARN L146 SmtUtils]: Spent 630ms on a formula simplification. DAG size of input: 64 DAG size of output 62 [2018-01-31 08:28:36,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:28:36,496 INFO L93 Difference]: Finished difference Result 248 states and 261 transitions. [2018-01-31 08:28:36,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-01-31 08:28:36,497 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 72 [2018-01-31 08:28:36,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:28:36,498 INFO L225 Difference]: With dead ends: 248 [2018-01-31 08:28:36,498 INFO L226 Difference]: Without dead ends: 247 [2018-01-31 08:28:36,498 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2246 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=662, Invalid=7528, Unknown=0, NotChecked=0, Total=8190 [2018-01-31 08:28:36,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-01-31 08:28:36,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 185. [2018-01-31 08:28:36,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-31 08:28:36,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 197 transitions. [2018-01-31 08:28:36,513 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 197 transitions. Word has length 72 [2018-01-31 08:28:36,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:28:36,513 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 197 transitions. [2018-01-31 08:28:36,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-01-31 08:28:36,513 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 197 transitions. [2018-01-31 08:28:36,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-31 08:28:36,514 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:28:36,514 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:28:36,514 INFO L371 AbstractCegarLoop]: === Iteration 28 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:28:36,514 INFO L82 PathProgramCache]: Analyzing trace with hash 778528889, now seen corresponding path program 3 times [2018-01-31 08:28:36,514 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:28:36,514 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:28:36,515 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:28:36,516 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:28:36,516 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:28:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:28:36,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:28:37,276 WARN L143 SmtUtils]: Spent 103ms on a formula simplification that was a NOOP. DAG size: 12 [2018-01-31 08:28:37,662 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:28:37,662 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:28:37,662 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:28:37,668 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:28:37,681 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:28:37,686 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:28:37,691 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:28:37,697 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:28:37,699 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:28:37,702 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:28:37,718 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-31 08:28:37,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:28:37,733 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-31 08:28:37,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:28:37,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:28:37,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-31 08:28:37,768 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:28:37,770 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-31 08:28:37,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:28:37,778 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:28:37,779 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:28:37,779 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-31 08:28:37,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:28:37,784 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-31 08:28:37,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-31 08:28:37,793 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 15 treesize of output 12 [2018-01-31 08:28:37,794 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-31 08:28:37,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:28:37,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:28:37,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:28:37,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-31 08:28:37,828 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 26 treesize of output 27 [2018-01-31 08:28:37,830 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-31 08:28:37,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:28:37,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:28:37,838 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-31 08:28:37,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-01-31 08:28:38,129 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 33 treesize of output 32 [2018-01-31 08:28:38,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25 [2018-01-31 08:28:38,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:28:38,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:28:38,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-31 08:28:38,266 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:43 [2018-01-31 08:28:38,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-01-31 08:28:38,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 8 treesize of output 7 [2018-01-31 08:28:38,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:28:38,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:28:38,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:28:38,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-01-31 08:28:38,404 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 21 treesize of output 17 [2018-01-31 08:28:38,411 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 17 treesize of output 14 [2018-01-31 08:28:38,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:28:38,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:28:38,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:28:38,420 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-01-31 08:28:38,481 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-31 08:28:38,501 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:28:38,501 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 35 [2018-01-31 08:28:38,502 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-31 08:28:38,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-31 08:28:38,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1126, Unknown=0, NotChecked=0, Total=1260 [2018-01-31 08:28:38,502 INFO L87 Difference]: Start difference. First operand 185 states and 197 transitions. Second operand 36 states. [2018-01-31 08:28:39,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:28:39,638 INFO L93 Difference]: Finished difference Result 185 states and 197 transitions. [2018-01-31 08:28:39,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-31 08:28:39,665 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 72 [2018-01-31 08:28:39,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:28:39,665 INFO L225 Difference]: With dead ends: 185 [2018-01-31 08:28:39,665 INFO L226 Difference]: Without dead ends: 144 [2018-01-31 08:28:39,666 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 55 SyntacticMatches, 8 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=498, Invalid=2694, Unknown=0, NotChecked=0, Total=3192 [2018-01-31 08:28:39,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-31 08:28:39,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 116. [2018-01-31 08:28:39,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-31 08:28:39,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2018-01-31 08:28:39,677 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 72 [2018-01-31 08:28:39,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:28:39,677 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2018-01-31 08:28:39,677 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-31 08:28:39,677 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2018-01-31 08:28:39,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-01-31 08:28:39,678 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:28:39,678 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:28:39,678 INFO L371 AbstractCegarLoop]: === Iteration 29 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:28:39,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1029696173, now seen corresponding path program 5 times [2018-01-31 08:28:39,679 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:28:39,679 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:28:39,679 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:28:39,679 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:28:39,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:28:39,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:28:39,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:28:40,323 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:28:40,323 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:28:40,323 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:28:40,328 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-31 08:28:40,337 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:28:40,342 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:28:40,351 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:28:40,355 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:28:40,358 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:28:40,361 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-31 08:28:40,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:28:40,369 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-31 08:28:40,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:28:40,375 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-31 08:28:40,375 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-01-31 08:28:40,436 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:28:40,437 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:28:40,437 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-31 08:28:40,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:28:40,446 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:28:40,446 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-31 08:28:40,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:28:40,454 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-31 08:28:40,454 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:19 [2018-01-31 08:28:40,518 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-31 08:28:40,520 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-31 08:28:40,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:28:40,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:28:40,528 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-31 08:28:40,528 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2018-01-31 08:28:40,674 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 17 treesize of output 13 [2018-01-31 08:28:40,679 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 13 treesize of output 14 [2018-01-31 08:28:40,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:28:40,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:28:40,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:28:40,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:61 [2018-01-31 08:28:41,255 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:28:41,275 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:28:41,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26] total 52 [2018-01-31 08:28:41,275 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-01-31 08:28:41,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-01-31 08:28:41,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2601, Unknown=0, NotChecked=0, Total=2756 [2018-01-31 08:28:41,276 INFO L87 Difference]: Start difference. First operand 116 states and 124 transitions. Second operand 53 states. [2018-01-31 08:28:42,034 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 57 DAG size of output 45 [2018-01-31 08:28:43,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:28:43,953 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2018-01-31 08:28:43,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-01-31 08:28:43,954 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 76 [2018-01-31 08:28:43,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:28:43,954 INFO L225 Difference]: With dead ends: 167 [2018-01-31 08:28:43,954 INFO L226 Difference]: Without dead ends: 123 [2018-01-31 08:28:43,955 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2191 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=710, Invalid=7662, Unknown=0, NotChecked=0, Total=8372 [2018-01-31 08:28:43,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-31 08:28:43,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 116. [2018-01-31 08:28:43,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-31 08:28:43,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2018-01-31 08:28:43,967 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 76 [2018-01-31 08:28:43,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:28:43,968 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2018-01-31 08:28:43,968 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-01-31 08:28:43,968 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2018-01-31 08:28:43,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-31 08:28:43,968 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:28:43,968 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:28:43,968 INFO L371 AbstractCegarLoop]: === Iteration 30 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:28:43,968 INFO L82 PathProgramCache]: Analyzing trace with hash -433991087, now seen corresponding path program 6 times [2018-01-31 08:28:43,968 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:28:43,969 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:28:43,969 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:28:43,969 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:28:43,969 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:28:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:28:43,985 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:28:44,618 WARN L143 SmtUtils]: Spent 142ms on a formula simplification that was a NOOP. DAG size: 18 [2018-01-31 08:28:44,852 WARN L143 SmtUtils]: Spent 136ms on a formula simplification that was a NOOP. DAG size: 18 [2018-01-31 08:28:45,789 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:28:45,789 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:28:45,789 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:28:45,794 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-31 08:28:45,810 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:28:45,815 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:28:45,819 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:28:45,824 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:28:45,829 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:28:45,831 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:28:45,835 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:28:45,857 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-31 08:28:45,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:28:45,879 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-31 08:28:45,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:28:45,885 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-31 08:28:45,885 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-01-31 08:28:45,953 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:28:45,954 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:28:45,954 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-31 08:28:45,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:28:45,966 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:28:45,967 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:28:45,968 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-31 08:28:45,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:28:45,974 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-31 08:28:45,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:19 [2018-01-31 08:28:46,045 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-31 08:28:46,047 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-31 08:28:46,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:28:46,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:28:46,055 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-31 08:28:46,055 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2018-01-31 08:28:46,641 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 34 treesize of output 26 [2018-01-31 08:28:46,793 INFO L303 Elim1Store]: Index analysis took 151 ms [2018-01-31 08:28:46,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 58 [2018-01-31 08:28:46,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 10 xjuncts. [2018-01-31 08:28:47,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:28:47,049 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-31 08:28:47,049 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:65, output treesize:88 [2018-01-31 08:28:47,714 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:28:47,747 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:28:47,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 57 [2018-01-31 08:28:47,748 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-01-31 08:28:47,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-01-31 08:28:47,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=3114, Unknown=0, NotChecked=0, Total=3306 [2018-01-31 08:28:47,749 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 58 states. [2018-01-31 08:28:48,978 WARN L146 SmtUtils]: Spent 336ms on a formula simplification. DAG size of input: 106 DAG size of output 58 [2018-01-31 08:28:50,443 WARN L146 SmtUtils]: Spent 1386ms on a formula simplification. DAG size of input: 111 DAG size of output 60 [2018-01-31 08:28:51,186 WARN L146 SmtUtils]: Spent 681ms on a formula simplification. DAG size of input: 100 DAG size of output 58 [2018-01-31 08:28:51,948 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 100 DAG size of output 67 [2018-01-31 08:28:52,574 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 105 DAG size of output 87 [2018-01-31 08:28:53,607 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 80 DAG size of output 77 [2018-01-31 08:28:55,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:28:55,014 INFO L93 Difference]: Finished difference Result 155 states and 162 transitions. [2018-01-31 08:28:55,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-01-31 08:28:55,014 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 79 [2018-01-31 08:28:55,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:28:55,015 INFO L225 Difference]: With dead ends: 155 [2018-01-31 08:28:55,015 INFO L226 Difference]: Without dead ends: 154 [2018-01-31 08:28:55,016 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2587 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=749, Invalid=8757, Unknown=0, NotChecked=0, Total=9506 [2018-01-31 08:28:55,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-31 08:28:55,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 116. [2018-01-31 08:28:55,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-31 08:28:55,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2018-01-31 08:28:55,031 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 79 [2018-01-31 08:28:55,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:28:55,031 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2018-01-31 08:28:55,031 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-01-31 08:28:55,031 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2018-01-31 08:28:55,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-31 08:28:55,031 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:28:55,032 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 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-31 08:28:55,032 INFO L371 AbstractCegarLoop]: === Iteration 31 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:28:55,032 INFO L82 PathProgramCache]: Analyzing trace with hash 831513640, now seen corresponding path program 6 times [2018-01-31 08:28:55,032 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:28:55,032 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:28:55,033 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:28:55,033 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:28:55,033 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:28:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:28:55,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:28:56,799 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:28:56,799 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:28:56,799 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:28:56,806 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-31 08:28:56,819 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:28:56,822 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:28:56,825 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:28:56,827 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:28:56,830 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:28:56,834 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:28:56,837 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:28:56,841 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:28:56,842 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:28:56,846 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:28:56,852 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-31 08:28:56,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:28:56,857 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-31 08:28:56,858 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-31 08:28:56,908 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-31 08:28:56,910 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-31 08:28:56,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:28:56,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:28:56,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:28:56,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-31 08:29:19,760 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 58 treesize of output 44 [2018-01-31 08:29:19,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 44 treesize of output 187 [2018-01-31 08:29:19,858 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-01-31 08:29:20,628 WARN L152 XnfTransformerHelper]: Simplifying disjunction of 65536 conjuctions. This might take some time... Received shutdown request... [2018-01-31 08:29:49,132 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-31 08:29:49,132 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-31 08:29:49,137 WARN L185 ceAbstractionStarter]: Timeout [2018-01-31 08:29:49,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:29:49 BoogieIcfgContainer [2018-01-31 08:29:49,138 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 08:29:49,139 INFO L168 Benchmark]: Toolchain (without parser) took 138005.44 ms. Allocated memory was 304.1 MB in the beginning and 1.1 GB in the end (delta: 759.2 MB). Free memory was 262.8 MB in the beginning and 782.8 MB in the end (delta: -520.0 MB). Peak memory consumption was 771.8 MB. Max. memory is 5.3 GB. [2018-01-31 08:29:49,142 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 304.1 MB. Free memory is still 268.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:29:49,143 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.77 ms. Allocated memory is still 304.1 MB. Free memory was 262.8 MB in the beginning and 252.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:29:49,143 INFO L168 Benchmark]: Boogie Preprocessor took 46.77 ms. Allocated memory is still 304.1 MB. Free memory was 252.8 MB in the beginning and 250.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:29:49,143 INFO L168 Benchmark]: RCFGBuilder took 654.77 ms. Allocated memory is still 304.1 MB. Free memory was 250.8 MB in the beginning and 227.9 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 5.3 GB. [2018-01-31 08:29:49,144 INFO L168 Benchmark]: TraceAbstraction took 136982.24 ms. Allocated memory was 304.1 MB in the beginning and 1.1 GB in the end (delta: 759.2 MB). Free memory was 227.9 MB in the beginning and 782.8 MB in the end (delta: -554.9 MB). Peak memory consumption was 736.9 MB. Max. memory is 5.3 GB. [2018-01-31 08:29:49,149 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.18 ms. Allocated memory is still 304.1 MB. Free memory is still 268.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 305.77 ms. Allocated memory is still 304.1 MB. Free memory was 262.8 MB in the beginning and 252.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 46.77 ms. Allocated memory is still 304.1 MB. Free memory was 252.8 MB in the beginning and 250.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 654.77 ms. Allocated memory is still 304.1 MB. Free memory was 250.8 MB in the beginning and 227.9 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 136982.24 ms. Allocated memory was 304.1 MB in the beginning and 1.1 GB in the end (delta: 759.2 MB). Free memory was 227.9 MB in the beginning and 782.8 MB in the end (delta: -554.9 MB). Peak memory consumption was 736.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 79 locations, 11 error locations. TIMEOUT Result, 136.9s OverallTime, 31 OverallIterations, 8 TraceHistogramMax, 45.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1869 SDtfs, 5056 SDslu, 21328 SDs, 0 SdLazy, 16295 SolverSat, 802 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 12.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1933 GetRequests, 824 SyntacticMatches, 14 SemanticMatches, 1095 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16278 ImplicationChecksByTransitivity, 59.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=185occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 30 MinimizatonAttempts, 436 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 34.5s InterpolantComputationTime, 2545 NumberOfCodeBlocks, 2525 NumberOfCodeBlocksAsserted, 71 NumberOfCheckSat, 2497 ConstructedInterpolants, 202 QuantifiedInterpolants, 1932447 SizeOfPredicates, 342 NumberOfNonLiveVariables, 3306 ConjunctsInSsa, 839 ConjunctsInUnsatCore, 48 InterpolantComputations, 13 PerfectInterpolantSequences, 47/984 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_08-29-49-161.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_08-29-49-161.csv Completed graceful shutdown