java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 11:44:46,304 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 11:44:46,306 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 11:44:46,318 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 11:44:46,318 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 11:44:46,319 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 11:44:46,320 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 11:44:46,322 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 11:44:46,323 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 11:44:46,324 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 11:44:46,324 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 11:44:46,325 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 11:44:46,325 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 11:44:46,326 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 11:44:46,327 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 11:44:46,330 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 11:44:46,332 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 11:44:46,334 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 11:44:46,335 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 11:44:46,336 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 11:44:46,338 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 11:44:46,339 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 11:44:46,339 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 11:44:46,340 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 11:44:46,341 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 11:44:46,342 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 11:44:46,342 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 11:44:46,343 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 11:44:46,343 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 11:44:46,343 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 11:44:46,344 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 11:44:46,344 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 11:44:46,354 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 11:44:46,354 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 11:44:46,355 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 11:44:46,355 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 11:44:46,355 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 11:44:46,355 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 11:44:46,356 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 11:44:46,356 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 11:44:46,356 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 11:44:46,357 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 11:44:46,357 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 11:44:46,357 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 11:44:46,357 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 11:44:46,357 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 11:44:46,358 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 11:44:46,358 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 11:44:46,358 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 11:44:46,358 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 11:44:46,358 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 11:44:46,359 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 11:44:46,359 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 11:44:46,359 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 11:44:46,359 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 11:44:46,359 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 11:44:46,360 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 11:44:46,360 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 11:44:46,360 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 11:44:46,360 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 11:44:46,360 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 11:44:46,361 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 11:44:46,361 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 11:44:46,361 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 11:44:46,362 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 11:44:46,362 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 11:44:46,396 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 11:44:46,409 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 11:44:46,413 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 11:44:46,415 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 11:44:46,415 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 11:44:46,416 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-24 11:44:46,577 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 11:44:46,583 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 11:44:46,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 11:44:46,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 11:44:46,590 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 11:44:46,591 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:44:46" (1/1) ... [2018-01-24 11:44:46,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aad67c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:44:46, skipping insertion in model container [2018-01-24 11:44:46,593 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:44:46" (1/1) ... [2018-01-24 11:44:46,606 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:44:46,643 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 11:44:46,763 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:44:46,785 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 11:44:46,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:44:46 WrapperNode [2018-01-24 11:44:46,794 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 11:44:46,794 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 11:44:46,794 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 11:44:46,794 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 11:44:46,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:44:46" (1/1) ... [2018-01-24 11:44:46,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:44:46" (1/1) ... [2018-01-24 11:44:46,813 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:44:46" (1/1) ... [2018-01-24 11:44:46,814 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:44:46" (1/1) ... [2018-01-24 11:44:46,818 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:44:46" (1/1) ... [2018-01-24 11:44:46,821 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:44:46" (1/1) ... [2018-01-24 11:44:46,822 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:44:46" (1/1) ... [2018-01-24 11:44:46,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 11:44:46,824 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 11:44:46,824 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 11:44:46,824 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 11:44:46,825 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:44:46" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 11:44:46,871 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 11:44:46,872 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 11:44:46,872 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcat [2018-01-24 11:44:46,872 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 11:44:46,872 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 11:44:46,872 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 11:44:46,872 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 11:44:46,872 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 11:44:46,872 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 11:44:46,872 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 11:44:46,873 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcat [2018-01-24 11:44:46,873 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 11:44:46,873 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 11:44:46,873 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 11:44:47,077 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 11:44:47,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:44:47 BoogieIcfgContainer [2018-01-24 11:44:47,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 11:44:47,078 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 11:44:47,078 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 11:44:47,080 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 11:44:47,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:44:46" (1/3) ... [2018-01-24 11:44:47,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d3105c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:44:47, skipping insertion in model container [2018-01-24 11:44:47,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:44:46" (2/3) ... [2018-01-24 11:44:47,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d3105c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:44:47, skipping insertion in model container [2018-01-24 11:44:47,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:44:47" (3/3) ... [2018-01-24 11:44:47,084 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-01-24 11:44:47,090 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 11:44:47,095 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-01-24 11:44:47,135 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 11:44:47,136 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 11:44:47,136 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 11:44:47,136 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 11:44:47,136 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 11:44:47,136 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 11:44:47,136 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 11:44:47,137 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 11:44:47,138 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 11:44:47,159 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-01-24 11:44:47,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-24 11:44:47,166 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:44:47,167 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:44:47,167 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:44:47,173 INFO L82 PathProgramCache]: Analyzing trace with hash 967400660, now seen corresponding path program 1 times [2018-01-24 11:44:47,175 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:44:47,176 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:44:47,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:47,220 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:44:47,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:47,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:44:47,273 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:44:47,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:44:47,333 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:44:47,334 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 11:44:47,336 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 11:44:47,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 11:44:47,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 11:44:47,353 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2018-01-24 11:44:47,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:44:47,520 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-01-24 11:44:47,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 11:44:47,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-24 11:44:47,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:44:47,530 INFO L225 Difference]: With dead ends: 73 [2018-01-24 11:44:47,531 INFO L226 Difference]: Without dead ends: 47 [2018-01-24 11:44:47,533 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 11:44:47,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-24 11:44:47,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-24 11:44:47,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-24 11:44:47,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-01-24 11:44:47,567 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 11 [2018-01-24 11:44:47,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:44:47,567 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-01-24 11:44:47,567 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 11:44:47,568 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-01-24 11:44:47,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 11:44:47,568 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:44:47,568 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:44:47,568 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:44:47,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1512837349, now seen corresponding path program 1 times [2018-01-24 11:44:47,569 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:44:47,569 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:44:47,570 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:47,570 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:44:47,570 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:44:47,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:44:47,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:44:47,681 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:44:47,682 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:44:47,683 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:44:47,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:44:47,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:44:47,684 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 4 states. [2018-01-24 11:44:47,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:44:47,759 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-01-24 11:44:47,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 11:44:47,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-24 11:44:47,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:44:47,760 INFO L225 Difference]: With dead ends: 47 [2018-01-24 11:44:47,761 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 11:44:47,762 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:44:47,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 11:44:47,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-24 11:44:47,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 11:44:47,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-01-24 11:44:47,768 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 15 [2018-01-24 11:44:47,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:44:47,769 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-01-24 11:44:47,769 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:44:47,769 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-01-24 11:44:47,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 11:44:47,770 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:44:47,770 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:44:47,770 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:44:47,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1512837350, now seen corresponding path program 1 times [2018-01-24 11:44:47,770 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:44:47,770 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:44:47,772 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:47,772 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:44:47,772 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:44:47,792 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:44:47,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:44:47,907 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:44:47,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:44:47,907 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:44:47,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:44:47,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:44:47,908 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 6 states. [2018-01-24 11:44:47,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:44:47,973 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-01-24 11:44:47,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:44:47,974 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-24 11:44:47,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:44:47,975 INFO L225 Difference]: With dead ends: 46 [2018-01-24 11:44:47,975 INFO L226 Difference]: Without dead ends: 45 [2018-01-24 11:44:47,976 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-24 11:44:47,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-24 11:44:47,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-01-24 11:44:47,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-24 11:44:47,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-01-24 11:44:47,983 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 15 [2018-01-24 11:44:47,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:44:47,983 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-01-24 11:44:47,983 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:44:47,983 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-01-24 11:44:47,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 11:44:47,984 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:44:47,984 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:44:47,984 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:44:47,985 INFO L82 PathProgramCache]: Analyzing trace with hash -346682393, now seen corresponding path program 1 times [2018-01-24 11:44:47,985 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:44:47,985 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:44:47,986 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:47,986 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:44:47,986 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:44:48,001 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:44:48,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:44:48,036 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:44:48,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 11:44:48,036 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 11:44:48,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 11:44:48,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 11:44:48,037 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 4 states. [2018-01-24 11:44:48,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:44:48,099 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-01-24 11:44:48,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 11:44:48,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 11:44:48,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:44:48,101 INFO L225 Difference]: With dead ends: 45 [2018-01-24 11:44:48,101 INFO L226 Difference]: Without dead ends: 44 [2018-01-24 11:44:48,102 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:44:48,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-24 11:44:48,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-01-24 11:44:48,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-24 11:44:48,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-01-24 11:44:48,109 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 16 [2018-01-24 11:44:48,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:44:48,110 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-01-24 11:44:48,110 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 11:44:48,110 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-01-24 11:44:48,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 11:44:48,111 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:44:48,111 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:44:48,111 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:44:48,111 INFO L82 PathProgramCache]: Analyzing trace with hash -346682392, now seen corresponding path program 1 times [2018-01-24 11:44:48,111 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:44:48,112 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:44:48,113 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:48,113 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:44:48,113 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:44:48,127 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:44:48,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:44:48,199 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:44:48,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:44:48,199 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:44:48,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:44:48,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:44:48,200 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-01-24 11:44:48,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:44:48,313 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-01-24 11:44:48,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 11:44:48,314 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-01-24 11:44:48,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:44:48,316 INFO L225 Difference]: With dead ends: 60 [2018-01-24 11:44:48,317 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 11:44:48,317 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-01-24 11:44:48,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 11:44:48,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2018-01-24 11:44:48,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 11:44:48,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-01-24 11:44:48,330 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 16 [2018-01-24 11:44:48,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:44:48,330 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-01-24 11:44:48,331 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:44:48,331 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-01-24 11:44:48,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 11:44:48,331 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:44:48,332 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:44:48,332 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:44:48,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1156029018, now seen corresponding path program 1 times [2018-01-24 11:44:48,332 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:44:48,332 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:44:48,333 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:48,333 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:44:48,334 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:48,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:44:48,348 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:44:48,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:44:48,436 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:44:48,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 11:44:48,437 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 11:44:48,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 11:44:48,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-24 11:44:48,437 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 7 states. [2018-01-24 11:44:48,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:44:48,535 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-01-24 11:44:48,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:44:48,535 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-01-24 11:44:48,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:44:48,536 INFO L225 Difference]: With dead ends: 51 [2018-01-24 11:44:48,536 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 11:44:48,536 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-01-24 11:44:48,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 11:44:48,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2018-01-24 11:44:48,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-24 11:44:48,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-01-24 11:44:48,542 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 16 [2018-01-24 11:44:48,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:44:48,542 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-01-24 11:44:48,542 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 11:44:48,542 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-01-24 11:44:48,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 11:44:48,543 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:44:48,543 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:44:48,543 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:44:48,544 INFO L82 PathProgramCache]: Analyzing trace with hash -131455439, now seen corresponding path program 1 times [2018-01-24 11:44:48,544 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:44:48,544 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:44:48,545 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:48,545 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:44:48,545 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:44:48,558 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:44:48,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:44:48,590 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:44:48,590 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 11:44:48,591 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 11:44:48,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 11:44:48,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 11:44:48,591 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2018-01-24 11:44:48,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:44:48,632 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-01-24 11:44:48,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:44:48,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-24 11:44:48,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:44:48,633 INFO L225 Difference]: With dead ends: 43 [2018-01-24 11:44:48,634 INFO L226 Difference]: Without dead ends: 42 [2018-01-24 11:44:48,634 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:44:48,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-24 11:44:48,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-01-24 11:44:48,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-24 11:44:48,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-01-24 11:44:48,640 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 20 [2018-01-24 11:44:48,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:44:48,641 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-01-24 11:44:48,641 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 11:44:48,641 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-01-24 11:44:48,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 11:44:48,642 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:44:48,642 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:44:48,642 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:44:48,642 INFO L82 PathProgramCache]: Analyzing trace with hash -131455438, now seen corresponding path program 1 times [2018-01-24 11:44:48,643 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:44:48,648 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:44:48,649 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:48,649 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:44:48,649 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:44:48,662 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:44:48,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:44:48,782 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:44:48,782 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 11:44:48,783 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 11:44:48,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 11:44:48,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 11:44:48,783 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 7 states. [2018-01-24 11:44:48,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:44:48,908 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-01-24 11:44:48,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:44:48,908 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-01-24 11:44:48,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:44:48,908 INFO L225 Difference]: With dead ends: 49 [2018-01-24 11:44:48,909 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 11:44:48,909 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-01-24 11:44:48,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 11:44:48,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-01-24 11:44:48,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-24 11:44:48,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-01-24 11:44:48,913 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 20 [2018-01-24 11:44:48,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:44:48,913 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-01-24 11:44:48,913 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 11:44:48,914 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-01-24 11:44:48,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 11:44:48,914 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:44:48,914 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:44:48,914 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:44:48,915 INFO L82 PathProgramCache]: Analyzing trace with hash -313436100, now seen corresponding path program 1 times [2018-01-24 11:44:48,915 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:44:48,915 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:44:48,916 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:48,916 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:44:48,916 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:44:48,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:44:48,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:44:48,975 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:44:48,976 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:44:48,976 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:44:48,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:44:48,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:44:48,977 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-01-24 11:44:49,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:44:49,071 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-01-24 11:44:49,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:44:49,071 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-24 11:44:49,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:44:49,072 INFO L225 Difference]: With dead ends: 44 [2018-01-24 11:44:49,072 INFO L226 Difference]: Without dead ends: 43 [2018-01-24 11:44:49,073 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:44:49,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-24 11:44:49,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-24 11:44:49,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-24 11:44:49,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-01-24 11:44:49,077 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 24 [2018-01-24 11:44:49,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:44:49,078 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-01-24 11:44:49,078 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:44:49,078 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-01-24 11:44:49,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 11:44:49,079 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:44:49,079 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:44:49,079 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:44:49,079 INFO L82 PathProgramCache]: Analyzing trace with hash -313436099, now seen corresponding path program 1 times [2018-01-24 11:44:49,079 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:44:49,079 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:44:49,080 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:49,080 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:44:49,080 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:44:49,092 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:44:49,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:44:49,225 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:44:49,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 11:44:49,226 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 11:44:49,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 11:44:49,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 11:44:49,226 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 9 states. [2018-01-24 11:44:49,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:44:49,444 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-01-24 11:44:49,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 11:44:49,444 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-01-24 11:44:49,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:44:49,445 INFO L225 Difference]: With dead ends: 51 [2018-01-24 11:44:49,445 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 11:44:49,446 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-01-24 11:44:49,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 11:44:49,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2018-01-24 11:44:49,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 11:44:49,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-01-24 11:44:49,453 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 24 [2018-01-24 11:44:49,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:44:49,454 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-01-24 11:44:49,454 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 11:44:49,454 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-01-24 11:44:49,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 11:44:49,455 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:44:49,455 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:44:49,455 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:44:49,455 INFO L82 PathProgramCache]: Analyzing trace with hash -313382859, now seen corresponding path program 1 times [2018-01-24 11:44:49,456 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:44:49,456 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:44:49,456 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:49,457 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:44:49,457 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:44:49,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:44:49,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:44:49,561 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:44:49,561 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:44:49,571 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:44:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:44:49,610 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:44:49,662 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 11 treesize of output 8 [2018-01-24 11:44:49,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 11:44:49,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:44:49,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:44:49,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:44:49,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-24 11:44:49,726 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 15 treesize of output 11 [2018-01-24 11:44:49,728 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 11 treesize of output 3 [2018-01-24 11:44:49,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:44:49,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:44:49,730 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-24 11:44:49,730 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-01-24 11:44:49,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:44:49,761 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 11:44:49,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2018-01-24 11:44:49,761 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 11:44:49,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 11:44:49,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-01-24 11:44:49,762 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 13 states. [2018-01-24 11:44:50,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:44:50,093 INFO L93 Difference]: Finished difference Result 117 states and 128 transitions. [2018-01-24 11:44:50,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 11:44:50,093 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-01-24 11:44:50,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:44:50,095 INFO L225 Difference]: With dead ends: 117 [2018-01-24 11:44:50,096 INFO L226 Difference]: Without dead ends: 91 [2018-01-24 11:44:50,096 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2018-01-24 11:44:50,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-24 11:44:50,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 62. [2018-01-24 11:44:50,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-24 11:44:50,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-01-24 11:44:50,104 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 24 [2018-01-24 11:44:50,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:44:50,104 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-01-24 11:44:50,104 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 11:44:50,104 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-01-24 11:44:50,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 11:44:50,105 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:44:50,105 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:44:50,105 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:44:50,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1126584510, now seen corresponding path program 1 times [2018-01-24 11:44:50,105 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:44:50,105 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:44:50,106 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:50,106 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:44:50,107 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:44:50,119 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:44:50,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:44:50,180 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:44:50,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:44:50,180 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:44:50,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:44:50,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:44:50,181 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 6 states. [2018-01-24 11:44:50,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:44:50,263 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-01-24 11:44:50,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 11:44:50,263 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-24 11:44:50,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:44:50,265 INFO L225 Difference]: With dead ends: 62 [2018-01-24 11:44:50,265 INFO L226 Difference]: Without dead ends: 61 [2018-01-24 11:44:50,265 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:44:50,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-24 11:44:50,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-24 11:44:50,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-24 11:44:50,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2018-01-24 11:44:50,273 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 25 [2018-01-24 11:44:50,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:44:50,273 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2018-01-24 11:44:50,273 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:44:50,274 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2018-01-24 11:44:50,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 11:44:50,274 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:44:50,275 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:44:50,275 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:44:50,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1126584509, now seen corresponding path program 1 times [2018-01-24 11:44:50,275 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:44:50,275 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:44:50,276 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:50,276 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:44:50,276 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:44:50,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:44:50,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:44:50,423 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:44:50,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 11:44:50,424 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 11:44:50,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 11:44:50,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 11:44:50,424 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 8 states. [2018-01-24 11:44:50,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:44:50,579 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-01-24 11:44:50,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 11:44:50,580 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-01-24 11:44:50,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:44:50,580 INFO L225 Difference]: With dead ends: 67 [2018-01-24 11:44:50,580 INFO L226 Difference]: Without dead ends: 66 [2018-01-24 11:44:50,581 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-01-24 11:44:50,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-24 11:44:50,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-01-24 11:44:50,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-24 11:44:50,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2018-01-24 11:44:50,589 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 25 [2018-01-24 11:44:50,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:44:50,589 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2018-01-24 11:44:50,589 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 11:44:50,589 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2018-01-24 11:44:50,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 11:44:50,591 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:44:50,591 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:44:50,591 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:44:50,591 INFO L82 PathProgramCache]: Analyzing trace with hash -99148426, now seen corresponding path program 1 times [2018-01-24 11:44:50,592 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:44:50,592 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:44:50,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:50,593 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:44:50,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:44:50,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:44:50,806 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 11:44:50,806 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:44:50,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 11:44:50,807 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 11:44:50,807 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 11:44:50,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-01-24 11:44:50,807 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 12 states. [2018-01-24 11:44:51,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:44:51,103 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2018-01-24 11:44:51,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 11:44:51,103 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-01-24 11:44:51,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:44:51,104 INFO L225 Difference]: With dead ends: 132 [2018-01-24 11:44:51,104 INFO L226 Difference]: Without dead ends: 104 [2018-01-24 11:44:51,105 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2018-01-24 11:44:51,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-24 11:44:51,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 66. [2018-01-24 11:44:51,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-24 11:44:51,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2018-01-24 11:44:51,114 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 28 [2018-01-24 11:44:51,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:44:51,115 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2018-01-24 11:44:51,115 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 11:44:51,115 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-01-24 11:44:51,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 11:44:51,116 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:44:51,116 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:44:51,116 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:44:51,116 INFO L82 PathProgramCache]: Analyzing trace with hash 323553400, now seen corresponding path program 1 times [2018-01-24 11:44:51,117 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:44:51,117 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:44:51,117 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:51,118 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:44:51,118 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:44:51,131 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:44:51,352 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:44:51,353 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:44:51,353 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:44:51,360 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:44:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:44:51,379 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:44:51,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:44:51,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:44:51,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:44:51,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-24 11:44:51,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 11:44:51,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 11:44:51,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:44:51,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:44:51,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:44:51,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-24 11:44:51,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-01-24 11:44:51,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 11:44:51,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:44:51,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:44:51,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:44:51,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:35 [2018-01-24 11:44:51,724 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:44:51,752 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:44:51,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2018-01-24 11:44:51,753 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-24 11:44:51,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-24 11:44:51,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2018-01-24 11:44:51,753 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 22 states. [2018-01-24 11:44:53,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:44:53,034 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2018-01-24 11:44:53,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 11:44:53,034 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2018-01-24 11:44:53,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:44:53,036 INFO L225 Difference]: With dead ends: 88 [2018-01-24 11:44:53,036 INFO L226 Difference]: Without dead ends: 87 [2018-01-24 11:44:53,037 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=150, Invalid=972, Unknown=0, NotChecked=0, Total=1122 [2018-01-24 11:44:53,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-24 11:44:53,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2018-01-24 11:44:53,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-24 11:44:53,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2018-01-24 11:44:53,046 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 28 [2018-01-24 11:44:53,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:44:53,047 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2018-01-24 11:44:53,047 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-24 11:44:53,047 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2018-01-24 11:44:53,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 11:44:53,048 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:44:53,048 INFO L322 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] [2018-01-24 11:44:53,048 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:44:53,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1309566295, now seen corresponding path program 1 times [2018-01-24 11:44:53,049 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:44:53,049 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:44:53,050 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:53,050 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:44:53,050 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:44:53,064 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:44:53,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:44:53,309 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:44:53,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-01-24 11:44:53,310 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 11:44:53,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 11:44:53,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-01-24 11:44:53,310 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 15 states. [2018-01-24 11:44:53,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:44:53,853 INFO L93 Difference]: Finished difference Result 178 states and 199 transitions. [2018-01-24 11:44:53,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-24 11:44:53,854 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-01-24 11:44:53,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:44:53,855 INFO L225 Difference]: With dead ends: 178 [2018-01-24 11:44:53,855 INFO L226 Difference]: Without dead ends: 161 [2018-01-24 11:44:53,856 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=233, Invalid=889, Unknown=0, NotChecked=0, Total=1122 [2018-01-24 11:44:53,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-01-24 11:44:53,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 135. [2018-01-24 11:44:53,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-24 11:44:53,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 154 transitions. [2018-01-24 11:44:53,872 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 154 transitions. Word has length 29 [2018-01-24 11:44:53,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:44:53,872 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 154 transitions. [2018-01-24 11:44:53,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 11:44:53,873 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 154 transitions. [2018-01-24 11:44:53,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 11:44:53,874 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:44:53,874 INFO L322 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] [2018-01-24 11:44:53,874 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:44:53,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1528421013, now seen corresponding path program 1 times [2018-01-24 11:44:53,874 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:44:53,875 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:44:53,875 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:53,876 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:44:53,876 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:44:53,890 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:44:54,128 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-24 11:44:54,128 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:44:54,128 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:44:54,135 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:44:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:44:54,155 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:44:54,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:44:54,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:44:54,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:44:54,163 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 11:44:54,229 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:44:54,230 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:44:54,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 11:44:54,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:44:54,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:44:54,236 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-24 11:44:54,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 11:44:54,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 11:44:54,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:44:54,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:44:54,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:44:54,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-24 11:44:54,299 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-24 11:44:54,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 11:44:54,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:44:54,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:44:54,311 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-24 11:44:54,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-24 11:44:54,458 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-24 11:44:54,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 11:44:54,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:44:54,472 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-24 11:44:54,472 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 11:44:54,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:44:54,484 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-24 11:44:54,484 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-01-24 11:44:54,520 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-24 11:44:54,540 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:44:54,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 23 [2018-01-24 11:44:54,540 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-24 11:44:54,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-24 11:44:54,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2018-01-24 11:44:54,541 INFO L87 Difference]: Start difference. First operand 135 states and 154 transitions. Second operand 24 states. [2018-01-24 11:44:55,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:44:55,187 INFO L93 Difference]: Finished difference Result 145 states and 166 transitions. [2018-01-24 11:44:55,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 11:44:55,188 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 29 [2018-01-24 11:44:55,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:44:55,189 INFO L225 Difference]: With dead ends: 145 [2018-01-24 11:44:55,189 INFO L226 Difference]: Without dead ends: 144 [2018-01-24 11:44:55,190 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=168, Invalid=1022, Unknown=0, NotChecked=0, Total=1190 [2018-01-24 11:44:55,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-24 11:44:55,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2018-01-24 11:44:55,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-24 11:44:55,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 161 transitions. [2018-01-24 11:44:55,209 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 161 transitions. Word has length 29 [2018-01-24 11:44:55,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:44:55,209 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 161 transitions. [2018-01-24 11:44:55,209 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-24 11:44:55,209 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 161 transitions. [2018-01-24 11:44:55,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 11:44:55,211 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:44:55,211 INFO L322 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] [2018-01-24 11:44:55,211 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:44:55,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1438570336, now seen corresponding path program 1 times [2018-01-24 11:44:55,211 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:44:55,211 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:44:55,212 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:55,212 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:44:55,212 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:44:55,221 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:44:55,297 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-24 11:44:55,298 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:44:55,298 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:44:55,306 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:44:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:44:55,325 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:44:55,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:44:55,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:44:55,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:44:55,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-01-24 11:44:55,498 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-24 11:44:55,518 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:44:55,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-01-24 11:44:55,519 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 11:44:55,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 11:44:55,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-01-24 11:44:55,519 INFO L87 Difference]: Start difference. First operand 140 states and 161 transitions. Second operand 17 states. [2018-01-24 11:44:55,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:44:55,767 INFO L93 Difference]: Finished difference Result 154 states and 178 transitions. [2018-01-24 11:44:55,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 11:44:55,767 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2018-01-24 11:44:55,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:44:55,768 INFO L225 Difference]: With dead ends: 154 [2018-01-24 11:44:55,768 INFO L226 Difference]: Without dead ends: 153 [2018-01-24 11:44:55,768 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2018-01-24 11:44:55,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-01-24 11:44:55,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 141. [2018-01-24 11:44:55,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-01-24 11:44:55,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 159 transitions. [2018-01-24 11:44:55,787 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 159 transitions. Word has length 29 [2018-01-24 11:44:55,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:44:55,788 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 159 transitions. [2018-01-24 11:44:55,788 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 11:44:55,788 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 159 transitions. [2018-01-24 11:44:55,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 11:44:55,789 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:44:55,789 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:44:55,789 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:44:55,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1106610309, now seen corresponding path program 2 times [2018-01-24 11:44:55,790 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:44:55,790 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:44:55,790 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:55,791 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:44:55,791 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:55,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:44:55,806 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:44:56,243 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:44:56,243 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:44:56,243 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:44:56,248 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 11:44:56,258 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:44:56,265 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:44:56,267 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:44:56,270 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:44:56,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:44:56,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:44:56,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:44:56,324 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-24 11:44:56,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 11:44:56,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 11:44:56,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:44:56,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:44:56,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:44:56,367 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-24 11:44:56,525 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 25 treesize of output 19 [2018-01-24 11:44:56,528 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:44:56,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 25 [2018-01-24 11:44:56,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:44:56,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:44:56,554 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-24 11:44:56,554 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:58 [2018-01-24 11:44:56,654 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:44:56,674 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:44:56,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 33 [2018-01-24 11:44:56,675 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-24 11:44:56,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-24 11:44:56,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=990, Unknown=0, NotChecked=0, Total=1122 [2018-01-24 11:44:56,676 INFO L87 Difference]: Start difference. First operand 141 states and 159 transitions. Second operand 34 states. [2018-01-24 11:44:57,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:44:57,375 INFO L93 Difference]: Finished difference Result 190 states and 215 transitions. [2018-01-24 11:44:57,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-24 11:44:57,376 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 32 [2018-01-24 11:44:57,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:44:57,377 INFO L225 Difference]: With dead ends: 190 [2018-01-24 11:44:57,377 INFO L226 Difference]: Without dead ends: 189 [2018-01-24 11:44:57,378 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=307, Invalid=2045, Unknown=0, NotChecked=0, Total=2352 [2018-01-24 11:44:57,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-01-24 11:44:57,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 149. [2018-01-24 11:44:57,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-01-24 11:44:57,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 169 transitions. [2018-01-24 11:44:57,395 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 169 transitions. Word has length 32 [2018-01-24 11:44:57,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:44:57,396 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 169 transitions. [2018-01-24 11:44:57,396 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-24 11:44:57,396 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 169 transitions. [2018-01-24 11:44:57,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 11:44:57,397 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:44:57,397 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:44:57,397 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:44:57,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1452172801, now seen corresponding path program 2 times [2018-01-24 11:44:57,397 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:44:57,397 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:44:57,398 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:57,398 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:44:57,398 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:44:57,415 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:44:57,778 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-24 11:44:57,778 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:44:57,778 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:44:57,783 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 11:44:57,794 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:44:57,801 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:44:57,803 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:44:57,806 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:44:57,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:44:57,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:44:57,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:44:57,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:44:57,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:44:57,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 11:44:57,846 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:44:57,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 11:44:57,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:44:57,856 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:44:57,857 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:44:57,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 11:44:57,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:44:57,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:44:57,863 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-24 11:44:57,903 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-24 11:44:57,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 13 treesize of output 12 [2018-01-24 11:44:57,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:44:57,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:44:57,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:44:57,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:20 [2018-01-24 11:44:57,940 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-24 11:44:57,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 11:44:57,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:44:57,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:44:57,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 11:44:57,951 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:30 [2018-01-24 11:44:58,120 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-24 11:44:58,130 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-24 11:44:58,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:44:58,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:44:58,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-01-24 11:44:58,168 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:43, output treesize:51 [2018-01-24 11:44:58,236 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-24 11:44:58,243 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-24 11:44:58,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:44:58,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:44:58,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:44:58,253 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:38 [2018-01-24 11:44:58,342 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-24 11:44:58,363 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:44:58,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2018-01-24 11:44:58,363 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-24 11:44:58,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-24 11:44:58,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=792, Unknown=0, NotChecked=0, Total=870 [2018-01-24 11:44:58,364 INFO L87 Difference]: Start difference. First operand 149 states and 169 transitions. Second operand 30 states. [2018-01-24 11:44:59,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:44:59,064 INFO L93 Difference]: Finished difference Result 162 states and 185 transitions. [2018-01-24 11:44:59,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-24 11:44:59,064 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 34 [2018-01-24 11:44:59,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:44:59,065 INFO L225 Difference]: With dead ends: 162 [2018-01-24 11:44:59,065 INFO L226 Difference]: Without dead ends: 161 [2018-01-24 11:44:59,066 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=183, Invalid=1539, Unknown=0, NotChecked=0, Total=1722 [2018-01-24 11:44:59,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-01-24 11:44:59,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 154. [2018-01-24 11:44:59,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-24 11:44:59,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 176 transitions. [2018-01-24 11:44:59,082 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 176 transitions. Word has length 34 [2018-01-24 11:44:59,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:44:59,082 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 176 transitions. [2018-01-24 11:44:59,082 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-24 11:44:59,082 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 176 transitions. [2018-01-24 11:44:59,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 11:44:59,083 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:44:59,083 INFO L322 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] [2018-01-24 11:44:59,083 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:44:59,083 INFO L82 PathProgramCache]: Analyzing trace with hash 357476204, now seen corresponding path program 1 times [2018-01-24 11:44:59,083 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:44:59,083 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:44:59,084 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:59,084 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:44:59,084 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:44:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:44:59,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:44:59,555 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:44:59,555 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:44:59,555 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:44:59,567 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:44:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:44:59,597 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:44:59,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:44:59,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:44:59,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:44:59,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:44:59,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:44:59,629 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-01-24 11:44:59,686 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:44:59,686 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:44:59,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 11:44:59,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:44:59,694 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:44:59,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-01-24 11:44:59,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:44:59,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:44:59,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-01-24 11:44:59,924 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:44:59,945 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:44:59,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2018-01-24 11:44:59,945 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-24 11:44:59,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-24 11:44:59,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2018-01-24 11:44:59,946 INFO L87 Difference]: Start difference. First operand 154 states and 176 transitions. Second operand 28 states. [2018-01-24 11:45:00,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:00,687 INFO L93 Difference]: Finished difference Result 200 states and 231 transitions. [2018-01-24 11:45:00,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 11:45:00,687 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 34 [2018-01-24 11:45:00,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:00,689 INFO L225 Difference]: With dead ends: 200 [2018-01-24 11:45:00,689 INFO L226 Difference]: Without dead ends: 199 [2018-01-24 11:45:00,690 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=237, Invalid=1925, Unknown=0, NotChecked=0, Total=2162 [2018-01-24 11:45:00,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-01-24 11:45:00,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 163. [2018-01-24 11:45:00,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-01-24 11:45:00,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 188 transitions. [2018-01-24 11:45:00,708 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 188 transitions. Word has length 34 [2018-01-24 11:45:00,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:00,709 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 188 transitions. [2018-01-24 11:45:00,709 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-24 11:45:00,709 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 188 transitions. [2018-01-24 11:45:00,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 11:45:00,710 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:00,710 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:45:00,710 INFO L371 AbstractCegarLoop]: === Iteration 22 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:45:00,710 INFO L82 PathProgramCache]: Analyzing trace with hash -679902947, now seen corresponding path program 1 times [2018-01-24 11:45:00,710 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:00,711 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:00,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:00,711 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:00,712 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:00,724 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:00,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:00,830 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 11:45:00,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 11:45:00,830 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 11:45:00,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 11:45:00,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 11:45:00,831 INFO L87 Difference]: Start difference. First operand 163 states and 188 transitions. Second operand 6 states. [2018-01-24 11:45:00,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:00,954 INFO L93 Difference]: Finished difference Result 163 states and 188 transitions. [2018-01-24 11:45:00,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 11:45:00,956 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-01-24 11:45:00,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:00,957 INFO L225 Difference]: With dead ends: 163 [2018-01-24 11:45:00,958 INFO L226 Difference]: Without dead ends: 121 [2018-01-24 11:45:00,958 INFO L525 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-24 11:45:00,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-24 11:45:00,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 116. [2018-01-24 11:45:00,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-24 11:45:00,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 125 transitions. [2018-01-24 11:45:00,976 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 125 transitions. Word has length 35 [2018-01-24 11:45:00,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:00,976 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 125 transitions. [2018-01-24 11:45:00,976 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 11:45:00,976 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2018-01-24 11:45:00,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 11:45:00,977 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:00,977 INFO L322 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:45:00,977 INFO L371 AbstractCegarLoop]: === Iteration 23 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:45:00,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1017556222, now seen corresponding path program 3 times [2018-01-24 11:45:00,977 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:00,977 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:00,978 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:00,978 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 11:45:00,978 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:00,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:01,448 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:01,449 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:45:01,449 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:45:01,454 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 11:45:01,466 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:45:01,469 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:45:01,472 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:45:01,474 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:45:01,477 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:45:01,478 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:45:01,481 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:45:01,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:45:01,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:01,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:01,490 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-24 11:45:01,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 11:45:01,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 11:45:01,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:01,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:01,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:45:01,524 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-24 11:45:01,816 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 33 treesize of output 25 [2018-01-24 11:45:01,843 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 25 treesize of output 55 [2018-01-24 11:45:01,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 10 xjuncts. [2018-01-24 11:45:01,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:45:01,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:45:01,898 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:61 [2018-01-24 11:45:02,061 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:02,082 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:45:02,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 34 [2018-01-24 11:45:02,083 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-24 11:45:02,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-24 11:45:02,084 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1080, Unknown=0, NotChecked=0, Total=1190 [2018-01-24 11:45:02,084 INFO L87 Difference]: Start difference. First operand 116 states and 125 transitions. Second operand 35 states. [2018-01-24 11:45:02,797 WARN L146 SmtUtils]: Spent 188ms on a formula simplification. DAG size of input: 61 DAG size of output 36 [2018-01-24 11:45:03,598 WARN L146 SmtUtils]: Spent 504ms on a formula simplification. DAG size of input: 70 DAG size of output 54 [2018-01-24 11:45:03,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:03,942 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2018-01-24 11:45:03,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-24 11:45:03,943 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 36 [2018-01-24 11:45:03,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:03,943 INFO L225 Difference]: With dead ends: 152 [2018-01-24 11:45:03,944 INFO L226 Difference]: Without dead ends: 151 [2018-01-24 11:45:03,945 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=306, Invalid=2556, Unknown=0, NotChecked=0, Total=2862 [2018-01-24 11:45:03,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-01-24 11:45:03,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 124. [2018-01-24 11:45:03,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-24 11:45:03,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-01-24 11:45:03,957 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 36 [2018-01-24 11:45:03,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:03,957 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-01-24 11:45:03,957 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-24 11:45:03,957 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-01-24 11:45:03,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 11:45:03,958 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:03,958 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:45:03,958 INFO L371 AbstractCegarLoop]: === Iteration 24 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:45:03,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1572046895, now seen corresponding path program 2 times [2018-01-24 11:45:03,958 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:03,958 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:03,959 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:03,959 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:45:03,959 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:03,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:04,301 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:04,301 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:45:04,302 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:45:04,308 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 11:45:04,321 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:45:04,327 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:45:04,330 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:45:04,333 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:45:04,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:45:04,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:04,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:45:04,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:04,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:04,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-01-24 11:45:04,387 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:04,387 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:04,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 11:45:04,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:04,394 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:04,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-01-24 11:45:04,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:04,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:04,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-01-24 11:45:04,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 11:45:04,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 11:45:04,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:04,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:04,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:45:04,452 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-01-24 11:45:04,534 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-24 11:45:04,540 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-24 11:45:04,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:45:04,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:45:04,554 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-24 11:45:04,554 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:55 [2018-01-24 11:45:04,757 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:04,777 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:45:04,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 34 [2018-01-24 11:45:04,778 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-24 11:45:04,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-24 11:45:04,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1098, Unknown=0, NotChecked=0, Total=1190 [2018-01-24 11:45:04,778 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 35 states. [2018-01-24 11:45:05,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:05,999 INFO L93 Difference]: Finished difference Result 164 states and 176 transitions. [2018-01-24 11:45:05,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-24 11:45:05,999 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 38 [2018-01-24 11:45:05,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:06,000 INFO L225 Difference]: With dead ends: 164 [2018-01-24 11:45:06,000 INFO L226 Difference]: Without dead ends: 163 [2018-01-24 11:45:06,001 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=248, Invalid=2508, Unknown=0, NotChecked=0, Total=2756 [2018-01-24 11:45:06,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-01-24 11:45:06,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 124. [2018-01-24 11:45:06,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-24 11:45:06,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-01-24 11:45:06,016 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 38 [2018-01-24 11:45:06,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:06,016 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-01-24 11:45:06,016 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-24 11:45:06,016 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-01-24 11:45:06,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-24 11:45:06,017 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:06,017 INFO L322 BasicCegarLoop]: trace histogram [4, 4, 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] [2018-01-24 11:45:06,017 INFO L371 AbstractCegarLoop]: === Iteration 25 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:45:06,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1543171285, now seen corresponding path program 3 times [2018-01-24 11:45:06,017 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:06,017 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:06,018 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:06,018 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:45:06,018 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:06,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:06,678 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 11:45:06,678 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:45:06,679 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:45:06,686 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 11:45:06,701 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:45:06,706 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:45:06,711 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:45:06,717 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:45:06,719 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:45:06,724 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:45:06,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:45:06,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:06,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:45:06,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:06,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:06,739 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-24 11:45:06,787 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:06,788 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:06,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 11:45:06,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:06,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-24 11:45:06,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:06,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:06,801 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-24 11:45:06,839 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-24 11:45:06,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-24 11:45:06,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:06,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:06,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:45:06,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-24 11:45:06,877 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-24 11:45:06,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 11:45:06,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:06,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:06,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-24 11:45:06,888 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:33 [2018-01-24 11:45:07,086 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-24 11:45:07,129 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-24 11:45:07,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:45:07,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:45:07,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-24 11:45:07,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:44, output treesize:57 [2018-01-24 11:45:07,202 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-24 11:45:07,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 11:45:07,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:07,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:07,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:07,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2018-01-24 11:45:07,242 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-24 11:45:07,250 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-24 11:45:07,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:45:07,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:45:07,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:45:07,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-01-24 11:45:07,316 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:07,340 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:45:07,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 29 [2018-01-24 11:45:07,340 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-24 11:45:07,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-24 11:45:07,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=780, Unknown=0, NotChecked=0, Total=870 [2018-01-24 11:45:07,341 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 30 states. [2018-01-24 11:45:08,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:08,345 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2018-01-24 11:45:08,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 11:45:08,365 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 39 [2018-01-24 11:45:08,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:08,366 INFO L225 Difference]: With dead ends: 124 [2018-01-24 11:45:08,366 INFO L226 Difference]: Without dead ends: 93 [2018-01-24 11:45:08,367 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=240, Invalid=1482, Unknown=0, NotChecked=0, Total=1722 [2018-01-24 11:45:08,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-24 11:45:08,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 84. [2018-01-24 11:45:08,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-24 11:45:08,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2018-01-24 11:45:08,379 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 39 [2018-01-24 11:45:08,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:08,379 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2018-01-24 11:45:08,379 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-24 11:45:08,379 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2018-01-24 11:45:08,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-24 11:45:08,380 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:08,380 INFO L322 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:45:08,380 INFO L371 AbstractCegarLoop]: === Iteration 26 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:45:08,380 INFO L82 PathProgramCache]: Analyzing trace with hash -11114239, now seen corresponding path program 4 times [2018-01-24 11:45:08,380 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:08,380 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:08,381 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:08,381 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:45:08,381 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:08,394 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:09,327 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-24 11:45:09,327 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:45:09,327 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:45:09,332 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-24 11:45:09,347 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:45:09,350 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:45:09,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:45:09,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:09,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:09,358 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-24 11:45:09,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 11:45:09,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 11:45:09,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:09,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:09,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:45:09,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-24 11:45:09,941 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-24 11:45:09,951 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:09,952 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:09,953 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:09,954 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:09,955 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:09,956 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:09,974 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-24 11:45:09,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:45:10,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:45:10,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:45:10,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:73 [2018-01-24 11:45:10,256 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-24 11:45:10,276 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:45:10,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 41 [2018-01-24 11:45:10,276 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-01-24 11:45:10,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-01-24 11:45:10,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1514, Unknown=0, NotChecked=0, Total=1722 [2018-01-24 11:45:10,277 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 42 states. [2018-01-24 11:45:10,728 WARN L146 SmtUtils]: Spent 147ms on a formula simplification. DAG size of input: 27 DAG size of output 21 [2018-01-24 11:45:11,338 WARN L146 SmtUtils]: Spent 554ms on a formula simplification. DAG size of input: 61 DAG size of output 29 [2018-01-24 11:45:12,240 WARN L146 SmtUtils]: Spent 633ms on a formula simplification. DAG size of input: 61 DAG size of output 39 [2018-01-24 11:45:14,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:14,004 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2018-01-24 11:45:14,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-24 11:45:14,004 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 40 [2018-01-24 11:45:14,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:14,005 INFO L225 Difference]: With dead ends: 125 [2018-01-24 11:45:14,005 INFO L226 Difference]: Without dead ends: 124 [2018-01-24 11:45:14,006 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1062 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=505, Invalid=3785, Unknown=0, NotChecked=0, Total=4290 [2018-01-24 11:45:14,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-24 11:45:14,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 100. [2018-01-24 11:45:14,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-01-24 11:45:14,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-01-24 11:45:14,023 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 40 [2018-01-24 11:45:14,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:14,023 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-01-24 11:45:14,023 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-01-24 11:45:14,023 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-01-24 11:45:14,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 11:45:14,024 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:14,024 INFO L322 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:45:14,024 INFO L371 AbstractCegarLoop]: === Iteration 27 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:45:14,024 INFO L82 PathProgramCache]: Analyzing trace with hash 862211954, now seen corresponding path program 3 times [2018-01-24 11:45:14,024 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:14,024 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:14,025 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:14,025 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:45:14,025 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:14,039 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:14,611 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-24 11:45:14,611 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:45:14,611 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 11:45:14,617 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 11:45:14,633 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:45:14,639 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:45:14,643 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:45:14,647 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 11:45:14,649 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:45:14,653 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:45:14,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:45:14,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:14,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:45:14,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:14,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:14,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-01-24 11:45:14,741 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:14,742 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:14,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-01-24 11:45:14,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:14,758 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:14,759 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:14,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 11:45:14,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:14,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:14,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:19 [2018-01-24 11:45:14,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 11:45:14,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 11:45:14,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:14,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:14,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:45:14,839 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2018-01-24 11:45:15,056 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 25 treesize of output 19 [2018-01-24 11:45:15,071 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 19 treesize of output 29 [2018-01-24 11:45:15,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-01-24 11:45:15,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:45:15,101 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-24 11:45:15,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:99 [2018-01-24 11:45:15,463 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-24 11:45:15,482 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:45:15,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 41 [2018-01-24 11:45:15,483 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-01-24 11:45:15,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-01-24 11:45:15,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1595, Unknown=0, NotChecked=0, Total=1722 [2018-01-24 11:45:15,483 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 42 states. [2018-01-24 11:45:16,404 WARN L146 SmtUtils]: Spent 282ms on a formula simplification. DAG size of input: 72 DAG size of output 51 [2018-01-24 11:45:17,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:17,139 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2018-01-24 11:45:17,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-24 11:45:17,140 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-01-24 11:45:17,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:17,140 INFO L225 Difference]: With dead ends: 116 [2018-01-24 11:45:17,141 INFO L226 Difference]: Without dead ends: 115 [2018-01-24 11:45:17,141 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 922 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=327, Invalid=3213, Unknown=0, NotChecked=0, Total=3540 [2018-01-24 11:45:17,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-24 11:45:17,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 110. [2018-01-24 11:45:17,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-01-24 11:45:17,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 116 transitions. [2018-01-24 11:45:17,163 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 116 transitions. Word has length 42 [2018-01-24 11:45:17,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:17,164 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 116 transitions. [2018-01-24 11:45:17,164 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-01-24 11:45:17,164 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 116 transitions. [2018-01-24 11:45:17,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-24 11:45:17,164 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:17,164 INFO L322 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:45:17,164 INFO L371 AbstractCegarLoop]: === Iteration 28 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:45:17,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1458979531, now seen corresponding path program 4 times [2018-01-24 11:45:17,165 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:17,165 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:17,165 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:17,165 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:45:17,165 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:17,181 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:18,157 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:18,157 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:45:18,157 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-24 11:45:18,162 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-24 11:45:18,182 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:45:18,185 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:45:18,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:45:18,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:18,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:45:18,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:18,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:18,199 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-01-24 11:45:18,251 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:18,252 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:18,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-01-24 11:45:18,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:18,262 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:18,263 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:18,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 11:45:18,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:18,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:18,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-01-24 11:45:18,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 11:45:18,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 11:45:18,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:18,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:18,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:45:18,328 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-01-24 11:45:18,684 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-24 11:45:18,687 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:18,688 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:18,688 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:18,694 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-24 11:45:18,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:45:18,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:45:18,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:45:18,725 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:84 [2018-01-24 11:45:19,043 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:19,063 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:45:19,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 47 [2018-01-24 11:45:19,077 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-01-24 11:45:19,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-01-24 11:45:19,077 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=2127, Unknown=0, NotChecked=0, Total=2256 [2018-01-24 11:45:19,078 INFO L87 Difference]: Start difference. First operand 110 states and 116 transitions. Second operand 48 states. [2018-01-24 11:45:21,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:21,133 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2018-01-24 11:45:21,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-24 11:45:21,133 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 46 [2018-01-24 11:45:21,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:21,134 INFO L225 Difference]: With dead ends: 130 [2018-01-24 11:45:21,134 INFO L226 Difference]: Without dead ends: 129 [2018-01-24 11:45:21,135 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1429 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=432, Invalid=5118, Unknown=0, NotChecked=0, Total=5550 [2018-01-24 11:45:21,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-01-24 11:45:21,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 115. [2018-01-24 11:45:21,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-01-24 11:45:21,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2018-01-24 11:45:21,151 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 46 [2018-01-24 11:45:21,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:21,152 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2018-01-24 11:45:21,152 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-01-24 11:45:21,152 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2018-01-24 11:45:21,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-24 11:45:21,153 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:21,153 INFO L322 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:45:21,153 INFO L371 AbstractCegarLoop]: === Iteration 29 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:45:21,153 INFO L82 PathProgramCache]: Analyzing trace with hash -839682937, now seen corresponding path program 5 times [2018-01-24 11:45:21,153 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:21,153 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:21,154 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:21,154 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:45:21,154 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:21,176 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:22,493 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:22,494 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:45:22,494 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-24 11:45:22,499 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-24 11:45:22,505 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:45:22,506 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:45:22,508 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:45:22,509 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:45:22,510 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:45:22,511 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:45:22,513 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:45:22,518 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:45:22,521 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:45:22,524 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:45:22,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:45:22,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:22,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:22,531 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-01-24 11:45:22,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 11:45:22,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 11:45:22,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:22,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:22,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:45:22,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-01-24 11:45:24,270 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 68 treesize of output 54 [2018-01-24 11:45:24,275 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:24,299 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:24,300 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:24,301 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:24,301 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:24,302 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:24,302 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:24,303 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:24,303 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:24,304 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:24,304 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:24,305 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:24,305 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:24,306 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:24,306 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:24,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 25 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 187 [2018-01-24 11:45:24,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:45:24,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:45:24,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:45:24,421 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:89, output treesize:101 [2018-01-24 11:45:24,608 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:24,627 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:45:24,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 53 [2018-01-24 11:45:24,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-01-24 11:45:24,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-01-24 11:45:24,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=2480, Unknown=1, NotChecked=0, Total=2862 [2018-01-24 11:45:24,629 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 54 states. [2018-01-24 11:45:35,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 11:45:35,391 INFO L93 Difference]: Finished difference Result 187 states and 205 transitions. [2018-01-24 11:45:35,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-01-24 11:45:35,391 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 48 [2018-01-24 11:45:35,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 11:45:35,392 INFO L225 Difference]: With dead ends: 187 [2018-01-24 11:45:35,392 INFO L226 Difference]: Without dead ends: 186 [2018-01-24 11:45:35,394 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2380 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1040, Invalid=7148, Unknown=2, NotChecked=0, Total=8190 [2018-01-24 11:45:35,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-01-24 11:45:35,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 147. [2018-01-24 11:45:35,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-01-24 11:45:35,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 157 transitions. [2018-01-24 11:45:35,421 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 157 transitions. Word has length 48 [2018-01-24 11:45:35,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 11:45:35,421 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 157 transitions. [2018-01-24 11:45:35,421 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-01-24 11:45:35,421 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 157 transitions. [2018-01-24 11:45:35,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-24 11:45:35,422 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 11:45:35,422 INFO L322 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 11:45:35,422 INFO L371 AbstractCegarLoop]: === Iteration 30 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 11:45:35,422 INFO L82 PathProgramCache]: Analyzing trace with hash -823357064, now seen corresponding path program 5 times [2018-01-24 11:45:35,422 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 11:45:35,422 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 11:45:35,423 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:35,423 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 11:45:35,423 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 11:45:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 11:45:35,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 11:45:36,083 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 70 DAG size of output 36 [2018-01-24 11:45:36,230 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 80 DAG size of output 62 [2018-01-24 11:45:36,371 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 68 DAG size of output 57 [2018-01-24 11:45:36,517 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 68 DAG size of output 50 [2018-01-24 11:45:36,875 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 84 DAG size of output 60 [2018-01-24 11:45:37,026 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 86 DAG size of output 60 [2018-01-24 11:45:37,161 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 84 DAG size of output 55 [2018-01-24 11:45:37,717 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:37,717 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 11:45:37,718 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-24 11:45:37,722 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-24 11:45:37,729 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:45:37,730 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:45:37,731 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:45:37,732 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:45:37,735 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:45:37,743 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 11:45:37,747 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 11:45:37,751 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 11:45:37,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:45:37,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:37,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 11:45:37,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:37,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:37,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-01-24 11:45:37,856 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:37,857 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:37,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 11:45:37,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:37,866 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:37,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-01-24 11:45:37,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:37,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:37,874 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:19 [2018-01-24 11:45:37,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-24 11:45:37,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 11:45:37,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 11:45:37,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 11:45:37,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 11:45:37,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2018-01-24 11:45:38,553 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 41 treesize of output 31 [2018-01-24 11:45:38,555 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:38,556 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:38,557 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 11:45:38,565 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 31 treesize of output 53 [2018-01-24 11:45:38,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 11:45:38,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 11:45:38,602 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-24 11:45:38,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:151 [2018-01-24 11:45:38,957 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 11:45:38,977 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 11:45:38,977 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 51 [2018-01-24 11:45:38,978 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-01-24 11:45:38,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-01-24 11:45:38,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2516, Unknown=0, NotChecked=0, Total=2652 [2018-01-24 11:45:38,979 INFO L87 Difference]: Start difference. First operand 147 states and 157 transitions. Second operand 52 states. Received shutdown request... [2018-01-24 11:45:39,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 11:45:39,065 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 11:45:39,068 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 11:45:39,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:45:39 BoogieIcfgContainer [2018-01-24 11:45:39,069 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 11:45:39,069 INFO L168 Benchmark]: Toolchain (without parser) took 52491.85 ms. Allocated memory was 303.0 MB in the beginning and 708.8 MB in the end (delta: 405.8 MB). Free memory was 260.9 MB in the beginning and 666.4 MB in the end (delta: -405.5 MB). Peak memory consumption was 368.8 MB. Max. memory is 5.3 GB. [2018-01-24 11:45:39,070 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 303.0 MB. Free memory is still 266.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 11:45:39,070 INFO L168 Benchmark]: CACSL2BoogieTranslator took 210.40 ms. Allocated memory is still 303.0 MB. Free memory was 259.9 MB in the beginning and 249.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-24 11:45:39,071 INFO L168 Benchmark]: Boogie Preprocessor took 29.60 ms. Allocated memory is still 303.0 MB. Free memory was 249.8 MB in the beginning and 247.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:45:39,071 INFO L168 Benchmark]: RCFGBuilder took 253.43 ms. Allocated memory is still 303.0 MB. Free memory was 247.8 MB in the beginning and 228.8 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. [2018-01-24 11:45:39,071 INFO L168 Benchmark]: TraceAbstraction took 51990.57 ms. Allocated memory was 303.0 MB in the beginning and 708.8 MB in the end (delta: 405.8 MB). Free memory was 228.8 MB in the beginning and 666.4 MB in the end (delta: -437.6 MB). Peak memory consumption was 336.6 MB. Max. memory is 5.3 GB. [2018-01-24 11:45:39,073 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.19 ms. Allocated memory is still 303.0 MB. Free memory is still 266.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 210.40 ms. Allocated memory is still 303.0 MB. Free memory was 259.9 MB in the beginning and 249.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 29.60 ms. Allocated memory is still 303.0 MB. Free memory was 249.8 MB in the beginning and 247.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 253.43 ms. Allocated memory is still 303.0 MB. Free memory was 247.8 MB in the beginning and 228.8 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 51990.57 ms. Allocated memory was 303.0 MB in the beginning and 708.8 MB in the end (delta: 405.8 MB). Free memory was 228.8 MB in the beginning and 666.4 MB in the end (delta: -437.6 MB). Peak memory consumption was 336.6 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 constructing difference of abstraction (147states) and interpolant automaton (currently 5 states, 52 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 52 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (147states) and interpolant automaton (currently 5 states, 52 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 52 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (147states) and interpolant automaton (currently 5 states, 52 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 52 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (147states) and interpolant automaton (currently 5 states, 52 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 52 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (147states) and interpolant automaton (currently 5 states, 52 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 52 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (147states) and interpolant automaton (currently 5 states, 52 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 52 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was constructing difference of abstraction (147states) and interpolant automaton (currently 5 states, 52 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 52 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was constructing difference of abstraction (147states) and interpolant automaton (currently 5 states, 52 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 52 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was constructing difference of abstraction (147states) and interpolant automaton (currently 5 states, 52 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 52 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was constructing difference of abstraction (147states) and interpolant automaton (currently 5 states, 52 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 52 known predicates. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (147states) and interpolant automaton (currently 5 states, 52 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 52 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 50 locations, 11 error locations. TIMEOUT Result, 51.9s OverallTime, 30 OverallIterations, 8 TraceHistogramMax, 29.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1003 SDtfs, 2396 SDslu, 8477 SDs, 0 SdLazy, 9371 SolverSat, 879 SolverUnsat, 13 SolverUnknown, 0 SolverNotchecked, 13.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1219 GetRequests, 345 SyntacticMatches, 11 SemanticMatches, 862 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10107 ImplicationChecksByTransitivity, 30.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 29 MinimizatonAttempts, 387 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 20.6s InterpolantComputationTime, 1417 NumberOfCodeBlocks, 1415 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 1372 ConstructedInterpolants, 137 QuantifiedInterpolants, 841286 SizeOfPredicates, 207 NumberOfNonLiveVariables, 2522 ConjunctsInSsa, 779 ConjunctsInUnsatCore, 45 InterpolantComputations, 16 PerfectInterpolantSequences, 15/799 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_11-45-39-082.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.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_11-45-39-082.csv Completed graceful shutdown