java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-29 22:43:35,083 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 22:43:35,084 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 22:43:35,098 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 22:43:35,099 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 22:43:35,100 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 22:43:35,101 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 22:43:35,102 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 22:43:35,104 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 22:43:35,104 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 22:43:35,105 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 22:43:35,105 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 22:43:35,106 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 22:43:35,108 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 22:43:35,109 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 22:43:35,112 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 22:43:35,114 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 22:43:35,116 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 22:43:35,117 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 22:43:35,119 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 22:43:35,121 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 22:43:35,121 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 22:43:35,122 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 22:43:35,123 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 22:43:35,123 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 22:43:35,125 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 22:43:35,125 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 22:43:35,126 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 22:43:35,126 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 22:43:35,126 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 22:43:35,127 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 22:43:35,127 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-29 22:43:35,137 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 22:43:35,138 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 22:43:35,139 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 22:43:35,139 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 22:43:35,139 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 22:43:35,139 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 22:43:35,140 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 22:43:35,140 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 22:43:35,141 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 22:43:35,141 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 22:43:35,141 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 22:43:35,141 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 22:43:35,142 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 22:43:35,142 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 22:43:35,142 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 22:43:35,142 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 22:43:35,142 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 22:43:35,143 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 22:43:35,143 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 22:43:35,143 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 22:43:35,143 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 22:43:35,143 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 22:43:35,144 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 22:43:35,144 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 22:43:35,144 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 22:43:35,144 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 22:43:35,144 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 22:43:35,145 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 22:43:35,145 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 22:43:35,145 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 22:43:35,145 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 22:43:35,145 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 22:43:35,146 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 22:43:35,147 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 22:43:35,184 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 22:43:35,197 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 22:43:35,201 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 22:43:35,203 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 22:43:35,203 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 22:43:35,204 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-01-29 22:43:35,390 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 22:43:35,397 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 22:43:35,398 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 22:43:35,398 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 22:43:35,404 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 22:43:35,404 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:43:35" (1/1) ... [2018-01-29 22:43:35,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@275d1893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:43:35, skipping insertion in model container [2018-01-29 22:43:35,407 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:43:35" (1/1) ... [2018-01-29 22:43:35,427 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 22:43:35,466 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 22:43:35,580 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 22:43:35,597 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 22:43:35,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:43:35 WrapperNode [2018-01-29 22:43:35,604 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 22:43:35,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 22:43:35,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 22:43:35,605 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 22:43:35,622 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:43:35" (1/1) ... [2018-01-29 22:43:35,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:43:35" (1/1) ... [2018-01-29 22:43:35,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:43:35" (1/1) ... [2018-01-29 22:43:35,633 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:43:35" (1/1) ... [2018-01-29 22:43:35,638 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:43:35" (1/1) ... [2018-01-29 22:43:35,641 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:43:35" (1/1) ... [2018-01-29 22:43:35,642 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:43:35" (1/1) ... [2018-01-29 22:43:35,643 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 22:43:35,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 22:43:35,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 22:43:35,644 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 22:43:35,645 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:43:35" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 22:43:35,696 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 22:43:35,696 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 22:43:35,696 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcat [2018-01-29 22:43:35,696 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 22:43:35,697 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-29 22:43:35,697 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-29 22:43:35,697 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 22:43:35,697 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 22:43:35,697 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 22:43:35,697 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-29 22:43:35,697 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcat [2018-01-29 22:43:35,697 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 22:43:35,697 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 22:43:35,698 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 22:43:35,945 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 22:43:35,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:43:35 BoogieIcfgContainer [2018-01-29 22:43:35,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 22:43:35,946 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 22:43:35,946 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 22:43:35,949 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 22:43:35,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:43:35" (1/3) ... [2018-01-29 22:43:35,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@722e4cad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:43:35, skipping insertion in model container [2018-01-29 22:43:35,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:43:35" (2/3) ... [2018-01-29 22:43:35,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@722e4cad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:43:35, skipping insertion in model container [2018-01-29 22:43:35,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:43:35" (3/3) ... [2018-01-29 22:43:35,952 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-01-29 22:43:35,959 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 22:43:35,965 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-01-29 22:43:36,012 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 22:43:36,012 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 22:43:36,012 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 22:43:36,013 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 22:43:36,013 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 22:43:36,013 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 22:43:36,013 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 22:43:36,013 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 22:43:36,014 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 22:43:36,035 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2018-01-29 22:43:36,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-29 22:43:36,043 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:36,044 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:43:36,045 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:43:36,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1358649906, now seen corresponding path program 1 times [2018-01-29 22:43:36,052 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:36,053 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:36,097 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:36,098 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:36,098 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:36,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:36,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:36,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:43:36,232 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:43:36,232 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-29 22:43:36,234 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-29 22:43:36,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-29 22:43:36,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 22:43:36,248 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 3 states. [2018-01-29 22:43:36,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:43:36,441 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2018-01-29 22:43:36,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-29 22:43:36,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-01-29 22:43:36,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:43:36,456 INFO L225 Difference]: With dead ends: 112 [2018-01-29 22:43:36,456 INFO L226 Difference]: Without dead ends: 75 [2018-01-29 22:43:36,460 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-29 22:43:36,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-29 22:43:36,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-01-29 22:43:36,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-29 22:43:36,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-01-29 22:43:36,495 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 21 [2018-01-29 22:43:36,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:43:36,495 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-01-29 22:43:36,495 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-29 22:43:36,495 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-01-29 22:43:36,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-29 22:43:36,496 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:36,496 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:43:36,496 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:43:36,497 INFO L82 PathProgramCache]: Analyzing trace with hash 291143110, now seen corresponding path program 1 times [2018-01-29 22:43:36,497 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:36,497 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:36,498 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:36,498 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:36,498 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:36,520 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:36,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:43:36,598 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:43:36,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 22:43:36,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 22:43:36,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 22:43:36,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 22:43:36,601 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 4 states. [2018-01-29 22:43:36,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:43:36,703 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-01-29 22:43:36,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 22:43:36,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-01-29 22:43:36,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:43:36,705 INFO L225 Difference]: With dead ends: 75 [2018-01-29 22:43:36,705 INFO L226 Difference]: Without dead ends: 74 [2018-01-29 22:43:36,706 INFO L553 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-29 22:43:36,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-29 22:43:36,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-29 22:43:36,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-29 22:43:36,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-01-29 22:43:36,716 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 24 [2018-01-29 22:43:36,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:43:36,716 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-01-29 22:43:36,716 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 22:43:36,717 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-01-29 22:43:36,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-29 22:43:36,717 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:36,718 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:43:36,718 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:43:36,718 INFO L82 PathProgramCache]: Analyzing trace with hash 291143111, now seen corresponding path program 1 times [2018-01-29 22:43:36,718 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:36,718 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:36,719 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:36,719 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:36,719 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:36,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:36,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:36,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:43:36,925 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:43:36,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 22:43:36,925 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 22:43:36,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 22:43:36,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:43:36,926 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 6 states. [2018-01-29 22:43:37,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:43:37,011 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2018-01-29 22:43:37,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 22:43:37,012 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-29 22:43:37,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:43:37,013 INFO L225 Difference]: With dead ends: 74 [2018-01-29 22:43:37,013 INFO L226 Difference]: Without dead ends: 73 [2018-01-29 22:43:37,013 INFO L553 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-29 22:43:37,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-29 22:43:37,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-01-29 22:43:37,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-29 22:43:37,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2018-01-29 22:43:37,019 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 24 [2018-01-29 22:43:37,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:43:37,019 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-01-29 22:43:37,019 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 22:43:37,020 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2018-01-29 22:43:37,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-29 22:43:37,020 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:37,020 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:43:37,020 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:43:37,021 INFO L82 PathProgramCache]: Analyzing trace with hash 435501890, now seen corresponding path program 1 times [2018-01-29 22:43:37,021 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:37,021 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:37,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:37,022 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:37,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:37,034 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:37,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:43:37,073 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:43:37,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 22:43:37,073 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 22:43:37,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 22:43:37,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 22:43:37,074 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand 4 states. [2018-01-29 22:43:37,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:43:37,113 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-01-29 22:43:37,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 22:43:37,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-01-29 22:43:37,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:43:37,115 INFO L225 Difference]: With dead ends: 73 [2018-01-29 22:43:37,115 INFO L226 Difference]: Without dead ends: 72 [2018-01-29 22:43:37,115 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:43:37,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-29 22:43:37,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-01-29 22:43:37,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-29 22:43:37,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-01-29 22:43:37,121 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 25 [2018-01-29 22:43:37,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:43:37,122 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-01-29 22:43:37,122 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 22:43:37,122 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-01-29 22:43:37,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-29 22:43:37,123 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:37,123 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:43:37,123 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:43:37,124 INFO L82 PathProgramCache]: Analyzing trace with hash 435501891, now seen corresponding path program 1 times [2018-01-29 22:43:37,124 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:37,124 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:37,125 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:37,125 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:37,125 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:37,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:37,139 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:37,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:43:37,210 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:43:37,210 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 22:43:37,211 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 22:43:37,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 22:43:37,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:43:37,211 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 6 states. [2018-01-29 22:43:37,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:43:37,293 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-01-29 22:43:37,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-29 22:43:37,294 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-29 22:43:37,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:43:37,294 INFO L225 Difference]: With dead ends: 72 [2018-01-29 22:43:37,295 INFO L226 Difference]: Without dead ends: 71 [2018-01-29 22:43:37,295 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-01-29 22:43:37,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-29 22:43:37,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-01-29 22:43:37,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-29 22:43:37,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-01-29 22:43:37,301 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 25 [2018-01-29 22:43:37,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:43:37,301 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-01-29 22:43:37,301 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 22:43:37,301 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-01-29 22:43:37,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-29 22:43:37,302 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:37,302 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:43:37,302 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:43:37,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1440353201, now seen corresponding path program 1 times [2018-01-29 22:43:37,302 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:37,302 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:37,303 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:37,304 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:37,304 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:37,319 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:37,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:43:37,359 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:43:37,359 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 22:43:37,360 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 22:43:37,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 22:43:37,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:43:37,360 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 5 states. [2018-01-29 22:43:37,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:43:37,462 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2018-01-29 22:43:37,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 22:43:37,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-01-29 22:43:37,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:43:37,464 INFO L225 Difference]: With dead ends: 74 [2018-01-29 22:43:37,464 INFO L226 Difference]: Without dead ends: 73 [2018-01-29 22:43:37,465 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:43:37,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-29 22:43:37,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2018-01-29 22:43:37,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-29 22:43:37,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2018-01-29 22:43:37,471 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 31 [2018-01-29 22:43:37,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:43:37,472 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2018-01-29 22:43:37,472 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 22:43:37,472 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-01-29 22:43:37,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-29 22:43:37,473 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:37,473 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:43:37,473 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:43:37,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1440353202, now seen corresponding path program 1 times [2018-01-29 22:43:37,473 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:37,474 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:37,474 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:37,474 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:37,475 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:37,489 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:37,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:43:37,578 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:43:37,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-29 22:43:37,578 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-29 22:43:37,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-29 22:43:37,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-29 22:43:37,579 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 7 states. [2018-01-29 22:43:37,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:43:37,764 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-01-29 22:43:37,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 22:43:37,764 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-01-29 22:43:37,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:43:37,766 INFO L225 Difference]: With dead ends: 81 [2018-01-29 22:43:37,766 INFO L226 Difference]: Without dead ends: 80 [2018-01-29 22:43:37,766 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-01-29 22:43:37,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-29 22:43:37,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 72. [2018-01-29 22:43:37,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-29 22:43:37,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-01-29 22:43:37,774 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 31 [2018-01-29 22:43:37,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:43:37,774 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-01-29 22:43:37,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-29 22:43:37,775 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-01-29 22:43:37,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-29 22:43:37,776 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:37,776 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:43:37,776 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:43:37,777 INFO L82 PathProgramCache]: Analyzing trace with hash 846262760, now seen corresponding path program 1 times [2018-01-29 22:43:37,777 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:37,777 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:37,778 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:37,778 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:37,778 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:37,792 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:37,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:43:37,907 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:43:37,907 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:43:37,920 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:37,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:37,971 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:43:38,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:43:38,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:38,026 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-29 22:43:38,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-01-29 22:43:38,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:43:38,183 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:43:38,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2018-01-29 22:43:38,184 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-29 22:43:38,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-29 22:43:38,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-01-29 22:43:38,185 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 13 states. [2018-01-29 22:43:38,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:43:38,390 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2018-01-29 22:43:38,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 22:43:38,391 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-01-29 22:43:38,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:43:38,391 INFO L225 Difference]: With dead ends: 92 [2018-01-29 22:43:38,391 INFO L226 Difference]: Without dead ends: 91 [2018-01-29 22:43:38,392 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2018-01-29 22:43:38,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-29 22:43:38,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2018-01-29 22:43:38,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-29 22:43:38,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-01-29 22:43:38,400 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 38 [2018-01-29 22:43:38,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:43:38,400 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-01-29 22:43:38,400 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-29 22:43:38,400 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-01-29 22:43:38,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-29 22:43:38,402 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:38,402 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:43:38,402 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:43:38,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1400971126, now seen corresponding path program 1 times [2018-01-29 22:43:38,402 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:38,402 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:38,403 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:38,404 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:38,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:38,418 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:38,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:43:38,464 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:43:38,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 22:43:38,465 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 22:43:38,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 22:43:38,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:43:38,466 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 6 states. [2018-01-29 22:43:38,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:43:38,538 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2018-01-29 22:43:38,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 22:43:38,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-01-29 22:43:38,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:43:38,539 INFO L225 Difference]: With dead ends: 79 [2018-01-29 22:43:38,539 INFO L226 Difference]: Without dead ends: 78 [2018-01-29 22:43:38,539 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-29 22:43:38,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-29 22:43:38,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-01-29 22:43:38,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-29 22:43:38,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-01-29 22:43:38,547 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 39 [2018-01-29 22:43:38,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:43:38,547 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-01-29 22:43:38,547 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 22:43:38,548 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-01-29 22:43:38,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-29 22:43:38,549 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:38,549 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:43:38,549 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:43:38,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1400971127, now seen corresponding path program 1 times [2018-01-29 22:43:38,550 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:38,550 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:38,550 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:38,551 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:38,551 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:38,565 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:38,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:43:38,717 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:43:38,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-29 22:43:38,718 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 22:43:38,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 22:43:38,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-29 22:43:38,718 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 9 states. [2018-01-29 22:43:38,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:43:38,918 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2018-01-29 22:43:38,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-29 22:43:38,919 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-01-29 22:43:38,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:43:38,920 INFO L225 Difference]: With dead ends: 93 [2018-01-29 22:43:38,920 INFO L226 Difference]: Without dead ends: 92 [2018-01-29 22:43:38,920 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-01-29 22:43:38,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-29 22:43:38,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2018-01-29 22:43:38,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-29 22:43:38,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-01-29 22:43:38,928 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 39 [2018-01-29 22:43:38,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:43:38,929 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-01-29 22:43:38,929 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 22:43:38,929 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-01-29 22:43:38,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-29 22:43:38,930 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:38,930 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:43:38,930 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:43:38,930 INFO L82 PathProgramCache]: Analyzing trace with hash 480431954, now seen corresponding path program 1 times [2018-01-29 22:43:38,930 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:38,930 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:38,931 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:38,931 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:38,931 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:38,943 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:39,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:43:39,008 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:43:39,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 22:43:39,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 22:43:39,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 22:43:39,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:43:39,009 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 6 states. [2018-01-29 22:43:39,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:43:39,083 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-01-29 22:43:39,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 22:43:39,083 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-01-29 22:43:39,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:43:39,084 INFO L225 Difference]: With dead ends: 84 [2018-01-29 22:43:39,084 INFO L226 Difference]: Without dead ends: 83 [2018-01-29 22:43:39,084 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-29 22:43:39,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-29 22:43:39,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-01-29 22:43:39,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-29 22:43:39,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2018-01-29 22:43:39,089 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 40 [2018-01-29 22:43:39,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:43:39,089 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2018-01-29 22:43:39,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 22:43:39,089 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2018-01-29 22:43:39,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-29 22:43:39,090 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:39,090 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:43:39,090 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:43:39,090 INFO L82 PathProgramCache]: Analyzing trace with hash 480431955, now seen corresponding path program 1 times [2018-01-29 22:43:39,090 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:39,090 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:39,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:39,091 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:39,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:39,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:39,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:43:39,222 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:43:39,222 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-29 22:43:39,222 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 22:43:39,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 22:43:39,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-29 22:43:39,223 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand 8 states. [2018-01-29 22:43:39,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:43:39,416 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2018-01-29 22:43:39,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-29 22:43:39,416 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-01-29 22:43:39,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:43:39,417 INFO L225 Difference]: With dead ends: 95 [2018-01-29 22:43:39,417 INFO L226 Difference]: Without dead ends: 94 [2018-01-29 22:43:39,417 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-01-29 22:43:39,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-29 22:43:39,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-01-29 22:43:39,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-01-29 22:43:39,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2018-01-29 22:43:39,424 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 40 [2018-01-29 22:43:39,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:43:39,424 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2018-01-29 22:43:39,424 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 22:43:39,424 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2018-01-29 22:43:39,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-29 22:43:39,426 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:39,426 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:43:39,426 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:43:39,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1491780338, now seen corresponding path program 2 times [2018-01-29 22:43:39,427 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:39,427 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:39,428 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:39,428 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:39,428 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:39,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:39,444 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:39,663 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:43:39,663 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:43:39,663 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:43:39,669 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:43:39,682 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:43:39,688 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:43:39,689 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:43:39,693 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:43:39,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:43:39,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:39,706 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-29 22:43:39,706 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-29 22:43:39,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-29 22:43:39,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-29 22:43:39,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:39,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:39,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:43:39,749 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-29 22:43:39,862 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-29 22:43:39,870 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-29 22:43:39,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:43:39,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:43:39,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:43:39,888 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:40 [2018-01-29 22:43:39,972 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:43:39,993 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:43:39,993 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2018-01-29 22:43:39,994 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-29 22:43:39,994 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-29 22:43:39,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2018-01-29 22:43:39,994 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand 21 states. [2018-01-29 22:43:40,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:43:40,583 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2018-01-29 22:43:40,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-29 22:43:40,583 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 45 [2018-01-29 22:43:40,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:43:40,584 INFO L225 Difference]: With dead ends: 113 [2018-01-29 22:43:40,584 INFO L226 Difference]: Without dead ends: 112 [2018-01-29 22:43:40,584 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=797, Unknown=0, NotChecked=0, Total=930 [2018-01-29 22:43:40,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-29 22:43:40,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 98. [2018-01-29 22:43:40,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-29 22:43:40,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-01-29 22:43:40,590 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 45 [2018-01-29 22:43:40,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:43:40,590 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-01-29 22:43:40,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-29 22:43:40,590 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-01-29 22:43:40,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-29 22:43:40,591 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:40,591 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:43:40,591 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:43:40,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1947433507, now seen corresponding path program 1 times [2018-01-29 22:43:40,591 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:40,591 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:40,592 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:40,592 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:43:40,592 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:40,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:40,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:43:40,725 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:43:40,725 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:43:40,732 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:40,752 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:43:40,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:43:40,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:40,762 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-29 22:43:40,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-01-29 22:43:40,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:43:40,855 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:43:40,855 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2018-01-29 22:43:40,855 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-29 22:43:40,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-29 22:43:40,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-01-29 22:43:40,856 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 15 states. [2018-01-29 22:43:41,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:43:41,053 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2018-01-29 22:43:41,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-29 22:43:41,053 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 47 [2018-01-29 22:43:41,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:43:41,054 INFO L225 Difference]: With dead ends: 110 [2018-01-29 22:43:41,054 INFO L226 Difference]: Without dead ends: 109 [2018-01-29 22:43:41,054 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2018-01-29 22:43:41,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-29 22:43:41,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 98. [2018-01-29 22:43:41,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-29 22:43:41,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2018-01-29 22:43:41,059 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 47 [2018-01-29 22:43:41,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:43:41,059 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2018-01-29 22:43:41,059 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-29 22:43:41,059 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2018-01-29 22:43:41,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-29 22:43:41,060 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:41,060 INFO L350 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-29 22:43:41,060 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:43:41,060 INFO L82 PathProgramCache]: Analyzing trace with hash 2030048057, now seen corresponding path program 1 times [2018-01-29 22:43:41,060 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:41,060 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:41,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:41,061 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:41,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:41,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:41,073 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:41,445 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-29 22:43:41,445 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:43:41,445 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:43:41,453 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:41,483 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:43:41,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:43:41,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:41,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:41,506 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 22:43:41,593 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:41,594 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:41,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:43:41,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:41,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:41,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-29 22:43:41,678 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-29 22:43:41,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-29 22:43:41,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:41,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:41,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:43:41,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-29 22:43:41,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 25 treesize of output 26 [2018-01-29 22:43:41,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-29 22:43:41,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:41,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:41,769 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-29 22:43:41,770 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-29 22:43:42,100 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-29 22:43:42,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-29 22:43:42,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:43:42,118 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-29 22:43:42,118 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:42,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:43:42,131 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-29 22:43:42,132 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-01-29 22:43:42,189 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-29 22:43:42,211 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:43:42,212 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 25 [2018-01-29 22:43:42,212 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-29 22:43:42,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-29 22:43:42,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=587, Unknown=0, NotChecked=0, Total=650 [2018-01-29 22:43:42,212 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand 26 states. [2018-01-29 22:43:43,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:43:43,062 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2018-01-29 22:43:43,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-29 22:43:43,062 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-01-29 22:43:43,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:43:43,063 INFO L225 Difference]: With dead ends: 121 [2018-01-29 22:43:43,063 INFO L226 Difference]: Without dead ends: 120 [2018-01-29 22:43:43,064 INFO L553 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-29 22:43:43,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-29 22:43:43,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 109. [2018-01-29 22:43:43,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-01-29 22:43:43,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2018-01-29 22:43:43,072 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 50 [2018-01-29 22:43:43,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:43:43,072 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2018-01-29 22:43:43,072 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-29 22:43:43,072 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2018-01-29 22:43:43,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-29 22:43:43,074 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:43,074 INFO L350 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-29 22:43:43,074 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:43:43,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1493019695, now seen corresponding path program 1 times [2018-01-29 22:43:43,074 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:43,074 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:43,075 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:43,075 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:43,075 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:43,088 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:43,227 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-29 22:43:43,228 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:43:43,228 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:43:43,233 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:43,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:43,253 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:43:43,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:43:43,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:43,263 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-29 22:43:43,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-01-29 22:43:43,375 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-29 22:43:43,407 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:43:43,407 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-01-29 22:43:43,408 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-29 22:43:43,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-29 22:43:43,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-01-29 22:43:43,408 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 19 states. [2018-01-29 22:43:43,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:43:43,667 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2018-01-29 22:43:43,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-29 22:43:43,667 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2018-01-29 22:43:43,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:43:43,670 INFO L225 Difference]: With dead ends: 140 [2018-01-29 22:43:43,670 INFO L226 Difference]: Without dead ends: 139 [2018-01-29 22:43:43,671 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2018-01-29 22:43:43,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-01-29 22:43:43,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 128. [2018-01-29 22:43:43,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-01-29 22:43:43,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2018-01-29 22:43:43,677 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 51 [2018-01-29 22:43:43,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:43:43,677 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2018-01-29 22:43:43,677 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-29 22:43:43,677 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2018-01-29 22:43:43,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-29 22:43:43,678 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:43,678 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:43:43,678 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:43:43,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1933602136, now seen corresponding path program 3 times [2018-01-29 22:43:43,678 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:43,678 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:43,679 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:43,679 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:43,679 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:43,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:44,027 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:43:44,028 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:43:44,028 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:43:44,033 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 22:43:44,043 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:43:44,046 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:43:44,049 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:43:44,052 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:43:44,053 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:43:44,056 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:43:44,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:43:44,066 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:44,071 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-29 22:43:44,071 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-29 22:43:44,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-29 22:43:44,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-29 22:43:44,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:44,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:44,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:43:44,116 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-29 22:43:44,294 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-29 22:43:44,306 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-29 22:43:44,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-01-29 22:43:44,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:43:44,338 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-29 22:43:44,338 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:47 [2018-01-29 22:43:44,486 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:43:44,506 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:43:44,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2018-01-29 22:43:44,507 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-29 22:43:44,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-29 22:43:44,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=832, Unknown=0, NotChecked=0, Total=930 [2018-01-29 22:43:44,507 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand 31 states. [2018-01-29 22:43:45,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:43:45,662 INFO L93 Difference]: Finished difference Result 149 states and 159 transitions. [2018-01-29 22:43:45,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-29 22:43:45,662 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 52 [2018-01-29 22:43:45,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:43:45,663 INFO L225 Difference]: With dead ends: 149 [2018-01-29 22:43:45,663 INFO L226 Difference]: Without dead ends: 148 [2018-01-29 22:43:45,664 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=288, Invalid=1782, Unknown=0, NotChecked=0, Total=2070 [2018-01-29 22:43:45,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-01-29 22:43:45,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 135. [2018-01-29 22:43:45,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-29 22:43:45,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 145 transitions. [2018-01-29 22:43:45,672 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 145 transitions. Word has length 52 [2018-01-29 22:43:45,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:43:45,672 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 145 transitions. [2018-01-29 22:43:45,673 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-29 22:43:45,673 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 145 transitions. [2018-01-29 22:43:45,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-29 22:43:45,673 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:45,673 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:43:45,673 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:43:45,674 INFO L82 PathProgramCache]: Analyzing trace with hash 499925011, now seen corresponding path program 2 times [2018-01-29 22:43:45,674 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:45,674 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:45,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:45,674 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:43:45,674 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:45,684 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:45,803 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-29 22:43:45,803 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:43:45,803 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:43:45,808 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:43:45,820 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:43:45,822 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:43:45,825 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:43:45,848 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-29 22:43:45,868 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 22:43:45,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2018-01-29 22:43:45,869 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-29 22:43:45,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-29 22:43:45,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-01-29 22:43:45,869 INFO L87 Difference]: Start difference. First operand 135 states and 145 transitions. Second operand 12 states. [2018-01-29 22:43:46,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:43:46,089 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2018-01-29 22:43:46,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-29 22:43:46,090 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2018-01-29 22:43:46,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:43:46,091 INFO L225 Difference]: With dead ends: 155 [2018-01-29 22:43:46,091 INFO L226 Difference]: Without dead ends: 154 [2018-01-29 22:43:46,091 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2018-01-29 22:43:46,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-29 22:43:46,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 127. [2018-01-29 22:43:46,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-01-29 22:43:46,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2018-01-29 22:43:46,098 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 54 [2018-01-29 22:43:46,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:43:46,098 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2018-01-29 22:43:46,098 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-29 22:43:46,098 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2018-01-29 22:43:46,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-29 22:43:46,099 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:46,099 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:43:46,099 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:43:46,099 INFO L82 PathProgramCache]: Analyzing trace with hash 353173611, now seen corresponding path program 1 times [2018-01-29 22:43:46,099 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:46,099 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:46,100 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:46,100 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:43:46,100 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:46,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:46,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:46,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:43:46,212 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:43:46,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 22:43:46,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 22:43:46,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 22:43:46,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:43:46,213 INFO L87 Difference]: Start difference. First operand 127 states and 136 transitions. Second operand 6 states. [2018-01-29 22:43:46,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:43:46,453 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2018-01-29 22:43:46,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 22:43:46,453 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-01-29 22:43:46,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:43:46,455 INFO L225 Difference]: With dead ends: 127 [2018-01-29 22:43:46,455 INFO L226 Difference]: Without dead ends: 113 [2018-01-29 22:43:46,455 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-29 22:43:46,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-01-29 22:43:46,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-01-29 22:43:46,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-29 22:43:46,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2018-01-29 22:43:46,478 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 54 [2018-01-29 22:43:46,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:43:46,478 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2018-01-29 22:43:46,479 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 22:43:46,479 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2018-01-29 22:43:46,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-29 22:43:46,479 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:46,480 INFO L350 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-29 22:43:46,480 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:43:46,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1903035143, now seen corresponding path program 1 times [2018-01-29 22:43:46,480 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:46,480 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:46,481 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:46,481 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:46,481 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:46,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:46,872 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-29 22:43:46,872 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:43:46,872 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:43:46,880 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:46,905 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:43:46,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 6 treesize of output 5 [2018-01-29 22:43:46,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:46,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:43:46,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:46,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:46,934 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-01-29 22:43:46,983 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:46,983 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:46,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:43:46,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:46,991 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:46,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-01-29 22:43:46,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:46,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:46,998 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-01-29 22:43:47,446 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-29 22:43:47,466 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:43:47,466 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 38 [2018-01-29 22:43:47,467 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-29 22:43:47,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-29 22:43:47,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1386, Unknown=0, NotChecked=0, Total=1482 [2018-01-29 22:43:47,467 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand 39 states. [2018-01-29 22:43:48,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:43:48,948 INFO L93 Difference]: Finished difference Result 141 states and 148 transitions. [2018-01-29 22:43:48,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-29 22:43:48,948 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 58 [2018-01-29 22:43:48,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:43:48,949 INFO L225 Difference]: With dead ends: 141 [2018-01-29 22:43:48,949 INFO L226 Difference]: Without dead ends: 140 [2018-01-29 22:43:48,950 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 841 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=419, Invalid=4273, Unknown=0, NotChecked=0, Total=4692 [2018-01-29 22:43:48,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-29 22:43:48,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 113. [2018-01-29 22:43:48,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-29 22:43:48,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2018-01-29 22:43:48,957 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 58 [2018-01-29 22:43:48,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:43:48,958 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2018-01-29 22:43:48,958 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-29 22:43:48,958 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2018-01-29 22:43:48,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-29 22:43:48,959 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:48,959 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:43:48,959 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:43:48,959 INFO L82 PathProgramCache]: Analyzing trace with hash 264882738, now seen corresponding path program 4 times [2018-01-29 22:43:48,959 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:48,959 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:48,960 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:48,960 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:43:48,960 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:48,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:48,975 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:49,460 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:43:49,461 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:43:49,461 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:43:49,466 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 22:43:49,483 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:43:49,486 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:43:49,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:43:49,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:49,497 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-29 22:43:49,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-29 22:43:49,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-29 22:43:49,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-29 22:43:49,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:49,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:49,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:43:49,549 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-29 22:43:49,916 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-29 22:43:49,923 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:49,924 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:49,926 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:49,936 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-29 22:43:49,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:43:49,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:43:49,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:43:49,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:63 [2018-01-29 22:43:50,172 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:43:50,194 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:43:50,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 34 [2018-01-29 22:43:50,220 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-29 22:43:50,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-29 22:43:50,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1092, Unknown=0, NotChecked=0, Total=1190 [2018-01-29 22:43:50,221 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand 35 states. [2018-01-29 22:43:51,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:43:51,752 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2018-01-29 22:43:51,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-29 22:43:51,752 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 59 [2018-01-29 22:43:51,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:43:51,754 INFO L225 Difference]: With dead ends: 141 [2018-01-29 22:43:51,754 INFO L226 Difference]: Without dead ends: 140 [2018-01-29 22:43:51,755 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=286, Invalid=2684, Unknown=0, NotChecked=0, Total=2970 [2018-01-29 22:43:51,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-29 22:43:51,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 120. [2018-01-29 22:43:51,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-29 22:43:51,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-01-29 22:43:51,768 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 59 [2018-01-29 22:43:51,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:43:51,768 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-01-29 22:43:51,768 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-29 22:43:51,769 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-01-29 22:43:51,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-29 22:43:51,769 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:51,770 INFO L350 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-29 22:43:51,770 INFO L371 AbstractCegarLoop]: === Iteration 22 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:43:51,770 INFO L82 PathProgramCache]: Analyzing trace with hash 224039479, now seen corresponding path program 2 times [2018-01-29 22:43:51,770 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:51,770 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:51,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:51,771 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:43:51,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:51,784 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:52,529 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:43:52,530 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:43:52,530 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:43:52,541 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:43:52,553 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:43:52,559 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:43:52,562 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:43:52,564 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:43:52,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:43:52,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:52,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:43:52,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:52,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:52,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-29 22:43:52,622 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:52,623 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:52,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:43:52,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:52,630 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-29 22:43:52,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:52,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:52,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-29 22:43:52,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-29 22:43:52,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-29 22:43:52,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:52,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:52,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:43:52,686 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-29 22:43:52,721 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-29 22:43:52,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-29 22:43:52,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:52,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:52,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-29 22:43:52,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:33 [2018-01-29 22:43:53,254 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-29 22:43:53,264 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-29 22:43:53,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:43:53,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:43:53,294 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-29 22:43:53,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:47, output treesize:59 [2018-01-29 22:43:53,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-01-29 22:43:53,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-01-29 22:43:53,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:43:53,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:43:53,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:43:53,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-29 22:43:53,608 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:43:53,628 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:43:53,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2018-01-29 22:43:53,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-29 22:43:53,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-29 22:43:53,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1248, Unknown=0, NotChecked=0, Total=1332 [2018-01-29 22:43:53,629 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 37 states. [2018-01-29 22:43:55,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:43:55,384 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-01-29 22:43:55,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-29 22:43:55,384 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 61 [2018-01-29 22:43:55,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:43:55,385 INFO L225 Difference]: With dead ends: 138 [2018-01-29 22:43:55,385 INFO L226 Difference]: Without dead ends: 137 [2018-01-29 22:43:55,386 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=273, Invalid=2919, Unknown=0, NotChecked=0, Total=3192 [2018-01-29 22:43:55,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-29 22:43:55,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 131. [2018-01-29 22:43:55,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-01-29 22:43:55,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2018-01-29 22:43:55,394 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 61 [2018-01-29 22:43:55,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:43:55,395 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2018-01-29 22:43:55,395 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-29 22:43:55,395 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2018-01-29 22:43:55,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-29 22:43:55,395 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:55,395 INFO L350 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-29 22:43:55,395 INFO L371 AbstractCegarLoop]: === Iteration 23 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:43:55,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1644710765, now seen corresponding path program 2 times [2018-01-29 22:43:55,396 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:55,396 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:55,396 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:55,396 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:43:55,396 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:55,405 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:56,038 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-29 22:43:56,039 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:43:56,039 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:43:56,043 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:43:56,056 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:43:56,062 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:43:56,065 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:43:56,068 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:43:56,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:43:56,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:56,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:43:56,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:56,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:56,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-01-29 22:43:56,136 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:56,137 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:56,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-01-29 22:43:56,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:56,147 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:56,148 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:56,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:43:56,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:56,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:56,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-01-29 22:43:57,590 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-29 22:43:57,610 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:43:57,610 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 44 [2018-01-29 22:43:57,610 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-01-29 22:43:57,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-01-29 22:43:57,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1861, Unknown=0, NotChecked=0, Total=1980 [2018-01-29 22:43:57,611 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand 45 states. [2018-01-29 22:43:59,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:43:59,026 INFO L93 Difference]: Finished difference Result 176 states and 186 transitions. [2018-01-29 22:43:59,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-29 22:43:59,026 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 62 [2018-01-29 22:43:59,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:43:59,027 INFO L225 Difference]: With dead ends: 176 [2018-01-29 22:43:59,027 INFO L226 Difference]: Without dead ends: 175 [2018-01-29 22:43:59,028 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1053 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=452, Invalid=4950, Unknown=0, NotChecked=0, Total=5402 [2018-01-29 22:43:59,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-01-29 22:43:59,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2018-01-29 22:43:59,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-01-29 22:43:59,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 181 transitions. [2018-01-29 22:43:59,038 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 181 transitions. Word has length 62 [2018-01-29 22:43:59,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:43:59,039 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 181 transitions. [2018-01-29 22:43:59,039 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-01-29 22:43:59,039 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 181 transitions. [2018-01-29 22:43:59,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-29 22:43:59,040 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:43:59,040 INFO L350 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-29 22:43:59,040 INFO L371 AbstractCegarLoop]: === Iteration 24 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:43:59,040 INFO L82 PathProgramCache]: Analyzing trace with hash -3216623, now seen corresponding path program 2 times [2018-01-29 22:43:59,040 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:43:59,040 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:43:59,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:59,041 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:43:59,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:43:59,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:43:59,053 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:43:59,566 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-29 22:43:59,566 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:43:59,566 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-29 22:43:59,571 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:43:59,582 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:43:59,589 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:43:59,591 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:43:59,594 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:43:59,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:43:59,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:59,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:59,662 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-01-29 22:43:59,724 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:59,724 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:43:59,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:43:59,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:59,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:43:59,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:59,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:59,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2018-01-29 22:43:59,802 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-29 22:43:59,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-29 22:43:59,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:59,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:59,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:43:59,813 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2018-01-29 22:43:59,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-01-29 22:43:59,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-29 22:43:59,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:43:59,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:43:59,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-29 22:43:59,870 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:44 [2018-01-29 22:44:00,593 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-29 22:44:00,599 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-29 22:44:00,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:00,643 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-29 22:44:00,644 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-29 22:44:00,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:44:00,689 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-29 22:44:00,690 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:37 [2018-01-29 22:44:00,893 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-29 22:44:00,914 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:44:00,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 47 [2018-01-29 22:44:00,914 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-01-29 22:44:00,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-01-29 22:44:00,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2120, Unknown=0, NotChecked=0, Total=2256 [2018-01-29 22:44:00,915 INFO L87 Difference]: Start difference. First operand 171 states and 181 transitions. Second operand 48 states. [2018-01-29 22:44:01,924 WARN L146 SmtUtils]: Spent 560ms on a formula simplification. DAG size of input: 68 DAG size of output 57 [2018-01-29 22:44:03,047 WARN L146 SmtUtils]: Spent 931ms on a formula simplification. DAG size of input: 71 DAG size of output 69 [2018-01-29 22:44:03,520 WARN L146 SmtUtils]: Spent 401ms on a formula simplification. DAG size of input: 75 DAG size of output 72 [2018-01-29 22:44:03,862 WARN L146 SmtUtils]: Spent 296ms on a formula simplification. DAG size of input: 74 DAG size of output 66 [2018-01-29 22:44:04,197 WARN L146 SmtUtils]: Spent 284ms on a formula simplification. DAG size of input: 72 DAG size of output 64 [2018-01-29 22:44:05,161 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 62 DAG size of output 61 [2018-01-29 22:44:06,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:44:06,901 INFO L93 Difference]: Finished difference Result 224 states and 235 transitions. [2018-01-29 22:44:06,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-01-29 22:44:06,902 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 65 [2018-01-29 22:44:06,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:44:06,903 INFO L225 Difference]: With dead ends: 224 [2018-01-29 22:44:06,903 INFO L226 Difference]: Without dead ends: 223 [2018-01-29 22:44:06,904 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1847 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=642, Invalid=7014, Unknown=0, NotChecked=0, Total=7656 [2018-01-29 22:44:06,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-01-29 22:44:06,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 171. [2018-01-29 22:44:06,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-01-29 22:44:06,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 181 transitions. [2018-01-29 22:44:06,913 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 181 transitions. Word has length 65 [2018-01-29 22:44:06,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:44:06,914 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 181 transitions. [2018-01-29 22:44:06,914 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-01-29 22:44:06,914 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 181 transitions. [2018-01-29 22:44:06,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-01-29 22:44:06,914 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:44:06,914 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:44:06,914 INFO L371 AbstractCegarLoop]: === Iteration 25 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:44:06,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1300620136, now seen corresponding path program 5 times [2018-01-29 22:44:06,915 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:44:06,915 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:44:06,915 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:44:06,915 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:44:06,915 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:44:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:44:06,925 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:44:07,687 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:44:07,688 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:44:07,688 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-29 22:44:07,695 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 22:44:07,702 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:44:07,704 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:44:07,706 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:44:07,707 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:44:07,709 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:44:07,715 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:44:07,718 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:44:07,721 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:44:07,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:44:07,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:07,735 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-29 22:44:07,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-29 22:44:07,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-29 22:44:07,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-29 22:44:07,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:07,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:07,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:44:07,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-29 22:44:09,895 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-29 22:44:09,897 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:09,898 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:09,899 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:09,900 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:09,901 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:09,902 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:09,910 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-29 22:44:09,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:44:09,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:44:09,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:44:09,957 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:73 [2018-01-29 22:44:10,113 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:44:10,133 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:44:10,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 41 [2018-01-29 22:44:10,134 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-01-29 22:44:10,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-01-29 22:44:10,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1511, Unknown=3, NotChecked=0, Total=1722 [2018-01-29 22:44:10,134 INFO L87 Difference]: Start difference. First operand 171 states and 181 transitions. Second operand 42 states. [2018-01-29 22:44:10,853 WARN L146 SmtUtils]: Spent 570ms on a formula simplification. DAG size of input: 62 DAG size of output 29 [2018-01-29 22:44:12,732 WARN L146 SmtUtils]: Spent 738ms on a formula simplification. DAG size of input: 81 DAG size of output 61 [2018-01-29 22:44:13,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:44:13,499 INFO L93 Difference]: Finished difference Result 210 states and 224 transitions. [2018-01-29 22:44:13,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-29 22:44:13,500 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 66 [2018-01-29 22:44:13,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:44:13,501 INFO L225 Difference]: With dead ends: 210 [2018-01-29 22:44:13,501 INFO L226 Difference]: Without dead ends: 209 [2018-01-29 22:44:13,502 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1236 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=632, Invalid=4335, Unknown=3, NotChecked=0, Total=4970 [2018-01-29 22:44:13,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-01-29 22:44:13,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 185. [2018-01-29 22:44:13,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-29 22:44:13,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 197 transitions. [2018-01-29 22:44:13,520 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 197 transitions. Word has length 66 [2018-01-29 22:44:13,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:44:13,520 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 197 transitions. [2018-01-29 22:44:13,520 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-01-29 22:44:13,521 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 197 transitions. [2018-01-29 22:44:13,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-29 22:44:13,521 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:44:13,522 INFO L350 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-29 22:44:13,522 INFO L371 AbstractCegarLoop]: === Iteration 26 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:44:13,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1036941411, now seen corresponding path program 3 times [2018-01-29 22:44:13,522 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:44:13,522 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:44:13,523 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:44:13,523 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:44:13,523 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:44:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:44:13,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:44:13,966 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-29 22:44:13,966 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:44:13,966 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-29 22:44:13,971 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 22:44:13,984 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:44:13,990 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:44:13,994 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:44:13,997 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:44:13,999 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:44:14,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:44:14,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:14,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 6 treesize of output 5 [2018-01-29 22:44:14,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:14,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:14,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-01-29 22:44:14,078 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:14,079 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:14,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-01-29 22:44:14,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:14,088 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:14,088 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:14,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:44:14,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:14,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:14,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-01-29 22:44:14,635 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-29 22:44:14,655 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:44:14,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 46 [2018-01-29 22:44:14,656 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-01-29 22:44:14,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-01-29 22:44:14,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=2044, Unknown=0, NotChecked=0, Total=2162 [2018-01-29 22:44:14,657 INFO L87 Difference]: Start difference. First operand 185 states and 197 transitions. Second operand 47 states. [2018-01-29 22:44:21,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:44:21,622 INFO L93 Difference]: Finished difference Result 233 states and 246 transitions. [2018-01-29 22:44:21,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-01-29 22:44:21,623 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 69 [2018-01-29 22:44:21,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:44:21,624 INFO L225 Difference]: With dead ends: 233 [2018-01-29 22:44:21,624 INFO L226 Difference]: Without dead ends: 232 [2018-01-29 22:44:21,625 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1615 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=704, Invalid=7668, Unknown=0, NotChecked=0, Total=8372 [2018-01-29 22:44:21,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-01-29 22:44:21,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 185. [2018-01-29 22:44:21,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-29 22:44:21,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 197 transitions. [2018-01-29 22:44:21,637 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 197 transitions. Word has length 69 [2018-01-29 22:44:21,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:44:21,637 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 197 transitions. [2018-01-29 22:44:21,637 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-01-29 22:44:21,637 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 197 transitions. [2018-01-29 22:44:21,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-29 22:44:21,638 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:44:21,638 INFO L350 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-29 22:44:21,638 INFO L371 AbstractCegarLoop]: === Iteration 27 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:44:21,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1528511545, now seen corresponding path program 4 times [2018-01-29 22:44:21,639 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:44:21,639 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:44:21,639 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:44:21,639 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:44:21,639 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:44:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:44:21,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:44:22,499 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-29 22:44:22,499 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:44:22,499 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-29 22:44:22,505 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-29 22:44:22,525 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:44:22,528 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:44:22,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:44:22,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:22,600 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-29 22:44:22,600 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-29 22:44:22,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-29 22:44:22,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-29 22:44:22,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:22,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:22,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:44:22,665 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-29 22:44:23,077 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-29 22:44:23,081 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:23,114 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:23,115 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:23,123 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-29 22:44:23,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:44:23,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:44:23,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:44:23,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:63 [2018-01-29 22:44:23,415 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-29 22:44:23,435 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:44:23,435 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 21] total 48 [2018-01-29 22:44:23,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-01-29 22:44:23,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-01-29 22:44:23,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2199, Unknown=0, NotChecked=0, Total=2352 [2018-01-29 22:44:23,436 INFO L87 Difference]: Start difference. First operand 185 states and 197 transitions. Second operand 49 states. [2018-01-29 22:44:28,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:44:28,243 INFO L93 Difference]: Finished difference Result 248 states and 261 transitions. [2018-01-29 22:44:28,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-01-29 22:44:28,266 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 72 [2018-01-29 22:44:28,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:44:28,267 INFO L225 Difference]: With dead ends: 248 [2018-01-29 22:44:28,267 INFO L226 Difference]: Without dead ends: 247 [2018-01-29 22:44:28,268 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2247 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=661, Invalid=7528, Unknown=1, NotChecked=0, Total=8190 [2018-01-29 22:44:28,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-01-29 22:44:28,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 185. [2018-01-29 22:44:28,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-29 22:44:28,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 197 transitions. [2018-01-29 22:44:28,281 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 197 transitions. Word has length 72 [2018-01-29 22:44:28,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:44:28,281 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 197 transitions. [2018-01-29 22:44:28,281 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-01-29 22:44:28,281 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 197 transitions. [2018-01-29 22:44:28,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-01-29 22:44:28,281 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:44:28,282 INFO L350 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-29 22:44:28,282 INFO L371 AbstractCegarLoop]: === Iteration 28 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:44:28,282 INFO L82 PathProgramCache]: Analyzing trace with hash 778528889, now seen corresponding path program 3 times [2018-01-29 22:44:28,282 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:44:28,282 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:44:28,283 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:44:28,283 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:44:28,283 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:44:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:44:28,296 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:44:28,872 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-29 22:44:28,872 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:44:28,872 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-29 22:44:28,877 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 22:44:28,888 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:44:28,893 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:44:28,898 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:44:28,903 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:44:28,905 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:44:28,908 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:44:28,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:44:28,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:28,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:44:28,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:28,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:28,920 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-29 22:44:28,927 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:28,928 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-29 22:44:28,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:28,935 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:28,936 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:28,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:44:28,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:28,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:28,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-29 22:44:28,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-29 22:44:28,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-29 22:44:28,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:28,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:28,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:28,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-29 22:44:28,979 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-29 22:44:28,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-29 22:44:28,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:28,984 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:28,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-29 22:44:28,988 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-01-29 22:44:29,222 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-29 22:44:29,234 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-29 22:44:29,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:44:29,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:44:29,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-29 22:44:29,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:43 [2018-01-29 22:44:29,329 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-29 22:44:29,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-29 22:44:29,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:29,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:29,338 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-29 22:44:29,339 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-01-29 22:44:29,394 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-29 22:44:29,399 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-29 22:44:29,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:44:29,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:44:29,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:44:29,407 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-01-29 22:44:29,465 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-29 22:44:29,485 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:44:29,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 35 [2018-01-29 22:44:29,486 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-29 22:44:29,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-29 22:44:29,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1126, Unknown=0, NotChecked=0, Total=1260 [2018-01-29 22:44:29,486 INFO L87 Difference]: Start difference. First operand 185 states and 197 transitions. Second operand 36 states. [2018-01-29 22:44:30,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:44:30,538 INFO L93 Difference]: Finished difference Result 185 states and 197 transitions. [2018-01-29 22:44:30,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-29 22:44:30,538 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 72 [2018-01-29 22:44:30,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:44:30,539 INFO L225 Difference]: With dead ends: 185 [2018-01-29 22:44:30,539 INFO L226 Difference]: Without dead ends: 144 [2018-01-29 22:44:30,539 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 55 SyntacticMatches, 8 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=498, Invalid=2694, Unknown=0, NotChecked=0, Total=3192 [2018-01-29 22:44:30,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-29 22:44:30,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 116. [2018-01-29 22:44:30,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-29 22:44:30,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2018-01-29 22:44:30,551 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 72 [2018-01-29 22:44:30,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:44:30,551 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2018-01-29 22:44:30,551 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-29 22:44:30,551 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2018-01-29 22:44:30,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-01-29 22:44:30,552 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:44:30,552 INFO L350 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-29 22:44:30,552 INFO L371 AbstractCegarLoop]: === Iteration 29 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:44:30,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1029696173, now seen corresponding path program 5 times [2018-01-29 22:44:30,552 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:44:30,552 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:44:30,553 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:44:30,553 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:44:30,553 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:44:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:44:30,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:44:31,182 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-29 22:44:31,183 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:44:31,183 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-29 22:44:31,188 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-29 22:44:31,195 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:44:31,199 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:44:31,208 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:44:31,212 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:44:31,215 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:44:31,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:44:31,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:31,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:44:31,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:31,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:31,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-01-29 22:44:31,293 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:31,293 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:31,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:44:31,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:31,302 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:31,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-01-29 22:44:31,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:31,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:31,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:19 [2018-01-29 22:44:31,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-29 22:44:31,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-29 22:44:31,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:31,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:31,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:44:31,380 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2018-01-29 22:44:31,523 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-29 22:44:31,528 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-29 22:44:31,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:44:31,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:44:31,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:44:31,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:61 [2018-01-29 22:44:32,064 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-29 22:44:32,085 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:44:32,085 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26] total 52 [2018-01-29 22:44:32,085 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-01-29 22:44:32,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-01-29 22:44:32,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2601, Unknown=0, NotChecked=0, Total=2756 [2018-01-29 22:44:32,086 INFO L87 Difference]: Start difference. First operand 116 states and 124 transitions. Second operand 53 states. [2018-01-29 22:44:33,120 WARN L146 SmtUtils]: Spent 386ms on a formula simplification. DAG size of input: 57 DAG size of output 45 [2018-01-29 22:44:34,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:44:34,954 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2018-01-29 22:44:34,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-01-29 22:44:34,954 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 76 [2018-01-29 22:44:34,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:44:34,955 INFO L225 Difference]: With dead ends: 167 [2018-01-29 22:44:34,955 INFO L226 Difference]: Without dead ends: 123 [2018-01-29 22:44:34,956 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2191 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=710, Invalid=7662, Unknown=0, NotChecked=0, Total=8372 [2018-01-29 22:44:34,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-29 22:44:34,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 116. [2018-01-29 22:44:34,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-29 22:44:34,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2018-01-29 22:44:34,966 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 76 [2018-01-29 22:44:34,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:44:34,967 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2018-01-29 22:44:34,967 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-01-29 22:44:34,967 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2018-01-29 22:44:34,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-29 22:44:34,967 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:44:34,967 INFO L350 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-29 22:44:34,967 INFO L371 AbstractCegarLoop]: === Iteration 30 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:44:34,967 INFO L82 PathProgramCache]: Analyzing trace with hash -433991087, now seen corresponding path program 6 times [2018-01-29 22:44:34,967 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:44:34,968 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:44:34,968 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:44:34,968 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:44:34,968 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:44:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:44:34,981 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:44:36,353 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-29 22:44:36,353 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:44:36,353 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-29 22:44:36,358 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-29 22:44:36,371 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 22:44:36,376 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 22:44:36,380 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 22:44:36,385 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 22:44:36,390 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 22:44:36,393 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:44:36,397 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:44:36,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:44:36,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:36,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:44:36,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:36,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:36,416 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-01-29 22:44:36,483 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:36,484 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:36,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-01-29 22:44:36,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:36,496 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:36,496 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:44:36,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:44:36,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:36,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:36,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:19 [2018-01-29 22:44:36,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-29 22:44:36,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-29 22:44:36,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:36,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:36,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:44:36,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2018-01-29 22:44:37,955 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-29 22:44:37,982 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-29 22:44:37,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 10 xjuncts. [2018-01-29 22:44:38,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:44:38,060 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-29 22:44:38,061 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:65, output treesize:88 [2018-01-29 22:44:38,719 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-29 22:44:38,740 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:44:38,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 57 [2018-01-29 22:44:38,741 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-01-29 22:44:38,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-01-29 22:44:38,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=3113, Unknown=1, NotChecked=0, Total=3306 [2018-01-29 22:44:38,741 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 58 states. [2018-01-29 22:44:40,327 WARN L146 SmtUtils]: Spent 564ms on a formula simplification. DAG size of input: 111 DAG size of output 60 [2018-01-29 22:44:40,568 WARN L146 SmtUtils]: Spent 167ms on a formula simplification. DAG size of input: 100 DAG size of output 58 [2018-01-29 22:44:42,194 WARN L146 SmtUtils]: Spent 282ms on a formula simplification. DAG size of input: 113 DAG size of output 81 [2018-01-29 22:44:43,630 WARN L146 SmtUtils]: Spent 482ms on a formula simplification. DAG size of input: 85 DAG size of output 55 [2018-01-29 22:44:44,288 WARN L146 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 102 DAG size of output 87 [2018-01-29 22:44:50,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:44:50,558 INFO L93 Difference]: Finished difference Result 155 states and 162 transitions. [2018-01-29 22:44:50,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-01-29 22:44:50,559 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 79 [2018-01-29 22:44:50,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:44:50,559 INFO L225 Difference]: With dead ends: 155 [2018-01-29 22:44:50,559 INFO L226 Difference]: Without dead ends: 154 [2018-01-29 22:44:50,560 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2562 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=798, Invalid=8706, Unknown=2, NotChecked=0, Total=9506 [2018-01-29 22:44:50,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-29 22:44:50,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 116. [2018-01-29 22:44:50,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-29 22:44:50,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2018-01-29 22:44:50,574 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 79 [2018-01-29 22:44:50,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:44:50,575 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2018-01-29 22:44:50,575 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-01-29 22:44:50,575 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2018-01-29 22:44:50,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-29 22:44:50,575 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:44:50,575 INFO L350 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:44:50,575 INFO L371 AbstractCegarLoop]: === Iteration 31 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-29 22:44:50,575 INFO L82 PathProgramCache]: Analyzing trace with hash 831513640, now seen corresponding path program 6 times [2018-01-29 22:44:50,576 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:44:50,576 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:44:50,576 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:44:50,576 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:44:50,576 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:44:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:44:50,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:44:51,917 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:44:51,917 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:44:51,917 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-29 22:44:51,922 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-29 22:44:51,933 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 22:44:51,937 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 22:44:51,939 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 22:44:51,942 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 22:44:51,945 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 22:44:51,947 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 22:44:51,951 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 22:44:51,954 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-29 22:44:51,956 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:44:51,959 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:44:51,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:44:51,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:51,968 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-29 22:44:51,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-29 22:44:52,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-29 22:44:52,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-29 22:44:52,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:44:52,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:44:52,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:44:52,022 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-29 22:45:21,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 44 [2018-01-29 22:45:21,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 44 treesize of output 187 [2018-01-29 22:45:21,884 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-01-29 22:45:22,417 WARN L152 XnfTransformerHelper]: Simplifying disjunction of 65536 conjuctions. This might take some time... Received shutdown request... [2018-01-29 22:45:50,574 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-29 22:45:50,575 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-29 22:45:50,579 WARN L185 ceAbstractionStarter]: Timeout [2018-01-29 22:45:50,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 10:45:50 BoogieIcfgContainer [2018-01-29 22:45:50,580 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 22:45:50,580 INFO L168 Benchmark]: Toolchain (without parser) took 135190.42 ms. Allocated memory was 303.0 MB in the beginning and 859.3 MB in the end (delta: 556.3 MB). Free memory was 263.1 MB in the beginning and 473.6 MB in the end (delta: -210.5 MB). Peak memory consumption was 583.4 MB. Max. memory is 5.3 GB. [2018-01-29 22:45:50,581 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 303.0 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 22:45:50,582 INFO L168 Benchmark]: CACSL2BoogieTranslator took 206.62 ms. Allocated memory is still 303.0 MB. Free memory was 262.1 MB in the beginning and 251.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-29 22:45:50,582 INFO L168 Benchmark]: Boogie Preprocessor took 38.48 ms. Allocated memory is still 303.0 MB. Free memory was 251.8 MB in the beginning and 249.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-29 22:45:50,582 INFO L168 Benchmark]: RCFGBuilder took 302.07 ms. Allocated memory is still 303.0 MB. Free memory was 249.8 MB in the beginning and 229.1 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. [2018-01-29 22:45:50,582 INFO L168 Benchmark]: TraceAbstraction took 134633.55 ms. Allocated memory was 303.0 MB in the beginning and 859.3 MB in the end (delta: 556.3 MB). Free memory was 229.1 MB in the beginning and 473.6 MB in the end (delta: -244.5 MB). Peak memory consumption was 549.4 MB. Max. memory is 5.3 GB. [2018-01-29 22:45:50,583 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 303.0 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 206.62 ms. Allocated memory is still 303.0 MB. Free memory was 262.1 MB in the beginning and 251.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.48 ms. Allocated memory is still 303.0 MB. Free memory was 251.8 MB in the beginning and 249.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 302.07 ms. Allocated memory is still 303.0 MB. Free memory was 249.8 MB in the beginning and 229.1 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 134633.55 ms. Allocated memory was 303.0 MB in the beginning and 859.3 MB in the end (delta: 556.3 MB). Free memory was 229.1 MB in the beginning and 473.6 MB in the end (delta: -244.5 MB). Peak memory consumption was 549.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 81 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. . - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 79 locations, 11 error locations. TIMEOUT Result, 134.5s OverallTime, 31 OverallIterations, 8 TraceHistogramMax, 48.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1869 SDtfs, 5118 SDslu, 21320 SDs, 0 SdLazy, 16281 SolverSat, 813 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 14.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1933 GetRequests, 824 SyntacticMatches, 14 SemanticMatches, 1095 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16254 ImplicationChecksByTransitivity, 51.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=185occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 30 MinimizatonAttempts, 436 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 24.3s InterpolantComputationTime, 2545 NumberOfCodeBlocks, 2525 NumberOfCodeBlocksAsserted, 71 NumberOfCheckSat, 2497 ConstructedInterpolants, 202 QuantifiedInterpolants, 1932447 SizeOfPredicates, 342 NumberOfNonLiveVariables, 3306 ConjunctsInSsa, 839 ConjunctsInUnsatCore, 48 InterpolantComputations, 13 PerfectInterpolantSequences, 47/984 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_22-45-50-589.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_22-45-50-589.csv Completed graceful shutdown