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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 18:25:06,404 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 18:25:06,406 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 18:25:06,416 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 18:25:06,416 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 18:25:06,417 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 18:25:06,418 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 18:25:06,419 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 18:25:06,420 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 18:25:06,421 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 18:25:06,421 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 18:25:06,421 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 18:25:06,422 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 18:25:06,423 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 18:25:06,424 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 18:25:06,426 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 18:25:06,427 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 18:25:06,428 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 18:25:06,429 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 18:25:06,430 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 18:25:06,432 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 18:25:06,432 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 18:25:06,432 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 18:25:06,433 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 18:25:06,434 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 18:25:06,435 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 18:25:06,435 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 18:25:06,436 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 18:25:06,436 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 18:25:06,436 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 18:25:06,436 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 18:25:06,437 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 18:25:06,446 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 18:25:06,447 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 18:25:06,448 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 18:25:06,448 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 18:25:06,448 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 18:25:06,449 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 18:25:06,449 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 18:25:06,449 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 18:25:06,449 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 18:25:06,449 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 18:25:06,449 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 18:25:06,450 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 18:25:06,450 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 18:25:06,450 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 18:25:06,450 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 18:25:06,450 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 18:25:06,450 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 18:25:06,451 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 18:25:06,451 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 18:25:06,451 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 18:25:06,451 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 18:25:06,451 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 18:25:06,451 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 18:25:06,451 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 18:25:06,452 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 18:25:06,481 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 18:25:06,490 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 18:25:06,493 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 18:25:06,495 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 18:25:06,495 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 18:25:06,496 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-02-02 18:25:06,627 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 18:25:06,628 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 18:25:06,629 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 18:25:06,629 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 18:25:06,634 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 18:25:06,635 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:25:06" (1/1) ... [2018-02-02 18:25:06,637 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@309783a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:25:06, skipping insertion in model container [2018-02-02 18:25:06,637 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:25:06" (1/1) ... [2018-02-02 18:25:06,652 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:25:06,682 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:25:06,766 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:25:06,780 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:25:06,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:25:06 WrapperNode [2018-02-02 18:25:06,784 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 18:25:06,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 18:25:06,785 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 18:25:06,785 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 18:25:06,793 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:25:06" (1/1) ... [2018-02-02 18:25:06,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:25:06" (1/1) ... [2018-02-02 18:25:06,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:25:06" (1/1) ... [2018-02-02 18:25:06,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:25:06" (1/1) ... [2018-02-02 18:25:06,807 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:25:06" (1/1) ... [2018-02-02 18:25:06,810 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:25:06" (1/1) ... [2018-02-02 18:25:06,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:25:06" (1/1) ... [2018-02-02 18:25:06,813 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 18:25:06,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 18:25:06,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 18:25:06,813 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 18:25:06,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:25:06" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-02 18:25:06,847 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 18:25:06,847 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 18:25:06,847 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcat [2018-02-02 18:25:06,847 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 18:25:06,847 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 18:25:06,848 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 18:25:06,848 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 18:25:06,848 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 18:25:06,848 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 18:25:06,848 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 18:25:06,848 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcat [2018-02-02 18:25:06,848 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 18:25:06,848 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 18:25:06,848 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 18:25:06,987 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 18:25:06,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:25:06 BoogieIcfgContainer [2018-02-02 18:25:06,988 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 18:25:06,989 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 18:25:06,989 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 18:25:06,991 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 18:25:06,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 06:25:06" (1/3) ... [2018-02-02 18:25:06,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18c850c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:25:06, skipping insertion in model container [2018-02-02 18:25:06,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:25:06" (2/3) ... [2018-02-02 18:25:06,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18c850c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:25:06, skipping insertion in model container [2018-02-02 18:25:06,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:25:06" (3/3) ... [2018-02-02 18:25:06,994 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-02-02 18:25:07,000 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 18:25:07,005 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-02-02 18:25:07,040 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 18:25:07,041 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 18:25:07,041 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 18:25:07,041 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 18:25:07,041 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 18:25:07,041 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 18:25:07,041 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 18:25:07,042 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 18:25:07,042 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 18:25:07,055 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-02-02 18:25:07,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-02 18:25:07,063 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:25:07,064 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:25:07,064 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:25:07,068 INFO L82 PathProgramCache]: Analyzing trace with hash 967400660, now seen corresponding path program 1 times [2018-02-02 18:25:07,070 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:25:07,071 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:25:07,114 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:07,115 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:25:07,115 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:07,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:25:07,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:25:07,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:25:07,193 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:25:07,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 18:25:07,194 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:25:07,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:25:07,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:25:07,205 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2018-02-02 18:25:07,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:25:07,275 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-02-02 18:25:07,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:25:07,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-02-02 18:25:07,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:25:07,347 INFO L225 Difference]: With dead ends: 51 [2018-02-02 18:25:07,347 INFO L226 Difference]: Without dead ends: 47 [2018-02-02 18:25:07,349 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:25:07,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-02 18:25:07,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-02 18:25:07,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-02 18:25:07,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-02-02 18:25:07,382 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 11 [2018-02-02 18:25:07,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:25:07,382 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-02-02 18:25:07,384 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:25:07,384 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-02-02 18:25:07,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 18:25:07,384 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:25:07,384 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:25:07,385 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:25:07,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1512837349, now seen corresponding path program 1 times [2018-02-02 18:25:07,385 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:25:07,385 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:25:07,386 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:07,386 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:25:07,386 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:25:07,406 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:25:07,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:25:07,457 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:25:07,457 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:25:07,458 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:25:07,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:25:07,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:25:07,459 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 4 states. [2018-02-02 18:25:07,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:25:07,514 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-02-02 18:25:07,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:25:07,515 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-02 18:25:07,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:25:07,516 INFO L225 Difference]: With dead ends: 46 [2018-02-02 18:25:07,516 INFO L226 Difference]: Without dead ends: 46 [2018-02-02 18:25:07,517 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:25:07,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-02 18:25:07,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-02 18:25:07,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-02 18:25:07,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-02-02 18:25:07,521 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 15 [2018-02-02 18:25:07,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:25:07,522 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-02-02 18:25:07,522 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:25:07,522 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-02-02 18:25:07,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 18:25:07,523 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:25:07,523 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:25:07,523 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:25:07,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1512837350, now seen corresponding path program 1 times [2018-02-02 18:25:07,523 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:25:07,523 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:25:07,524 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:07,524 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:25:07,524 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:25:07,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:25:07,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:25:07,627 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:25:07,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 18:25:07,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 18:25:07,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 18:25:07,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 18:25:07,629 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 6 states. [2018-02-02 18:25:07,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:25:07,727 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-02-02 18:25:07,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 18:25:07,728 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-02-02 18:25:07,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:25:07,729 INFO L225 Difference]: With dead ends: 45 [2018-02-02 18:25:07,729 INFO L226 Difference]: Without dead ends: 45 [2018-02-02 18:25:07,729 INFO L554 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-02-02 18:25:07,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-02 18:25:07,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-02 18:25:07,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-02 18:25:07,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-02-02 18:25:07,733 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 15 [2018-02-02 18:25:07,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:25:07,733 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-02-02 18:25:07,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 18:25:07,733 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-02-02 18:25:07,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 18:25:07,734 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:25:07,734 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:25:07,734 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:25:07,734 INFO L82 PathProgramCache]: Analyzing trace with hash -346682393, now seen corresponding path program 1 times [2018-02-02 18:25:07,734 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:25:07,735 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:25:07,736 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:07,736 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:25:07,736 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:25:07,748 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:25:07,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:25:07,784 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:25:07,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:25:07,784 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:25:07,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:25:07,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:25:07,785 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 4 states. [2018-02-02 18:25:07,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:25:07,816 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-02-02 18:25:07,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:25:07,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-02 18:25:07,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:25:07,817 INFO L225 Difference]: With dead ends: 44 [2018-02-02 18:25:07,817 INFO L226 Difference]: Without dead ends: 44 [2018-02-02 18:25:07,818 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:25:07,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-02 18:25:07,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-02-02 18:25:07,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-02 18:25:07,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-02-02 18:25:07,820 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 16 [2018-02-02 18:25:07,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:25:07,820 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-02-02 18:25:07,820 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:25:07,820 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-02-02 18:25:07,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 18:25:07,821 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:25:07,821 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:25:07,821 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:25:07,821 INFO L82 PathProgramCache]: Analyzing trace with hash -346682392, now seen corresponding path program 1 times [2018-02-02 18:25:07,821 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:25:07,821 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:25:07,822 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:07,822 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:25:07,822 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:07,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:25:07,833 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:25:07,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:25:07,885 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:25:07,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 18:25:07,886 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 18:25:07,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 18:25:07,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 18:25:07,886 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-02-02 18:25:07,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:25:07,953 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-02-02 18:25:07,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 18:25:07,953 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-02-02 18:25:07,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:25:07,955 INFO L225 Difference]: With dead ends: 59 [2018-02-02 18:25:07,955 INFO L226 Difference]: Without dead ends: 59 [2018-02-02 18:25:07,955 INFO L554 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-02-02 18:25:07,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-02 18:25:07,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2018-02-02 18:25:07,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-02 18:25:07,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-02-02 18:25:07,960 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 16 [2018-02-02 18:25:07,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:25:07,960 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-02-02 18:25:07,960 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 18:25:07,960 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-02-02 18:25:07,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 18:25:07,961 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:25:07,961 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:25:07,961 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:25:07,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1156029018, now seen corresponding path program 1 times [2018-02-02 18:25:07,961 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:25:07,961 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:25:07,961 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:07,962 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:25:07,962 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:25:07,971 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:25:08,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:25:08,019 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:25:08,019 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 18:25:08,019 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 18:25:08,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 18:25:08,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 18:25:08,019 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 7 states. [2018-02-02 18:25:08,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:25:08,079 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-02-02 18:25:08,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 18:25:08,079 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-02-02 18:25:08,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:25:08,079 INFO L225 Difference]: With dead ends: 50 [2018-02-02 18:25:08,079 INFO L226 Difference]: Without dead ends: 50 [2018-02-02 18:25:08,080 INFO L554 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-02-02 18:25:08,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-02 18:25:08,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2018-02-02 18:25:08,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-02 18:25:08,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-02-02 18:25:08,081 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 16 [2018-02-02 18:25:08,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:25:08,082 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-02-02 18:25:08,082 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 18:25:08,082 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-02-02 18:25:08,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 18:25:08,082 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:25:08,082 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:25:08,082 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:25:08,082 INFO L82 PathProgramCache]: Analyzing trace with hash -131455439, now seen corresponding path program 1 times [2018-02-02 18:25:08,082 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:25:08,083 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:25:08,083 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:08,083 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:25:08,083 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:25:08,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:25:08,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:25:08,122 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:25:08,123 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 18:25:08,123 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 18:25:08,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 18:25:08,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:25:08,123 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2018-02-02 18:25:08,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:25:08,163 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-02-02 18:25:08,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 18:25:08,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-02 18:25:08,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:25:08,164 INFO L225 Difference]: With dead ends: 42 [2018-02-02 18:25:08,164 INFO L226 Difference]: Without dead ends: 42 [2018-02-02 18:25:08,164 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 18:25:08,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-02 18:25:08,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-02-02 18:25:08,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-02 18:25:08,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-02-02 18:25:08,166 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 20 [2018-02-02 18:25:08,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:25:08,167 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-02-02 18:25:08,167 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 18:25:08,167 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-02-02 18:25:08,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 18:25:08,167 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:25:08,167 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:25:08,168 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:25:08,168 INFO L82 PathProgramCache]: Analyzing trace with hash -131455438, now seen corresponding path program 1 times [2018-02-02 18:25:08,168 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:25:08,168 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:25:08,169 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:08,169 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:25:08,169 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:08,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:25:08,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:25:08,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:25:08,227 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:25:08,227 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 18:25:08,228 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 18:25:08,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 18:25:08,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 18:25:08,228 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 7 states. [2018-02-02 18:25:08,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:25:08,304 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-02-02 18:25:08,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 18:25:08,305 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-02-02 18:25:08,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:25:08,306 INFO L225 Difference]: With dead ends: 48 [2018-02-02 18:25:08,306 INFO L226 Difference]: Without dead ends: 48 [2018-02-02 18:25:08,306 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-02-02 18:25:08,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-02 18:25:08,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-02-02 18:25:08,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-02 18:25:08,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-02-02 18:25:08,310 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 20 [2018-02-02 18:25:08,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:25:08,310 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-02-02 18:25:08,310 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 18:25:08,310 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-02-02 18:25:08,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 18:25:08,311 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:25:08,311 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:25:08,311 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:25:08,311 INFO L82 PathProgramCache]: Analyzing trace with hash -313436100, now seen corresponding path program 1 times [2018-02-02 18:25:08,311 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:25:08,312 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:25:08,312 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:08,312 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:25:08,312 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:25:08,322 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:25:08,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:25:08,354 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:25:08,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 18:25:08,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 18:25:08,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 18:25:08,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 18:25:08,355 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-02-02 18:25:08,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:25:08,419 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-02-02 18:25:08,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 18:25:08,420 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-02 18:25:08,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:25:08,420 INFO L225 Difference]: With dead ends: 43 [2018-02-02 18:25:08,420 INFO L226 Difference]: Without dead ends: 43 [2018-02-02 18:25:08,421 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-02 18:25:08,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-02 18:25:08,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-02-02 18:25:08,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-02 18:25:08,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-02-02 18:25:08,424 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 24 [2018-02-02 18:25:08,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:25:08,424 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-02-02 18:25:08,424 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 18:25:08,424 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-02-02 18:25:08,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 18:25:08,425 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:25:08,425 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:25:08,425 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:25:08,425 INFO L82 PathProgramCache]: Analyzing trace with hash -313436099, now seen corresponding path program 1 times [2018-02-02 18:25:08,426 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:25:08,426 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:25:08,426 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:08,429 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:25:08,429 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:25:08,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:25:08,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:25:08,518 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:25:08,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 18:25:08,518 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 18:25:08,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 18:25:08,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 18:25:08,519 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 9 states. [2018-02-02 18:25:08,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:25:08,612 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-02-02 18:25:08,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 18:25:08,612 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-02-02 18:25:08,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:25:08,612 INFO L225 Difference]: With dead ends: 50 [2018-02-02 18:25:08,612 INFO L226 Difference]: Without dead ends: 50 [2018-02-02 18:25:08,613 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-02-02 18:25:08,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-02 18:25:08,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2018-02-02 18:25:08,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-02 18:25:08,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-02-02 18:25:08,614 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 24 [2018-02-02 18:25:08,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:25:08,615 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-02-02 18:25:08,615 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 18:25:08,615 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-02-02 18:25:08,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 18:25:08,615 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:25:08,616 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:25:08,616 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:25:08,616 INFO L82 PathProgramCache]: Analyzing trace with hash -313382859, now seen corresponding path program 1 times [2018-02-02 18:25:08,616 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:25:08,616 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:25:08,617 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:08,617 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:25:08,617 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:25:08,624 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:25:08,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:25:08,699 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:25:08,699 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 18:25:08,707 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:25:08,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:25:08,742 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:25:08,786 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-02-02 18:25:08,787 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-02-02 18:25:08,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:08,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:25:08,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:25:08,792 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-02-02 18:25:08,829 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-02-02 18:25:08,835 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-02-02 18:25:08,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:08,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:25:08,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:25:08,837 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-02-02 18:25:08,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:25:08,881 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:25:08,882 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2018-02-02 18:25:08,882 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 18:25:08,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 18:25:08,882 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-02-02 18:25:08,882 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 13 states. [2018-02-02 18:25:09,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:25:09,204 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2018-02-02 18:25:09,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 18:25:09,204 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-02-02 18:25:09,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:25:09,206 INFO L225 Difference]: With dead ends: 91 [2018-02-02 18:25:09,206 INFO L226 Difference]: Without dead ends: 91 [2018-02-02 18:25:09,206 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2018-02-02 18:25:09,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-02 18:25:09,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 62. [2018-02-02 18:25:09,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-02 18:25:09,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-02-02 18:25:09,211 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 24 [2018-02-02 18:25:09,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:25:09,212 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-02-02 18:25:09,212 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 18:25:09,212 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-02-02 18:25:09,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 18:25:09,212 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:25:09,213 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:25:09,213 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:25:09,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1126584510, now seen corresponding path program 1 times [2018-02-02 18:25:09,213 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:25:09,213 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:25:09,214 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:09,214 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:25:09,214 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:25:09,223 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:25:09,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:25:09,251 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:25:09,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 18:25:09,251 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 18:25:09,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 18:25:09,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 18:25:09,252 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 6 states. [2018-02-02 18:25:09,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:25:09,305 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2018-02-02 18:25:09,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 18:25:09,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-02 18:25:09,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:25:09,306 INFO L225 Difference]: With dead ends: 61 [2018-02-02 18:25:09,306 INFO L226 Difference]: Without dead ends: 61 [2018-02-02 18:25:09,306 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-02 18:25:09,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-02 18:25:09,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-02-02 18:25:09,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-02 18:25:09,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2018-02-02 18:25:09,309 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 25 [2018-02-02 18:25:09,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:25:09,309 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2018-02-02 18:25:09,309 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 18:25:09,310 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2018-02-02 18:25:09,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 18:25:09,310 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:25:09,310 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:25:09,312 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:25:09,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1126584509, now seen corresponding path program 1 times [2018-02-02 18:25:09,312 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:25:09,312 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:25:09,313 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:09,313 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:25:09,313 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:25:09,322 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:25:09,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:25:09,432 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:25:09,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 18:25:09,432 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 18:25:09,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 18:25:09,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 18:25:09,433 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 8 states. [2018-02-02 18:25:09,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:25:09,546 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2018-02-02 18:25:09,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 18:25:09,547 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-02-02 18:25:09,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:25:09,547 INFO L225 Difference]: With dead ends: 66 [2018-02-02 18:25:09,547 INFO L226 Difference]: Without dead ends: 66 [2018-02-02 18:25:09,548 INFO L554 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-02-02 18:25:09,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-02 18:25:09,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-02-02 18:25:09,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-02 18:25:09,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2018-02-02 18:25:09,550 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 25 [2018-02-02 18:25:09,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:25:09,550 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2018-02-02 18:25:09,550 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 18:25:09,550 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2018-02-02 18:25:09,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 18:25:09,551 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:25:09,551 INFO L351 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-02-02 18:25:09,551 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:25:09,551 INFO L82 PathProgramCache]: Analyzing trace with hash -99148426, now seen corresponding path program 1 times [2018-02-02 18:25:09,551 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:25:09,551 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:25:09,552 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:09,552 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:25:09,552 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:09,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:25:09,558 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:25:09,643 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 18:25:09,643 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:25:09,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 18:25:09,643 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 18:25:09,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 18:25:09,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-02 18:25:09,644 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 12 states. [2018-02-02 18:25:09,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:25:09,788 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2018-02-02 18:25:09,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 18:25:09,788 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-02-02 18:25:09,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:25:09,789 INFO L225 Difference]: With dead ends: 104 [2018-02-02 18:25:09,789 INFO L226 Difference]: Without dead ends: 104 [2018-02-02 18:25:09,789 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2018-02-02 18:25:09,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-02 18:25:09,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 66. [2018-02-02 18:25:09,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-02 18:25:09,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2018-02-02 18:25:09,792 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 28 [2018-02-02 18:25:09,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:25:09,792 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2018-02-02 18:25:09,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 18:25:09,792 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-02-02 18:25:09,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 18:25:09,793 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:25:09,793 INFO L351 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-02-02 18:25:09,793 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:25:09,794 INFO L82 PathProgramCache]: Analyzing trace with hash 323553400, now seen corresponding path program 1 times [2018-02-02 18:25:09,794 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:25:09,794 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:25:09,795 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:09,795 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:25:09,795 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:09,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:25:09,805 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:25:09,951 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:25:09,951 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:25:09,951 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 18:25:09,956 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:25:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:25:09,986 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:25:09,992 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-02-02 18:25:09,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:09,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:25:09,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-02 18:25:10,041 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-02-02 18:25:10,044 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-02-02 18:25:10,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:10,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:25:10,052 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-02-02 18:25:10,052 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-02-02 18:25:10,148 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-02-02 18:25:10,156 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-02-02 18:25:10,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 18:25:10,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:25:10,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:25:10,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:35 [2018-02-02 18:25:10,277 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:25:10,296 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:25:10,296 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2018-02-02 18:25:10,296 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 18:25:10,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 18:25:10,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2018-02-02 18:25:10,296 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 22 states. [2018-02-02 18:25:11,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:25:11,273 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2018-02-02 18:25:11,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 18:25:11,273 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2018-02-02 18:25:11,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:25:11,274 INFO L225 Difference]: With dead ends: 87 [2018-02-02 18:25:11,274 INFO L226 Difference]: Without dead ends: 87 [2018-02-02 18:25:11,274 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=969, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 18:25:11,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-02 18:25:11,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2018-02-02 18:25:11,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-02 18:25:11,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2018-02-02 18:25:11,278 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 28 [2018-02-02 18:25:11,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:25:11,278 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2018-02-02 18:25:11,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 18:25:11,278 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2018-02-02 18:25:11,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 18:25:11,279 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:25:11,279 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:25:11,280 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:25:11,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1309566295, now seen corresponding path program 1 times [2018-02-02 18:25:11,280 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:25:11,280 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:25:11,281 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:11,281 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:25:11,281 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:25:11,291 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:25:11,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:25:11,499 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:25:11,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-02-02 18:25:11,499 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 18:25:11,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 18:25:11,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-02-02 18:25:11,500 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 15 states. [2018-02-02 18:25:11,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:25:11,835 INFO L93 Difference]: Finished difference Result 161 states and 178 transitions. [2018-02-02 18:25:11,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 18:25:11,835 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-02-02 18:25:11,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:25:11,836 INFO L225 Difference]: With dead ends: 161 [2018-02-02 18:25:11,836 INFO L226 Difference]: Without dead ends: 161 [2018-02-02 18:25:11,836 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=233, Invalid=889, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 18:25:11,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-02 18:25:11,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 135. [2018-02-02 18:25:11,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-02 18:25:11,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 154 transitions. [2018-02-02 18:25:11,841 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 154 transitions. Word has length 29 [2018-02-02 18:25:11,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:25:11,841 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 154 transitions. [2018-02-02 18:25:11,841 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 18:25:11,841 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 154 transitions. [2018-02-02 18:25:11,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 18:25:11,842 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:25:11,842 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:25:11,843 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:25:11,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1528421013, now seen corresponding path program 1 times [2018-02-02 18:25:11,843 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:25:11,843 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:25:11,844 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:11,844 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:25:11,844 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:25:11,852 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:25:12,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:25:12,021 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:25:12,021 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 18:25:12,026 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:25:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:25:12,040 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:25:12,042 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-02-02 18:25:12,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:12,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:25:12,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 18:25:12,066 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:25:12,066 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:25:12,068 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-02-02 18:25:12,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:12,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:25:12,071 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-02 18:25:12,096 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-02-02 18:25:12,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-02 18:25:12,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:12,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:25:12,102 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-02-02 18:25:12,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-02-02 18:25:12,121 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-02-02 18:25:12,128 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-02-02 18:25:12,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:12,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:25:12,136 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-02-02 18:25:12,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-02-02 18:25:12,280 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-02-02 18:25:12,288 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-02-02 18:25:12,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 18:25:12,298 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-02-02 18:25:12,298 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:12,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:25:12,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:25:12,317 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-02-02 18:25:12,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:25:12,387 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:25:12,388 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 23 [2018-02-02 18:25:12,389 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 18:25:12,389 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 18:25:12,389 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2018-02-02 18:25:12,389 INFO L87 Difference]: Start difference. First operand 135 states and 154 transitions. Second operand 24 states. [2018-02-02 18:25:13,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:25:13,537 INFO L93 Difference]: Finished difference Result 144 states and 165 transitions. [2018-02-02 18:25:13,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 18:25:13,538 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 29 [2018-02-02 18:25:13,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:25:13,539 INFO L225 Difference]: With dead ends: 144 [2018-02-02 18:25:13,539 INFO L226 Difference]: Without dead ends: 144 [2018-02-02 18:25:13,540 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=174, Invalid=1085, Unknown=1, NotChecked=0, Total=1260 [2018-02-02 18:25:13,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-02-02 18:25:13,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2018-02-02 18:25:13,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-02 18:25:13,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 161 transitions. [2018-02-02 18:25:13,544 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 161 transitions. Word has length 29 [2018-02-02 18:25:13,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:25:13,545 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 161 transitions. [2018-02-02 18:25:13,545 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 18:25:13,545 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 161 transitions. [2018-02-02 18:25:13,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 18:25:13,545 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:25:13,546 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:25:13,546 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:25:13,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1438570336, now seen corresponding path program 1 times [2018-02-02 18:25:13,546 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:25:13,546 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:25:13,546 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:13,546 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:25:13,546 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:25:13,551 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:25:13,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:25:13,626 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:25:13,626 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 18:25:13,631 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:25:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:25:13,650 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:25:13,655 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-02-02 18:25:13,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:13,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:25:13,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-02 18:25:13,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:25:13,740 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:25:13,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2018-02-02 18:25:13,740 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 18:25:13,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 18:25:13,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-02 18:25:13,740 INFO L87 Difference]: Start difference. First operand 140 states and 161 transitions. Second operand 15 states. [2018-02-02 18:25:13,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:25:13,849 INFO L93 Difference]: Finished difference Result 153 states and 175 transitions. [2018-02-02 18:25:13,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 18:25:13,849 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-02-02 18:25:13,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:25:13,850 INFO L225 Difference]: With dead ends: 153 [2018-02-02 18:25:13,851 INFO L226 Difference]: Without dead ends: 153 [2018-02-02 18:25:13,851 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-02-02 18:25:13,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-02 18:25:13,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 145. [2018-02-02 18:25:13,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-02 18:25:13,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 165 transitions. [2018-02-02 18:25:13,853 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 165 transitions. Word has length 29 [2018-02-02 18:25:13,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:25:13,853 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 165 transitions. [2018-02-02 18:25:13,853 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 18:25:13,854 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 165 transitions. [2018-02-02 18:25:13,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 18:25:13,854 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:25:13,854 INFO L351 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-02-02 18:25:13,854 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:25:13,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1106610309, now seen corresponding path program 2 times [2018-02-02 18:25:13,855 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:25:13,855 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:25:13,855 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:13,855 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:25:13,855 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:25:13,863 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:25:14,327 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:25:14,327 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:25:14,327 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 18:25:14,332 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 18:25:14,344 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 18:25:14,344 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:25:14,346 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:25:14,360 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-02-02 18:25:14,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:14,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:25:14,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-02 18:25:14,394 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-02-02 18:25:14,395 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-02-02 18:25:14,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:14,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:25:14,400 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-02-02 18:25:14,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-02-02 18:25:14,520 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-02-02 18:25:14,523 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:25:14,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-02-02 18:25:14,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 18:25:14,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:25:14,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:25:14,550 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:58 [2018-02-02 18:25:14,634 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:25:14,651 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:25:14,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 33 [2018-02-02 18:25:14,652 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 18:25:14,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 18:25:14,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=991, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 18:25:14,653 INFO L87 Difference]: Start difference. First operand 145 states and 165 transitions. Second operand 34 states. [2018-02-02 18:25:15,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:25:15,288 INFO L93 Difference]: Finished difference Result 190 states and 216 transitions. [2018-02-02 18:25:15,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 18:25:15,288 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 32 [2018-02-02 18:25:15,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:25:15,289 INFO L225 Difference]: With dead ends: 190 [2018-02-02 18:25:15,289 INFO L226 Difference]: Without dead ends: 190 [2018-02-02 18:25:15,289 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=304, Invalid=2048, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 18:25:15,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-02-02 18:25:15,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 157. [2018-02-02 18:25:15,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-02 18:25:15,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 180 transitions. [2018-02-02 18:25:15,293 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 180 transitions. Word has length 32 [2018-02-02 18:25:15,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:25:15,293 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 180 transitions. [2018-02-02 18:25:15,293 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 18:25:15,293 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 180 transitions. [2018-02-02 18:25:15,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 18:25:15,294 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:25:15,294 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:25:15,294 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:25:15,295 INFO L82 PathProgramCache]: Analyzing trace with hash 53168317, now seen corresponding path program 2 times [2018-02-02 18:25:15,295 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:25:15,295 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:25:15,295 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:15,296 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:25:15,296 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:15,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:25:15,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:25:15,375 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:25:15,375 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:25:15,375 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 18:25:15,380 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 18:25:15,396 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-02 18:25:15,396 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:25:15,397 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:25:15,418 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 18:25:15,436 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:25:15,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2018-02-02 18:25:15,436 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 18:25:15,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 18:25:15,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-02-02 18:25:15,437 INFO L87 Difference]: Start difference. First operand 157 states and 180 transitions. Second operand 12 states. [2018-02-02 18:25:15,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:25:15,554 INFO L93 Difference]: Finished difference Result 162 states and 184 transitions. [2018-02-02 18:25:15,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 18:25:15,554 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2018-02-02 18:25:15,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:25:15,555 INFO L225 Difference]: With dead ends: 162 [2018-02-02 18:25:15,555 INFO L226 Difference]: Without dead ends: 162 [2018-02-02 18:25:15,555 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2018-02-02 18:25:15,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-02 18:25:15,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2018-02-02 18:25:15,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-02 18:25:15,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 169 transitions. [2018-02-02 18:25:15,558 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 169 transitions. Word has length 33 [2018-02-02 18:25:15,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:25:15,559 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 169 transitions. [2018-02-02 18:25:15,559 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 18:25:15,559 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 169 transitions. [2018-02-02 18:25:15,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 18:25:15,559 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:25:15,559 INFO L351 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-02-02 18:25:15,559 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:25:15,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1452172801, now seen corresponding path program 2 times [2018-02-02 18:25:15,559 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:25:15,559 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:25:15,560 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:15,560 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:25:15,560 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:25:15,570 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:25:15,916 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:25:15,916 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:25:15,916 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 18:25:15,922 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 18:25:15,940 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 18:25:15,940 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:25:15,943 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:25:15,952 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-02-02 18:25:15,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:15,956 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-02-02 18:25:15,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:15,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:25:15,961 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-02 18:25:15,968 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:25:15,969 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-02-02 18:25:15,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:15,984 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:25:15,985 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:25:15,985 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-02-02 18:25:15,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:15,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:25:15,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-02-02 18:25:16,017 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-02-02 18:25:16,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-02 18:25:16,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:16,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:25:16,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:25:16,022 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:20 [2018-02-02 18:25:16,045 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-02-02 18:25:16,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-02 18:25:16,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:16,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:25:16,063 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-02-02 18:25:16,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:30 [2018-02-02 18:25:16,187 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-02-02 18:25:16,194 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-02-02 18:25:16,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 18:25:16,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:25:16,213 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-02-02 18:25:16,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:43, output treesize:51 [2018-02-02 18:25:16,272 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-02-02 18:25:16,276 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-02-02 18:25:16,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 18:25:16,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:25:16,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:25:16,283 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:38 [2018-02-02 18:25:16,354 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:25:16,372 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:25:16,372 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2018-02-02 18:25:16,373 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 18:25:16,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 18:25:16,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2018-02-02 18:25:16,373 INFO L87 Difference]: Start difference. First operand 149 states and 169 transitions. Second operand 29 states. [2018-02-02 18:25:16,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:25:16,981 INFO L93 Difference]: Finished difference Result 161 states and 184 transitions. [2018-02-02 18:25:16,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 18:25:16,981 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 34 [2018-02-02 18:25:16,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:25:16,982 INFO L225 Difference]: With dead ends: 161 [2018-02-02 18:25:16,982 INFO L226 Difference]: Without dead ends: 161 [2018-02-02 18:25:16,982 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=175, Invalid=1465, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 18:25:16,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-02 18:25:16,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 154. [2018-02-02 18:25:16,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-02-02 18:25:16,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 176 transitions. [2018-02-02 18:25:16,987 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 176 transitions. Word has length 34 [2018-02-02 18:25:16,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:25:16,987 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 176 transitions. [2018-02-02 18:25:16,988 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 18:25:16,988 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 176 transitions. [2018-02-02 18:25:16,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 18:25:16,988 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:25:16,988 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:25:16,988 INFO L371 AbstractCegarLoop]: === Iteration 22 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:25:16,988 INFO L82 PathProgramCache]: Analyzing trace with hash 357476204, now seen corresponding path program 1 times [2018-02-02 18:25:16,988 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:25:16,989 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:25:16,989 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:16,989 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:25:16,989 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:25:16,997 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:25:17,192 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:25:17,193 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:25:17,193 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 18:25:17,201 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:25:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:25:17,228 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:25:17,235 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-02-02 18:25:17,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:17,241 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-02-02 18:25:17,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:17,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:25:17,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-02-02 18:25:17,283 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:25:17,284 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:25:17,284 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-02-02 18:25:17,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:17,289 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:25:17,290 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-02-02 18:25:17,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:17,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:25:17,308 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-02-02 18:25:17,535 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:25:17,564 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:25:17,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2018-02-02 18:25:17,565 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 18:25:17,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 18:25:17,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2018-02-02 18:25:17,565 INFO L87 Difference]: Start difference. First operand 154 states and 176 transitions. Second operand 28 states. [2018-02-02 18:25:18,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:25:18,210 INFO L93 Difference]: Finished difference Result 199 states and 228 transitions. [2018-02-02 18:25:18,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 18:25:18,210 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 34 [2018-02-02 18:25:18,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:25:18,211 INFO L225 Difference]: With dead ends: 199 [2018-02-02 18:25:18,211 INFO L226 Difference]: Without dead ends: 199 [2018-02-02 18:25:18,212 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=237, Invalid=1925, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 18:25:18,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-02-02 18:25:18,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 163. [2018-02-02 18:25:18,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-02 18:25:18,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 188 transitions. [2018-02-02 18:25:18,217 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 188 transitions. Word has length 34 [2018-02-02 18:25:18,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:25:18,217 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 188 transitions. [2018-02-02 18:25:18,217 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 18:25:18,217 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 188 transitions. [2018-02-02 18:25:18,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 18:25:18,218 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:25:18,218 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:25:18,218 INFO L371 AbstractCegarLoop]: === Iteration 23 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:25:18,218 INFO L82 PathProgramCache]: Analyzing trace with hash -679902947, now seen corresponding path program 1 times [2018-02-02 18:25:18,218 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:25:18,218 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:25:18,219 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:18,219 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:25:18,219 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:18,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:25:18,226 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:25:18,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:25:18,271 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:25:18,271 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 18:25:18,271 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 18:25:18,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 18:25:18,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 18:25:18,272 INFO L87 Difference]: Start difference. First operand 163 states and 188 transitions. Second operand 6 states. [2018-02-02 18:25:18,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:25:18,332 INFO L93 Difference]: Finished difference Result 162 states and 187 transitions. [2018-02-02 18:25:18,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 18:25:18,333 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-02-02 18:25:18,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:25:18,333 INFO L225 Difference]: With dead ends: 162 [2018-02-02 18:25:18,333 INFO L226 Difference]: Without dead ends: 121 [2018-02-02 18:25:18,333 INFO L554 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-02-02 18:25:18,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-02 18:25:18,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 116. [2018-02-02 18:25:18,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-02 18:25:18,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 125 transitions. [2018-02-02 18:25:18,335 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 125 transitions. Word has length 35 [2018-02-02 18:25:18,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:25:18,335 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 125 transitions. [2018-02-02 18:25:18,335 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 18:25:18,335 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2018-02-02 18:25:18,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 18:25:18,335 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:25:18,335 INFO L351 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-02-02 18:25:18,336 INFO L371 AbstractCegarLoop]: === Iteration 24 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:25:18,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1017556222, now seen corresponding path program 3 times [2018-02-02 18:25:18,336 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:25:18,336 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:25:18,336 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:18,336 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:25:18,336 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:25:18,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:25:18,765 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:25:18,765 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:25:18,765 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 18:25:18,772 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 18:25:18,796 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-02-02 18:25:18,797 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:25:18,799 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:25:18,826 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-02-02 18:25:18,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:18,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:25:18,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-02 18:25:18,863 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-02-02 18:25:18,865 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-02-02 18:25:18,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:18,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:25:18,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:25:18,870 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-02-02 18:25:19,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-02-02 18:25:19,149 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-02-02 18:25:19,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 10 xjuncts. [2018-02-02 18:25:19,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:25:19,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:25:19,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:61 [2018-02-02 18:25:19,342 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:25:19,360 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:25:19,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 39 [2018-02-02 18:25:19,360 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-02 18:25:19,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-02 18:25:19,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1427, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 18:25:19,361 INFO L87 Difference]: Start difference. First operand 116 states and 125 transitions. Second operand 40 states. [2018-02-02 18:25:20,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:25:20,386 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2018-02-02 18:25:20,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 18:25:20,386 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 36 [2018-02-02 18:25:20,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:25:20,386 INFO L225 Difference]: With dead ends: 151 [2018-02-02 18:25:20,386 INFO L226 Difference]: Without dead ends: 151 [2018-02-02 18:25:20,387 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=324, Invalid=2868, Unknown=0, NotChecked=0, Total=3192 [2018-02-02 18:25:20,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-02 18:25:20,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 124. [2018-02-02 18:25:20,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 18:25:20,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-02-02 18:25:20,389 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 36 [2018-02-02 18:25:20,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:25:20,390 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-02-02 18:25:20,390 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-02 18:25:20,390 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-02-02 18:25:20,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 18:25:20,390 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:25:20,390 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:25:20,391 INFO L371 AbstractCegarLoop]: === Iteration 25 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:25:20,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1572046895, now seen corresponding path program 2 times [2018-02-02 18:25:20,391 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:25:20,391 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:25:20,392 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:20,392 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:25:20,392 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:20,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:25:20,401 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:25:20,638 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:25:20,638 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:25:20,638 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 18:25:20,643 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 18:25:20,660 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 18:25:20,660 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:25:20,662 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:25:20,666 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-02-02 18:25:20,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:20,672 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-02-02 18:25:20,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:20,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:25:20,676 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-02-02 18:25:20,710 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:25:20,711 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:25:20,711 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-02-02 18:25:20,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:20,716 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:25:20,716 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-02-02 18:25:20,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:20,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:25:20,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-02-02 18:25:20,754 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-02-02 18:25:20,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 11 treesize of output 10 [2018-02-02 18:25:20,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:20,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:25:20,759 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-02-02 18:25:20,759 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-02-02 18:25:20,824 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-02-02 18:25:20,841 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-02-02 18:25:20,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 18:25:20,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:25:20,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:25:20,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:55 [2018-02-02 18:25:21,049 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:25:21,079 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:25:21,079 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 34 [2018-02-02 18:25:21,080 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 18:25:21,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 18:25:21,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1098, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 18:25:21,080 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 35 states. [2018-02-02 18:25:21,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:25:21,980 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2018-02-02 18:25:21,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 18:25:21,980 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 38 [2018-02-02 18:25:21,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:25:21,981 INFO L225 Difference]: With dead ends: 163 [2018-02-02 18:25:21,981 INFO L226 Difference]: Without dead ends: 163 [2018-02-02 18:25:21,981 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=248, Invalid=2508, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 18:25:21,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-02 18:25:21,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 124. [2018-02-02 18:25:21,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 18:25:21,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-02-02 18:25:21,983 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 38 [2018-02-02 18:25:21,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:25:21,984 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-02-02 18:25:21,984 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 18:25:21,984 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-02-02 18:25:21,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 18:25:21,984 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:25:21,984 INFO L351 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-02-02 18:25:21,984 INFO L371 AbstractCegarLoop]: === Iteration 26 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:25:21,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1543171285, now seen corresponding path program 3 times [2018-02-02 18:25:21,985 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:25:21,985 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:25:21,985 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:21,985 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:25:21,985 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:25:21,995 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:25:22,228 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 18:25:22,228 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:25:22,228 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 18:25:22,233 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 18:25:22,257 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-02 18:25:22,257 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:25:22,259 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:25:22,271 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-02-02 18:25:22,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:22,275 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-02-02 18:25:22,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:22,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:25:22,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-02 18:25:22,283 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:25:22,284 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:25:22,284 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-02-02 18:25:22,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:22,289 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-02-02 18:25:22,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:22,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:25:22,293 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-02-02 18:25:22,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-02 18:25:22,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-02 18:25:22,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:22,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:25:22,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:25:22,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-02 18:25:22,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-02-02 18:25:22,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-02 18:25:22,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:22,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:25:22,330 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-02-02 18:25:22,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-02-02 18:25:22,441 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-02-02 18:25:22,447 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-02-02 18:25:22,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 18:25:22,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:25:22,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-02 18:25:22,466 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:43 [2018-02-02 18:25:22,479 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-02-02 18:25:22,483 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-02-02 18:25:22,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:22,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:25:22,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:25:22,489 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2018-02-02 18:25:22,513 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-02-02 18:25:22,519 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-02-02 18:25:22,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 18:25:22,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:25:22,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:25:22,526 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-02-02 18:25:22,573 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:25:22,605 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:25:22,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2018-02-02 18:25:22,606 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 18:25:22,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 18:25:22,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2018-02-02 18:25:22,606 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 25 states. [2018-02-02 18:25:23,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:25:23,029 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2018-02-02 18:25:23,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 18:25:23,029 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 39 [2018-02-02 18:25:23,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:25:23,030 INFO L225 Difference]: With dead ends: 123 [2018-02-02 18:25:23,030 INFO L226 Difference]: Without dead ends: 93 [2018-02-02 18:25:23,030 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 27 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=200, Invalid=1132, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 18:25:23,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-02 18:25:23,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 84. [2018-02-02 18:25:23,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-02 18:25:23,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2018-02-02 18:25:23,031 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 39 [2018-02-02 18:25:23,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:25:23,032 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2018-02-02 18:25:23,032 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 18:25:23,032 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2018-02-02 18:25:23,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 18:25:23,032 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:25:23,032 INFO L351 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-02-02 18:25:23,032 INFO L371 AbstractCegarLoop]: === Iteration 27 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:25:23,032 INFO L82 PathProgramCache]: Analyzing trace with hash -11114239, now seen corresponding path program 4 times [2018-02-02 18:25:23,032 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:25:23,032 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:25:23,033 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:23,033 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:25:23,033 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:25:23,040 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:25:23,696 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:25:23,697 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:25:23,697 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 18:25:23,702 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 18:25:23,713 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 18:25:23,713 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:25:23,715 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:25:23,729 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-02-02 18:25:23,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:23,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:25:23,733 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-02 18:25:23,766 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-02-02 18:25:23,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-02 18:25:23,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:23,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:25:23,772 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-02-02 18:25:23,772 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-02-02 18:25:24,928 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-02-02 18:25:24,952 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:25:24,953 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:25:24,954 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:25:24,955 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:25:24,955 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:25:24,957 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:25:24,970 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-02-02 18:25:24,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 18:25:25,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:25:25,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:25:25,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:73 [2018-02-02 18:25:25,223 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:25:25,256 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:25:25,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22] total 45 [2018-02-02 18:25:25,256 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-02 18:25:25,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-02 18:25:25,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1839, Unknown=1, NotChecked=0, Total=2070 [2018-02-02 18:25:25,257 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 46 states. [2018-02-02 18:25:26,025 WARN L146 SmtUtils]: Spent 512ms on a formula simplification. DAG size of input: 74 DAG size of output 34 [2018-02-02 18:25:26,658 WARN L146 SmtUtils]: Spent 507ms on a formula simplification. DAG size of input: 60 DAG size of output 39 [2018-02-02 18:25:27,826 WARN L146 SmtUtils]: Spent 541ms on a formula simplification. DAG size of input: 69 DAG size of output 48 [2018-02-02 18:25:28,365 WARN L146 SmtUtils]: Spent 492ms on a formula simplification. DAG size of input: 69 DAG size of output 48 [2018-02-02 18:25:29,106 WARN L146 SmtUtils]: Spent 523ms on a formula simplification. DAG size of input: 81 DAG size of output 61 [2018-02-02 18:25:29,857 WARN L146 SmtUtils]: Spent 425ms on a formula simplification. DAG size of input: 50 DAG size of output 29 [2018-02-02 18:25:31,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:25:31,084 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2018-02-02 18:25:31,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 18:25:31,084 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 40 [2018-02-02 18:25:31,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:25:31,085 INFO L225 Difference]: With dead ends: 124 [2018-02-02 18:25:31,085 INFO L226 Difference]: Without dead ends: 124 [2018-02-02 18:25:31,085 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1364 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=550, Invalid=4279, Unknown=1, NotChecked=0, Total=4830 [2018-02-02 18:25:31,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-02 18:25:31,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 100. [2018-02-02 18:25:31,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-02 18:25:31,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-02-02 18:25:31,087 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 40 [2018-02-02 18:25:31,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:25:31,087 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-02-02 18:25:31,087 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-02 18:25:31,088 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-02-02 18:25:31,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 18:25:31,088 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:25:31,088 INFO L351 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-02-02 18:25:31,088 INFO L371 AbstractCegarLoop]: === Iteration 28 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:25:31,088 INFO L82 PathProgramCache]: Analyzing trace with hash 862211954, now seen corresponding path program 3 times [2018-02-02 18:25:31,088 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:25:31,089 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:25:31,089 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:31,089 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:25:31,089 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:31,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:25:31,097 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:25:31,694 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:25:31,694 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:25:31,694 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 18:25:31,699 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 18:25:31,722 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-02 18:25:31,722 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:25:31,724 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:25:31,768 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-02-02 18:25:31,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:31,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:25:31,772 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-02 18:25:31,815 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-02-02 18:25:31,816 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-02-02 18:25:31,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:31,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:25:31,821 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-02-02 18:25:31,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-02-02 18:25:32,141 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-02-02 18:25:32,164 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-02-02 18:25:32,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 10 xjuncts. [2018-02-02 18:25:32,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:25:32,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:25:32,238 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:67 [2018-02-02 18:25:32,435 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:25:32,468 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:25:32,468 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20] total 42 [2018-02-02 18:25:32,468 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-02 18:25:32,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-02 18:25:32,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1671, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 18:25:32,469 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 43 states. [2018-02-02 18:25:33,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:25:33,902 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2018-02-02 18:25:33,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 18:25:33,902 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2018-02-02 18:25:33,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:25:33,903 INFO L225 Difference]: With dead ends: 119 [2018-02-02 18:25:33,903 INFO L226 Difference]: Without dead ends: 119 [2018-02-02 18:25:33,904 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=415, Invalid=3875, Unknown=0, NotChecked=0, Total=4290 [2018-02-02 18:25:33,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-02 18:25:33,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 105. [2018-02-02 18:25:33,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-02 18:25:33,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2018-02-02 18:25:33,909 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 42 [2018-02-02 18:25:33,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:25:33,909 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2018-02-02 18:25:33,909 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-02 18:25:33,910 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2018-02-02 18:25:33,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 18:25:33,910 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:25:33,910 INFO L351 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-02-02 18:25:33,910 INFO L371 AbstractCegarLoop]: === Iteration 29 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:25:33,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1458979531, now seen corresponding path program 4 times [2018-02-02 18:25:33,911 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:25:33,911 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:25:33,911 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:33,911 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:25:33,911 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:25:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:25:33,931 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:25:34,946 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:25:34,946 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:25:34,946 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 18:25:34,951 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 18:25:34,965 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 18:25:34,966 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:25:34,968 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:25:34,972 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 28 treesize of output 27 [2018-02-02 18:25:34,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:34,981 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 19 treesize of output 18 [2018-02-02 18:25:34,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:34,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-02-02 18:25:34,989 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:34,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-02-02 18:25:34,991 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:34,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:25:34,998 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:41 [2018-02-02 18:25:35,063 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:25:35,064 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:25:35,064 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 27 treesize of output 21 [2018-02-02 18:25:35,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:35,077 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:25:35,077 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:25:35,078 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 37 treesize of output 46 [2018-02-02 18:25:35,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:35,092 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:25:35,093 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 21 treesize of output 30 [2018-02-02 18:25:35,093 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:35,104 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:25:35,105 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:25:35,105 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 36 treesize of output 30 [2018-02-02 18:25:35,105 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:35,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:25:35,113 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:65, output treesize:40 [2018-02-02 18:25:35,174 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 37 treesize of output 34 [2018-02-02 18:25:35,176 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-02-02 18:25:35,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:35,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:25:35,190 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 34 treesize of output 31 [2018-02-02 18:25:35,191 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 18 treesize of output 17 [2018-02-02 18:25:35,191 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:25:35,194 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:25:35,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-02 18:25:35,203 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:72, output treesize:64 [2018-02-02 18:25:36,358 WARN L143 SmtUtils]: Spent 939ms on a formula simplification that was a NOOP. DAG size: 45 [2018-02-02 18:25:37,094 WARN L143 SmtUtils]: Spent 690ms on a formula simplification that was a NOOP. DAG size: 48 [2018-02-02 18:25:38,159 WARN L143 SmtUtils]: Spent 406ms on a formula simplification that was a NOOP. DAG size: 51 [2018-02-02 18:25:39,821 WARN L143 SmtUtils]: Spent 1611ms on a formula simplification that was a NOOP. DAG size: 53 [2018-02-02 18:25:39,826 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 60 [2018-02-02 18:25:39,830 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:25:39,831 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:25:39,832 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:25:39,841 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-02-02 18:25:39,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 18:25:39,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:25:39,896 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 65 treesize of output 57 [2018-02-02 18:25:39,897 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:25:39,898 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:25:39,898 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:25:39,904 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 37 treesize of output 79 [2018-02-02 18:25:39,905 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-02 18:25:39,926 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:25:39,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-02-02 18:25:39,965 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:134, output treesize:278 [2018-02-02 18:25:40,342 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:25:40,359 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:25:40,359 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 47 [2018-02-02 18:25:40,359 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-02 18:25:40,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-02 18:25:40,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=2128, Unknown=1, NotChecked=0, Total=2256 [2018-02-02 18:25:40,360 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 48 states. [2018-02-02 18:25:43,585 WARN L146 SmtUtils]: Spent 2822ms on a formula simplification. DAG size of input: 133 DAG size of output 67 [2018-02-02 18:25:45,395 WARN L146 SmtUtils]: Spent 1767ms on a formula simplification. DAG size of input: 63 DAG size of output 49 [2018-02-02 18:25:49,278 WARN L146 SmtUtils]: Spent 3829ms on a formula simplification. DAG size of input: 108 DAG size of output 83 [2018-02-02 18:25:50,579 WARN L146 SmtUtils]: Spent 402ms on a formula simplification. DAG size of input: 114 DAG size of output 86 [2018-02-02 18:25:53,483 WARN L146 SmtUtils]: Spent 2018ms on a formula simplification. DAG size of input: 111 DAG size of output 85 [2018-02-02 18:25:54,041 WARN L146 SmtUtils]: Spent 490ms on a formula simplification. DAG size of input: 125 DAG size of output 88 [2018-02-02 18:26:00,528 WARN L146 SmtUtils]: Spent 6354ms on a formula simplification. DAG size of input: 138 DAG size of output 94 [2018-02-02 18:26:02,588 WARN L146 SmtUtils]: Spent 1991ms on a formula simplification. DAG size of input: 126 DAG size of output 88 [2018-02-02 18:26:09,760 WARN L146 SmtUtils]: Spent 6259ms on a formula simplification. DAG size of input: 120 DAG size of output 102 [2018-02-02 18:26:10,764 WARN L146 SmtUtils]: Spent 926ms on a formula simplification. DAG size of input: 131 DAG size of output 110 [2018-02-02 18:26:11,728 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 117 DAG size of output 94 [2018-02-02 18:26:12,421 WARN L146 SmtUtils]: Spent 493ms on a formula simplification. DAG size of input: 85 DAG size of output 64 [2018-02-02 18:26:14,489 WARN L146 SmtUtils]: Spent 1997ms on a formula simplification. DAG size of input: 97 DAG size of output 80 [2018-02-02 18:26:14,948 WARN L146 SmtUtils]: Spent 405ms on a formula simplification. DAG size of input: 95 DAG size of output 78 [2018-02-02 18:26:15,812 WARN L146 SmtUtils]: Spent 666ms on a formula simplification. DAG size of input: 100 DAG size of output 81 [2018-02-02 18:26:16,669 WARN L146 SmtUtils]: Spent 772ms on a formula simplification. DAG size of input: 96 DAG size of output 79 [2018-02-02 18:26:16,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:26:16,944 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2018-02-02 18:26:16,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 18:26:16,944 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 46 [2018-02-02 18:26:16,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:26:16,945 INFO L225 Difference]: With dead ends: 125 [2018-02-02 18:26:16,945 INFO L226 Difference]: Without dead ends: 125 [2018-02-02 18:26:16,946 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1360 ImplicationChecksByTransitivity, 41.5s TimeCoverageRelationStatistics Valid=408, Invalid=5140, Unknown=2, NotChecked=0, Total=5550 [2018-02-02 18:26:16,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-02 18:26:16,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 115. [2018-02-02 18:26:16,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-02-02 18:26:16,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2018-02-02 18:26:16,948 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 46 [2018-02-02 18:26:16,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:26:16,948 INFO L432 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2018-02-02 18:26:16,948 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-02 18:26:16,949 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2018-02-02 18:26:16,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 18:26:16,949 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:26:16,949 INFO L351 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-02-02 18:26:16,949 INFO L371 AbstractCegarLoop]: === Iteration 30 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:26:16,949 INFO L82 PathProgramCache]: Analyzing trace with hash -839682937, now seen corresponding path program 5 times [2018-02-02 18:26:16,950 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:26:16,950 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:26:16,950 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:26:16,950 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:26:16,951 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:26:16,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:26:16,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:26:18,190 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:26:18,191 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:26:18,191 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-02 18:26:18,195 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 18:26:18,211 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-02-02 18:26:18,211 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:26:18,213 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:26:18,231 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-02-02 18:26:18,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:26:18,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:26:18,234 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-02 18:26:18,273 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-02-02 18:26:18,274 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-02-02 18:26:18,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:26:18,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:26:18,279 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-02-02 18:26:18,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-02-02 18:26:19,088 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-02-02 18:26:19,090 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:26:19,090 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:26:19,091 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:26:19,091 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:26:19,092 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:26:19,092 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:26:19,092 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:26:19,093 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:26:19,093 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:26:19,094 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:26:19,095 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:26:19,095 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:26:19,096 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:26:19,096 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:26:19,098 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:26:19,109 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-02-02 18:26:19,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 18:26:19,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:26:19,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:26:19,233 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:89, output treesize:101 [2018-02-02 18:26:19,429 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:26:19,447 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:26:19,447 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 28] total 57 [2018-02-02 18:26:19,447 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-02 18:26:19,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-02 18:26:19,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=2903, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 18:26:19,448 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 58 states. [2018-02-02 18:26:24,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:26:24,298 INFO L93 Difference]: Finished difference Result 184 states and 195 transitions. [2018-02-02 18:26:24,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-02 18:26:24,299 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 48 [2018-02-02 18:26:24,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:26:24,299 INFO L225 Difference]: With dead ends: 184 [2018-02-02 18:26:24,299 INFO L226 Difference]: Without dead ends: 184 [2018-02-02 18:26:24,301 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2676 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=979, Invalid=7577, Unknown=0, NotChecked=0, Total=8556 [2018-02-02 18:26:24,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-02-02 18:26:24,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 147. [2018-02-02 18:26:24,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 18:26:24,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 157 transitions. [2018-02-02 18:26:24,305 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 157 transitions. Word has length 48 [2018-02-02 18:26:24,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:26:24,305 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 157 transitions. [2018-02-02 18:26:24,305 INFO L433 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-02-02 18:26:24,305 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 157 transitions. [2018-02-02 18:26:24,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-02 18:26:24,306 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:26:24,306 INFO L351 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-02-02 18:26:24,306 INFO L371 AbstractCegarLoop]: === Iteration 31 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:26:24,306 INFO L82 PathProgramCache]: Analyzing trace with hash -823357064, now seen corresponding path program 5 times [2018-02-02 18:26:24,306 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:26:24,306 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:26:24,307 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:26:24,307 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:26:24,307 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:26:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:26:24,324 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:26:24,883 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 105 DAG size of output 32 [2018-02-02 18:26:25,952 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:26:25,952 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:26:25,952 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:26:25,957 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 18:26:25,976 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-02-02 18:26:25,976 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:26:25,979 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:26:25,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 18:26:25,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:26:25,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 18:26:25,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:26:25,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:26:25,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:25 [2018-02-02 18:26:26,059 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:26:26,059 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:26:26,060 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 20 treesize of output 29 [2018-02-02 18:26:26,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:26:26,069 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:26:26,072 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:26:26,072 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-02-02 18:26:26,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:26:26,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:26:26,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:25 [2018-02-02 18:26:26,139 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-02-02 18:26:26,140 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-02-02 18:26:26,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:26:26,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:26:26,146 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-02-02 18:26:26,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2018-02-02 18:26:26,650 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-02-02 18:26:26,652 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:26:26,652 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:26:26,653 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:26:26,659 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-02-02 18:26:26,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 18:26:26,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:26:26,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:26:26,688 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:151 [2018-02-02 18:26:26,994 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:26:27,011 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:26:27,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 51 [2018-02-02 18:26:27,012 INFO L409 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-02-02 18:26:27,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-02-02 18:26:27,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2514, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 18:26:27,012 INFO L87 Difference]: Start difference. First operand 147 states and 157 transitions. Second operand 52 states. [2018-02-02 18:26:27,604 WARN L146 SmtUtils]: Spent 331ms on a formula simplification. DAG size of input: 106 DAG size of output 48 [2018-02-02 18:26:29,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:26:29,684 INFO L93 Difference]: Finished difference Result 180 states and 190 transitions. [2018-02-02 18:26:29,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 18:26:29,718 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 50 [2018-02-02 18:26:29,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:26:29,719 INFO L225 Difference]: With dead ends: 180 [2018-02-02 18:26:29,719 INFO L226 Difference]: Without dead ends: 180 [2018-02-02 18:26:29,720 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1452 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=356, Invalid=5344, Unknown=0, NotChecked=0, Total=5700 [2018-02-02 18:26:29,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-02 18:26:29,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 147. [2018-02-02 18:26:29,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-02 18:26:29,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 157 transitions. [2018-02-02 18:26:29,723 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 157 transitions. Word has length 50 [2018-02-02 18:26:29,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:26:29,723 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 157 transitions. [2018-02-02 18:26:29,723 INFO L433 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-02-02 18:26:29,724 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 157 transitions. [2018-02-02 18:26:29,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 18:26:29,724 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:26:29,724 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 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-02-02 18:26:29,724 INFO L371 AbstractCegarLoop]: === Iteration 32 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 18:26:29,725 INFO L82 PathProgramCache]: Analyzing trace with hash -487224261, now seen corresponding path program 6 times [2018-02-02 18:26:29,725 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:26:29,725 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:26:29,725 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:26:29,726 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:26:29,726 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:26:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:26:29,746 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:26:30,965 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:26:30,966 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 18:26:30,966 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 18:26:30,971 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 18:26:31,001 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-02-02 18:26:31,002 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:26:31,004 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:26:31,077 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-02-02 18:26:31,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:26:31,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:26:31,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-02-02 18:26:31,147 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:26:31,147 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:26:31,147 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-02-02 18:26:31,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:26:31,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 18:26:31,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:26:31,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:26:31,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:21 [2018-02-02 18:26:31,242 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-02-02 18:26:31,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-02 18:26:31,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:26:31,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:26:31,251 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-02-02 18:26:31,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-02-02 18:26:31,295 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-02-02 18:26:31,296 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-02-02 18:26:31,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:26:31,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:26:31,324 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-02-02 18:26:31,324 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:41 [2018-02-02 18:26:32,562 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 69 treesize of output 57 [2018-02-02 18:26:32,566 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-02-02 18:26:32,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 18:26:32,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 51 [2018-02-02 18:26:32,582 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:26:32,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:26:32,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:26:32,609 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:89, output treesize:77 [2018-02-02 18:26:32,791 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:26:32,808 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 18:26:32,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32] total 62 [2018-02-02 18:26:32,809 INFO L409 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-02-02 18:26:32,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-02-02 18:26:32,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=3724, Unknown=0, NotChecked=0, Total=3906 [2018-02-02 18:26:32,809 INFO L87 Difference]: Start difference. First operand 147 states and 157 transitions. Second operand 63 states. [2018-02-02 18:26:33,837 WARN L146 SmtUtils]: Spent 609ms on a formula simplification. DAG size of input: 97 DAG size of output 88 [2018-02-02 18:26:35,124 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 112 DAG size of output 111 Received shutdown request... [2018-02-02 18:26:35,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 18:26:35,761 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 18:26:35,764 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 18:26:35,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 06:26:35 BoogieIcfgContainer [2018-02-02 18:26:35,765 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 18:26:35,765 INFO L168 Benchmark]: Toolchain (without parser) took 89138.08 ms. Allocated memory was 399.5 MB in the beginning and 738.2 MB in the end (delta: 338.7 MB). Free memory was 353.5 MB in the beginning and 696.9 MB in the end (delta: -343.4 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 18:26:35,766 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 399.5 MB. Free memory is still 360.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 18:26:35,766 INFO L168 Benchmark]: CACSL2BoogieTranslator took 155.82 ms. Allocated memory is still 399.5 MB. Free memory was 353.5 MB in the beginning and 342.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 18:26:35,766 INFO L168 Benchmark]: Boogie Preprocessor took 28.14 ms. Allocated memory is still 399.5 MB. Free memory was 342.9 MB in the beginning and 341.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 18:26:35,766 INFO L168 Benchmark]: RCFGBuilder took 174.83 ms. Allocated memory is still 399.5 MB. Free memory was 341.6 MB in the beginning and 321.8 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 5.3 GB. [2018-02-02 18:26:35,767 INFO L168 Benchmark]: TraceAbstraction took 88776.09 ms. Allocated memory was 399.5 MB in the beginning and 738.2 MB in the end (delta: 338.7 MB). Free memory was 321.8 MB in the beginning and 696.9 MB in the end (delta: -375.2 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 18:26:35,767 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.16 ms. Allocated memory is still 399.5 MB. Free memory is still 360.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 155.82 ms. Allocated memory is still 399.5 MB. Free memory was 353.5 MB in the beginning and 342.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.14 ms. Allocated memory is still 399.5 MB. Free memory was 342.9 MB in the beginning and 341.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 174.83 ms. Allocated memory is still 399.5 MB. Free memory was 341.6 MB in the beginning and 321.8 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 88776.09 ms. Allocated memory was 399.5 MB in the beginning and 738.2 MB in the end (delta: 338.7 MB). Free memory was 321.8 MB in the beginning and 696.9 MB in the end (delta: -375.2 MB). There was no memory consumed. 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 13 states, 63 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 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 13 states, 63 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 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 13 states, 63 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 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 13 states, 63 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 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 13 states, 63 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 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 13 states, 63 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 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 13 states, 63 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 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 13 states, 63 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 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 13 states, 63 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 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 13 states, 63 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 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 13 states, 63 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 50 locations, 11 error locations. TIMEOUT Result, 88.7s OverallTime, 32 OverallIterations, 8 TraceHistogramMax, 62.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1055 SDtfs, 2743 SDslu, 9242 SDs, 0 SdLazy, 11017 SolverSat, 971 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 10.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1405 GetRequests, 408 SyntacticMatches, 17 SemanticMatches, 979 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12845 ImplicationChecksByTransitivity, 71.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 31 MinimizatonAttempts, 425 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 24.4s InterpolantComputationTime, 1591 NumberOfCodeBlocks, 1581 NumberOfCodeBlocksAsserted, 80 NumberOfCheckSat, 1542 ConstructedInterpolants, 172 QuantifiedInterpolants, 1131523 SizeOfPredicates, 215 NumberOfNonLiveVariables, 2885 ConjunctsInSsa, 865 ConjunctsInUnsatCore, 49 InterpolantComputations, 17 PerfectInterpolantSequences, 28/983 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_18-26-35-773.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_18-26-35-773.csv Completed graceful shutdown