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/cstrcat-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 08:19:05,461 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:19:05,462 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:19:05,479 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:19:05,479 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:19:05,480 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:19:05,482 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:19:05,484 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:19:05,486 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:19:05,488 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:19:05,489 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:19:05,489 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:19:05,490 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:19:05,492 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:19:05,497 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:19:05,499 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:19:05,511 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:19:05,513 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:19:05,514 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:19:05,515 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:19:05,518 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:19:05,518 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:19:05,518 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:19:05,525 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:19:05,526 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:19:05,527 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:19:05,528 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:19:05,528 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:19:05,528 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:19:05,529 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:19:05,529 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:19:05,530 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:19:05,549 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:19:05,549 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:19:05,550 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:19:05,550 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:19:05,552 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:19:05,552 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:19:05,552 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:19:05,553 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:19:05,553 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:19:05,553 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 08:19:05,553 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:19:05,554 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:19:05,554 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:19:05,554 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 08:19:05,554 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 08:19:05,554 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 08:19:05,555 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:19:05,555 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:19:05,555 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:19:05,555 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:19:05,556 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:19:05,556 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:19:05,556 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:19:05,556 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:19:05,556 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:19:05,557 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:19:05,557 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:19:05,557 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:19:05,557 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:19:05,557 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:19:05,557 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:19:05,558 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:19:05,558 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:19:05,558 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:19:05,606 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:19:05,619 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:19:05,623 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:19:05,624 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:19:05,625 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:19:05,626 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-01-31 08:19:05,843 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:19:05,856 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:19:05,858 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:19:05,858 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:19:05,868 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:19:05,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:19:05" (1/1) ... [2018-01-31 08:19:05,874 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17a99aa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:19:05, skipping insertion in model container [2018-01-31 08:19:05,874 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:19:05" (1/1) ... [2018-01-31 08:19:05,893 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:19:05,953 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:19:06,123 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:19:06,160 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:19:06,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:19:06 WrapperNode [2018-01-31 08:19:06,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:19:06,175 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:19:06,178 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:19:06,179 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:19:06,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:19:06" (1/1) ... [2018-01-31 08:19:06,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:19:06" (1/1) ... [2018-01-31 08:19:06,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:19:06" (1/1) ... [2018-01-31 08:19:06,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:19:06" (1/1) ... [2018-01-31 08:19:06,211 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:19:06" (1/1) ... [2018-01-31 08:19:06,217 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:19:06" (1/1) ... [2018-01-31 08:19:06,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:19:06" (1/1) ... [2018-01-31 08:19:06,222 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:19:06,222 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:19:06,222 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:19:06,223 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:19:06,230 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:19:06" (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:19:06,301 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:19:06,301 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:19:06,301 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcat [2018-01-31 08:19:06,302 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:19:06,302 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 08:19:06,302 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 08:19:06,302 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:19:06,302 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:19:06,302 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:19:06,302 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 08:19:06,303 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcat [2018-01-31 08:19:06,303 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:19:06,305 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:19:06,305 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:19:06,883 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:19:06,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:19:06 BoogieIcfgContainer [2018-01-31 08:19:06,884 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:19:06,885 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:19:06,885 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:19:06,888 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:19:06,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:19:05" (1/3) ... [2018-01-31 08:19:06,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539647a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:19:06, skipping insertion in model container [2018-01-31 08:19:06,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:19:06" (2/3) ... [2018-01-31 08:19:06,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539647a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:19:06, skipping insertion in model container [2018-01-31 08:19:06,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:19:06" (3/3) ... [2018-01-31 08:19:06,892 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-01-31 08:19:06,901 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:19:06,909 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-01-31 08:19:06,953 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:19:06,953 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:19:06,954 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:19:06,954 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:19:06,954 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:19:06,954 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:19:06,954 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:19:06,954 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:19:06,955 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:19:06,980 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2018-01-31 08:19:06,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-31 08:19:06,989 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:19:06,990 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:19:06,991 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:19:06,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1358649906, now seen corresponding path program 1 times [2018-01-31 08:19:06,999 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:19:07,000 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:19:07,060 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:07,060 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:19:07,060 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:07,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:19:07,112 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:19:07,184 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:19:07,191 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:19:07,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 08:19:07,193 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 08:19:07,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 08:19:07,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:19:07,206 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 3 states. [2018-01-31 08:19:07,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:19:07,362 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2018-01-31 08:19:07,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 08:19:07,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-01-31 08:19:07,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:19:07,467 INFO L225 Difference]: With dead ends: 112 [2018-01-31 08:19:07,467 INFO L226 Difference]: Without dead ends: 75 [2018-01-31 08:19:07,471 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:19:07,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-31 08:19:07,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-01-31 08:19:07,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-31 08:19:07,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-01-31 08:19:07,514 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 21 [2018-01-31 08:19:07,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:19:07,515 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-01-31 08:19:07,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 08:19:07,515 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-01-31 08:19:07,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-31 08:19:07,516 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:19:07,516 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:19:07,517 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:19:07,517 INFO L82 PathProgramCache]: Analyzing trace with hash 291143110, now seen corresponding path program 1 times [2018-01-31 08:19:07,517 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:19:07,517 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:19:07,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:07,518 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:19:07,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:19:07,542 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:19:07,649 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:19:07,650 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:19:07,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:19:07,652 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:19:07,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:19:07,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:19:07,652 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 4 states. [2018-01-31 08:19:07,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:19:07,842 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-01-31 08:19:07,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:19:07,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-01-31 08:19:07,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:19:07,845 INFO L225 Difference]: With dead ends: 75 [2018-01-31 08:19:07,845 INFO L226 Difference]: Without dead ends: 74 [2018-01-31 08:19:07,846 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:19:07,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-31 08:19:07,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-31 08:19:07,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-31 08:19:07,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-01-31 08:19:07,858 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 24 [2018-01-31 08:19:07,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:19:07,858 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-01-31 08:19:07,858 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:19:07,859 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-01-31 08:19:07,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-31 08:19:07,859 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:19:07,859 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:19:07,860 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:19:07,860 INFO L82 PathProgramCache]: Analyzing trace with hash 291143111, now seen corresponding path program 1 times [2018-01-31 08:19:07,860 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:19:07,860 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:19:07,861 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:07,861 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:19:07,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:19:07,880 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:19:08,159 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:19:08,159 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:19:08,161 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:19:08,162 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:19:08,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:19:08,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:19:08,163 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 6 states. [2018-01-31 08:19:08,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:19:08,381 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2018-01-31 08:19:08,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:19:08,381 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-31 08:19:08,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:19:08,382 INFO L225 Difference]: With dead ends: 74 [2018-01-31 08:19:08,382 INFO L226 Difference]: Without dead ends: 73 [2018-01-31 08:19:08,383 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:19:08,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-31 08:19:08,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-01-31 08:19:08,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-31 08:19:08,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-01-31 08:19:08,391 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 24 [2018-01-31 08:19:08,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:19:08,391 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-01-31 08:19:08,391 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:19:08,391 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-01-31 08:19:08,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-31 08:19:08,392 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:19:08,392 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:19:08,392 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:19:08,393 INFO L82 PathProgramCache]: Analyzing trace with hash 435501890, now seen corresponding path program 1 times [2018-01-31 08:19:08,393 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:19:08,393 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:19:08,394 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:08,394 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:19:08,394 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:19:08,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:19:08,483 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:19:08,483 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:19:08,484 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:19:08,484 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:19:08,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:19:08,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:19:08,485 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 4 states. [2018-01-31 08:19:08,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:19:08,571 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-01-31 08:19:08,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:19:08,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-01-31 08:19:08,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:19:08,573 INFO L225 Difference]: With dead ends: 73 [2018-01-31 08:19:08,573 INFO L226 Difference]: Without dead ends: 72 [2018-01-31 08:19:08,573 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:19:08,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-31 08:19:08,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-01-31 08:19:08,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-31 08:19:08,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-01-31 08:19:08,581 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 25 [2018-01-31 08:19:08,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:19:08,582 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-01-31 08:19:08,582 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:19:08,582 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-01-31 08:19:08,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-31 08:19:08,583 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:19:08,583 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:19:08,583 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:19:08,583 INFO L82 PathProgramCache]: Analyzing trace with hash 435501891, now seen corresponding path program 1 times [2018-01-31 08:19:08,583 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:19:08,584 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:19:08,584 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:08,585 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:19:08,585 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:08,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:19:08,599 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:19:09,015 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:19:09,015 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:19:09,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:19:09,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:19:09,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:19:09,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:19:09,016 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 7 states. [2018-01-31 08:19:09,257 WARN L143 SmtUtils]: Spent 144ms on a formula simplification that was a NOOP. DAG size: 16 [2018-01-31 08:19:09,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:19:09,426 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-01-31 08:19:09,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:19:09,426 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-01-31 08:19:09,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:19:09,427 INFO L225 Difference]: With dead ends: 72 [2018-01-31 08:19:09,427 INFO L226 Difference]: Without dead ends: 71 [2018-01-31 08:19:09,428 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:19:09,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-31 08:19:09,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-01-31 08:19:09,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-31 08:19:09,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-01-31 08:19:09,437 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 25 [2018-01-31 08:19:09,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:19:09,437 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-01-31 08:19:09,437 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:19:09,438 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-01-31 08:19:09,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-31 08:19:09,438 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:19:09,439 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:19:09,439 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:19:09,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1440353202, now seen corresponding path program 1 times [2018-01-31 08:19:09,439 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:19:09,439 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:19:09,440 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:09,440 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:19:09,441 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:09,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:19:09,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:19:09,534 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:19:09,535 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:19:09,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:19:09,535 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:19:09,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:19:09,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:19:09,536 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 6 states. [2018-01-31 08:19:09,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:19:09,691 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-01-31 08:19:09,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:19:09,691 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-31 08:19:09,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:19:09,692 INFO L225 Difference]: With dead ends: 78 [2018-01-31 08:19:09,692 INFO L226 Difference]: Without dead ends: 77 [2018-01-31 08:19:09,693 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:19:09,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-31 08:19:09,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2018-01-31 08:19:09,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-31 08:19:09,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2018-01-31 08:19:09,701 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 31 [2018-01-31 08:19:09,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:19:09,701 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2018-01-31 08:19:09,701 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:19:09,702 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2018-01-31 08:19:09,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-31 08:19:09,702 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:19:09,703 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:19:09,703 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:19:09,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1440353203, now seen corresponding path program 1 times [2018-01-31 08:19:09,703 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:19:09,703 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:19:09,704 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:09,704 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:19:09,705 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:09,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:19:09,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:19:09,895 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:19:09,895 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:19:09,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 08:19:09,896 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:19:09,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:19:09,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:19:09,896 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 8 states. [2018-01-31 08:19:10,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:19:10,512 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-01-31 08:19:10,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:19:10,512 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-01-31 08:19:10,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:19:10,513 INFO L225 Difference]: With dead ends: 82 [2018-01-31 08:19:10,513 INFO L226 Difference]: Without dead ends: 81 [2018-01-31 08:19:10,513 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:19:10,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-31 08:19:10,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2018-01-31 08:19:10,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-31 08:19:10,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-01-31 08:19:10,523 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 31 [2018-01-31 08:19:10,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:19:10,523 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-01-31 08:19:10,523 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:19:10,523 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-01-31 08:19:10,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-31 08:19:10,524 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:19:10,524 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:19:10,525 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:19:10,525 INFO L82 PathProgramCache]: Analyzing trace with hash -789761369, now seen corresponding path program 1 times [2018-01-31 08:19:10,525 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:19:10,525 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:19:10,526 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:10,526 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:19:10,526 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:10,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:19:10,540 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:19:10,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-31 08:19:10,597 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:19:10,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:19:10,598 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:19:10,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:19:10,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:19:10,598 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 7 states. [2018-01-31 08:19:10,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:19:10,742 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-01-31 08:19:10,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:19:10,743 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-01-31 08:19:10,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:19:10,743 INFO L225 Difference]: With dead ends: 76 [2018-01-31 08:19:10,744 INFO L226 Difference]: Without dead ends: 75 [2018-01-31 08:19:10,744 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:19:10,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-31 08:19:10,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-01-31 08:19:10,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-31 08:19:10,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-01-31 08:19:10,753 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 38 [2018-01-31 08:19:10,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:19:10,753 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-01-31 08:19:10,753 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:19:10,753 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-01-31 08:19:10,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-31 08:19:10,755 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:19:10,755 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:19:10,757 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:19:10,757 INFO L82 PathProgramCache]: Analyzing trace with hash -789761368, now seen corresponding path program 1 times [2018-01-31 08:19:10,757 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:19:10,757 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:19:10,758 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:10,758 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:19:10,758 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:10,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:19:10,772 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:19:11,059 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:19:11,059 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:19:11,060 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:19:11,079 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:19:11,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:19:11,144 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:19:11,201 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:19:11,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:19:11,308 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:19:11,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-01-31 08:19:11,421 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:19:11,441 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:19:11,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-01-31 08:19:11,441 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-31 08:19:11,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-31 08:19:11,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:19:11,442 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 11 states. [2018-01-31 08:19:11,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:19:11,997 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2018-01-31 08:19:11,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 08:19:11,997 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-01-31 08:19:11,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:19:11,998 INFO L225 Difference]: With dead ends: 92 [2018-01-31 08:19:11,998 INFO L226 Difference]: Without dead ends: 91 [2018-01-31 08:19:11,999 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2018-01-31 08:19:11,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-31 08:19:12,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2018-01-31 08:19:12,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-31 08:19:12,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-01-31 08:19:12,008 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 38 [2018-01-31 08:19:12,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:19:12,008 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-01-31 08:19:12,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-31 08:19:12,009 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-01-31 08:19:12,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-31 08:19:12,010 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:19:12,010 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:19:12,010 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:19:12,010 INFO L82 PathProgramCache]: Analyzing trace with hash -2071136617, now seen corresponding path program 1 times [2018-01-31 08:19:12,011 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:19:12,011 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:19:12,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:12,012 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:19:12,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:19:12,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:19:12,427 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:19:12,427 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:19:12,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:19:12,428 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:19:12,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:19:12,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:19:12,428 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 6 states. [2018-01-31 08:19:12,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:19:12,506 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2018-01-31 08:19:12,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:19:12,506 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-01-31 08:19:12,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:19:12,507 INFO L225 Difference]: With dead ends: 79 [2018-01-31 08:19:12,507 INFO L226 Difference]: Without dead ends: 78 [2018-01-31 08:19:12,507 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:19:12,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-31 08:19:12,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-01-31 08:19:12,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-31 08:19:12,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-01-31 08:19:12,514 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 39 [2018-01-31 08:19:12,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:19:12,514 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-01-31 08:19:12,514 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:19:12,514 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-01-31 08:19:12,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-31 08:19:12,515 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:19:12,516 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:19:12,516 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:19:12,516 INFO L82 PathProgramCache]: Analyzing trace with hash -2071136616, now seen corresponding path program 1 times [2018-01-31 08:19:12,516 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:19:12,516 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:19:12,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:12,517 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:19:12,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:19:12,530 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:19:12,850 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:19:12,850 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:19:12,850 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 08:19:12,850 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 08:19:12,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 08:19:12,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:19:12,851 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 9 states. [2018-01-31 08:19:13,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:19:13,008 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2018-01-31 08:19:13,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 08:19:13,008 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-01-31 08:19:13,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:19:13,009 INFO L225 Difference]: With dead ends: 93 [2018-01-31 08:19:13,009 INFO L226 Difference]: Without dead ends: 92 [2018-01-31 08:19:13,010 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-01-31 08:19:13,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-31 08:19:13,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2018-01-31 08:19:13,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-31 08:19:13,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-01-31 08:19:13,023 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 39 [2018-01-31 08:19:13,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:19:13,023 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-01-31 08:19:13,023 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 08:19:13,023 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-01-31 08:19:13,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-31 08:19:13,024 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:19:13,024 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:19:13,024 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:19:13,025 INFO L82 PathProgramCache]: Analyzing trace with hash 219274321, now seen corresponding path program 1 times [2018-01-31 08:19:13,025 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:19:13,025 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:19:13,025 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:13,025 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:19:13,026 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:19:13,036 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:19:13,096 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:19:13,096 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:19:13,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:19:13,096 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:19:13,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:19:13,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:19:13,097 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 7 states. [2018-01-31 08:19:13,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:19:13,187 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-01-31 08:19:13,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:19:13,188 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-01-31 08:19:13,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:19:13,188 INFO L225 Difference]: With dead ends: 84 [2018-01-31 08:19:13,189 INFO L226 Difference]: Without dead ends: 83 [2018-01-31 08:19:13,189 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:19:13,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-31 08:19:13,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-01-31 08:19:13,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-31 08:19:13,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-01-31 08:19:13,194 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 40 [2018-01-31 08:19:13,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:19:13,195 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-01-31 08:19:13,195 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:19:13,195 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-01-31 08:19:13,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-31 08:19:13,196 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:19:13,196 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:19:13,196 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:19:13,196 INFO L82 PathProgramCache]: Analyzing trace with hash 219274322, now seen corresponding path program 1 times [2018-01-31 08:19:13,196 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:19:13,197 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:19:13,197 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:13,197 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:19:13,198 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:19:13,209 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:19:13,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:19:13,456 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:19:13,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 08:19:13,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 08:19:13,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 08:19:13,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:19:13,457 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 9 states. [2018-01-31 08:19:13,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:19:13,885 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2018-01-31 08:19:13,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 08:19:13,886 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2018-01-31 08:19:13,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:19:13,886 INFO L225 Difference]: With dead ends: 95 [2018-01-31 08:19:13,886 INFO L226 Difference]: Without dead ends: 94 [2018-01-31 08:19:13,887 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-01-31 08:19:13,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-31 08:19:13,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-01-31 08:19:13,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-31 08:19:13,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2018-01-31 08:19:13,893 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 40 [2018-01-31 08:19:13,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:19:13,893 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2018-01-31 08:19:13,893 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 08:19:13,893 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2018-01-31 08:19:13,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-31 08:19:13,894 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:19:13,895 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:19:13,895 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:19:13,895 INFO L82 PathProgramCache]: Analyzing trace with hash 564346387, now seen corresponding path program 2 times [2018-01-31 08:19:13,895 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:19:13,895 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:19:13,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:13,896 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:19:13,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:19:13,910 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:19:14,583 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:19:14,584 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:19:14,584 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:19:14,589 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:19:14,603 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:19:14,609 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:19:14,612 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:19:14,618 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:19:14,626 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:19:14,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:19:14,631 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:19:14,632 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-31 08:19:14,867 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:19:14,869 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:19:14,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:19:14,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:19:14,876 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:19:14,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-31 08:19:15,175 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:19:15,181 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:19:15,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:19:15,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:19:15,197 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:19:15,198 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:40 [2018-01-31 08:19:15,339 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:19:15,367 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:19:15,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 25 [2018-01-31 08:19:15,367 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-31 08:19:15,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-31 08:19:15,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2018-01-31 08:19:15,368 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand 26 states. [2018-01-31 08:19:16,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:19:16,411 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2018-01-31 08:19:16,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-31 08:19:16,430 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 45 [2018-01-31 08:19:16,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:19:16,431 INFO L225 Difference]: With dead ends: 113 [2018-01-31 08:19:16,431 INFO L226 Difference]: Without dead ends: 112 [2018-01-31 08:19:16,432 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=217, Invalid=1423, Unknown=0, NotChecked=0, Total=1640 [2018-01-31 08:19:16,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-31 08:19:16,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 98. [2018-01-31 08:19:16,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-31 08:19:16,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-01-31 08:19:16,438 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 45 [2018-01-31 08:19:16,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:19:16,438 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-01-31 08:19:16,438 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-31 08:19:16,439 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-01-31 08:19:16,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-31 08:19:16,441 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:19:16,442 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:19:16,442 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:19:16,442 INFO L82 PathProgramCache]: Analyzing trace with hash 141736189, now seen corresponding path program 1 times [2018-01-31 08:19:16,442 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:19:16,442 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:19:16,443 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:16,443 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:19:16,443 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:16,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:19:16,463 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:19:16,715 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:19:16,715 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:19:16,715 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:19:16,722 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:19:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:19:16,747 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:19:16,753 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:19:16,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:19:16,757 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:19:16,758 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-01-31 08:19:16,867 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:19:16,886 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:19:16,887 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 17 [2018-01-31 08:19:16,887 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-31 08:19:16,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-31 08:19:16,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-01-31 08:19:16,887 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 18 states. [2018-01-31 08:19:17,342 WARN L143 SmtUtils]: Spent 134ms on a formula simplification that was a NOOP. DAG size: 25 [2018-01-31 08:19:17,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:19:17,439 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2018-01-31 08:19:17,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-31 08:19:17,440 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 47 [2018-01-31 08:19:17,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:19:17,440 INFO L225 Difference]: With dead ends: 110 [2018-01-31 08:19:17,440 INFO L226 Difference]: Without dead ends: 109 [2018-01-31 08:19:17,441 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2018-01-31 08:19:17,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-31 08:19:17,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 98. [2018-01-31 08:19:17,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-31 08:19:17,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-01-31 08:19:17,449 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 47 [2018-01-31 08:19:17,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:19:17,449 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-01-31 08:19:17,449 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-31 08:19:17,449 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-01-31 08:19:17,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-31 08:19:17,450 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:19:17,450 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:19:17,450 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:19:17,450 INFO L82 PathProgramCache]: Analyzing trace with hash -220320392, now seen corresponding path program 1 times [2018-01-31 08:19:17,450 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:19:17,451 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:19:17,451 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:17,451 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:19:17,451 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:17,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:19:17,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:19:17,867 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:19:17,867 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:19:17,868 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) [2018-01-31 08:19:17,881 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:19:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:19:17,913 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:19:17,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:19:17,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:19:18,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:19:18,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:19:18,088 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:19:18,088 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:19:18,091 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:19:18,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:19:18,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:19:18,095 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-31 08:19:18,130 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:19:18,132 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:19:18,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:19:18,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:19:18,162 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:19:18,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-31 08:19:18,237 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:19:18,243 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:19:18,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:19:18,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:19:18,254 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:19:18,255 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-31 08:19:18,626 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:19:18,708 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:19:18,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:19:18,716 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:19:18,716 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:19:18,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:19:18,735 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:19:18,736 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-01-31 08:19:18,785 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:19:18,807 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:19:18,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 25 [2018-01-31 08:19:18,807 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-31 08:19:18,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-31 08:19:18,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=587, Unknown=0, NotChecked=0, Total=650 [2018-01-31 08:19:18,808 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 26 states. [2018-01-31 08:19:19,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:19:19,810 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2018-01-31 08:19:19,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-31 08:19:19,811 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-01-31 08:19:19,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:19:19,811 INFO L225 Difference]: With dead ends: 121 [2018-01-31 08:19:19,812 INFO L226 Difference]: Without dead ends: 120 [2018-01-31 08:19:19,812 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=214, Invalid=1508, Unknown=0, NotChecked=0, Total=1722 [2018-01-31 08:19:19,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-31 08:19:19,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 109. [2018-01-31 08:19:19,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-31 08:19:19,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2018-01-31 08:19:19,822 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 50 [2018-01-31 08:19:19,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:19:19,822 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2018-01-31 08:19:19,822 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-31 08:19:19,822 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2018-01-31 08:19:19,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-31 08:19:19,824 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:19:19,824 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:19:19,824 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:19:19,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1760002418, now seen corresponding path program 1 times [2018-01-31 08:19:19,824 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:19:19,825 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:19:19,825 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:19,825 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:19:19,826 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:19,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:19:19,838 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:19:20,128 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:19:20,129 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:19:20,129 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:19:20,134 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:19:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:19:20,158 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:19:20,174 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:19:20,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:19:20,187 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:19:20,187 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-01-31 08:19:20,313 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:19:20,333 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:19:20,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-01-31 08:19:20,333 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-31 08:19:20,333 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-31 08:19:20,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-01-31 08:19:20,334 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 21 states. [2018-01-31 08:19:20,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:19:20,710 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2018-01-31 08:19:20,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-31 08:19:20,711 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2018-01-31 08:19:20,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:19:20,714 INFO L225 Difference]: With dead ends: 138 [2018-01-31 08:19:20,714 INFO L226 Difference]: Without dead ends: 137 [2018-01-31 08:19:20,715 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=791, Unknown=0, NotChecked=0, Total=930 [2018-01-31 08:19:20,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-31 08:19:20,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 128. [2018-01-31 08:19:20,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-01-31 08:19:20,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2018-01-31 08:19:20,724 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 51 [2018-01-31 08:19:20,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:19:20,724 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2018-01-31 08:19:20,724 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-31 08:19:20,724 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2018-01-31 08:19:20,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-31 08:19:20,725 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:19:20,725 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:19:20,725 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:19:20,726 INFO L82 PathProgramCache]: Analyzing trace with hash -801598392, now seen corresponding path program 3 times [2018-01-31 08:19:20,726 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:19:20,726 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:19:20,726 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:20,727 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:19:20,727 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:19:20,742 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:19:21,499 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:19:21,499 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:19:21,555 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:19:21,561 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:19:21,573 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:19:21,576 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:19:21,597 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:19:21,612 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:19:21,629 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:19:21,633 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:19:21,649 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:19:21,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:19:21,654 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:19:21,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-31 08:19:21,705 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:19:21,706 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:19:21,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:19:21,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:19:21,713 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:19:21,713 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-31 08:19:22,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-01-31 08:19:22,195 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:19:22,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-01-31 08:19:22,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:19:22,227 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:19:22,227 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:47 [2018-01-31 08:19:22,479 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:19:22,500 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:19:22,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 38 [2018-01-31 08:19:22,501 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-31 08:19:22,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-31 08:19:22,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1363, Unknown=0, NotChecked=0, Total=1482 [2018-01-31 08:19:22,501 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand 39 states. [2018-01-31 08:19:25,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:19:25,072 INFO L93 Difference]: Finished difference Result 149 states and 159 transitions. [2018-01-31 08:19:25,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-31 08:19:25,072 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 52 [2018-01-31 08:19:25,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:19:25,073 INFO L225 Difference]: With dead ends: 149 [2018-01-31 08:19:25,073 INFO L226 Difference]: Without dead ends: 148 [2018-01-31 08:19:25,074 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=484, Invalid=3298, Unknown=0, NotChecked=0, Total=3782 [2018-01-31 08:19:25,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-31 08:19:25,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 135. [2018-01-31 08:19:25,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-31 08:19:25,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 145 transitions. [2018-01-31 08:19:25,084 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 145 transitions. Word has length 52 [2018-01-31 08:19:25,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:19:25,084 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 145 transitions. [2018-01-31 08:19:25,084 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-31 08:19:25,084 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 145 transitions. [2018-01-31 08:19:25,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-31 08:19:25,085 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:19:25,085 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:19:25,086 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:19:25,086 INFO L82 PathProgramCache]: Analyzing trace with hash -507124950, now seen corresponding path program 1 times [2018-01-31 08:19:25,086 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:19:25,086 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:19:25,087 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:25,087 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:19:25,087 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:25,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:19:25,099 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:19:25,282 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:19:25,282 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:19:25,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:19:25,283 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:19:25,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:19:25,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:19:25,283 INFO L87 Difference]: Start difference. First operand 135 states and 145 transitions. Second operand 6 states. [2018-01-31 08:19:25,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:19:25,427 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2018-01-31 08:19:25,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:19:25,427 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-01-31 08:19:25,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:19:25,428 INFO L225 Difference]: With dead ends: 135 [2018-01-31 08:19:25,428 INFO L226 Difference]: Without dead ends: 121 [2018-01-31 08:19:25,428 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:19:25,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-31 08:19:25,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-01-31 08:19:25,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-31 08:19:25,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2018-01-31 08:19:25,438 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 54 [2018-01-31 08:19:25,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:19:25,439 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2018-01-31 08:19:25,439 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:19:25,439 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2018-01-31 08:19:25,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-31 08:19:25,440 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:19:25,440 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:19:25,440 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:19:25,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1728796146, now seen corresponding path program 2 times [2018-01-31 08:19:25,440 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:19:25,441 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:19:25,441 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:25,441 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:19:25,441 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:19:25,455 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:19:25,837 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:19:25,838 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:19:25,838 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:19:25,844 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:19:25,859 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:19:25,861 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:19:25,863 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:19:25,898 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:19:25,918 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:19:25,918 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2018-01-31 08:19:25,918 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-31 08:19:25,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-31 08:19:25,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-01-31 08:19:25,918 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand 15 states. [2018-01-31 08:19:26,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:19:26,397 INFO L93 Difference]: Finished difference Result 129 states and 136 transitions. [2018-01-31 08:19:26,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-31 08:19:26,397 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2018-01-31 08:19:26,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:19:26,398 INFO L225 Difference]: With dead ends: 129 [2018-01-31 08:19:26,398 INFO L226 Difference]: Without dead ends: 128 [2018-01-31 08:19:26,399 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=212, Invalid=910, Unknown=0, NotChecked=0, Total=1122 [2018-01-31 08:19:26,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-01-31 08:19:26,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 113. [2018-01-31 08:19:26,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-31 08:19:26,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2018-01-31 08:19:26,413 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 54 [2018-01-31 08:19:26,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:19:26,413 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2018-01-31 08:19:26,413 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-31 08:19:26,413 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2018-01-31 08:19:26,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-31 08:19:26,414 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:19:26,414 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:19:26,414 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:19:26,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1598987239, now seen corresponding path program 1 times [2018-01-31 08:19:26,415 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:19:26,415 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:19:26,415 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:26,415 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:19:26,416 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:19:26,431 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:19:26,937 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:19:26,937 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:19:26,937 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:19:26,943 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:19:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:19:26,967 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:19:26,978 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:19:26,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:19:26,983 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:19:26,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:19:26,987 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:19:26,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-01-31 08:19:27,034 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:19:27,037 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:19:27,037 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:19:27,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:19:27,048 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:19:27,048 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:19:27,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:19:27,054 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:19:27,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-01-31 08:19:27,558 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:19:27,578 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:19:27,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 42 [2018-01-31 08:19:27,579 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-01-31 08:19:27,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-01-31 08:19:27,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1700, Unknown=0, NotChecked=0, Total=1806 [2018-01-31 08:19:27,580 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand 43 states. [2018-01-31 08:19:29,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:19:29,964 INFO L93 Difference]: Finished difference Result 137 states and 144 transitions. [2018-01-31 08:19:29,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-31 08:19:29,964 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 58 [2018-01-31 08:19:29,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:19:29,965 INFO L225 Difference]: With dead ends: 137 [2018-01-31 08:19:29,965 INFO L226 Difference]: Without dead ends: 136 [2018-01-31 08:19:29,966 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 940 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=547, Invalid=5003, Unknown=0, NotChecked=0, Total=5550 [2018-01-31 08:19:29,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-01-31 08:19:29,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 113. [2018-01-31 08:19:29,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-31 08:19:29,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2018-01-31 08:19:29,972 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 58 [2018-01-31 08:19:29,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:19:29,972 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2018-01-31 08:19:29,972 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-01-31 08:19:29,972 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2018-01-31 08:19:29,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-31 08:19:29,973 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:19:29,973 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:19:29,973 INFO L371 AbstractCegarLoop]: === Iteration 22 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:19:29,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1498101645, now seen corresponding path program 4 times [2018-01-31 08:19:29,974 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:19:29,974 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:19:29,974 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:29,974 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:19:29,974 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:19:29,992 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:19:30,433 WARN L146 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 33 DAG size of output 30 [2018-01-31 08:19:30,877 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:19:30,878 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:19:30,878 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:19:30,883 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-31 08:19:30,915 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:19:30,919 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:19:30,923 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:19:30,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:19:30,928 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:19:30,928 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-31 08:19:30,987 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:19:30,989 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:19:30,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:19:30,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:19:30,995 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:19:30,996 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-31 08:19:34,213 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:19:34,216 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:19:34,217 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:19:34,217 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:19:34,235 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:19:34,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:19:34,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:19:34,275 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:19:34,275 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:63 [2018-01-31 08:19:34,945 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:19:34,964 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:19:34,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 45 [2018-01-31 08:19:34,965 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-01-31 08:19:34,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-01-31 08:19:34,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1888, Unknown=4, NotChecked=0, Total=2070 [2018-01-31 08:19:34,966 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand 46 states. [2018-01-31 08:19:36,072 WARN L146 SmtUtils]: Spent 651ms on a formula simplification. DAG size of input: 86 DAG size of output 45 [2018-01-31 08:19:39,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:19:39,759 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2018-01-31 08:19:39,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-31 08:19:39,760 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 59 [2018-01-31 08:19:39,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:19:39,762 INFO L225 Difference]: With dead ends: 141 [2018-01-31 08:19:39,762 INFO L226 Difference]: Without dead ends: 140 [2018-01-31 08:19:39,764 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1151 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=609, Invalid=4789, Unknown=4, NotChecked=0, Total=5402 [2018-01-31 08:19:39,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-31 08:19:39,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 120. [2018-01-31 08:19:39,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-31 08:19:39,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-01-31 08:19:39,772 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 59 [2018-01-31 08:19:39,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:19:39,772 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-01-31 08:19:39,772 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-01-31 08:19:39,772 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-01-31 08:19:39,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-31 08:19:39,773 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:19:39,773 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:19:39,773 INFO L371 AbstractCegarLoop]: === Iteration 23 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:19:39,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1279257240, now seen corresponding path program 2 times [2018-01-31 08:19:39,774 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:19:39,774 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:19:39,774 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:39,774 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:19:39,775 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:19:39,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:19:40,554 WARN L146 SmtUtils]: Spent 436ms on a formula simplification. DAG size of input: 23 DAG size of output 17 [2018-01-31 08:19:41,287 WARN L143 SmtUtils]: Spent 141ms on a formula simplification that was a NOOP. DAG size: 20 [2018-01-31 08:19:41,571 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:19:41,572 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:19:41,572 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:19:41,577 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:19:41,591 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:19:41,597 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:19:41,600 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:19:41,603 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:19:41,606 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:19:41,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:19:41,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:19:41,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:19:41,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:19:41,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-31 08:19:41,671 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:19:41,672 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:19:41,672 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:19:41,672 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:19:41,679 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:19:41,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:19:41,683 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:19:41,684 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-31 08:19:41,734 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:19:41,736 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:19:41,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:19:41,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:19:41,742 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:19:41,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-31 08:19:41,791 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:19:41,793 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:19:41,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:19:41,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:19:41,804 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:19:41,804 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:33 [2018-01-31 08:19:43,061 WARN L143 SmtUtils]: Spent 122ms on a formula simplification that was a NOOP. DAG size: 29 [2018-01-31 08:19:43,152 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:19:43,294 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:19:43,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:19:43,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:19:43,324 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:19:43,324 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:47, output treesize:59 [2018-01-31 08:19:43,495 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:19:43,501 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:19:43,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:19:43,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:19:43,521 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:19:43,521 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-31 08:19:43,588 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:19:43,607 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:19:43,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 38 [2018-01-31 08:19:43,607 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-31 08:19:43,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-31 08:19:43,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1394, Unknown=0, NotChecked=0, Total=1482 [2018-01-31 08:19:43,608 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 39 states. [2018-01-31 08:19:45,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:19:45,580 INFO L93 Difference]: Finished difference Result 155 states and 163 transitions. [2018-01-31 08:19:45,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-31 08:19:45,580 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 61 [2018-01-31 08:19:45,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:19:45,581 INFO L225 Difference]: With dead ends: 155 [2018-01-31 08:19:45,581 INFO L226 Difference]: Without dead ends: 154 [2018-01-31 08:19:45,582 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=293, Invalid=3129, Unknown=0, NotChecked=0, Total=3422 [2018-01-31 08:19:45,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-31 08:19:45,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 132. [2018-01-31 08:19:45,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-31 08:19:45,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 140 transitions. [2018-01-31 08:19:45,592 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 140 transitions. Word has length 61 [2018-01-31 08:19:45,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:19:45,592 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 140 transitions. [2018-01-31 08:19:45,592 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-31 08:19:45,592 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 140 transitions. [2018-01-31 08:19:45,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-31 08:19:45,593 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:19:45,593 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:19:45,593 INFO L371 AbstractCegarLoop]: === Iteration 24 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:19:45,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1002268754, now seen corresponding path program 2 times [2018-01-31 08:19:45,594 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:19:45,594 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:19:45,595 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:45,595 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:19:45,595 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:19:45,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:19:46,013 WARN L143 SmtUtils]: Spent 122ms on a formula simplification that was a NOOP. DAG size: 16 [2018-01-31 08:19:46,227 WARN L143 SmtUtils]: Spent 114ms on a formula simplification that was a NOOP. DAG size: 16 [2018-01-31 08:19:47,172 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:19:47,172 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:19:47,172 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:19:47,179 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:19:47,193 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:19:47,200 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:19:47,202 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:19:47,205 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:19:47,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:19:47,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:19:47,215 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:19:47,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:19:47,219 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:19:47,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-01-31 08:19:47,279 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:19:47,280 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:19:47,280 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:19:47,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:19:47,290 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:19:47,290 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:19:47,291 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:19:47,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:19:47,296 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:19:47,296 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-01-31 08:19:47,953 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:19:47,972 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:19:47,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 46 [2018-01-31 08:19:47,973 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-01-31 08:19:47,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-01-31 08:19:47,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=2038, Unknown=0, NotChecked=0, Total=2162 [2018-01-31 08:19:47,974 INFO L87 Difference]: Start difference. First operand 132 states and 140 transitions. Second operand 47 states. [2018-01-31 08:19:48,849 WARN L143 SmtUtils]: Spent 276ms on a formula simplification that was a NOOP. DAG size: 35 [2018-01-31 08:19:50,383 WARN L143 SmtUtils]: Spent 248ms on a formula simplification that was a NOOP. DAG size: 37 [2018-01-31 08:19:51,338 WARN L143 SmtUtils]: Spent 224ms on a formula simplification that was a NOOP. DAG size: 37 [2018-01-31 08:19:51,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:19:51,495 INFO L93 Difference]: Finished difference Result 165 states and 174 transitions. [2018-01-31 08:19:51,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-31 08:19:51,496 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 62 [2018-01-31 08:19:51,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:19:51,496 INFO L225 Difference]: With dead ends: 165 [2018-01-31 08:19:51,496 INFO L226 Difference]: Without dead ends: 164 [2018-01-31 08:19:51,498 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1100 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=541, Invalid=5311, Unknown=0, NotChecked=0, Total=5852 [2018-01-31 08:19:51,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-01-31 08:19:51,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2018-01-31 08:19:51,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-01-31 08:19:51,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 169 transitions. [2018-01-31 08:19:51,507 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 169 transitions. Word has length 62 [2018-01-31 08:19:51,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:19:51,508 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 169 transitions. [2018-01-31 08:19:51,508 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-01-31 08:19:51,508 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 169 transitions. [2018-01-31 08:19:51,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-31 08:19:51,508 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:19:51,509 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:19:51,509 INFO L371 AbstractCegarLoop]: === Iteration 25 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:19:51,509 INFO L82 PathProgramCache]: Analyzing trace with hash 260031442, now seen corresponding path program 2 times [2018-01-31 08:19:51,509 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:19:51,509 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:19:51,510 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:51,510 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:19:51,510 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:19:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:19:51,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:19:52,069 WARN L143 SmtUtils]: Spent 146ms on a formula simplification that was a NOOP. DAG size: 18 [2018-01-31 08:19:52,624 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:19:52,624 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:19:52,624 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:19:52,631 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:19:52,646 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:19:52,653 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:19:52,656 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:19:52,659 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:19:52,818 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:19:52,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:19:52,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:19:52,824 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-01-31 08:19:52,895 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:19:52,896 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:19:52,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 08:19:52,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:19:52,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:19:52,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:19:52,914 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:19:52,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2018-01-31 08:19:53,007 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:19:53,009 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:19:53,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:19:53,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:19:53,019 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:19:53,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2018-01-31 08:19:53,068 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:19:53,072 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:19:53,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:19:53,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:19:53,086 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:19:53,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:44 [2018-01-31 08:19:54,058 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:19:54,088 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:19:54,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:19:54,100 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:19:54,100 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-31 08:19:54,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:19:54,119 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:19:54,119 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:37 [2018-01-31 08:19:54,284 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:19:54,303 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:19:54,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 53 [2018-01-31 08:19:54,304 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-01-31 08:19:54,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-01-31 08:19:54,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=2713, Unknown=0, NotChecked=0, Total=2862 [2018-01-31 08:19:54,305 INFO L87 Difference]: Start difference. First operand 160 states and 169 transitions. Second operand 54 states. [2018-01-31 08:19:55,843 WARN L146 SmtUtils]: Spent 674ms on a formula simplification. DAG size of input: 74 DAG size of output 68 [2018-01-31 08:19:56,518 WARN L146 SmtUtils]: Spent 607ms on a formula simplification. DAG size of input: 92 DAG size of output 84 [2018-01-31 08:19:57,422 WARN L146 SmtUtils]: Spent 824ms on a formula simplification. DAG size of input: 96 DAG size of output 86 [2018-01-31 08:19:57,688 WARN L146 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 93 DAG size of output 84 [2018-01-31 08:19:57,852 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 91 DAG size of output 82 [2018-01-31 08:19:59,205 WARN L146 SmtUtils]: Spent 1288ms on a formula simplification. DAG size of input: 108 DAG size of output 96 [2018-01-31 08:20:00,505 WARN L146 SmtUtils]: Spent 1215ms on a formula simplification. DAG size of input: 112 DAG size of output 97 [2018-01-31 08:20:00,679 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 95 DAG size of output 83 [2018-01-31 08:20:01,773 WARN L146 SmtUtils]: Spent 978ms on a formula simplification. DAG size of input: 101 DAG size of output 85 [2018-01-31 08:20:03,829 WARN L146 SmtUtils]: Spent 1952ms on a formula simplification. DAG size of input: 112 DAG size of output 98 [2018-01-31 08:20:04,045 WARN L146 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 105 DAG size of output 91 [2018-01-31 08:20:04,753 WARN L146 SmtUtils]: Spent 627ms on a formula simplification. DAG size of input: 111 DAG size of output 98 [2018-01-31 08:20:04,942 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 91 DAG size of output 83 [2018-01-31 08:20:05,621 WARN L146 SmtUtils]: Spent 618ms on a formula simplification. DAG size of input: 94 DAG size of output 84 [2018-01-31 08:20:05,836 WARN L146 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 100 DAG size of output 92 [2018-01-31 08:20:06,833 WARN L146 SmtUtils]: Spent 676ms on a formula simplification. DAG size of input: 100 DAG size of output 86 [2018-01-31 08:20:07,454 WARN L146 SmtUtils]: Spent 340ms on a formula simplification. DAG size of input: 114 DAG size of output 98 [2018-01-31 08:20:07,723 WARN L146 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 115 DAG size of output 100 [2018-01-31 08:20:08,353 WARN L146 SmtUtils]: Spent 540ms on a formula simplification. DAG size of input: 132 DAG size of output 114 [2018-01-31 08:20:08,551 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 109 DAG size of output 98 [2018-01-31 08:20:08,826 WARN L146 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 117 DAG size of output 103 [2018-01-31 08:20:09,440 WARN L146 SmtUtils]: Spent 559ms on a formula simplification. DAG size of input: 83 DAG size of output 77 [2018-01-31 08:20:10,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:10,386 INFO L93 Difference]: Finished difference Result 184 states and 193 transitions. [2018-01-31 08:20:10,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-01-31 08:20:10,386 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 65 [2018-01-31 08:20:10,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:10,387 INFO L225 Difference]: With dead ends: 184 [2018-01-31 08:20:10,387 INFO L226 Difference]: Without dead ends: 183 [2018-01-31 08:20:10,389 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2235 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=855, Invalid=8847, Unknown=0, NotChecked=0, Total=9702 [2018-01-31 08:20:10,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-01-31 08:20:10,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 160. [2018-01-31 08:20:10,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-01-31 08:20:10,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 169 transitions. [2018-01-31 08:20:10,405 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 169 transitions. Word has length 65 [2018-01-31 08:20:10,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:10,406 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 169 transitions. [2018-01-31 08:20:10,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-01-31 08:20:10,406 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 169 transitions. [2018-01-31 08:20:10,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-31 08:20:10,407 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:10,407 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:20:10,407 INFO L371 AbstractCegarLoop]: === Iteration 26 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:20:10,407 INFO L82 PathProgramCache]: Analyzing trace with hash -56058392, now seen corresponding path program 5 times [2018-01-31 08:20:10,407 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:10,407 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:10,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:10,408 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:20:10,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:10,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:10,426 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:11,776 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:20:11,776 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:20:11,891 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:20:11,896 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-31 08:20:11,905 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:20:11,907 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:20:11,909 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:20:11,911 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:20:11,913 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:20:11,920 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:20:11,923 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:20:11,926 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:20:11,929 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:20:11,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:11,934 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:20:11,934 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-31 08:20:11,989 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:20:11,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-31 08:20:11,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:11,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:20:11,997 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:20:11,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-31 08:20:14,591 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:20:14,594 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:20:14,595 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:20:14,596 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:20:14,596 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:20:14,597 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:20:14,598 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:20:14,607 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:20:14,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:20:14,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:20:14,671 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:20:14,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:73 [2018-01-31 08:20:14,959 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:20:14,978 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:20:14,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 52 [2018-01-31 08:20:14,979 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-01-31 08:20:14,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-01-31 08:20:14,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2536, Unknown=3, NotChecked=0, Total=2756 [2018-01-31 08:20:14,980 INFO L87 Difference]: Start difference. First operand 160 states and 169 transitions. Second operand 53 states. [2018-01-31 08:20:16,061 WARN L146 SmtUtils]: Spent 730ms on a formula simplification. DAG size of input: 73 DAG size of output 34 [2018-01-31 08:20:16,601 WARN L146 SmtUtils]: Spent 485ms on a formula simplification. DAG size of input: 101 DAG size of output 45 [2018-01-31 08:20:16,885 WARN L146 SmtUtils]: Spent 227ms on a formula simplification. DAG size of input: 87 DAG size of output 48 [2018-01-31 08:20:17,976 WARN L146 SmtUtils]: Spent 855ms on a formula simplification. DAG size of input: 101 DAG size of output 62 [2018-01-31 08:20:19,438 WARN L146 SmtUtils]: Spent 915ms on a formula simplification. DAG size of input: 92 DAG size of output 53 [2018-01-31 08:20:20,655 WARN L146 SmtUtils]: Spent 235ms on a formula simplification. DAG size of input: 98 DAG size of output 59 [2018-01-31 08:20:21,567 WARN L146 SmtUtils]: Spent 833ms on a formula simplification. DAG size of input: 100 DAG size of output 61 [2018-01-31 08:20:24,767 WARN L146 SmtUtils]: Spent 1231ms on a formula simplification. DAG size of input: 84 DAG size of output 43 [2018-01-31 08:20:25,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:25,659 INFO L93 Difference]: Finished difference Result 199 states and 212 transitions. [2018-01-31 08:20:25,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-01-31 08:20:25,660 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 66 [2018-01-31 08:20:25,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:25,661 INFO L225 Difference]: With dead ends: 199 [2018-01-31 08:20:25,661 INFO L226 Difference]: Without dead ends: 198 [2018-01-31 08:20:25,664 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2079 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=890, Invalid=7663, Unknown=3, NotChecked=0, Total=8556 [2018-01-31 08:20:25,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-01-31 08:20:25,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 174. [2018-01-31 08:20:25,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-01-31 08:20:25,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 185 transitions. [2018-01-31 08:20:25,684 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 185 transitions. Word has length 66 [2018-01-31 08:20:25,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:25,685 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 185 transitions. [2018-01-31 08:20:25,685 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-01-31 08:20:25,686 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 185 transitions. [2018-01-31 08:20:25,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-31 08:20:25,686 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:25,687 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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:20:25,687 INFO L371 AbstractCegarLoop]: === Iteration 27 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:20:25,687 INFO L82 PathProgramCache]: Analyzing trace with hash -191613235, now seen corresponding path program 1 times [2018-01-31 08:20:25,687 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:25,687 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:25,688 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:25,688 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:20:25,688 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:25,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:25,705 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:26,372 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:20:26,373 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:20:26,373 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:20:26,378 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:26,403 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:20:26,406 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:20:26,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:26,411 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:20:26,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:26,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:20:26,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-31 08:20:26,421 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:20:26,423 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:20:26,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:26,431 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:20:26,431 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:20:26,432 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:20:26,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:26,436 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:20:26,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-31 08:20:26,485 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:20:26,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-31 08:20:26,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:26,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:20:26,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:20:26,491 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-31 08:20:26,520 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:20:26,521 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:20:26,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:26,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:20:26,529 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:20:26,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-01-31 08:20:26,935 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:20:26,944 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:20:26,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:20:26,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:20:26,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-31 08:20:26,970 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:40, output treesize:45 [2018-01-31 08:20:27,099 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:20:27,104 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:20:27,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:20:27,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:20:27,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:20:27,113 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-01-31 08:20:27,190 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:20:27,210 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:20:27,210 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 38 [2018-01-31 08:20:27,210 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-31 08:20:27,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-31 08:20:27,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1393, Unknown=0, NotChecked=0, Total=1482 [2018-01-31 08:20:27,211 INFO L87 Difference]: Start difference. First operand 174 states and 185 transitions. Second operand 39 states. [2018-01-31 08:20:30,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:30,373 INFO L93 Difference]: Finished difference Result 196 states and 207 transitions. [2018-01-31 08:20:30,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-31 08:20:30,374 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 68 [2018-01-31 08:20:30,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:30,375 INFO L225 Difference]: With dead ends: 196 [2018-01-31 08:20:30,375 INFO L226 Difference]: Without dead ends: 195 [2018-01-31 08:20:30,375 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=300, Invalid=3240, Unknown=0, NotChecked=0, Total=3540 [2018-01-31 08:20:30,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-01-31 08:20:30,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 185. [2018-01-31 08:20:30,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-31 08:20:30,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 197 transitions. [2018-01-31 08:20:30,396 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 197 transitions. Word has length 68 [2018-01-31 08:20:30,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:30,397 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 197 transitions. [2018-01-31 08:20:30,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-31 08:20:30,397 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 197 transitions. [2018-01-31 08:20:30,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-31 08:20:30,398 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:30,398 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:20:30,398 INFO L371 AbstractCegarLoop]: === Iteration 28 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:20:30,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1645043011, now seen corresponding path program 3 times [2018-01-31 08:20:30,398 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:30,399 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:30,400 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:30,400 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:20:30,400 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:30,415 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:30,845 WARN L143 SmtUtils]: Spent 122ms on a formula simplification that was a NOOP. DAG size: 16 [2018-01-31 08:20:31,258 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:20:31,258 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:20:31,258 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:20:31,263 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:20:31,277 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:20:31,284 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:20:31,289 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:20:31,291 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:20:31,294 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:20:31,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:20:31,312 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:31,323 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:20:31,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:31,327 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:20:31,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-01-31 08:20:31,379 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:20:31,380 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:20:31,380 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:20:31,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:31,394 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:20:31,395 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:20:31,395 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:20:31,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:31,400 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:20:31,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-01-31 08:20:32,104 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:20:32,124 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:20:32,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 50 [2018-01-31 08:20:32,124 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-01-31 08:20:32,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-01-31 08:20:32,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=2422, Unknown=0, NotChecked=0, Total=2550 [2018-01-31 08:20:32,125 INFO L87 Difference]: Start difference. First operand 185 states and 197 transitions. Second operand 51 states. [2018-01-31 08:20:36,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:36,759 INFO L93 Difference]: Finished difference Result 233 states and 246 transitions. [2018-01-31 08:20:36,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-01-31 08:20:36,759 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 69 [2018-01-31 08:20:36,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:36,760 INFO L225 Difference]: With dead ends: 233 [2018-01-31 08:20:36,760 INFO L226 Difference]: Without dead ends: 232 [2018-01-31 08:20:36,760 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=878, Invalid=8628, Unknown=0, NotChecked=0, Total=9506 [2018-01-31 08:20:36,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-01-31 08:20:36,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 185. [2018-01-31 08:20:36,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-31 08:20:36,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 197 transitions. [2018-01-31 08:20:36,776 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 197 transitions. Word has length 69 [2018-01-31 08:20:36,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:36,776 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 197 transitions. [2018-01-31 08:20:36,776 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-01-31 08:20:36,776 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 197 transitions. [2018-01-31 08:20:36,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-31 08:20:36,777 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:36,777 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:20:36,777 INFO L371 AbstractCegarLoop]: === Iteration 29 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:20:36,777 INFO L82 PathProgramCache]: Analyzing trace with hash 428521848, now seen corresponding path program 3 times [2018-01-31 08:20:36,778 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:36,778 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:36,778 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:36,778 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:20:36,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:36,795 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:37,338 WARN L143 SmtUtils]: Spent 101ms on a formula simplification that was a NOOP. DAG size: 12 [2018-01-31 08:20:38,147 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:20:38,147 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:20:38,147 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:20:38,152 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:20:38,166 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:20:38,171 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:20:38,176 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:20:38,181 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:20:38,183 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:20:38,186 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:20:38,190 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:20:38,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:38,195 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:20:38,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:38,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:20:38,199 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-31 08:20:38,246 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:20:38,247 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:20:38,247 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:20:38,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:38,254 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:20:38,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:38,258 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:20:38,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-31 08:20:38,331 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:20:38,332 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:20:38,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:38,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:20:38,340 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:20:38,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-31 08:20:38,375 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:20:38,377 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:20:38,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:38,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:20:38,387 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:20:38,388 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:33 [2018-01-31 08:20:38,727 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:20:38,765 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:20:38,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:20:38,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:20:38,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-31 08:20:38,793 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:44, output treesize:57 [2018-01-31 08:20:38,917 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:20:38,919 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:20:38,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:38,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:20:38,927 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:20:38,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-01-31 08:20:38,996 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:20:39,002 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:20:39,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:20:39,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:20:39,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:20:39,010 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-01-31 08:20:39,080 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:20:39,100 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:20:39,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 41 [2018-01-31 08:20:39,101 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-01-31 08:20:39,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-01-31 08:20:39,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1569, Unknown=0, NotChecked=0, Total=1722 [2018-01-31 08:20:39,102 INFO L87 Difference]: Start difference. First operand 185 states and 197 transitions. Second operand 42 states. [2018-01-31 08:20:40,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:40,887 INFO L93 Difference]: Finished difference Result 227 states and 238 transitions. [2018-01-31 08:20:40,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-31 08:20:40,887 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 72 [2018-01-31 08:20:40,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:40,888 INFO L225 Difference]: With dead ends: 227 [2018-01-31 08:20:40,888 INFO L226 Difference]: Without dead ends: 186 [2018-01-31 08:20:40,889 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=630, Invalid=4200, Unknown=0, NotChecked=0, Total=4830 [2018-01-31 08:20:40,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-01-31 08:20:40,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-01-31 08:20:40,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-31 08:20:40,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 196 transitions. [2018-01-31 08:20:40,903 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 196 transitions. Word has length 72 [2018-01-31 08:20:40,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:40,903 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 196 transitions. [2018-01-31 08:20:40,903 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-01-31 08:20:40,903 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 196 transitions. [2018-01-31 08:20:40,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-31 08:20:40,904 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:40,904 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:20:40,904 INFO L371 AbstractCegarLoop]: === Iteration 30 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:20:40,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1615270521, now seen corresponding path program 4 times [2018-01-31 08:20:40,905 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:40,905 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:40,906 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:40,906 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:20:40,906 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:40,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:40,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:41,473 WARN L143 SmtUtils]: Spent 147ms on a formula simplification that was a NOOP. DAG size: 18 [2018-01-31 08:20:42,301 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:20:42,301 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:20:42,302 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:20:42,306 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-31 08:20:42,329 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:20:42,332 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:20:42,415 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:20:42,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:42,420 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:20:42,420 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-31 08:20:42,490 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:20:42,491 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:20:42,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:42,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:20:42,497 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:20:42,498 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-31 08:20:43,173 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:20:43,175 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:20:43,176 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:20:43,176 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:20:43,184 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:20:43,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:20:43,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:20:43,222 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:20:43,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:63 [2018-01-31 08:20:43,670 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:20:43,690 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:20:43,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 25] total 56 [2018-01-31 08:20:43,690 INFO L409 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-01-31 08:20:43,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-01-31 08:20:43,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=3050, Unknown=0, NotChecked=0, Total=3192 [2018-01-31 08:20:43,691 INFO L87 Difference]: Start difference. First operand 185 states and 196 transitions. Second operand 57 states. [2018-01-31 08:20:44,884 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 85 DAG size of output 82 [2018-01-31 08:20:45,243 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 84 DAG size of output 83 [2018-01-31 08:20:45,402 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 82 DAG size of output 81 [2018-01-31 08:20:45,625 WARN L146 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 102 DAG size of output 100 [2018-01-31 08:20:46,051 WARN L146 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 106 DAG size of output 104 [2018-01-31 08:20:46,630 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 86 DAG size of output 85 [2018-01-31 08:20:46,818 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 90 DAG size of output 87 [2018-01-31 08:20:47,015 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 87 DAG size of output 85 [2018-01-31 08:20:48,500 WARN L146 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 105 DAG size of output 103 [2018-01-31 08:20:48,696 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 92 DAG size of output 91 [2018-01-31 08:20:48,927 WARN L146 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 111 DAG size of output 106 [2018-01-31 08:20:49,296 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 90 DAG size of output 85 [2018-01-31 08:20:49,613 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 100 DAG size of output 92 [2018-01-31 08:20:49,859 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 93 DAG size of output 87 [2018-01-31 08:20:50,131 WARN L146 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 102 DAG size of output 96 [2018-01-31 08:20:50,346 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 100 DAG size of output 93 [2018-01-31 08:20:50,544 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 84 DAG size of output 81 [2018-01-31 08:20:51,040 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 88 DAG size of output 85 [2018-01-31 08:20:51,580 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 87 DAG size of output 81 [2018-01-31 08:20:52,455 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 82 DAG size of output 76 [2018-01-31 08:20:52,631 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 91 DAG size of output 85 [2018-01-31 08:20:53,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:20:53,836 INFO L93 Difference]: Finished difference Result 219 states and 230 transitions. [2018-01-31 08:20:53,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-01-31 08:20:53,836 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 72 [2018-01-31 08:20:53,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:20:53,837 INFO L225 Difference]: With dead ends: 219 [2018-01-31 08:20:53,838 INFO L226 Difference]: Without dead ends: 218 [2018-01-31 08:20:53,839 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2687 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=925, Invalid=10415, Unknown=2, NotChecked=0, Total=11342 [2018-01-31 08:20:53,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-01-31 08:20:53,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 185. [2018-01-31 08:20:53,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-31 08:20:53,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 196 transitions. [2018-01-31 08:20:53,866 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 196 transitions. Word has length 72 [2018-01-31 08:20:53,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:20:53,866 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 196 transitions. [2018-01-31 08:20:53,866 INFO L433 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-01-31 08:20:53,866 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 196 transitions. [2018-01-31 08:20:53,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-01-31 08:20:53,867 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:20:53,867 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:20:53,867 INFO L371 AbstractCegarLoop]: === Iteration 31 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:20:53,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1251612174, now seen corresponding path program 5 times [2018-01-31 08:20:53,868 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:20:53,868 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:20:53,868 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:53,869 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:20:53,869 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:20:53,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:20:53,882 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:20:54,664 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:20:54,664 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:20:54,664 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:20:54,669 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-31 08:20:54,678 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:20:54,682 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:20:54,692 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:20:54,696 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:20:54,699 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:20:54,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:20:54,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:54,712 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:20:54,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:54,718 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:20:54,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-01-31 08:20:54,787 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:20:54,788 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:20:54,788 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:20:54,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:54,800 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:20:54,801 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:20:54,801 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:20:54,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:54,848 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:20:54,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:19 [2018-01-31 08:20:54,918 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:20:54,920 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:20:54,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:20:54,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:20:54,929 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:20:54,929 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2018-01-31 08:20:55,135 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 18 treesize of output 14 [2018-01-31 08:20:55,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 15 [2018-01-31 08:20:55,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:20:55,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:20:55,154 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:20:55,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:45 [2018-01-31 08:20:55,876 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:20:55,895 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:20:55,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 29] total 58 [2018-01-31 08:20:55,896 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-01-31 08:20:55,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-01-31 08:20:55,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=3253, Unknown=0, NotChecked=0, Total=3422 [2018-01-31 08:20:55,897 INFO L87 Difference]: Start difference. First operand 185 states and 196 transitions. Second operand 59 states. [2018-01-31 08:20:56,891 WARN L146 SmtUtils]: Spent 167ms on a formula simplification. DAG size of input: 89 DAG size of output 73 [2018-01-31 08:21:01,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:21:01,365 INFO L93 Difference]: Finished difference Result 230 states and 242 transitions. [2018-01-31 08:21:01,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-01-31 08:21:01,366 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 76 [2018-01-31 08:21:01,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:21:01,367 INFO L225 Difference]: With dead ends: 230 [2018-01-31 08:21:01,367 INFO L226 Difference]: Without dead ends: 229 [2018-01-31 08:21:01,369 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2965 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=964, Invalid=10808, Unknown=0, NotChecked=0, Total=11772 [2018-01-31 08:21:01,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-01-31 08:21:01,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 185. [2018-01-31 08:21:01,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-31 08:21:01,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 196 transitions. [2018-01-31 08:21:01,394 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 196 transitions. Word has length 76 [2018-01-31 08:21:01,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:21:01,395 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 196 transitions. [2018-01-31 08:21:01,395 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-01-31 08:21:01,395 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 196 transitions. [2018-01-31 08:21:01,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-31 08:21:01,396 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:21:01,396 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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:21:01,396 INFO L371 AbstractCegarLoop]: === Iteration 32 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:21:01,396 INFO L82 PathProgramCache]: Analyzing trace with hash 160836131, now seen corresponding path program 2 times [2018-01-31 08:21:01,396 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:21:01,397 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:21:01,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:21:01,397 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:21:01,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:21:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:21:01,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:21:02,822 WARN L143 SmtUtils]: Spent 176ms on a formula simplification that was a NOOP. DAG size: 21 [2018-01-31 08:21:03,356 WARN L143 SmtUtils]: Spent 118ms on a formula simplification that was a NOOP. DAG size: 13 [2018-01-31 08:21:03,408 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-31 08:21:03,408 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:21:03,408 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:21:03,413 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:21:03,427 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:21:03,437 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:21:03,440 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:21:03,444 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:21:03,450 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:21:03,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:21:03,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:21:03,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:21:03,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:21:03,458 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-31 08:21:03,506 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:21:03,507 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:21:03,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:21:03,639 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:21:03,640 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:21:03,640 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:21:03,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:21:03,645 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:21:03,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-31 08:21:03,693 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:21:03,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-31 08:21:03,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:21:03,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:21:03,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:21:03,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-31 08:21:03,738 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:21:03,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-31 08:21:03,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:21:03,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:21:03,751 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:21:03,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:33 [2018-01-31 08:21:04,471 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:21:04,480 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:21:04,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:21:04,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:21:04,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-31 08:21:04,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:47, output treesize:63 [2018-01-31 08:21:04,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-01-31 08:21:04,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:21:04,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:21:04,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:21:04,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:21:04,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2018-01-31 08:21:04,833 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:21:04,839 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:21:04,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:21:04,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:21:04,850 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:21:04,850 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-31 08:21:05,001 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:21:05,020 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:21:05,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27] total 50 [2018-01-31 08:21:05,021 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-01-31 08:21:05,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-01-31 08:21:05,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2355, Unknown=0, NotChecked=0, Total=2550 [2018-01-31 08:21:05,021 INFO L87 Difference]: Start difference. First operand 185 states and 196 transitions. Second operand 51 states. [2018-01-31 08:21:11,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:21:11,891 INFO L93 Difference]: Finished difference Result 195 states and 205 transitions. [2018-01-31 08:21:11,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-01-31 08:21:11,891 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 79 [2018-01-31 08:21:11,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:21:11,892 INFO L225 Difference]: With dead ends: 195 [2018-01-31 08:21:11,892 INFO L226 Difference]: Without dead ends: 150 [2018-01-31 08:21:11,893 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1681 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=961, Invalid=6695, Unknown=0, NotChecked=0, Total=7656 [2018-01-31 08:21:11,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-31 08:21:11,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 116. [2018-01-31 08:21:11,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-31 08:21:11,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2018-01-31 08:21:11,913 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 79 [2018-01-31 08:21:11,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:21:11,914 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2018-01-31 08:21:11,914 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-01-31 08:21:11,914 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2018-01-31 08:21:11,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-31 08:21:11,914 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:21:11,915 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:21:11,915 INFO L371 AbstractCegarLoop]: === Iteration 33 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:21:11,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1882956238, now seen corresponding path program 6 times [2018-01-31 08:21:11,915 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:21:11,915 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:21:11,916 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:21:11,916 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:21:11,916 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:21:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:21:11,928 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:21:12,584 WARN L143 SmtUtils]: Spent 139ms on a formula simplification that was a NOOP. DAG size: 18 [2018-01-31 08:21:12,829 WARN L143 SmtUtils]: Spent 145ms on a formula simplification that was a NOOP. DAG size: 18 [2018-01-31 08:21:14,035 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:21:14,036 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:21:14,036 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:21:14,042 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-31 08:21:14,057 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:21:14,062 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:21:14,067 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:21:14,073 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:21:14,078 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:21:14,081 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:21:14,084 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:21:14,093 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:21:14,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:21:14,100 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:21:14,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:21:14,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:21:14,107 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-01-31 08:21:14,183 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:21:14,184 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:21:14,185 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:21:14,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:21:14,206 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:21:14,207 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:21:14,207 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:21:14,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:21:14,214 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:21:14,214 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:19 [2018-01-31 08:21:14,293 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:21:14,295 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:21:14,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:21:14,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:21:14,303 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:21:14,303 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2018-01-31 08:21:15,122 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:21:15,302 INFO L303 Elim1Store]: Index analysis took 179 ms [2018-01-31 08:21:15,315 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:21:15,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 10 xjuncts. [2018-01-31 08:21:15,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:21:15,382 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:21:15,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:65, output treesize:150 [2018-01-31 08:21:16,336 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:21:16,356 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:21:16,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 34] total 67 [2018-01-31 08:21:16,356 INFO L409 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-01-31 08:21:16,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-01-31 08:21:16,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=4335, Unknown=0, NotChecked=0, Total=4556 [2018-01-31 08:21:16,357 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 68 states. [2018-01-31 08:21:16,942 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 70 DAG size of output 44 [2018-01-31 08:21:17,911 WARN L146 SmtUtils]: Spent 627ms on a formula simplification. DAG size of input: 93 DAG size of output 64 [2018-01-31 08:21:18,165 WARN L146 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 117 DAG size of output 82 [2018-01-31 08:21:19,281 WARN L146 SmtUtils]: Spent 974ms on a formula simplification. DAG size of input: 128 DAG size of output 83 [2018-01-31 08:21:19,649 WARN L146 SmtUtils]: Spent 226ms on a formula simplification. DAG size of input: 134 DAG size of output 83 [2018-01-31 08:21:19,902 WARN L146 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 123 DAG size of output 81 [2018-01-31 08:21:20,342 WARN L146 SmtUtils]: Spent 320ms on a formula simplification. DAG size of input: 146 DAG size of output 98 [2018-01-31 08:21:22,581 WARN L146 SmtUtils]: Spent 343ms on a formula simplification. DAG size of input: 162 DAG size of output 111 [2018-01-31 08:21:23,273 WARN L146 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 138 DAG size of output 93 [2018-01-31 08:21:24,263 WARN L146 SmtUtils]: Spent 864ms on a formula simplification. DAG size of input: 143 DAG size of output 95 Received shutdown request... [2018-01-31 08:21:24,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-31 08:21:24,700 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-31 08:21:24,707 WARN L185 ceAbstractionStarter]: Timeout [2018-01-31 08:21:24,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:21:24 BoogieIcfgContainer [2018-01-31 08:21:24,707 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 08:21:24,708 INFO L168 Benchmark]: Toolchain (without parser) took 138864.47 ms. Allocated memory was 308.3 MB in the beginning and 725.6 MB in the end (delta: 417.3 MB). Free memory was 268.2 MB in the beginning and 548.0 MB in the end (delta: -279.8 MB). Peak memory consumption was 137.5 MB. Max. memory is 5.3 GB. [2018-01-31 08:21:24,709 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 308.3 MB. Free memory is still 274.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:21:24,710 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.91 ms. Allocated memory is still 308.3 MB. Free memory was 267.2 MB in the beginning and 256.9 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-31 08:21:24,710 INFO L168 Benchmark]: Boogie Preprocessor took 47.03 ms. Allocated memory is still 308.3 MB. Free memory was 256.9 MB in the beginning and 254.9 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:21:24,710 INFO L168 Benchmark]: RCFGBuilder took 661.81 ms. Allocated memory is still 308.3 MB. Free memory was 254.9 MB in the beginning and 233.8 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 5.3 GB. [2018-01-31 08:21:24,711 INFO L168 Benchmark]: TraceAbstraction took 137822.28 ms. Allocated memory was 308.3 MB in the beginning and 725.6 MB in the end (delta: 417.3 MB). Free memory was 233.8 MB in the beginning and 548.0 MB in the end (delta: -314.2 MB). Peak memory consumption was 103.1 MB. Max. memory is 5.3 GB. [2018-01-31 08:21:24,712 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.20 ms. Allocated memory is still 308.3 MB. Free memory is still 274.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 316.91 ms. Allocated memory is still 308.3 MB. Free memory was 267.2 MB in the beginning and 256.9 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 47.03 ms. Allocated memory is still 308.3 MB. Free memory was 256.9 MB in the beginning and 254.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 661.81 ms. Allocated memory is still 308.3 MB. Free memory was 254.9 MB in the beginning and 233.8 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 137822.28 ms. Allocated memory was 308.3 MB in the beginning and 725.6 MB in the end (delta: 417.3 MB). Free memory was 233.8 MB in the beginning and 548.0 MB in the end (delta: -314.2 MB). Peak memory consumption was 103.1 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 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (116states) and interpolant automaton (currently 20 states, 68 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (116states) and interpolant automaton (currently 20 states, 68 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was constructing difference of abstraction (116states) and interpolant automaton (currently 20 states, 68 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (116states) and interpolant automaton (currently 20 states, 68 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (116states) and interpolant automaton (currently 20 states, 68 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (116states) and interpolant automaton (currently 20 states, 68 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (116states) and interpolant automaton (currently 20 states, 68 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was constructing difference of abstraction (116states) and interpolant automaton (currently 20 states, 68 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (116states) and interpolant automaton (currently 20 states, 68 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was constructing difference of abstraction (116states) and interpolant automaton (currently 20 states, 68 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 known predicates. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (116states) and interpolant automaton (currently 20 states, 68 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 83 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 79 locations, 11 error locations. TIMEOUT Result, 137.7s OverallTime, 33 OverallIterations, 6 TraceHistogramMax, 89.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1966 SDtfs, 7106 SDslu, 26527 SDs, 0 SdLazy, 19729 SolverSat, 976 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 24.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2313 GetRequests, 883 SyntacticMatches, 27 SemanticMatches, 1402 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21838 ImplicationChecksByTransitivity, 100.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=185occurred in iteration=27, 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, 32 MinimizatonAttempts, 396 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 45.5s InterpolantComputationTime, 2877 NumberOfCodeBlocks, 2857 NumberOfCodeBlocksAsserted, 77 NumberOfCheckSat, 2824 ConstructedInterpolants, 269 QuantifiedInterpolants, 2300558 SizeOfPredicates, 553 NumberOfNonLiveVariables, 3760 ConjunctsInSsa, 1120 ConjunctsInUnsatCore, 53 InterpolantComputations, 14 PerfectInterpolantSequences, 64/1146 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/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-21-24-720.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/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-21-24-720.csv Completed graceful shutdown