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/cav18-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-26d9e06-m [2018-02-02 08:44:11,770 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 08:44:11,772 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 08:44:11,786 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 08:44:11,786 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 08:44:11,787 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 08:44:11,788 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 08:44:11,790 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 08:44:11,792 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 08:44:11,793 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 08:44:11,794 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 08:44:11,794 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 08:44:11,795 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 08:44:11,796 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 08:44:11,797 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 08:44:11,799 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 08:44:11,800 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 08:44:11,802 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 08:44:11,803 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 08:44:11,804 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 08:44:11,806 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 08:44:11,807 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 08:44:11,807 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 08:44:11,808 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 08:44:11,808 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 08:44:11,809 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 08:44:11,809 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 08:44:11,810 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 08:44:11,810 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 08:44:11,811 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 08:44:11,811 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 08:44:11,811 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 08:44:11,822 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 08:44:11,822 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 08:44:11,824 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 08:44:11,824 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 08:44:11,824 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 08:44:11,824 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 08:44:11,824 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 08:44:11,825 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 08:44:11,825 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 08:44:11,825 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 08:44:11,825 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 08:44:11,825 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 08:44:11,825 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 08:44:11,826 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 08:44:11,826 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 08:44:11,826 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 08:44:11,826 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 08:44:11,826 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 08:44:11,827 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 08:44:11,827 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 08:44:11,827 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 08:44:11,827 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 08:44:11,827 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 08:44:11,827 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 08:44:11,828 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 08:44:11,857 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 08:44:11,866 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 08:44:11,870 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 08:44:11,871 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 08:44:11,871 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 08:44:11,872 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 08:44:12,026 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 08:44:12,027 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 08:44:12,028 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 08:44:12,028 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 08:44:12,032 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 08:44:12,033 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:44:12" (1/1) ... [2018-02-02 08:44:12,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21938c2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:44:12, skipping insertion in model container [2018-02-02 08:44:12,035 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:44:12" (1/1) ... [2018-02-02 08:44:12,045 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 08:44:12,073 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 08:44:12,162 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 08:44:12,179 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 08:44:12,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:44:12 WrapperNode [2018-02-02 08:44:12,187 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 08:44:12,188 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 08:44:12,188 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 08:44:12,188 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 08:44:12,197 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:44:12" (1/1) ... [2018-02-02 08:44:12,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:44:12" (1/1) ... [2018-02-02 08:44:12,204 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:44:12" (1/1) ... [2018-02-02 08:44:12,204 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:44:12" (1/1) ... [2018-02-02 08:44:12,206 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:44:12" (1/1) ... [2018-02-02 08:44:12,208 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:44:12" (1/1) ... [2018-02-02 08:44:12,209 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:44:12" (1/1) ... [2018-02-02 08:44:12,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 08:44:12,211 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 08:44:12,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 08:44:12,211 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 08:44:12,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:44:12" (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 08:44:12,247 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 08:44:12,247 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 08:44:12,247 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcat [2018-02-02 08:44:12,247 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 08:44:12,247 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 08:44:12,247 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 08:44:12,247 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 08:44:12,247 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 08:44:12,247 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 08:44:12,247 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 08:44:12,247 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcat [2018-02-02 08:44:12,247 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 08:44:12,248 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 08:44:12,248 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 08:44:12,400 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 08:44:12,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:44:12 BoogieIcfgContainer [2018-02-02 08:44:12,401 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 08:44:12,401 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 08:44:12,402 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 08:44:12,404 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 08:44:12,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:44:12" (1/3) ... [2018-02-02 08:44:12,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52e5f96f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:44:12, skipping insertion in model container [2018-02-02 08:44:12,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:44:12" (2/3) ... [2018-02-02 08:44:12,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52e5f96f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:44:12, skipping insertion in model container [2018-02-02 08:44:12,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:44:12" (3/3) ... [2018-02-02 08:44:12,406 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-02-02 08:44:12,412 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 08:44:12,417 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-02-02 08:44:12,449 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 08:44:12,449 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 08:44:12,450 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 08:44:12,450 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 08:44:12,450 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 08:44:12,450 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 08:44:12,450 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 08:44:12,450 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 08:44:12,452 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 08:44:12,464 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-02-02 08:44:12,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-02 08:44:12,473 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:44:12,474 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:44:12,475 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:44:12,479 INFO L82 PathProgramCache]: Analyzing trace with hash 967400660, now seen corresponding path program 1 times [2018-02-02 08:44:12,480 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:44:12,481 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:44:12,523 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:12,523 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:44:12,523 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:12,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:44:12,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:44:12,630 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 08:44:12,633 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:44:12,633 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 08:44:12,634 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 08:44:12,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 08:44:12,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:44:12,647 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2018-02-02 08:44:12,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:44:12,722 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-02-02 08:44:12,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 08:44:12,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-02-02 08:44:12,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:44:12,779 INFO L225 Difference]: With dead ends: 51 [2018-02-02 08:44:12,779 INFO L226 Difference]: Without dead ends: 47 [2018-02-02 08:44:12,781 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 08:44:12,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-02 08:44:12,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-02 08:44:12,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-02 08:44:12,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-02-02 08:44:12,804 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 11 [2018-02-02 08:44:12,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:44:12,804 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-02-02 08:44:12,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 08:44:12,805 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-02-02 08:44:12,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 08:44:12,805 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:44:12,805 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:44:12,805 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:44:12,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1512837349, now seen corresponding path program 1 times [2018-02-02 08:44:12,806 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:44:12,806 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:44:12,806 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:12,807 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:44:12,807 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:44:12,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:44:12,883 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 08:44:12,883 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:44:12,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 08:44:12,884 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 08:44:12,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 08:44:12,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 08:44:12,885 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 4 states. [2018-02-02 08:44:12,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:44:12,939 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-02-02 08:44:12,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 08:44:12,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-02 08:44:12,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:44:12,940 INFO L225 Difference]: With dead ends: 46 [2018-02-02 08:44:12,940 INFO L226 Difference]: Without dead ends: 46 [2018-02-02 08:44:12,941 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 08:44:12,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-02 08:44:12,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-02 08:44:12,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-02 08:44:12,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-02-02 08:44:12,945 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 15 [2018-02-02 08:44:12,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:44:12,945 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-02-02 08:44:12,946 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 08:44:12,946 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-02-02 08:44:12,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 08:44:12,946 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:44:12,946 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:44:12,946 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:44:12,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1512837350, now seen corresponding path program 1 times [2018-02-02 08:44:12,947 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:44:12,947 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:44:12,948 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:12,948 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:44:12,948 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:44:12,961 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:44:13,051 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 08:44:13,052 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:44:13,052 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:44:13,052 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 08:44:13,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 08:44:13,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:44:13,053 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 6 states. [2018-02-02 08:44:13,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:44:13,136 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-02-02 08:44:13,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 08:44:13,136 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-02-02 08:44:13,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:44:13,137 INFO L225 Difference]: With dead ends: 45 [2018-02-02 08:44:13,137 INFO L226 Difference]: Without dead ends: 45 [2018-02-02 08:44:13,138 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 08:44:13,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-02 08:44:13,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-02 08:44:13,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-02 08:44:13,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-02-02 08:44:13,142 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 15 [2018-02-02 08:44:13,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:44:13,142 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-02-02 08:44:13,142 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 08:44:13,142 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-02-02 08:44:13,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 08:44:13,143 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:44:13,143 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:44:13,143 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:44:13,143 INFO L82 PathProgramCache]: Analyzing trace with hash -346682393, now seen corresponding path program 1 times [2018-02-02 08:44:13,143 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:44:13,143 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:44:13,144 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:13,145 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:44:13,145 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:44:13,155 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:44:13,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:44:13,179 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:44:13,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 08:44:13,180 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 08:44:13,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 08:44:13,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 08:44:13,180 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 4 states. [2018-02-02 08:44:13,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:44:13,212 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-02-02 08:44:13,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 08:44:13,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-02 08:44:13,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:44:13,213 INFO L225 Difference]: With dead ends: 44 [2018-02-02 08:44:13,214 INFO L226 Difference]: Without dead ends: 44 [2018-02-02 08:44:13,214 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 08:44:13,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-02 08:44:13,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-02-02 08:44:13,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-02 08:44:13,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-02-02 08:44:13,216 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 16 [2018-02-02 08:44:13,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:44:13,216 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-02-02 08:44:13,216 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 08:44:13,216 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-02-02 08:44:13,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 08:44:13,217 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:44:13,217 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:44:13,217 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:44:13,217 INFO L82 PathProgramCache]: Analyzing trace with hash -346682392, now seen corresponding path program 1 times [2018-02-02 08:44:13,217 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:44:13,217 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:44:13,218 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:13,218 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:44:13,218 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:44:13,229 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:44:13,279 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 08:44:13,279 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:44:13,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:44:13,280 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 08:44:13,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 08:44:13,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:44:13,280 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-02-02 08:44:13,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:44:13,385 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-02-02 08:44:13,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 08:44:13,386 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-02-02 08:44:13,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:44:13,388 INFO L225 Difference]: With dead ends: 59 [2018-02-02 08:44:13,388 INFO L226 Difference]: Without dead ends: 59 [2018-02-02 08:44:13,389 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 08:44:13,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-02 08:44:13,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2018-02-02 08:44:13,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-02 08:44:13,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-02-02 08:44:13,400 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 16 [2018-02-02 08:44:13,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:44:13,400 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-02-02 08:44:13,400 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 08:44:13,400 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-02-02 08:44:13,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 08:44:13,401 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:44:13,401 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:44:13,401 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:44:13,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1156029018, now seen corresponding path program 1 times [2018-02-02 08:44:13,401 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:44:13,401 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:44:13,402 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:13,402 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:44:13,402 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:44:13,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:44:13,471 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 08:44:13,472 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:44:13,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 08:44:13,472 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 08:44:13,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 08:44:13,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 08:44:13,473 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 7 states. [2018-02-02 08:44:13,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:44:13,543 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-02-02 08:44:13,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 08:44:13,543 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-02-02 08:44:13,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:44:13,543 INFO L225 Difference]: With dead ends: 50 [2018-02-02 08:44:13,544 INFO L226 Difference]: Without dead ends: 50 [2018-02-02 08:44:13,544 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 08:44:13,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-02 08:44:13,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2018-02-02 08:44:13,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-02 08:44:13,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-02-02 08:44:13,546 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 16 [2018-02-02 08:44:13,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:44:13,546 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-02-02 08:44:13,546 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 08:44:13,546 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-02-02 08:44:13,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 08:44:13,547 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:44:13,547 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 08:44:13,547 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:44:13,547 INFO L82 PathProgramCache]: Analyzing trace with hash -131455439, now seen corresponding path program 1 times [2018-02-02 08:44:13,547 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:44:13,547 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:44:13,547 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:13,548 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:44:13,548 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:44:13,556 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:44:13,581 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 08:44:13,581 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:44:13,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 08:44:13,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 08:44:13,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 08:44:13,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:44:13,582 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2018-02-02 08:44:13,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:44:13,616 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-02-02 08:44:13,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 08:44:13,616 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-02 08:44:13,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:44:13,616 INFO L225 Difference]: With dead ends: 42 [2018-02-02 08:44:13,617 INFO L226 Difference]: Without dead ends: 42 [2018-02-02 08:44:13,617 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 08:44:13,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-02 08:44:13,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-02-02 08:44:13,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-02 08:44:13,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-02-02 08:44:13,618 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 20 [2018-02-02 08:44:13,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:44:13,619 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-02-02 08:44:13,619 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 08:44:13,619 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-02-02 08:44:13,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 08:44:13,619 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:44:13,619 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 08:44:13,619 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:44:13,619 INFO L82 PathProgramCache]: Analyzing trace with hash -131455438, now seen corresponding path program 1 times [2018-02-02 08:44:13,619 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:44:13,619 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:44:13,620 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:13,620 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:44:13,620 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:44:13,629 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:44:13,672 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 08:44:13,673 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:44:13,673 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 08:44:13,673 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 08:44:13,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 08:44:13,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 08:44:13,674 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 7 states. [2018-02-02 08:44:13,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:44:13,759 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-02-02 08:44:13,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 08:44:13,759 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-02-02 08:44:13,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:44:13,759 INFO L225 Difference]: With dead ends: 48 [2018-02-02 08:44:13,760 INFO L226 Difference]: Without dead ends: 48 [2018-02-02 08:44:13,760 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 08:44:13,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-02 08:44:13,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-02-02 08:44:13,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-02 08:44:13,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-02-02 08:44:13,763 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 20 [2018-02-02 08:44:13,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:44:13,763 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-02-02 08:44:13,763 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 08:44:13,763 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-02-02 08:44:13,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 08:44:13,764 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:44:13,764 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 08:44:13,764 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:44:13,764 INFO L82 PathProgramCache]: Analyzing trace with hash -313436100, now seen corresponding path program 1 times [2018-02-02 08:44:13,764 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:44:13,764 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:44:13,765 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:13,765 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:44:13,765 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:44:13,774 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:44:13,825 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 08:44:13,826 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:44:13,826 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:44:13,826 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 08:44:13,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 08:44:13,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:44:13,827 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-02-02 08:44:13,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:44:13,864 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-02-02 08:44:13,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 08:44:13,865 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-02 08:44:13,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:44:13,865 INFO L225 Difference]: With dead ends: 43 [2018-02-02 08:44:13,865 INFO L226 Difference]: Without dead ends: 43 [2018-02-02 08:44:13,865 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 08:44:13,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-02 08:44:13,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-02-02 08:44:13,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-02 08:44:13,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-02-02 08:44:13,867 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 24 [2018-02-02 08:44:13,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:44:13,867 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-02-02 08:44:13,868 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 08:44:13,868 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-02-02 08:44:13,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 08:44:13,868 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:44:13,868 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 08:44:13,868 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:44:13,868 INFO L82 PathProgramCache]: Analyzing trace with hash -313436099, now seen corresponding path program 1 times [2018-02-02 08:44:13,868 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:44:13,868 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:44:13,869 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:13,869 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:44:13,869 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:44:13,877 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:44:13,952 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 08:44:13,952 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:44:13,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 08:44:13,953 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 08:44:13,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 08:44:13,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 08:44:13,953 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 9 states. [2018-02-02 08:44:14,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:44:14,048 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-02-02 08:44:14,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 08:44:14,049 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-02-02 08:44:14,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:44:14,049 INFO L225 Difference]: With dead ends: 50 [2018-02-02 08:44:14,049 INFO L226 Difference]: Without dead ends: 50 [2018-02-02 08:44:14,049 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 08:44:14,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-02 08:44:14,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2018-02-02 08:44:14,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-02 08:44:14,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-02-02 08:44:14,051 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 24 [2018-02-02 08:44:14,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:44:14,051 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-02-02 08:44:14,051 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 08:44:14,051 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-02-02 08:44:14,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 08:44:14,052 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:44:14,052 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 08:44:14,052 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:44:14,052 INFO L82 PathProgramCache]: Analyzing trace with hash -313382859, now seen corresponding path program 1 times [2018-02-02 08:44:14,052 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:44:14,052 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:44:14,053 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:14,053 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:44:14,053 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:14,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:44:14,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:44:14,118 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 08:44:14,119 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:44:14,119 INFO L209 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 08:44:14,125 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:44:14,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:44:14,151 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:44:14,188 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 08:44:14,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 08:44:14,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:14,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:44:14,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:44:14,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-02-02 08:44:14,237 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 08:44:14,239 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 08:44:14,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:14,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:44:14,242 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 08:44:14,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-02-02 08:44:14,250 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 08:44:14,267 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 08:44:14,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2018-02-02 08:44:14,267 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 08:44:14,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 08:44:14,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-02-02 08:44:14,267 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 13 states. [2018-02-02 08:44:14,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:44:14,532 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2018-02-02 08:44:14,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 08:44:14,532 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-02-02 08:44:14,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:44:14,534 INFO L225 Difference]: With dead ends: 91 [2018-02-02 08:44:14,534 INFO L226 Difference]: Without dead ends: 91 [2018-02-02 08:44:14,535 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2018-02-02 08:44:14,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-02-02 08:44:14,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 62. [2018-02-02 08:44:14,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-02 08:44:14,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-02-02 08:44:14,540 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 24 [2018-02-02 08:44:14,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:44:14,541 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-02-02 08:44:14,541 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 08:44:14,541 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-02-02 08:44:14,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 08:44:14,542 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:44:14,542 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 08:44:14,542 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:44:14,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1126584510, now seen corresponding path program 1 times [2018-02-02 08:44:14,542 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:44:14,542 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:44:14,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:14,543 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:44:14,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:44:14,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:44:14,602 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 08:44:14,602 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:44:14,602 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:44:14,603 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 08:44:14,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 08:44:14,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:44:14,603 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 6 states. [2018-02-02 08:44:14,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:44:14,675 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2018-02-02 08:44:14,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 08:44:14,675 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-02 08:44:14,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:44:14,676 INFO L225 Difference]: With dead ends: 61 [2018-02-02 08:44:14,676 INFO L226 Difference]: Without dead ends: 61 [2018-02-02 08:44:14,676 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 08:44:14,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-02-02 08:44:14,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-02-02 08:44:14,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-02 08:44:14,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2018-02-02 08:44:14,680 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 25 [2018-02-02 08:44:14,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:44:14,680 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2018-02-02 08:44:14,680 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 08:44:14,681 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2018-02-02 08:44:14,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 08:44:14,681 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:44:14,681 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 08:44:14,682 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:44:14,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1126584509, now seen corresponding path program 1 times [2018-02-02 08:44:14,682 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:44:14,682 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:44:14,683 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:14,683 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:44:14,683 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:44:14,691 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:44:14,767 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 08:44:14,767 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:44:14,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 08:44:14,768 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 08:44:14,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 08:44:14,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 08:44:14,768 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 8 states. [2018-02-02 08:44:14,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:44:14,885 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2018-02-02 08:44:14,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 08:44:14,886 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-02-02 08:44:14,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:44:14,887 INFO L225 Difference]: With dead ends: 66 [2018-02-02 08:44:14,887 INFO L226 Difference]: Without dead ends: 66 [2018-02-02 08:44:14,887 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 08:44:14,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-02 08:44:14,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-02-02 08:44:14,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-02 08:44:14,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2018-02-02 08:44:14,890 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 25 [2018-02-02 08:44:14,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:44:14,891 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2018-02-02 08:44:14,891 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 08:44:14,891 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2018-02-02 08:44:14,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 08:44:14,891 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:44:14,891 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 08:44:14,892 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:44:14,892 INFO L82 PathProgramCache]: Analyzing trace with hash -99148426, now seen corresponding path program 1 times [2018-02-02 08:44:14,892 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:44:14,892 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:44:14,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:14,893 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:44:14,893 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:14,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:44:14,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:44:15,038 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 08:44:15,038 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:44:15,038 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 08:44:15,039 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 08:44:15,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 08:44:15,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-02-02 08:44:15,039 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 12 states. [2018-02-02 08:44:15,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:44:15,196 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2018-02-02 08:44:15,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 08:44:15,196 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-02-02 08:44:15,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:44:15,197 INFO L225 Difference]: With dead ends: 104 [2018-02-02 08:44:15,197 INFO L226 Difference]: Without dead ends: 104 [2018-02-02 08:44:15,198 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2018-02-02 08:44:15,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-02 08:44:15,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 66. [2018-02-02 08:44:15,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-02-02 08:44:15,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2018-02-02 08:44:15,202 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 28 [2018-02-02 08:44:15,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:44:15,203 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2018-02-02 08:44:15,203 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 08:44:15,203 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-02-02 08:44:15,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 08:44:15,204 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:44:15,204 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 08:44:15,204 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:44:15,204 INFO L82 PathProgramCache]: Analyzing trace with hash 323553400, now seen corresponding path program 1 times [2018-02-02 08:44:15,204 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:44:15,204 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:44:15,205 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:15,205 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:44:15,205 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:44:15,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:44:15,367 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 08:44:15,367 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:44:15,367 INFO L209 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 08:44:15,372 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:44:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:44:15,385 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:44:15,390 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 08:44:15,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:15,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:44:15,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-02 08:44:15,425 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 08:44:15,426 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 08:44:15,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:15,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:44:15,432 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 08:44:15,432 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-02-02 08:44:15,510 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 08:44:15,516 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 08:44:15,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:44:15,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:44:15,528 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 08:44:15,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:35 [2018-02-02 08:44:15,610 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 08:44:15,628 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:44:15,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2018-02-02 08:44:15,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 08:44:15,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 08:44:15,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2018-02-02 08:44:15,629 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 22 states. [2018-02-02 08:44:16,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:44:16,689 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2018-02-02 08:44:16,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 08:44:16,689 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2018-02-02 08:44:16,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:44:16,690 INFO L225 Difference]: With dead ends: 87 [2018-02-02 08:44:16,690 INFO L226 Difference]: Without dead ends: 87 [2018-02-02 08:44:16,690 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=969, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 08:44:16,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-02 08:44:16,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2018-02-02 08:44:16,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-02 08:44:16,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2018-02-02 08:44:16,694 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 28 [2018-02-02 08:44:16,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:44:16,694 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2018-02-02 08:44:16,694 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 08:44:16,694 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2018-02-02 08:44:16,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 08:44:16,695 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:44:16,695 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 08:44:16,696 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:44:16,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1309566295, now seen corresponding path program 1 times [2018-02-02 08:44:16,696 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:44:16,696 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:44:16,697 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:16,697 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:44:16,697 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:44:16,707 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:44:16,910 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 08:44:16,910 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:44:16,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-02-02 08:44:16,911 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 08:44:16,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 08:44:16,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-02-02 08:44:16,911 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 15 states. [2018-02-02 08:44:17,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:44:17,399 INFO L93 Difference]: Finished difference Result 161 states and 178 transitions. [2018-02-02 08:44:17,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 08:44:17,403 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-02-02 08:44:17,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:44:17,404 INFO L225 Difference]: With dead ends: 161 [2018-02-02 08:44:17,404 INFO L226 Difference]: Without dead ends: 161 [2018-02-02 08:44:17,405 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=233, Invalid=889, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 08:44:17,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-02 08:44:17,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 135. [2018-02-02 08:44:17,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-02-02 08:44:17,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 154 transitions. [2018-02-02 08:44:17,410 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 154 transitions. Word has length 29 [2018-02-02 08:44:17,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:44:17,410 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 154 transitions. [2018-02-02 08:44:17,410 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 08:44:17,411 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 154 transitions. [2018-02-02 08:44:17,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 08:44:17,412 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:44:17,412 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 08:44:17,412 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:44:17,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1528421013, now seen corresponding path program 1 times [2018-02-02 08:44:17,412 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:44:17,412 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:44:17,413 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:17,413 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:44:17,413 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:17,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:44:17,423 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:44:17,621 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 08:44:17,622 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:44:17,622 INFO L209 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 08:44:17,627 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:44:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:44:17,644 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:44:17,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:44:17,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:17,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:44:17,662 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 08:44:17,688 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:44:17,688 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:44:17,690 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 08:44:17,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:17,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:44:17,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-02 08:44:17,744 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 08:44:17,747 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 08:44:17,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:17,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:44:17,755 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 08:44:17,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-02-02 08:44:17,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-02-02 08:44:17,795 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 08:44:17,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:17,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:44:17,808 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 08:44:17,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-02-02 08:44:17,969 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 08:44:17,976 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 08:44:17,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:44:17,985 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 08:44:17,985 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:17,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:44:18,000 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 08:44:18,000 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-02-02 08:44:18,035 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 08:44:18,063 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:44:18,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 23 [2018-02-02 08:44:18,063 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 08:44:18,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 08:44:18,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2018-02-02 08:44:18,064 INFO L87 Difference]: Start difference. First operand 135 states and 154 transitions. Second operand 24 states. [2018-02-02 08:44:19,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:44:19,277 INFO L93 Difference]: Finished difference Result 144 states and 165 transitions. [2018-02-02 08:44:19,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 08:44:19,277 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 29 [2018-02-02 08:44:19,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:44:19,279 INFO L225 Difference]: With dead ends: 144 [2018-02-02 08:44:19,279 INFO L226 Difference]: Without dead ends: 144 [2018-02-02 08:44:19,279 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=174, Invalid=1085, Unknown=1, NotChecked=0, Total=1260 [2018-02-02 08:44:19,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-02-02 08:44:19,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2018-02-02 08:44:19,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-02-02 08:44:19,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 161 transitions. [2018-02-02 08:44:19,284 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 161 transitions. Word has length 29 [2018-02-02 08:44:19,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:44:19,284 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 161 transitions. [2018-02-02 08:44:19,284 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 08:44:19,284 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 161 transitions. [2018-02-02 08:44:19,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 08:44:19,285 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:44:19,285 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 08:44:19,285 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:44:19,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1438570336, now seen corresponding path program 1 times [2018-02-02 08:44:19,285 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:44:19,286 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:44:19,286 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:19,286 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:44:19,286 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:44:19,292 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:44:19,368 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 08:44:19,368 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:44:19,368 INFO L209 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 08:44:19,372 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:44:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:44:19,385 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:44:19,388 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 08:44:19,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:19,396 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 08:44:19,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-02-02 08:44:19,479 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 08:44:19,497 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:44:19,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2018-02-02 08:44:19,497 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 08:44:19,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 08:44:19,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-02 08:44:19,498 INFO L87 Difference]: Start difference. First operand 140 states and 161 transitions. Second operand 15 states. [2018-02-02 08:44:19,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:44:19,627 INFO L93 Difference]: Finished difference Result 153 states and 175 transitions. [2018-02-02 08:44:19,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 08:44:19,627 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-02-02 08:44:19,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:44:19,627 INFO L225 Difference]: With dead ends: 153 [2018-02-02 08:44:19,628 INFO L226 Difference]: Without dead ends: 153 [2018-02-02 08:44:19,628 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 08:44:19,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-02 08:44:19,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 145. [2018-02-02 08:44:19,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-02-02 08:44:19,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 165 transitions. [2018-02-02 08:44:19,630 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 165 transitions. Word has length 29 [2018-02-02 08:44:19,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:44:19,631 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 165 transitions. [2018-02-02 08:44:19,631 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 08:44:19,631 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 165 transitions. [2018-02-02 08:44:19,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 08:44:19,631 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:44:19,632 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 08:44:19,632 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:44:19,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1106610309, now seen corresponding path program 2 times [2018-02-02 08:44:19,632 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:44:19,632 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:44:19,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:19,633 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:44:19,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:19,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:44:19,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:44:20,248 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 08:44:20,249 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:44:20,249 INFO L209 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 08:44:20,254 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 08:44:20,262 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:44:20,266 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:44:20,267 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:44:20,269 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:44:20,285 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 08:44:20,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:20,290 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 08:44:20,290 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-02 08:44:20,318 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 08:44:20,319 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 08:44:20,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:20,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:44:20,324 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 08:44:20,324 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-02-02 08:44:20,472 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 08:44:20,475 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:44:20,478 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 08:44:20,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:44:20,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:44:20,494 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 08:44:20,494 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:58 [2018-02-02 08:44:20,593 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 08:44:20,610 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:44:20,610 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 33 [2018-02-02 08:44:20,610 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 08:44:20,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 08:44:20,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=991, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 08:44:20,611 INFO L87 Difference]: Start difference. First operand 145 states and 165 transitions. Second operand 34 states. [2018-02-02 08:44:21,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:44:21,256 INFO L93 Difference]: Finished difference Result 190 states and 216 transitions. [2018-02-02 08:44:21,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 08:44:21,257 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 32 [2018-02-02 08:44:21,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:44:21,257 INFO L225 Difference]: With dead ends: 190 [2018-02-02 08:44:21,258 INFO L226 Difference]: Without dead ends: 190 [2018-02-02 08:44:21,258 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=304, Invalid=2048, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 08:44:21,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-02-02 08:44:21,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 157. [2018-02-02 08:44:21,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-02 08:44:21,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 180 transitions. [2018-02-02 08:44:21,266 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 180 transitions. Word has length 32 [2018-02-02 08:44:21,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:44:21,267 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 180 transitions. [2018-02-02 08:44:21,267 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 08:44:21,267 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 180 transitions. [2018-02-02 08:44:21,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 08:44:21,267 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:44:21,268 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 08:44:21,268 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:44:21,268 INFO L82 PathProgramCache]: Analyzing trace with hash 53168317, now seen corresponding path program 2 times [2018-02-02 08:44:21,268 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:44:21,268 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:44:21,272 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:21,272 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:44:21,272 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:44:21,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:44:21,392 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 08:44:21,392 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:44:21,393 INFO L209 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 08:44:21,408 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 08:44:21,438 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:44:21,439 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:44:21,441 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:44:21,458 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 08:44:21,475 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 08:44:21,475 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2018-02-02 08:44:21,476 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 08:44:21,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 08:44:21,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-02-02 08:44:21,476 INFO L87 Difference]: Start difference. First operand 157 states and 180 transitions. Second operand 12 states. [2018-02-02 08:44:21,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:44:21,623 INFO L93 Difference]: Finished difference Result 162 states and 184 transitions. [2018-02-02 08:44:21,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 08:44:21,623 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2018-02-02 08:44:21,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:44:21,624 INFO L225 Difference]: With dead ends: 162 [2018-02-02 08:44:21,624 INFO L226 Difference]: Without dead ends: 162 [2018-02-02 08:44:21,624 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 08:44:21,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-02-02 08:44:21,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2018-02-02 08:44:21,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-02 08:44:21,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 169 transitions. [2018-02-02 08:44:21,627 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 169 transitions. Word has length 33 [2018-02-02 08:44:21,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:44:21,628 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 169 transitions. [2018-02-02 08:44:21,628 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 08:44:21,628 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 169 transitions. [2018-02-02 08:44:21,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 08:44:21,628 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:44:21,628 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 08:44:21,628 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:44:21,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1452172801, now seen corresponding path program 2 times [2018-02-02 08:44:21,629 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:44:21,629 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:44:21,629 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:21,630 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:44:21,630 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:44:21,641 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:44:22,007 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 08:44:22,007 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:44:22,204 INFO L209 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 08:44:22,210 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 08:44:22,219 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:44:22,223 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:44:22,225 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:44:22,227 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:44:22,236 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 08:44:22,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:22,240 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 08:44:22,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:22,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:44:22,243 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-02 08:44:22,248 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:44:22,249 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 08:44:22,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:22,256 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:44:22,256 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:44:22,257 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 08:44:22,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:22,260 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 08:44:22,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-02-02 08:44:22,289 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 08:44:22,290 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 08:44:22,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:22,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:44:22,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:44:22,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:20 [2018-02-02 08:44:22,345 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 08:44:22,347 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 08:44:22,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:22,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:44:22,355 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 08:44:22,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:30 [2018-02-02 08:44:22,482 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 08:44:22,489 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 08:44:22,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:44:22,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:44:22,510 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 08:44:22,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:43, output treesize:51 [2018-02-02 08:44:22,563 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 08:44:22,567 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 08:44:22,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:44:22,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:44:22,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:44:22,573 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:38 [2018-02-02 08:44:22,640 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 08:44:22,659 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:44:22,660 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28 [2018-02-02 08:44:22,660 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 08:44:22,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 08:44:22,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2018-02-02 08:44:22,660 INFO L87 Difference]: Start difference. First operand 149 states and 169 transitions. Second operand 29 states. [2018-02-02 08:44:23,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:44:23,268 INFO L93 Difference]: Finished difference Result 161 states and 184 transitions. [2018-02-02 08:44:23,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 08:44:23,269 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 34 [2018-02-02 08:44:23,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:44:23,270 INFO L225 Difference]: With dead ends: 161 [2018-02-02 08:44:23,270 INFO L226 Difference]: Without dead ends: 161 [2018-02-02 08:44:23,270 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 08:44:23,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-02-02 08:44:23,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 154. [2018-02-02 08:44:23,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-02-02 08:44:23,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 176 transitions. [2018-02-02 08:44:23,274 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 176 transitions. Word has length 34 [2018-02-02 08:44:23,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:44:23,274 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 176 transitions. [2018-02-02 08:44:23,274 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 08:44:23,274 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 176 transitions. [2018-02-02 08:44:23,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 08:44:23,275 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:44:23,275 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 08:44:23,275 INFO L371 AbstractCegarLoop]: === Iteration 22 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:44:23,275 INFO L82 PathProgramCache]: Analyzing trace with hash 357476204, now seen corresponding path program 1 times [2018-02-02 08:44:23,275 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:44:23,275 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:44:23,276 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:23,276 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:44:23,276 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:44:23,283 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:44:23,458 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 08:44:23,458 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:44:23,458 INFO L209 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 08:44:23,462 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:44:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:44:23,477 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:44:23,480 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 08:44:23,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:23,484 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 08:44:23,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:23,488 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 08:44:23,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-02-02 08:44:23,534 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:44:23,535 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:44:23,535 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 08:44:23,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:23,541 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:44:23,542 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 08:44:23,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:23,547 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 08:44:23,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-02-02 08:44:23,702 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 08:44:23,731 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:44:23,731 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2018-02-02 08:44:23,731 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 08:44:23,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 08:44:23,732 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2018-02-02 08:44:23,732 INFO L87 Difference]: Start difference. First operand 154 states and 176 transitions. Second operand 28 states. [2018-02-02 08:44:24,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:44:24,358 INFO L93 Difference]: Finished difference Result 199 states and 228 transitions. [2018-02-02 08:44:24,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 08:44:24,358 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 34 [2018-02-02 08:44:24,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:44:24,359 INFO L225 Difference]: With dead ends: 199 [2018-02-02 08:44:24,360 INFO L226 Difference]: Without dead ends: 199 [2018-02-02 08:44:24,360 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=237, Invalid=1925, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 08:44:24,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-02-02 08:44:24,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 163. [2018-02-02 08:44:24,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-02-02 08:44:24,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 188 transitions. [2018-02-02 08:44:24,366 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 188 transitions. Word has length 34 [2018-02-02 08:44:24,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:44:24,366 INFO L432 AbstractCegarLoop]: Abstraction has 163 states and 188 transitions. [2018-02-02 08:44:24,366 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 08:44:24,366 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 188 transitions. [2018-02-02 08:44:24,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 08:44:24,367 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:44:24,367 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 08:44:24,367 INFO L371 AbstractCegarLoop]: === Iteration 23 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:44:24,367 INFO L82 PathProgramCache]: Analyzing trace with hash -679902947, now seen corresponding path program 1 times [2018-02-02 08:44:24,367 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:44:24,367 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:44:24,368 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:24,368 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:44:24,368 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:44:24,375 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:44:24,426 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 08:44:24,426 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:44:24,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:44:24,427 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 08:44:24,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 08:44:24,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:44:24,427 INFO L87 Difference]: Start difference. First operand 163 states and 188 transitions. Second operand 6 states. [2018-02-02 08:44:24,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:44:24,516 INFO L93 Difference]: Finished difference Result 162 states and 187 transitions. [2018-02-02 08:44:24,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 08:44:24,516 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-02-02 08:44:24,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:44:24,517 INFO L225 Difference]: With dead ends: 162 [2018-02-02 08:44:24,517 INFO L226 Difference]: Without dead ends: 121 [2018-02-02 08:44:24,517 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 08:44:24,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-02 08:44:24,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 116. [2018-02-02 08:44:24,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-02 08:44:24,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 125 transitions. [2018-02-02 08:44:24,520 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 125 transitions. Word has length 35 [2018-02-02 08:44:24,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:44:24,520 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 125 transitions. [2018-02-02 08:44:24,520 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 08:44:24,520 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2018-02-02 08:44:24,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 08:44:24,521 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:44:24,521 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 08:44:24,521 INFO L371 AbstractCegarLoop]: === Iteration 24 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:44:24,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1017556222, now seen corresponding path program 3 times [2018-02-02 08:44:24,521 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:44:24,521 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:44:24,522 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:24,522 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:44:24,522 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:44:24,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:44:24,959 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 08:44:24,959 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:44:24,959 INFO L209 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 08:44:24,964 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 08:44:24,971 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:44:24,973 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:44:24,976 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:44:24,977 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:44:24,979 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:44:24,980 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:44:24,982 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:44:24,998 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 08:44:24,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:25,002 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 08:44:25,002 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-02 08:44:25,047 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 08:44:25,050 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 08:44:25,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:25,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:44:25,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:44:25,056 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-02-02 08:44:25,332 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 08:44:25,347 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 08:44:25,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 10 xjuncts. [2018-02-02 08:44:25,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:44:25,387 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 08:44:25,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:61 [2018-02-02 08:44:25,543 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 08:44:25,561 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:44:25,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 39 [2018-02-02 08:44:25,562 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-02 08:44:25,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-02 08:44:25,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1427, Unknown=0, NotChecked=0, Total=1560 [2018-02-02 08:44:25,562 INFO L87 Difference]: Start difference. First operand 116 states and 125 transitions. Second operand 40 states. [2018-02-02 08:44:26,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:44:26,545 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2018-02-02 08:44:26,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 08:44:26,545 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 36 [2018-02-02 08:44:26,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:44:26,545 INFO L225 Difference]: With dead ends: 151 [2018-02-02 08:44:26,545 INFO L226 Difference]: Without dead ends: 151 [2018-02-02 08:44:26,546 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=324, Invalid=2868, Unknown=0, NotChecked=0, Total=3192 [2018-02-02 08:44:26,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-02-02 08:44:26,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 124. [2018-02-02 08:44:26,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 08:44:26,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-02-02 08:44:26,548 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 36 [2018-02-02 08:44:26,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:44:26,548 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-02-02 08:44:26,548 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-02 08:44:26,548 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-02-02 08:44:26,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 08:44:26,548 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:44:26,548 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 08:44:26,549 INFO L371 AbstractCegarLoop]: === Iteration 25 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:44:26,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1572046895, now seen corresponding path program 2 times [2018-02-02 08:44:26,549 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:44:26,549 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:44:26,549 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:26,549 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:44:26,549 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:26,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:44:26,555 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:44:26,934 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 08:44:26,934 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:44:26,934 INFO L209 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 08:44:26,938 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 08:44:26,948 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:44:26,952 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:44:26,954 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:44:26,956 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:44:26,959 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 08:44:26,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:26,964 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 08:44:26,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:26,968 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 08:44:26,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-02-02 08:44:27,003 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:44:27,004 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:44:27,004 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 08:44:27,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:27,010 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:44:27,011 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 08:44:27,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:27,217 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 08:44:27,218 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-02-02 08:44:27,265 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 08:44:27,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-02 08:44:27,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:27,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:44:27,272 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 08:44:27,272 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-02-02 08:44:27,337 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 08:44:27,350 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 08:44:27,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:44:27,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:44:27,371 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 08:44:27,371 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:55 [2018-02-02 08:44:27,559 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 08:44:27,591 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:44:27,591 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 34 [2018-02-02 08:44:27,591 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-02-02 08:44:27,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-02-02 08:44:27,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1098, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 08:44:27,592 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 35 states. [2018-02-02 08:44:28,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:44:28,510 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2018-02-02 08:44:28,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 08:44:28,511 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 38 [2018-02-02 08:44:28,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:44:28,511 INFO L225 Difference]: With dead ends: 163 [2018-02-02 08:44:28,511 INFO L226 Difference]: Without dead ends: 163 [2018-02-02 08:44:28,512 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=248, Invalid=2508, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 08:44:28,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-02-02 08:44:28,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 124. [2018-02-02 08:44:28,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-02 08:44:28,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-02-02 08:44:28,515 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 38 [2018-02-02 08:44:28,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:44:28,515 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-02-02 08:44:28,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-02-02 08:44:28,516 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-02-02 08:44:28,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 08:44:28,516 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:44:28,516 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 08:44:28,516 INFO L371 AbstractCegarLoop]: === Iteration 26 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:44:28,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1543171285, now seen corresponding path program 3 times [2018-02-02 08:44:28,517 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:44:28,517 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:44:28,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:28,517 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:44:28,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:44:28,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:44:28,867 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 08:44:28,867 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:44:28,867 INFO L209 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 08:44:28,874 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 08:44:28,891 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:44:28,897 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:44:28,904 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:44:28,910 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:44:28,913 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:44:28,917 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:44:28,924 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 08:44:28,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:28,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:44:28,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:28,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:44:28,934 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-02 08:44:28,941 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:44:28,942 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:44:28,943 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 08:44:28,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:28,950 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 08:44:28,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:28,956 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 08:44:28,956 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-02-02 08:44:28,969 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 08:44:28,970 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 08:44:28,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:28,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:44:28,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:44:28,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-02 08:44:29,010 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 08:44:29,019 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 08:44:29,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:29,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:44:29,028 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 08:44:29,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-02-02 08:44:29,142 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 08:44:29,151 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 08:44:29,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:44:29,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:44:29,178 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 08:44:29,178 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:43 [2018-02-02 08:44:29,197 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 08:44:29,199 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 08:44:29,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:29,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:44:29,208 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 08:44:29,208 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2018-02-02 08:44:29,234 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 08:44:29,239 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 08:44:29,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:44:29,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:44:29,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:44:29,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-02-02 08:44:29,283 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 08:44:29,300 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:44:29,301 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2018-02-02 08:44:29,301 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 08:44:29,301 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 08:44:29,301 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2018-02-02 08:44:29,302 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 25 states. [2018-02-02 08:44:29,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:44:29,788 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2018-02-02 08:44:29,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 08:44:29,788 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 39 [2018-02-02 08:44:29,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:44:29,788 INFO L225 Difference]: With dead ends: 123 [2018-02-02 08:44:29,789 INFO L226 Difference]: Without dead ends: 93 [2018-02-02 08:44:29,789 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 27 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=200, Invalid=1132, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 08:44:29,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-02-02 08:44:29,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 84. [2018-02-02 08:44:29,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-02 08:44:29,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2018-02-02 08:44:29,790 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 39 [2018-02-02 08:44:29,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:44:29,791 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2018-02-02 08:44:29,791 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 08:44:29,791 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2018-02-02 08:44:29,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 08:44:29,791 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:44:29,791 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 08:44:29,791 INFO L371 AbstractCegarLoop]: === Iteration 27 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:44:29,791 INFO L82 PathProgramCache]: Analyzing trace with hash -11114239, now seen corresponding path program 4 times [2018-02-02 08:44:29,791 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:44:29,791 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:44:29,792 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:29,792 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:44:29,792 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:44:29,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:44:30,447 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 08:44:30,447 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:44:30,447 INFO L209 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 08:44:30,451 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 08:44:30,464 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:44:30,465 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:44:30,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 6 treesize of output 5 [2018-02-02 08:44:30,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:30,487 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 08:44:30,487 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-02 08:44:30,521 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 08:44:30,522 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 08:44:30,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:30,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:44:30,527 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 08:44:30,527 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-02-02 08:44:31,791 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 08:44:31,804 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:44:31,804 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:44:31,805 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:44:31,806 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:44:31,807 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:44:31,809 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:44:31,821 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 08:44:31,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:44:31,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:44:31,874 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 08:44:31,874 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:73 [2018-02-02 08:44:32,076 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 08:44:32,277 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:44:32,278 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22] total 45 [2018-02-02 08:44:32,278 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-02 08:44:32,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-02 08:44:32,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1839, Unknown=1, NotChecked=0, Total=2070 [2018-02-02 08:44:32,279 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 46 states. [2018-02-02 08:44:33,045 WARN L146 SmtUtils]: Spent 522ms on a formula simplification. DAG size of input: 74 DAG size of output 34 [2018-02-02 08:44:33,684 WARN L146 SmtUtils]: Spent 518ms on a formula simplification. DAG size of input: 60 DAG size of output 39 [2018-02-02 08:44:34,882 WARN L146 SmtUtils]: Spent 553ms on a formula simplification. DAG size of input: 69 DAG size of output 48 [2018-02-02 08:44:35,434 WARN L146 SmtUtils]: Spent 508ms on a formula simplification. DAG size of input: 69 DAG size of output 48 [2018-02-02 08:44:36,178 WARN L146 SmtUtils]: Spent 536ms on a formula simplification. DAG size of input: 81 DAG size of output 61 [2018-02-02 08:44:36,974 WARN L146 SmtUtils]: Spent 450ms on a formula simplification. DAG size of input: 50 DAG size of output 29 [2018-02-02 08:44:38,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:44:38,239 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2018-02-02 08:44:38,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 08:44:38,239 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 40 [2018-02-02 08:44:38,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:44:38,240 INFO L225 Difference]: With dead ends: 124 [2018-02-02 08:44:38,240 INFO L226 Difference]: Without dead ends: 124 [2018-02-02 08:44:38,240 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1364 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=550, Invalid=4279, Unknown=1, NotChecked=0, Total=4830 [2018-02-02 08:44:38,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-02-02 08:44:38,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 100. [2018-02-02 08:44:38,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-02-02 08:44:38,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-02-02 08:44:38,242 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 40 [2018-02-02 08:44:38,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:44:38,242 INFO L432 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-02-02 08:44:38,242 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-02 08:44:38,242 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-02-02 08:44:38,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-02 08:44:38,242 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:44:38,242 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 08:44:38,242 INFO L371 AbstractCegarLoop]: === Iteration 28 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:44:38,242 INFO L82 PathProgramCache]: Analyzing trace with hash 862211954, now seen corresponding path program 3 times [2018-02-02 08:44:38,243 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:44:38,243 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:44:38,243 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:38,243 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:44:38,243 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:44:38,252 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:44:38,755 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 08:44:38,755 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:44:38,755 INFO L209 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 08:44:38,759 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 08:44:38,770 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:44:38,774 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:44:38,777 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:44:38,780 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:44:38,781 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:44:38,783 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:44:38,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:44:38,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:38,834 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 08:44:38,834 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-02-02 08:44:38,882 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 08:44:38,883 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 08:44:38,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:38,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:44:38,889 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 08:44:38,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-02-02 08:44:39,247 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 08:44:39,273 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 08:44:39,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 10 xjuncts. [2018-02-02 08:44:39,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:44:39,338 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 08:44:39,339 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:67 [2018-02-02 08:44:39,512 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 08:44:39,543 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:44:39,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20] total 42 [2018-02-02 08:44:39,544 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-02-02 08:44:39,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-02-02 08:44:39,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1671, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 08:44:39,544 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 43 states. [2018-02-02 08:44:41,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:44:41,115 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2018-02-02 08:44:41,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 08:44:41,115 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2018-02-02 08:44:41,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:44:41,116 INFO L225 Difference]: With dead ends: 119 [2018-02-02 08:44:41,116 INFO L226 Difference]: Without dead ends: 119 [2018-02-02 08:44:41,116 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 08:44:41,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-02 08:44:41,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 105. [2018-02-02 08:44:41,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-02-02 08:44:41,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2018-02-02 08:44:41,119 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 42 [2018-02-02 08:44:41,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:44:41,119 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2018-02-02 08:44:41,119 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-02-02 08:44:41,119 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2018-02-02 08:44:41,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-02 08:44:41,119 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:44:41,120 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 08:44:41,120 INFO L371 AbstractCegarLoop]: === Iteration 29 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:44:41,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1458979531, now seen corresponding path program 4 times [2018-02-02 08:44:41,120 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:44:41,120 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:44:41,120 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:41,121 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:44:41,121 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:44:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:44:41,131 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:44:42,244 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 08:44:42,244 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:44:42,244 INFO L209 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 08:44:42,249 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 08:44:42,263 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:44:42,265 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:44:42,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-02-02 08:44:42,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:42,291 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 08:44:42,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:42,312 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 08:44:42,313 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:42,313 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 08:44:42,314 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:42,323 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 08:44:42,323 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:41 [2018-02-02 08:44:42,389 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:44:42,389 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:44:42,390 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 08:44:42,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:42,405 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:44:42,405 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:44:42,406 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 08:44:42,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:42,423 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:44:42,424 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 08:44:42,424 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:42,438 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:44:42,439 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:44:42,439 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 08:44:42,440 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:42,450 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 08:44:42,450 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:65, output treesize:40 [2018-02-02 08:44:42,523 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 08:44:42,524 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 08:44:42,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:42,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:44:42,733 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 08:44:42,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-02-02 08:44:42,735 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:44:42,738 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:44:42,748 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 08:44:42,748 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:72, output treesize:64 [2018-02-02 08:44:44,025 WARN L143 SmtUtils]: Spent 944ms on a formula simplification that was a NOOP. DAG size: 45 [2018-02-02 08:44:44,787 WARN L143 SmtUtils]: Spent 716ms on a formula simplification that was a NOOP. DAG size: 48 [2018-02-02 08:44:45,888 WARN L143 SmtUtils]: Spent 418ms on a formula simplification that was a NOOP. DAG size: 51 [2018-02-02 08:44:47,649 WARN L143 SmtUtils]: Spent 1701ms on a formula simplification that was a NOOP. DAG size: 53 [2018-02-02 08:44:47,672 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 08:44:47,675 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:44:47,676 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:44:47,676 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:44:47,681 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 08:44:47,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:44:47,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:44:47,732 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 08:44:47,734 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:44:47,734 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:44:47,735 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:44:47,740 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 08:44:47,741 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-02 08:44:47,758 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:44:47,801 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 08:44:47,801 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:134, output treesize:278 [2018-02-02 08:44:48,172 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 08:44:48,189 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:44:48,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 47 [2018-02-02 08:44:48,190 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-02 08:44:48,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-02 08:44:48,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=2128, Unknown=1, NotChecked=0, Total=2256 [2018-02-02 08:44:48,190 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 48 states. [2018-02-02 08:44:51,709 WARN L146 SmtUtils]: Spent 3050ms on a formula simplification. DAG size of input: 133 DAG size of output 67 [2018-02-02 08:44:53,580 WARN L146 SmtUtils]: Spent 1801ms on a formula simplification. DAG size of input: 63 DAG size of output 49 [2018-02-02 08:44:57,666 WARN L146 SmtUtils]: Spent 4026ms on a formula simplification. DAG size of input: 108 DAG size of output 83 [2018-02-02 08:44:58,981 WARN L146 SmtUtils]: Spent 392ms on a formula simplification. DAG size of input: 114 DAG size of output 86 [2018-02-02 08:45:01,940 WARN L146 SmtUtils]: Spent 2075ms on a formula simplification. DAG size of input: 111 DAG size of output 85 [2018-02-02 08:45:02,550 WARN L146 SmtUtils]: Spent 535ms on a formula simplification. DAG size of input: 125 DAG size of output 88 [2018-02-02 08:45:09,392 WARN L146 SmtUtils]: Spent 6704ms on a formula simplification. DAG size of input: 138 DAG size of output 94 [2018-02-02 08:45:11,482 WARN L146 SmtUtils]: Spent 2023ms on a formula simplification. DAG size of input: 126 DAG size of output 88 Received shutdown request... [2018-02-02 08:45:16,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 08:45:16,576 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 08:45:16,579 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 08:45:16,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:45:16 BoogieIcfgContainer [2018-02-02 08:45:16,579 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 08:45:16,580 INFO L168 Benchmark]: Toolchain (without parser) took 64553.74 ms. Allocated memory was 400.6 MB in the beginning and 987.2 MB in the end (delta: 586.7 MB). Free memory was 357.4 MB in the beginning and 632.8 MB in the end (delta: -275.4 MB). Peak memory consumption was 311.3 MB. Max. memory is 5.3 GB. [2018-02-02 08:45:16,581 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 400.6 MB. Free memory is still 362.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 08:45:16,581 INFO L168 Benchmark]: CACSL2BoogieTranslator took 159.65 ms. Allocated memory is still 400.6 MB. Free memory was 357.4 MB in the beginning and 346.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 08:45:16,581 INFO L168 Benchmark]: Boogie Preprocessor took 22.81 ms. Allocated memory is still 400.6 MB. Free memory was 346.9 MB in the beginning and 344.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 08:45:16,581 INFO L168 Benchmark]: RCFGBuilder took 190.22 ms. Allocated memory is still 400.6 MB. Free memory was 344.2 MB in the beginning and 324.9 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 5.3 GB. [2018-02-02 08:45:16,581 INFO L168 Benchmark]: TraceAbstraction took 64177.94 ms. Allocated memory was 400.6 MB in the beginning and 987.2 MB in the end (delta: 586.7 MB). Free memory was 324.9 MB in the beginning and 632.8 MB in the end (delta: -307.9 MB). Peak memory consumption was 278.8 MB. Max. memory is 5.3 GB. [2018-02-02 08:45:16,582 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.14 ms. Allocated memory is still 400.6 MB. Free memory is still 362.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 159.65 ms. Allocated memory is still 400.6 MB. Free memory was 357.4 MB in the beginning and 346.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 22.81 ms. Allocated memory is still 400.6 MB. Free memory was 346.9 MB in the beginning and 344.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 190.22 ms. Allocated memory is still 400.6 MB. Free memory was 344.2 MB in the beginning and 324.9 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 64177.94 ms. Allocated memory was 400.6 MB in the beginning and 987.2 MB in the end (delta: 586.7 MB). Free memory was 324.9 MB in the beginning and 632.8 MB in the end (delta: -307.9 MB). Peak memory consumption was 278.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (105states) and interpolant automaton (currently 16 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 120. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (105states) and interpolant automaton (currently 16 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 120. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (105states) and interpolant automaton (currently 16 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 120. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (105states) and interpolant automaton (currently 16 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 120. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (105states) and interpolant automaton (currently 16 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 120. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (105states) and interpolant automaton (currently 16 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 120. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was constructing difference of abstraction (105states) and interpolant automaton (currently 16 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 120. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was constructing difference of abstraction (105states) and interpolant automaton (currently 16 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 120. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was constructing difference of abstraction (105states) and interpolant automaton (currently 16 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 120. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was constructing difference of abstraction (105states) and interpolant automaton (currently 16 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 120. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (105states) and interpolant automaton (currently 16 states, 48 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 120. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 50 locations, 11 error locations. TIMEOUT Result, 64.1s OverallTime, 29 OverallIterations, 6 TraceHistogramMax, 44.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 972 SDtfs, 2318 SDslu, 7254 SDs, 0 SdLazy, 7796 SolverSat, 725 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1080 GetRequests, 334 SyntacticMatches, 16 SemanticMatches, 729 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7073 ImplicationChecksByTransitivity, 46.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, 28 MinimizatonAttempts, 345 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 17.9s InterpolantComputationTime, 1287 NumberOfCodeBlocks, 1277 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 1244 ConstructedInterpolants, 98 QuantifiedInterpolants, 575546 SizeOfPredicates, 171 NumberOfNonLiveVariables, 2249 ConjunctsInSsa, 613 ConjunctsInUnsatCore, 43 InterpolantComputations, 17 PerfectInterpolantSequences, 28/505 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_08-45-16-588.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_08-45-16-588.csv Completed graceful shutdown