java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 12:10:40,869 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 12:10:40,870 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 12:10:40,882 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 12:10:40,882 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 12:10:40,883 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 12:10:40,884 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 12:10:40,885 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 12:10:40,887 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 12:10:40,887 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 12:10:40,888 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 12:10:40,888 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 12:10:40,889 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 12:10:40,890 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 12:10:40,891 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 12:10:40,893 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 12:10:40,894 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 12:10:40,896 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 12:10:40,897 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 12:10:40,898 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 12:10:40,899 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 12:10:40,900 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 12:10:40,900 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 12:10:40,901 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 12:10:40,901 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 12:10:40,902 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 12:10:40,902 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 12:10:40,903 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 12:10:40,903 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 12:10:40,903 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 12:10:40,904 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 12:10:40,904 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 12:10:40,914 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 12:10:40,914 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 12:10:40,915 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 12:10:40,915 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 12:10:40,915 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 12:10:40,915 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 12:10:40,916 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 12:10:40,916 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 12:10:40,916 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 12:10:40,916 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 12:10:40,916 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 12:10:40,916 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 12:10:40,916 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 12:10:40,917 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 12:10:40,917 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 12:10:40,917 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 12:10:40,917 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 12:10:40,917 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 12:10:40,917 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 12:10:40,918 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:10:40,918 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 12:10:40,918 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 12:10:40,918 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 12:10:40,918 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 12:10:40,945 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 12:10:40,953 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 12:10:40,955 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 12:10:40,956 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 12:10:40,956 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 12:10:40,957 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-02-04 12:10:41,070 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 12:10:41,071 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 12:10:41,071 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 12:10:41,072 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 12:10:41,076 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 12:10:41,077 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:10:41" (1/1) ... [2018-02-04 12:10:41,079 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5663edf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:41, skipping insertion in model container [2018-02-04 12:10:41,079 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:10:41" (1/1) ... [2018-02-04 12:10:41,090 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:10:41,117 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:10:41,212 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:10:41,228 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:10:41,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:41 WrapperNode [2018-02-04 12:10:41,235 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 12:10:41,235 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 12:10:41,236 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 12:10:41,236 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 12:10:41,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:41" (1/1) ... [2018-02-04 12:10:41,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:41" (1/1) ... [2018-02-04 12:10:41,255 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:41" (1/1) ... [2018-02-04 12:10:41,256 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:41" (1/1) ... [2018-02-04 12:10:41,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:41" (1/1) ... [2018-02-04 12:10:41,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:41" (1/1) ... [2018-02-04 12:10:41,266 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:41" (1/1) ... [2018-02-04 12:10:41,268 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 12:10:41,268 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 12:10:41,269 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 12:10:41,269 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 12:10:41,270 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:41" (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-04 12:10:41,315 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 12:10:41,315 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 12:10:41,315 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlen [2018-02-04 12:10:41,315 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-02-04 12:10:41,315 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrstr [2018-02-04 12:10:41,315 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 12:10:41,316 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 12:10:41,316 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 12:10:41,316 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 12:10:41,316 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 12:10:41,316 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 12:10:41,316 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 12:10:41,316 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlen [2018-02-04 12:10:41,316 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-02-04 12:10:41,316 INFO L128 BoogieDeclarations]: Found specification of procedure cstrstr [2018-02-04 12:10:41,316 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 12:10:41,316 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 12:10:41,316 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 12:10:41,543 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 12:10:41,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:10:41 BoogieIcfgContainer [2018-02-04 12:10:41,544 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 12:10:41,545 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 12:10:41,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 12:10:41,547 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 12:10:41,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:10:41" (1/3) ... [2018-02-04 12:10:41,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e3c7b41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:10:41, skipping insertion in model container [2018-02-04 12:10:41,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:10:41" (2/3) ... [2018-02-04 12:10:41,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e3c7b41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:10:41, skipping insertion in model container [2018-02-04 12:10:41,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:10:41" (3/3) ... [2018-02-04 12:10:41,550 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-02-04 12:10:41,557 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 12:10:41,568 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-02-04 12:10:41,599 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 12:10:41,599 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 12:10:41,599 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 12:10:41,599 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 12:10:41,599 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 12:10:41,600 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 12:10:41,600 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 12:10:41,600 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 12:10:41,601 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 12:10:41,614 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2018-02-04 12:10:41,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 12:10:41,623 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:41,624 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:10:41,624 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 12:10:41,627 INFO L82 PathProgramCache]: Analyzing trace with hash -718609434, now seen corresponding path program 1 times [2018-02-04 12:10:41,628 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:41,628 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:41,660 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:41,660 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:41,660 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:41,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:41,706 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:41,778 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-04 12:10:41,780 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:41,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:10:41,781 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:10:41,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:10:41,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:10:41,841 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 4 states. [2018-02-04 12:10:41,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:41,920 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2018-02-04 12:10:41,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:10:41,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 12:10:41,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:41,926 INFO L225 Difference]: With dead ends: 89 [2018-02-04 12:10:41,926 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 12:10:41,928 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:10:41,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 12:10:41,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-02-04 12:10:41,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-04 12:10:41,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2018-02-04 12:10:41,957 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 13 [2018-02-04 12:10:41,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:41,957 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2018-02-04 12:10:41,958 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:10:41,958 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2018-02-04 12:10:41,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 12:10:41,958 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:41,958 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:10:41,958 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 12:10:41,959 INFO L82 PathProgramCache]: Analyzing trace with hash -718609433, now seen corresponding path program 1 times [2018-02-04 12:10:41,959 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:41,959 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:41,959 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:41,960 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:41,960 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:41,973 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:42,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:10:42,036 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:42,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:10:42,037 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:10:42,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:10:42,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:10:42,038 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand 6 states. [2018-02-04 12:10:42,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:42,126 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-02-04 12:10:42,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:10:42,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-04 12:10:42,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:42,129 INFO L225 Difference]: With dead ends: 85 [2018-02-04 12:10:42,129 INFO L226 Difference]: Without dead ends: 85 [2018-02-04 12:10:42,130 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-04 12:10:42,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-04 12:10:42,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-02-04 12:10:42,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-04 12:10:42,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2018-02-04 12:10:42,136 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 13 [2018-02-04 12:10:42,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:42,136 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2018-02-04 12:10:42,136 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:10:42,137 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2018-02-04 12:10:42,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 12:10:42,137 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:42,137 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:10:42,137 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 12:10:42,138 INFO L82 PathProgramCache]: Analyzing trace with hash -802055959, now seen corresponding path program 1 times [2018-02-04 12:10:42,138 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:42,138 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:42,139 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:42,139 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:42,139 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:42,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:42,176 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-04 12:10:42,176 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:42,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:10:42,176 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:10:42,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:10:42,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:10:42,177 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand 4 states. [2018-02-04 12:10:42,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:42,223 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2018-02-04 12:10:42,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:10:42,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 12:10:42,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:42,225 INFO L225 Difference]: With dead ends: 84 [2018-02-04 12:10:42,225 INFO L226 Difference]: Without dead ends: 84 [2018-02-04 12:10:42,225 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-04 12:10:42,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-04 12:10:42,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-02-04 12:10:42,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-04 12:10:42,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2018-02-04 12:10:42,231 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 14 [2018-02-04 12:10:42,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:42,231 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2018-02-04 12:10:42,231 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:10:42,231 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2018-02-04 12:10:42,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 12:10:42,232 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:42,232 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:10:42,232 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 12:10:42,232 INFO L82 PathProgramCache]: Analyzing trace with hash -802055958, now seen corresponding path program 1 times [2018-02-04 12:10:42,232 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:42,232 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:42,233 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:42,233 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:42,233 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:42,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:42,290 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-04 12:10:42,290 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:42,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:10:42,291 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:10:42,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:10:42,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:10:42,291 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 5 states. [2018-02-04 12:10:42,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:42,317 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2018-02-04 12:10:42,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:10:42,318 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 12:10:42,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:42,319 INFO L225 Difference]: With dead ends: 83 [2018-02-04 12:10:42,319 INFO L226 Difference]: Without dead ends: 83 [2018-02-04 12:10:42,320 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:10:42,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-04 12:10:42,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-02-04 12:10:42,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 12:10:42,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2018-02-04 12:10:42,324 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 14 [2018-02-04 12:10:42,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:42,324 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2018-02-04 12:10:42,325 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:10:42,325 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2018-02-04 12:10:42,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 12:10:42,325 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:42,325 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:10:42,325 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 12:10:42,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1145880583, now seen corresponding path program 1 times [2018-02-04 12:10:42,326 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:42,326 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:42,327 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:42,327 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:42,327 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:42,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:42,338 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:42,361 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-04 12:10:42,361 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:42,361 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:10:42,361 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:10:42,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:10:42,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:10:42,362 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 5 states. [2018-02-04 12:10:42,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:42,416 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2018-02-04 12:10:42,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:10:42,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 12:10:42,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:42,416 INFO L225 Difference]: With dead ends: 82 [2018-02-04 12:10:42,416 INFO L226 Difference]: Without dead ends: 82 [2018-02-04 12:10:42,417 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-04 12:10:42,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-04 12:10:42,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-02-04 12:10:42,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 12:10:42,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-02-04 12:10:42,419 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 17 [2018-02-04 12:10:42,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:42,420 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-02-04 12:10:42,420 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:10:42,420 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-02-04 12:10:42,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 12:10:42,420 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:42,420 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:10:42,420 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 12:10:42,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1145880582, now seen corresponding path program 1 times [2018-02-04 12:10:42,420 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:42,420 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:42,421 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:42,421 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:42,421 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:42,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:42,501 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-04 12:10:42,501 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:42,501 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:10:42,501 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:10:42,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:10:42,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:10:42,502 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 8 states. [2018-02-04 12:10:42,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:42,609 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2018-02-04 12:10:42,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:10:42,610 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-02-04 12:10:42,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:42,610 INFO L225 Difference]: With dead ends: 81 [2018-02-04 12:10:42,611 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 12:10:42,611 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:10:42,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 12:10:42,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-02-04 12:10:42,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-04 12:10:42,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2018-02-04 12:10:42,613 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 17 [2018-02-04 12:10:42,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:42,614 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2018-02-04 12:10:42,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:10:42,614 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-02-04 12:10:42,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 12:10:42,614 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:42,614 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] [2018-02-04 12:10:42,614 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 12:10:42,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1883098626, now seen corresponding path program 1 times [2018-02-04 12:10:42,614 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:42,615 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:42,615 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:42,615 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:42,616 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:42,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:42,671 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-04 12:10:42,671 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:42,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 12:10:42,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 12:10:42,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 12:10:42,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:10:42,672 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 7 states. [2018-02-04 12:10:42,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:42,781 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2018-02-04 12:10:42,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 12:10:42,781 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-04 12:10:42,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:42,782 INFO L225 Difference]: With dead ends: 80 [2018-02-04 12:10:42,782 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 12:10:42,782 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 12:10:42,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 12:10:42,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-02-04 12:10:42,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 12:10:42,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-02-04 12:10:42,785 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 23 [2018-02-04 12:10:42,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:42,785 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-02-04 12:10:42,785 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 12:10:42,785 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-02-04 12:10:42,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 12:10:42,786 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:42,786 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] [2018-02-04 12:10:42,786 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 12:10:42,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1883098625, now seen corresponding path program 1 times [2018-02-04 12:10:42,787 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:42,787 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:42,788 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:42,788 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:42,788 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:42,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:42,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:42,886 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-04 12:10:42,886 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:42,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 12:10:42,886 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 12:10:42,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 12:10:42,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:10:42,887 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 10 states. [2018-02-04 12:10:42,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:42,994 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2018-02-04 12:10:42,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 12:10:42,995 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-02-04 12:10:42,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:42,998 INFO L225 Difference]: With dead ends: 104 [2018-02-04 12:10:42,998 INFO L226 Difference]: Without dead ends: 104 [2018-02-04 12:10:42,998 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-02-04 12:10:42,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-04 12:10:43,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2018-02-04 12:10:43,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 12:10:43,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2018-02-04 12:10:43,003 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 23 [2018-02-04 12:10:43,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:43,003 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2018-02-04 12:10:43,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 12:10:43,003 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2018-02-04 12:10:43,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 12:10:43,004 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:43,004 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] [2018-02-04 12:10:43,004 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 12:10:43,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1390800317, now seen corresponding path program 1 times [2018-02-04 12:10:43,004 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:43,004 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:43,005 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:43,005 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:43,005 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:43,017 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:43,174 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-04 12:10:43,174 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:43,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 12:10:43,174 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 12:10:43,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 12:10:43,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-04 12:10:43,175 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 13 states. [2018-02-04 12:10:43,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:43,459 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2018-02-04 12:10:43,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 12:10:43,459 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-02-04 12:10:43,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:43,460 INFO L225 Difference]: With dead ends: 104 [2018-02-04 12:10:43,460 INFO L226 Difference]: Without dead ends: 104 [2018-02-04 12:10:43,460 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2018-02-04 12:10:43,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-04 12:10:43,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 96. [2018-02-04 12:10:43,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 12:10:43,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2018-02-04 12:10:43,463 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 23 [2018-02-04 12:10:43,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:43,463 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2018-02-04 12:10:43,464 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 12:10:43,464 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2018-02-04 12:10:43,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 12:10:43,464 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:43,464 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:10:43,464 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 12:10:43,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1853436480, now seen corresponding path program 1 times [2018-02-04 12:10:43,464 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:43,464 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:43,465 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:43,465 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:43,465 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:43,475 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:43,666 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-04 12:10:43,666 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:10:43,666 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:10:43,671 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:43,699 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:10:43,722 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-04 12:10:43,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:43,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:43,727 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 12:10:43,737 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 15 treesize of output 12 [2018-02-04 12:10:43,739 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-04 12:10:43,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:43,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:43,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:43,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-02-04 12:10:43,838 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 19 treesize of output 15 [2018-02-04 12:10:43,846 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 15 treesize of output 12 [2018-02-04 12:10:43,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:10:43,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:10:43,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:10:43,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-02-04 12:10:43,913 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-04 12:10:43,931 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:10:43,931 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-02-04 12:10:43,931 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 12:10:43,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 12:10:43,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-02-04 12:10:43,932 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 22 states. [2018-02-04 12:10:44,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:44,604 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2018-02-04 12:10:44,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 12:10:44,604 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 27 [2018-02-04 12:10:44,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:44,605 INFO L225 Difference]: With dead ends: 100 [2018-02-04 12:10:44,605 INFO L226 Difference]: Without dead ends: 100 [2018-02-04 12:10:44,606 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=183, Invalid=1077, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 12:10:44,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-04 12:10:44,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2018-02-04 12:10:44,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 12:10:44,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2018-02-04 12:10:44,612 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 27 [2018-02-04 12:10:44,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:44,612 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2018-02-04 12:10:44,612 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 12:10:44,612 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2018-02-04 12:10:44,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 12:10:44,613 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:44,613 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] [2018-02-04 12:10:44,613 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 12:10:44,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1699013504, now seen corresponding path program 1 times [2018-02-04 12:10:44,613 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:44,613 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:44,614 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:44,614 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:44,614 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:44,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:44,706 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-04 12:10:44,706 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:44,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:10:44,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:10:44,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:10:44,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:10:44,707 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand 6 states. [2018-02-04 12:10:44,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:44,822 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2018-02-04 12:10:44,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:10:44,822 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-02-04 12:10:44,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:44,823 INFO L225 Difference]: With dead ends: 92 [2018-02-04 12:10:44,823 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 12:10:44,823 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-04 12:10:44,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 12:10:44,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-02-04 12:10:44,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-04 12:10:44,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-02-04 12:10:44,826 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 28 [2018-02-04 12:10:44,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:44,826 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-02-04 12:10:44,826 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:10:44,826 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-02-04 12:10:44,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 12:10:44,826 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:44,826 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:10:44,827 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 12:10:44,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1948682038, now seen corresponding path program 1 times [2018-02-04 12:10:44,827 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:44,827 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:44,827 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:44,827 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:44,827 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:44,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:44,872 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-04 12:10:44,872 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:44,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:10:44,873 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:10:44,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:10:44,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:10:44,873 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 6 states. [2018-02-04 12:10:44,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:44,936 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-02-04 12:10:44,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:10:44,937 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-04 12:10:44,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:44,937 INFO L225 Difference]: With dead ends: 67 [2018-02-04 12:10:44,937 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 12:10:44,938 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-04 12:10:44,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 12:10:44,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-02-04 12:10:44,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 12:10:44,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2018-02-04 12:10:44,940 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 31 [2018-02-04 12:10:44,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:44,940 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2018-02-04 12:10:44,940 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:10:44,940 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2018-02-04 12:10:44,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 12:10:44,941 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:44,941 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:10:44,941 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 12:10:44,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1948682039, now seen corresponding path program 1 times [2018-02-04 12:10:44,941 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:44,941 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:44,942 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:44,942 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:44,942 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:44,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:44,949 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:45,014 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-04 12:10:45,015 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:45,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 12:10:45,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 12:10:45,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 12:10:45,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 12:10:45,016 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 9 states. [2018-02-04 12:10:45,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:45,103 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2018-02-04 12:10:45,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 12:10:45,103 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-02-04 12:10:45,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:45,103 INFO L225 Difference]: With dead ends: 72 [2018-02-04 12:10:45,103 INFO L226 Difference]: Without dead ends: 72 [2018-02-04 12:10:45,104 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-02-04 12:10:45,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-04 12:10:45,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-02-04 12:10:45,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 12:10:45,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-02-04 12:10:45,106 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 31 [2018-02-04 12:10:45,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:45,106 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-02-04 12:10:45,106 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 12:10:45,106 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-02-04 12:10:45,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 12:10:45,107 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:45,107 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:10:45,107 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 12:10:45,107 INFO L82 PathProgramCache]: Analyzing trace with hash -211494479, now seen corresponding path program 1 times [2018-02-04 12:10:45,107 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:45,107 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:45,108 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:45,108 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:45,108 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:45,119 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:45,259 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-04 12:10:45,260 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:10:45,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 12:10:45,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 12:10:45,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 12:10:45,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-04 12:10:45,261 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 13 states. [2018-02-04 12:10:45,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:10:45,412 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-02-04 12:10:45,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 12:10:45,413 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-02-04 12:10:45,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:10:45,413 INFO L225 Difference]: With dead ends: 89 [2018-02-04 12:10:45,413 INFO L226 Difference]: Without dead ends: 70 [2018-02-04 12:10:45,413 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2018-02-04 12:10:45,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-04 12:10:45,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-02-04 12:10:45,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-04 12:10:45,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-02-04 12:10:45,419 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 36 [2018-02-04 12:10:45,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:10:45,419 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-02-04 12:10:45,419 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 12:10:45,419 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-02-04 12:10:45,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 12:10:45,420 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:10:45,420 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:10:45,420 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 12:10:45,420 INFO L82 PathProgramCache]: Analyzing trace with hash -188862225, now seen corresponding path program 1 times [2018-02-04 12:10:45,420 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:10:45,421 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:10:45,421 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:45,421 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:45,421 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:10:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:45,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:10:45,625 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-04 12:10:45,625 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:10:45,625 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:10:45,630 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:10:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:10:45,648 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:10:45,650 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-04 12:10:45,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:45,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:45,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 12:10:45,674 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:45,675 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:10:45,677 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-04 12:10:45,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:45,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:45,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-04 12:10:45,704 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-04 12:10:45,705 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-04 12:10:45,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:45,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:45,710 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-04 12:10:45,710 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-02-04 12:10:45,733 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-04 12:10:45,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 11 treesize of output 10 [2018-02-04 12:10:45,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:45,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:10:45,743 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-04 12:10:45,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-02-04 12:10:52,098 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-04 12:10:52,101 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-04 12:10:52,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:10:52,114 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-04 12:10:52,115 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 12:10:52,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:10:52,132 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-04 12:10:52,132 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-02-04 12:10:52,206 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-04 12:10:52,234 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:10:52,235 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 26 [2018-02-04 12:10:52,235 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 12:10:52,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 12:10:52,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=632, Unknown=3, NotChecked=0, Total=702 [2018-02-04 12:10:52,236 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 27 states. [2018-02-04 12:11:05,508 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 79 DAG size of output 60 [2018-02-04 12:11:08,162 WARN L146 SmtUtils]: Spent 2044ms on a formula simplification. DAG size of input: 54 DAG size of output 45 [2018-02-04 12:11:10,363 WARN L146 SmtUtils]: Spent 2142ms on a formula simplification. DAG size of input: 54 DAG size of output 45 [2018-02-04 12:11:12,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:11:12,885 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2018-02-04 12:11:12,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 12:11:12,885 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 36 [2018-02-04 12:11:12,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:11:12,886 INFO L225 Difference]: With dead ends: 81 [2018-02-04 12:11:12,886 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 12:11:12,887 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=216, Invalid=1417, Unknown=7, NotChecked=0, Total=1640 [2018-02-04 12:11:12,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 12:11:12,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-02-04 12:11:12,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-04 12:11:12,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2018-02-04 12:11:12,889 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 36 [2018-02-04 12:11:12,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:11:12,890 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2018-02-04 12:11:12,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 12:11:12,890 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2018-02-04 12:11:12,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 12:11:12,891 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:11:12,891 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:11:12,892 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 12:11:12,892 INFO L82 PathProgramCache]: Analyzing trace with hash -7823713, now seen corresponding path program 1 times [2018-02-04 12:11:12,892 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:11:12,892 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:11:12,892 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:12,892 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:12,893 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:12,898 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:11:12,938 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-04 12:11:12,938 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:11:12,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 12:11:12,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 12:11:12,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 12:11:12,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 12:11:12,939 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand 7 states. [2018-02-04 12:11:13,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:11:13,000 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2018-02-04 12:11:13,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 12:11:13,000 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-02-04 12:11:13,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:11:13,001 INFO L225 Difference]: With dead ends: 77 [2018-02-04 12:11:13,001 INFO L226 Difference]: Without dead ends: 77 [2018-02-04 12:11:13,001 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 12:11:13,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-04 12:11:13,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-02-04 12:11:13,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 12:11:13,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-02-04 12:11:13,002 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 39 [2018-02-04 12:11:13,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:11:13,003 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-02-04 12:11:13,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 12:11:13,003 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-02-04 12:11:13,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 12:11:13,003 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:11:13,003 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:11:13,003 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 12:11:13,003 INFO L82 PathProgramCache]: Analyzing trace with hash -7823712, now seen corresponding path program 1 times [2018-02-04 12:11:13,003 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:11:13,003 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:11:13,004 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:13,004 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:13,004 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:13,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:13,012 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:11:13,130 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-04 12:11:13,130 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:11:13,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 12:11:13,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:11:13,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:11:13,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:11:13,131 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 8 states. [2018-02-04 12:11:13,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:11:13,188 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2018-02-04 12:11:13,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:11:13,189 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-02-04 12:11:13,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:11:13,189 INFO L225 Difference]: With dead ends: 111 [2018-02-04 12:11:13,189 INFO L226 Difference]: Without dead ends: 111 [2018-02-04 12:11:13,190 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:11:13,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-04 12:11:13,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-02-04 12:11:13,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-02-04 12:11:13,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2018-02-04 12:11:13,193 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 39 [2018-02-04 12:11:13,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:11:13,193 INFO L432 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2018-02-04 12:11:13,193 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:11:13,194 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2018-02-04 12:11:13,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-04 12:11:13,194 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:11:13,194 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:11:13,194 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 12:11:13,194 INFO L82 PathProgramCache]: Analyzing trace with hash -701857031, now seen corresponding path program 2 times [2018-02-04 12:11:13,194 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:11:13,194 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:11:13,195 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:13,195 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:13,195 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:13,209 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:11:13,591 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:11:13,592 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:11:13,592 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:11:13,597 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:11:13,617 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:11:13,617 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:11:13,619 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:11:13,633 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-04 12:11:13,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:13,639 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-04 12:11:13,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:13,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:11:13,644 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 12:11:13,679 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:11:13,687 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-04 12:11:13,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:13,694 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:11:13,695 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:11:13,695 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-04 12:11:13,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:13,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:11:13,700 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 12:11:13,736 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-04 12:11:13,738 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-04 12:11:13,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:13,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:11:13,744 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-04 12:11:13,744 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-02-04 12:11:13,768 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 29 treesize of output 30 [2018-02-04 12:11:13,772 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-04 12:11:13,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:13,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:11:13,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 12:11:13,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-02-04 12:11:15,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-02-04 12:11:15,717 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 10 treesize of output 1 [2018-02-04 12:11:15,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:15,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-02-04 12:11:15,725 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 12:11:15,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:11:15,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:11:15,734 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2018-02-04 12:11:15,798 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:11:15,814 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:11:15,814 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 29 [2018-02-04 12:11:15,815 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 12:11:15,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 12:11:15,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=793, Unknown=0, NotChecked=0, Total=870 [2018-02-04 12:11:15,815 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand 30 states. [2018-02-04 12:11:18,819 WARN L146 SmtUtils]: Spent 2277ms on a formula simplification. DAG size of input: 55 DAG size of output 39 [2018-02-04 12:11:19,726 WARN L146 SmtUtils]: Spent 276ms on a formula simplification. DAG size of input: 70 DAG size of output 56 [2018-02-04 12:11:20,338 WARN L146 SmtUtils]: Spent 402ms on a formula simplification. DAG size of input: 61 DAG size of output 47 [2018-02-04 12:11:22,676 WARN L146 SmtUtils]: Spent 2145ms on a formula simplification. DAG size of input: 68 DAG size of output 52 [2018-02-04 12:11:22,982 WARN L146 SmtUtils]: Spent 213ms on a formula simplification. DAG size of input: 74 DAG size of output 55 [2018-02-04 12:11:25,285 WARN L146 SmtUtils]: Spent 2199ms on a formula simplification. DAG size of input: 78 DAG size of output 58 [2018-02-04 12:11:25,919 WARN L146 SmtUtils]: Spent 543ms on a formula simplification. DAG size of input: 54 DAG size of output 43 [2018-02-04 12:11:27,656 WARN L146 SmtUtils]: Spent 1370ms on a formula simplification. DAG size of input: 58 DAG size of output 47 [2018-02-04 12:11:28,110 WARN L146 SmtUtils]: Spent 361ms on a formula simplification. DAG size of input: 68 DAG size of output 53 [2018-02-04 12:11:30,391 WARN L146 SmtUtils]: Spent 2204ms on a formula simplification. DAG size of input: 72 DAG size of output 56 [2018-02-04 12:11:31,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:11:31,912 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2018-02-04 12:11:31,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 12:11:31,912 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 41 [2018-02-04 12:11:31,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:11:31,913 INFO L225 Difference]: With dead ends: 112 [2018-02-04 12:11:31,913 INFO L226 Difference]: Without dead ends: 81 [2018-02-04 12:11:31,914 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=269, Invalid=1801, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 12:11:31,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-04 12:11:31,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 67. [2018-02-04 12:11:31,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 12:11:31,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-02-04 12:11:31,917 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 41 [2018-02-04 12:11:31,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:11:31,917 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-02-04 12:11:31,917 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 12:11:31,917 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-02-04 12:11:31,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 12:11:31,917 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:11:31,917 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:11:31,917 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 12:11:31,917 INFO L82 PathProgramCache]: Analyzing trace with hash 648064035, now seen corresponding path program 1 times [2018-02-04 12:11:31,918 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:11:31,918 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:11:31,918 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:31,918 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:11:31,918 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:31,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:31,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:11:32,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 12:11:32,363 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:11:32,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-02-04 12:11:32,364 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-04 12:11:32,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-04 12:11:32,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-02-04 12:11:32,364 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 16 states. [2018-02-04 12:11:32,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:11:32,685 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2018-02-04 12:11:32,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 12:11:32,685 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-02-04 12:11:32,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:11:32,686 INFO L225 Difference]: With dead ends: 119 [2018-02-04 12:11:32,686 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 12:11:32,686 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2018-02-04 12:11:32,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 12:11:32,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 98. [2018-02-04 12:11:32,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-04 12:11:32,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 120 transitions. [2018-02-04 12:11:32,688 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 120 transitions. Word has length 43 [2018-02-04 12:11:32,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:11:32,688 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 120 transitions. [2018-02-04 12:11:32,689 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-04 12:11:32,689 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 120 transitions. [2018-02-04 12:11:32,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 12:11:32,689 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:11:32,689 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:11:32,689 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 12:11:32,689 INFO L82 PathProgramCache]: Analyzing trace with hash 19279971, now seen corresponding path program 1 times [2018-02-04 12:11:32,689 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:11:32,689 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:11:32,690 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:32,690 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:32,690 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:32,696 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:11:32,748 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-04 12:11:32,748 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:11:32,748 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:11:32,757 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:32,778 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:11:32,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 12:11:32,856 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:11:32,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 11 [2018-02-04 12:11:32,856 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 12:11:32,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 12:11:32,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-02-04 12:11:32,857 INFO L87 Difference]: Start difference. First operand 98 states and 120 transitions. Second operand 12 states. [2018-02-04 12:11:32,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:11:32,939 INFO L93 Difference]: Finished difference Result 97 states and 117 transitions. [2018-02-04 12:11:32,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 12:11:32,940 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-02-04 12:11:32,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:11:32,940 INFO L225 Difference]: With dead ends: 97 [2018-02-04 12:11:32,941 INFO L226 Difference]: Without dead ends: 97 [2018-02-04 12:11:32,941 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-02-04 12:11:32,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-04 12:11:32,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-02-04 12:11:32,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-04 12:11:32,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 117 transitions. [2018-02-04 12:11:32,943 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 117 transitions. Word has length 45 [2018-02-04 12:11:32,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:11:32,943 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 117 transitions. [2018-02-04 12:11:32,943 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 12:11:32,943 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2018-02-04 12:11:32,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-04 12:11:32,943 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:11:32,944 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:11:32,944 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 12:11:32,944 INFO L82 PathProgramCache]: Analyzing trace with hash 19279972, now seen corresponding path program 1 times [2018-02-04 12:11:32,944 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:11:32,944 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:11:32,944 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:32,944 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:32,945 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:32,951 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:11:33,063 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-04 12:11:33,063 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:11:33,063 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:11:33,068 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:33,087 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:11:33,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:11:33,199 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:11:33,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 22 [2018-02-04 12:11:33,199 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 12:11:33,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 12:11:33,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2018-02-04 12:11:33,200 INFO L87 Difference]: Start difference. First operand 97 states and 117 transitions. Second operand 23 states. [2018-02-04 12:11:33,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:11:33,478 INFO L93 Difference]: Finished difference Result 141 states and 170 transitions. [2018-02-04 12:11:33,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-04 12:11:33,479 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 45 [2018-02-04 12:11:33,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:11:33,480 INFO L225 Difference]: With dead ends: 141 [2018-02-04 12:11:33,480 INFO L226 Difference]: Without dead ends: 141 [2018-02-04 12:11:33,480 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=937, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 12:11:33,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-04 12:11:33,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 118. [2018-02-04 12:11:33,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-04 12:11:33,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 149 transitions. [2018-02-04 12:11:33,484 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 149 transitions. Word has length 45 [2018-02-04 12:11:33,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:11:33,485 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 149 transitions. [2018-02-04 12:11:33,485 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 12:11:33,485 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 149 transitions. [2018-02-04 12:11:33,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 12:11:33,485 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:11:33,485 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:11:33,485 INFO L371 AbstractCegarLoop]: === Iteration 22 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 12:11:33,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1348184644, now seen corresponding path program 1 times [2018-02-04 12:11:33,486 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:11:33,486 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:11:33,487 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:33,487 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:33,487 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:33,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:33,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:11:33,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 12:11:33,555 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:11:33,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:11:33,555 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:11:33,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:11:33,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:11:33,556 INFO L87 Difference]: Start difference. First operand 118 states and 149 transitions. Second operand 8 states. [2018-02-04 12:11:33,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:11:33,633 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2018-02-04 12:11:33,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:11:33,634 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-02-04 12:11:33,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:11:33,635 INFO L225 Difference]: With dead ends: 117 [2018-02-04 12:11:33,636 INFO L226 Difference]: Without dead ends: 117 [2018-02-04 12:11:33,636 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-02-04 12:11:33,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-04 12:11:33,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-02-04 12:11:33,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 12:11:33,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 145 transitions. [2018-02-04 12:11:33,639 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 145 transitions. Word has length 47 [2018-02-04 12:11:33,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:11:33,640 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 145 transitions. [2018-02-04 12:11:33,640 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:11:33,640 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 145 transitions. [2018-02-04 12:11:33,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 12:11:33,640 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:11:33,640 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:11:33,640 INFO L371 AbstractCegarLoop]: === Iteration 23 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 12:11:33,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1348184645, now seen corresponding path program 1 times [2018-02-04 12:11:33,641 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:11:33,641 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:11:33,641 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:33,641 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:33,642 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:33,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:11:33,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 12:11:33,683 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:11:33,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:11:33,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:11:33,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:11:33,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:11:33,684 INFO L87 Difference]: Start difference. First operand 117 states and 145 transitions. Second operand 5 states. [2018-02-04 12:11:33,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:11:33,716 INFO L93 Difference]: Finished difference Result 119 states and 143 transitions. [2018-02-04 12:11:33,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:11:33,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-02-04 12:11:33,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:11:33,717 INFO L225 Difference]: With dead ends: 119 [2018-02-04 12:11:33,717 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 12:11:33,717 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:11:33,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 12:11:33,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 114. [2018-02-04 12:11:33,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-04 12:11:33,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 138 transitions. [2018-02-04 12:11:33,721 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 138 transitions. Word has length 47 [2018-02-04 12:11:33,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:11:33,721 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 138 transitions. [2018-02-04 12:11:33,721 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:11:33,721 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 138 transitions. [2018-02-04 12:11:33,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-04 12:11:33,722 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:11:33,722 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:11:33,722 INFO L371 AbstractCegarLoop]: === Iteration 24 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 12:11:33,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1381663923, now seen corresponding path program 1 times [2018-02-04 12:11:33,722 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:11:33,722 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:11:33,723 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:33,723 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:33,723 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:33,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:11:34,098 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 12:11:34,098 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:11:34,098 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:11:34,104 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:34,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:34,122 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:11:34,124 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-04 12:11:34,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:34,127 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-04 12:11:34,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:34,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:11:34,131 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 12:11:34,147 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:11:34,148 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-04 12:11:34,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:34,154 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:11:34,154 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:11:34,154 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-04 12:11:34,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:34,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:11:34,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 12:11:34,193 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-04 12:11:34,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-04 12:11:34,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:34,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:11:34,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:11:34,198 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-02-04 12:11:34,219 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 28 treesize of output 29 [2018-02-04 12:11:34,221 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-04 12:11:34,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:34,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:11:34,228 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-04 12:11:34,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-02-04 12:11:35,701 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 33 treesize of output 31 [2018-02-04 12:11:35,702 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 10 treesize of output 1 [2018-02-04 12:11:35,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:35,710 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-04 12:11:35,710 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 12:11:35,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:11:35,717 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-04 12:11:35,717 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:32 [2018-02-04 12:11:35,788 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 12:11:35,805 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:11:35,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 29 [2018-02-04 12:11:35,806 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 12:11:35,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 12:11:35,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=791, Unknown=0, NotChecked=0, Total=870 [2018-02-04 12:11:35,806 INFO L87 Difference]: Start difference. First operand 114 states and 138 transitions. Second operand 30 states. [2018-02-04 12:11:36,507 WARN L146 SmtUtils]: Spent 193ms on a formula simplification. DAG size of input: 48 DAG size of output 32 [2018-02-04 12:11:37,823 WARN L146 SmtUtils]: Spent 1108ms on a formula simplification. DAG size of input: 63 DAG size of output 49 [2018-02-04 12:11:40,579 WARN L146 SmtUtils]: Spent 1858ms on a formula simplification. DAG size of input: 54 DAG size of output 40 [2018-02-04 12:11:41,320 WARN L146 SmtUtils]: Spent 201ms on a formula simplification. DAG size of input: 61 DAG size of output 45 [2018-02-04 12:11:41,509 WARN L146 SmtUtils]: Spent 165ms on a formula simplification. DAG size of input: 69 DAG size of output 51 [2018-02-04 12:11:44,901 WARN L146 SmtUtils]: Spent 3364ms on a formula simplification. DAG size of input: 73 DAG size of output 54 [2018-02-04 12:11:45,259 WARN L146 SmtUtils]: Spent 191ms on a formula simplification. DAG size of input: 47 DAG size of output 36 [2018-02-04 12:11:48,128 WARN L146 SmtUtils]: Spent 2129ms on a formula simplification. DAG size of input: 48 DAG size of output 38 [2018-02-04 12:11:50,501 WARN L146 SmtUtils]: Spent 2186ms on a formula simplification. DAG size of input: 59 DAG size of output 47 [2018-02-04 12:11:50,855 WARN L146 SmtUtils]: Spent 274ms on a formula simplification. DAG size of input: 63 DAG size of output 50 [2018-02-04 12:11:52,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:11:52,272 INFO L93 Difference]: Finished difference Result 133 states and 152 transitions. [2018-02-04 12:11:52,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 12:11:52,272 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 48 [2018-02-04 12:11:52,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:11:52,272 INFO L225 Difference]: With dead ends: 133 [2018-02-04 12:11:52,272 INFO L226 Difference]: Without dead ends: 133 [2018-02-04 12:11:52,273 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=279, Invalid=1977, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 12:11:52,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-04 12:11:52,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 76. [2018-02-04 12:11:52,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 12:11:52,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2018-02-04 12:11:52,274 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 48 [2018-02-04 12:11:52,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:11:52,274 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2018-02-04 12:11:52,274 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 12:11:52,274 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2018-02-04 12:11:52,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 12:11:52,275 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:11:52,275 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:11:52,275 INFO L371 AbstractCegarLoop]: === Iteration 25 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 12:11:52,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1474955739, now seen corresponding path program 1 times [2018-02-04 12:11:52,275 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:11:52,275 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:11:52,275 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:52,275 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:52,276 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:52,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:11:52,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-04 12:11:52,311 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:11:52,311 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:11:52,316 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:52,333 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:11:52,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 12:11:52,373 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:11:52,374 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 10 [2018-02-04 12:11:52,374 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 12:11:52,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 12:11:52,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-02-04 12:11:52,374 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 11 states. [2018-02-04 12:11:52,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:11:52,455 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2018-02-04 12:11:52,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 12:11:52,456 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2018-02-04 12:11:52,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:11:52,456 INFO L225 Difference]: With dead ends: 75 [2018-02-04 12:11:52,456 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 12:11:52,457 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-02-04 12:11:52,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 12:11:52,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-02-04 12:11:52,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 12:11:52,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2018-02-04 12:11:52,458 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 49 [2018-02-04 12:11:52,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:11:52,459 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2018-02-04 12:11:52,459 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 12:11:52,459 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2018-02-04 12:11:52,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-04 12:11:52,459 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:11:52,459 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:11:52,459 INFO L371 AbstractCegarLoop]: === Iteration 26 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 12:11:52,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1474955738, now seen corresponding path program 1 times [2018-02-04 12:11:52,459 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:11:52,460 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:11:52,460 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:52,460 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:52,460 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:52,464 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:11:52,584 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-04 12:11:52,585 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:11:52,585 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:11:52,592 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:52,607 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:11:52,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:11:52,725 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:11:52,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2018-02-04 12:11:52,726 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-04 12:11:52,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-04 12:11:52,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2018-02-04 12:11:52,726 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 25 states. [2018-02-04 12:11:53,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:11:53,005 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2018-02-04 12:11:53,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 12:11:53,005 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 49 [2018-02-04 12:11:53,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:11:53,005 INFO L225 Difference]: With dead ends: 106 [2018-02-04 12:11:53,005 INFO L226 Difference]: Without dead ends: 106 [2018-02-04 12:11:53,006 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=1189, Unknown=0, NotChecked=0, Total=1332 [2018-02-04 12:11:53,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-02-04 12:11:53,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2018-02-04 12:11:53,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-04 12:11:53,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2018-02-04 12:11:53,008 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 49 [2018-02-04 12:11:53,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:11:53,008 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2018-02-04 12:11:53,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-04 12:11:53,008 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2018-02-04 12:11:53,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 12:11:53,008 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:11:53,009 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:11:53,009 INFO L371 AbstractCegarLoop]: === Iteration 27 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 12:11:53,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1071735008, now seen corresponding path program 1 times [2018-02-04 12:11:53,009 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:11:53,009 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:11:53,010 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:53,010 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:53,010 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:11:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:53,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:11:53,105 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:11:53,105 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:11:53,105 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:11:53,116 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:11:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:11:53,147 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:11:53,163 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-04 12:11:53,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:53,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:11:53,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 12:11:53,193 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:11:53,193 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:11:53,194 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-04 12:11:53,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:53,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:11:53,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-04 12:11:53,230 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-04 12:11:53,232 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-04 12:11:53,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:53,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:11:53,240 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-04 12:11:53,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-02-04 12:11:53,267 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-04 12:11:53,270 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-04 12:11:53,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:11:53,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:11:53,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-04 12:11:53,284 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-02-04 12:12:06,445 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 53 treesize of output 45 [2018-02-04 12:12:06,447 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:12:06,451 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 22 treesize of output 31 [2018-02-04 12:12:06,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:12:06,464 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 20 treesize of output 12 [2018-02-04 12:12:06,464 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:12:06,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:12:06,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:12:06,487 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:75, output treesize:51 [2018-02-04 12:12:06,565 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:12:06,581 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:12:06,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 25] total 34 [2018-02-04 12:12:06,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-04 12:12:06,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-04 12:12:06,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1033, Unknown=5, NotChecked=0, Total=1122 [2018-02-04 12:12:06,582 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand 34 states. [2018-02-04 12:12:11,667 WARN L146 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 81 DAG size of output 71 [2018-02-04 12:12:30,583 WARN L146 SmtUtils]: Spent 4053ms on a formula simplification. DAG size of input: 101 DAG size of output 93 [2018-02-04 12:12:40,737 WARN L143 SmtUtils]: Spent 2014ms on a formula simplification that was a NOOP. DAG size: 67 [2018-02-04 12:12:57,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:12:57,461 INFO L93 Difference]: Finished difference Result 134 states and 148 transitions. [2018-02-04 12:12:57,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-04 12:12:57,461 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 52 [2018-02-04 12:12:57,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:12:57,462 INFO L225 Difference]: With dead ends: 134 [2018-02-04 12:12:57,462 INFO L226 Difference]: Without dead ends: 96 [2018-02-04 12:12:57,462 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1062 ImplicationChecksByTransitivity, 46.3s TimeCoverageRelationStatistics Valid=389, Invalid=4567, Unknown=14, NotChecked=0, Total=4970 [2018-02-04 12:12:57,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-02-04 12:12:57,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 83. [2018-02-04 12:12:57,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-04 12:12:57,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2018-02-04 12:12:57,464 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 52 [2018-02-04 12:12:57,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:12:57,464 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2018-02-04 12:12:57,464 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-04 12:12:57,464 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2018-02-04 12:12:57,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-04 12:12:57,464 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:12:57,464 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:12:57,464 INFO L371 AbstractCegarLoop]: === Iteration 28 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 12:12:57,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1302686214, now seen corresponding path program 2 times [2018-02-04 12:12:57,465 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:12:57,465 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:12:57,465 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:12:57,465 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:12:57,465 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:12:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:12:57,471 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:12:57,613 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:12:57,613 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:12:57,613 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:12:57,618 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:12:57,643 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:12:57,643 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:12:57,646 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:12:57,651 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-04 12:12:57,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:12:57,656 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-04 12:12:57,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:12:57,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:12:57,659 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 12:12:57,680 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:12:57,681 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-04 12:12:57,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:12:57,687 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:12:57,688 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:12:57,688 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-04 12:12:57,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:12:57,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:12:57,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-04 12:12:57,717 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-04 12:12:57,718 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-04 12:12:57,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:12:57,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:12:57,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:12:57,724 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-02-04 12:12:57,745 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 29 treesize of output 30 [2018-02-04 12:12:57,746 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-04 12:12:57,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:12:57,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:12:57,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:12:57,756 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-02-04 12:12:58,920 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 46 treesize of output 40 [2018-02-04 12:12:58,926 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-04 12:12:58,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:12:58,935 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 21 treesize of output 13 [2018-02-04 12:12:58,935 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:12:58,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:12:58,956 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 2 xjuncts. [2018-02-04 12:12:58,956 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:81 [2018-02-04 12:12:59,127 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:12:59,145 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:12:59,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 25] total 36 [2018-02-04 12:12:59,146 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 12:12:59,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 12:12:59,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1168, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 12:12:59,146 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 36 states. [2018-02-04 12:13:02,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:13:02,774 INFO L93 Difference]: Finished difference Result 176 states and 196 transitions. [2018-02-04 12:13:02,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 12:13:02,774 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 65 [2018-02-04 12:13:02,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:13:02,775 INFO L225 Difference]: With dead ends: 176 [2018-02-04 12:13:02,775 INFO L226 Difference]: Without dead ends: 117 [2018-02-04 12:13:02,776 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=385, Invalid=4727, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 12:13:02,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-04 12:13:02,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 93. [2018-02-04 12:13:02,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-04 12:13:02,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2018-02-04 12:13:02,777 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 65 [2018-02-04 12:13:02,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:13:02,777 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2018-02-04 12:13:02,777 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 12:13:02,777 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2018-02-04 12:13:02,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-04 12:13:02,778 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:13:02,778 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:13:02,778 INFO L371 AbstractCegarLoop]: === Iteration 29 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 12:13:02,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1081639798, now seen corresponding path program 1 times [2018-02-04 12:13:02,778 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:13:02,778 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:13:02,778 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:13:02,778 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:13:02,778 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:13:02,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:13:02,785 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:13:02,993 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:13:02,994 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:13:02,994 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:13:02,998 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:13:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:13:03,018 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:13:03,049 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 18 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:13:03,066 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:13:03,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 20 [2018-02-04 12:13:03,066 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 12:13:03,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 12:13:03,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2018-02-04 12:13:03,066 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand 21 states. [2018-02-04 12:13:03,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:13:03,321 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2018-02-04 12:13:03,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 12:13:03,321 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 71 [2018-02-04 12:13:03,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:13:03,321 INFO L225 Difference]: With dead ends: 112 [2018-02-04 12:13:03,321 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 12:13:03,322 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2018-02-04 12:13:03,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 12:13:03,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 95. [2018-02-04 12:13:03,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 12:13:03,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2018-02-04 12:13:03,324 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 71 [2018-02-04 12:13:03,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:13:03,324 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2018-02-04 12:13:03,324 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 12:13:03,324 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2018-02-04 12:13:03,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-04 12:13:03,325 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:13:03,325 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:13:03,325 INFO L371 AbstractCegarLoop]: === Iteration 30 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 12:13:03,325 INFO L82 PathProgramCache]: Analyzing trace with hash 2131279692, now seen corresponding path program 1 times [2018-02-04 12:13:03,325 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:13:03,325 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:13:03,326 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:13:03,326 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:13:03,326 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:13:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:13:03,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:13:03,572 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:13:03,572 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:13:03,572 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:13:03,577 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:13:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:13:03,606 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:13:03,651 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:13:03,668 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:13:03,668 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 21 [2018-02-04 12:13:03,668 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 12:13:03,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 12:13:03,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2018-02-04 12:13:03,668 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 22 states. [2018-02-04 12:13:04,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:13:04,024 INFO L93 Difference]: Finished difference Result 127 states and 142 transitions. [2018-02-04 12:13:04,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 12:13:04,024 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 75 [2018-02-04 12:13:04,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:13:04,024 INFO L225 Difference]: With dead ends: 127 [2018-02-04 12:13:04,025 INFO L226 Difference]: Without dead ends: 127 [2018-02-04 12:13:04,025 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=889, Unknown=0, NotChecked=0, Total=992 [2018-02-04 12:13:04,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-04 12:13:04,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 96. [2018-02-04 12:13:04,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 12:13:04,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2018-02-04 12:13:04,027 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 75 [2018-02-04 12:13:04,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:13:04,027 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2018-02-04 12:13:04,027 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 12:13:04,028 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2018-02-04 12:13:04,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-04 12:13:04,028 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:13:04,028 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:13:04,028 INFO L371 AbstractCegarLoop]: === Iteration 31 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 12:13:04,028 INFO L82 PathProgramCache]: Analyzing trace with hash 119487994, now seen corresponding path program 3 times [2018-02-04 12:13:04,029 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:13:04,029 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:13:04,029 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:13:04,029 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:13:04,029 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:13:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:13:04,040 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:13:04,194 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:13:04,195 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:13:04,195 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:13:04,202 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 12:13:04,253 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 12:13:04,254 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:13:04,257 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:13:04,259 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-04 12:13:04,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:04,263 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-04 12:13:04,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:04,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:13:04,266 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 12:13:04,293 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:13:04,293 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:13:04,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 12:13:04,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:04,301 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-04 12:13:04,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:04,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:13:04,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-04 12:13:04,340 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-04 12:13:04,341 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-04 12:13:04,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:04,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:13:04,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:13:04,348 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:28 [2018-02-04 12:13:04,372 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 29 treesize of output 30 [2018-02-04 12:13:04,373 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-04 12:13:04,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:04,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:13:04,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:13:04,382 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-02-04 12:13:05,123 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 45 treesize of output 39 [2018-02-04 12:13:05,127 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 15 treesize of output 12 [2018-02-04 12:13:05,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:13:05,134 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 21 treesize of output 13 [2018-02-04 12:13:05,134 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:05,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:13:05,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-04 12:13:05,148 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:59, output treesize:66 [2018-02-04 12:13:05,342 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:13:05,360 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:13:05,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 28] total 41 [2018-02-04 12:13:05,360 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-04 12:13:05,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-04 12:13:05,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1540, Unknown=0, NotChecked=0, Total=1640 [2018-02-04 12:13:05,361 INFO L87 Difference]: Start difference. First operand 96 states and 109 transitions. Second operand 41 states. [2018-02-04 12:13:08,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:13:08,571 INFO L93 Difference]: Finished difference Result 333 states and 380 transitions. [2018-02-04 12:13:08,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-04 12:13:08,572 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 78 [2018-02-04 12:13:08,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:13:08,572 INFO L225 Difference]: With dead ends: 333 [2018-02-04 12:13:08,572 INFO L226 Difference]: Without dead ends: 193 [2018-02-04 12:13:08,574 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1404 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=500, Invalid=7690, Unknown=0, NotChecked=0, Total=8190 [2018-02-04 12:13:08,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-04 12:13:08,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 157. [2018-02-04 12:13:08,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-04 12:13:08,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 187 transitions. [2018-02-04 12:13:08,578 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 187 transitions. Word has length 78 [2018-02-04 12:13:08,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:13:08,578 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 187 transitions. [2018-02-04 12:13:08,578 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-04 12:13:08,578 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 187 transitions. [2018-02-04 12:13:08,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-04 12:13:08,579 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:13:08,579 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:13:08,579 INFO L371 AbstractCegarLoop]: === Iteration 32 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 12:13:08,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1554803288, now seen corresponding path program 2 times [2018-02-04 12:13:08,579 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:13:08,580 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:13:08,580 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:13:08,580 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:13:08,580 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:13:08,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:13:08,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:13:08,815 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 18 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:13:08,816 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:13:08,816 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:13:08,823 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:13:08,869 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:13:08,870 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:13:08,873 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:13:09,053 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 32 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:13:09,070 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:13:09,070 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 29 [2018-02-04 12:13:09,070 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-04 12:13:09,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-04 12:13:09,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2018-02-04 12:13:09,071 INFO L87 Difference]: Start difference. First operand 157 states and 187 transitions. Second operand 30 states. [2018-02-04 12:13:09,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:13:09,538 INFO L93 Difference]: Finished difference Result 213 states and 247 transitions. [2018-02-04 12:13:09,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 12:13:09,538 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 84 [2018-02-04 12:13:09,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:13:09,538 INFO L225 Difference]: With dead ends: 213 [2018-02-04 12:13:09,538 INFO L226 Difference]: Without dead ends: 213 [2018-02-04 12:13:09,539 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=1625, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 12:13:09,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-02-04 12:13:09,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 167. [2018-02-04 12:13:09,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-02-04 12:13:09,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 200 transitions. [2018-02-04 12:13:09,541 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 200 transitions. Word has length 84 [2018-02-04 12:13:09,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:13:09,541 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 200 transitions. [2018-02-04 12:13:09,541 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-04 12:13:09,541 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 200 transitions. [2018-02-04 12:13:09,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-04 12:13:09,542 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:13:09,542 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:13:09,542 INFO L371 AbstractCegarLoop]: === Iteration 33 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 12:13:09,542 INFO L82 PathProgramCache]: Analyzing trace with hash 432851257, now seen corresponding path program 1 times [2018-02-04 12:13:09,542 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:13:09,543 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:13:09,543 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:13:09,543 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:13:09,543 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:13:09,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:13:09,564 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:13:10,080 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-04 12:13:10,080 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:13:10,080 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:13:10,085 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:13:10,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:13:10,113 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:13:10,120 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-04 12:13:10,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:10,125 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-04 12:13:10,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:10,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:13:10,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 12:13:10,166 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:13:10,167 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-04 12:13:10,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:10,174 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:13:10,174 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:13:10,175 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-04 12:13:10,175 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:10,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:13:10,179 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 12:13:10,222 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-04 12:13:10,223 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-04 12:13:10,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:10,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:13:10,231 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-04 12:13:10,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-02-04 12:13:10,263 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 29 treesize of output 30 [2018-02-04 12:13:10,265 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-04 12:13:10,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:10,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:13:10,272 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-04 12:13:10,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2018-02-04 12:13:13,876 WARN L146 SmtUtils]: Spent 285ms on a formula simplification. DAG size of input: 52 DAG size of output 32 [2018-02-04 12:13:16,681 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 47 treesize of output 41 [2018-02-04 12:13:16,686 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-04 12:13:16,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:13:16,693 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 22 treesize of output 14 [2018-02-04 12:13:16,693 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:16,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:13:16,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:13:16,718 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2018-02-04 12:13:16,846 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 4 proven. 66 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 12:13:16,862 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:13:16,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 55 [2018-02-04 12:13:16,863 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-04 12:13:16,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-04 12:13:16,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2900, Unknown=1, NotChecked=0, Total=3080 [2018-02-04 12:13:16,864 INFO L87 Difference]: Start difference. First operand 167 states and 200 transitions. Second operand 56 states. [2018-02-04 12:13:30,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:13:30,709 INFO L93 Difference]: Finished difference Result 231 states and 262 transitions. [2018-02-04 12:13:30,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-04 12:13:30,709 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 87 [2018-02-04 12:13:30,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:13:30,710 INFO L225 Difference]: With dead ends: 231 [2018-02-04 12:13:30,710 INFO L226 Difference]: Without dead ends: 231 [2018-02-04 12:13:30,711 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1907 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=598, Invalid=8331, Unknown=1, NotChecked=0, Total=8930 [2018-02-04 12:13:30,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-02-04 12:13:30,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 108. [2018-02-04 12:13:30,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-04 12:13:30,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2018-02-04 12:13:30,714 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 87 [2018-02-04 12:13:30,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:13:30,714 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2018-02-04 12:13:30,714 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-04 12:13:30,714 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2018-02-04 12:13:30,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-04 12:13:30,714 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:13:30,714 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:13:30,714 INFO L371 AbstractCegarLoop]: === Iteration 34 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 12:13:30,714 INFO L82 PathProgramCache]: Analyzing trace with hash 21370394, now seen corresponding path program 2 times [2018-02-04 12:13:30,714 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:13:30,714 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:13:30,715 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:13:30,715 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:13:30,715 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:13:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:13:30,721 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:13:30,927 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 18 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:13:30,927 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:13:30,927 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:13:30,932 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:13:30,963 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 12:13:30,963 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:13:30,965 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:13:31,025 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-02-04 12:13:31,056 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:13:31,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [18] total 21 [2018-02-04 12:13:31,057 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 12:13:31,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 12:13:31,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-02-04 12:13:31,057 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand 22 states. [2018-02-04 12:13:31,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:13:31,487 INFO L93 Difference]: Finished difference Result 153 states and 171 transitions. [2018-02-04 12:13:31,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 12:13:31,487 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 88 [2018-02-04 12:13:31,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:13:31,488 INFO L225 Difference]: With dead ends: 153 [2018-02-04 12:13:31,488 INFO L226 Difference]: Without dead ends: 153 [2018-02-04 12:13:31,488 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=256, Invalid=1636, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 12:13:31,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-04 12:13:31,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 113. [2018-02-04 12:13:31,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 12:13:31,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 132 transitions. [2018-02-04 12:13:31,490 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 132 transitions. Word has length 88 [2018-02-04 12:13:31,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:13:31,490 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 132 transitions. [2018-02-04 12:13:31,490 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 12:13:31,490 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 132 transitions. [2018-02-04 12:13:31,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-04 12:13:31,491 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:13:31,491 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:13:31,491 INFO L371 AbstractCegarLoop]: === Iteration 35 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 12:13:31,491 INFO L82 PathProgramCache]: Analyzing trace with hash 657968236, now seen corresponding path program 4 times [2018-02-04 12:13:31,491 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:13:31,491 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:13:31,492 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:13:31,492 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:13:31,492 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:13:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:13:31,500 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:13:31,677 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 8 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:13:31,678 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:13:31,678 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:13:31,686 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-04 12:13:31,735 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-04 12:13:31,735 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:13:31,740 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:13:31,743 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-04 12:13:31,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:31,748 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-04 12:13:31,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:31,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:13:31,752 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 12:13:31,790 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:13:31,791 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-04 12:13:31,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:31,799 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:13:31,800 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:13:31,800 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-04 12:13:31,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:31,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:13:31,806 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 12:13:31,852 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-04 12:13:31,854 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-04 12:13:31,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:31,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:13:31,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:13:31,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-02-04 12:13:31,880 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 28 treesize of output 29 [2018-02-04 12:13:31,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 13 treesize of output 12 [2018-02-04 12:13:31,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:31,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:13:31,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-04 12:13:31,890 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-02-04 12:13:32,912 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 46 treesize of output 40 [2018-02-04 12:13:32,916 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 15 treesize of output 12 [2018-02-04 12:13:32,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:13:32,923 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 22 treesize of output 14 [2018-02-04 12:13:32,923 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:32,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:13:32,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:13:32,938 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2018-02-04 12:13:33,032 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:13:33,048 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:13:33,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 31] total 46 [2018-02-04 12:13:33,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-04 12:13:33,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-04 12:13:33,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1949, Unknown=0, NotChecked=0, Total=2070 [2018-02-04 12:13:33,049 INFO L87 Difference]: Start difference. First operand 113 states and 132 transitions. Second operand 46 states. [2018-02-04 12:13:44,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:13:44,076 INFO L93 Difference]: Finished difference Result 252 states and 284 transitions. [2018-02-04 12:13:44,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-02-04 12:13:44,077 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 91 [2018-02-04 12:13:44,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:13:44,078 INFO L225 Difference]: With dead ends: 252 [2018-02-04 12:13:44,078 INFO L226 Difference]: Without dead ends: 154 [2018-02-04 12:13:44,079 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1739 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=561, Invalid=8945, Unknown=0, NotChecked=0, Total=9506 [2018-02-04 12:13:44,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-02-04 12:13:44,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 117. [2018-02-04 12:13:44,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 12:13:44,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 135 transitions. [2018-02-04 12:13:44,080 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 135 transitions. Word has length 91 [2018-02-04 12:13:44,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:13:44,080 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 135 transitions. [2018-02-04 12:13:44,080 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-04 12:13:44,080 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 135 transitions. [2018-02-04 12:13:44,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-02-04 12:13:44,081 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:13:44,081 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:13:44,081 INFO L371 AbstractCegarLoop]: === Iteration 36 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 12:13:44,081 INFO L82 PathProgramCache]: Analyzing trace with hash -2017086444, now seen corresponding path program 5 times [2018-02-04 12:13:44,081 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:13:44,081 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:13:44,081 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:13:44,082 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:13:44,082 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:13:44,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:13:44,090 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:13:44,335 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 10 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:13:44,335 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:13:44,335 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:13:44,340 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-04 12:13:44,418 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-02-04 12:13:44,418 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:13:44,421 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:13:44,423 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-04 12:13:44,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:44,427 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-04 12:13:44,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:44,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:13:44,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 12:13:44,459 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:13:44,459 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-04 12:13:44,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:44,464 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:13:44,465 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:13:44,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-04 12:13:44,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:44,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:13:44,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-04 12:13:44,497 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-04 12:13:44,498 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-04 12:13:44,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:44,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:13:44,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:13:44,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-02-04 12:13:44,523 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 28 treesize of output 29 [2018-02-04 12:13:44,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 13 treesize of output 12 [2018-02-04 12:13:44,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:44,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:13:44,539 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-04 12:13:44,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-02-04 12:13:45,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 56 [2018-02-04 12:13:45,722 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 48 treesize of output 46 [2018-02-04 12:13:45,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:13:45,763 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 40 treesize of output 31 [2018-02-04 12:13:45,763 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:45,790 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 38 treesize of output 29 [2018-02-04 12:13:45,791 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:45,792 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 31 treesize of output 22 [2018-02-04 12:13:45,792 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:45,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2018-02-04 12:13:45,845 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-04 12:13:45,870 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 29 treesize of output 19 [2018-02-04 12:13:45,871 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:45,891 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 31 treesize of output 21 [2018-02-04 12:13:45,891 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 12:13:45,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 30 [2018-02-04 12:13:45,917 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-02-04 12:13:45,933 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 21 treesize of output 19 [2018-02-04 12:13:45,933 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-02-04 12:13:45,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 12:13:45,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:13:45,953 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:56, output treesize:32 [2018-02-04 12:13:46,053 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 78 proven. 41 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-02-04 12:13:46,069 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:13:46,069 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23] total 40 [2018-02-04 12:13:46,070 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-04 12:13:46,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-04 12:13:46,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1450, Unknown=0, NotChecked=0, Total=1560 [2018-02-04 12:13:46,070 INFO L87 Difference]: Start difference. First operand 117 states and 135 transitions. Second operand 40 states. [2018-02-04 12:13:49,342 WARN L146 SmtUtils]: Spent 391ms on a formula simplification. DAG size of input: 61 DAG size of output 45 [2018-02-04 12:13:49,692 WARN L146 SmtUtils]: Spent 315ms on a formula simplification. DAG size of input: 62 DAG size of output 46 [2018-02-04 12:13:50,252 WARN L146 SmtUtils]: Spent 250ms on a formula simplification. DAG size of input: 59 DAG size of output 43 [2018-02-04 12:13:50,617 WARN L146 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 57 DAG size of output 41 [2018-02-04 12:13:51,978 WARN L146 SmtUtils]: Spent 551ms on a formula simplification. DAG size of input: 58 DAG size of output 42 [2018-02-04 12:13:52,826 WARN L146 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 55 DAG size of output 39 [2018-02-04 12:14:07,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:14:07,445 INFO L93 Difference]: Finished difference Result 276 states and 311 transitions. [2018-02-04 12:14:07,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-04 12:14:07,445 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 104 [2018-02-04 12:14:07,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:14:07,446 INFO L225 Difference]: With dead ends: 276 [2018-02-04 12:14:07,447 INFO L226 Difference]: Without dead ends: 159 [2018-02-04 12:14:07,447 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1259 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=524, Invalid=6616, Unknown=0, NotChecked=0, Total=7140 [2018-02-04 12:14:07,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-04 12:14:07,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 120. [2018-02-04 12:14:07,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-04 12:14:07,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 138 transitions. [2018-02-04 12:14:07,450 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 138 transitions. Word has length 104 [2018-02-04 12:14:07,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:14:07,450 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 138 transitions. [2018-02-04 12:14:07,450 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-04 12:14:07,450 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 138 transitions. [2018-02-04 12:14:07,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-02-04 12:14:07,451 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:14:07,451 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:14:07,451 INFO L371 AbstractCegarLoop]: === Iteration 37 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-04 12:14:07,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1898575794, now seen corresponding path program 3 times [2018-02-04 12:14:07,451 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:14:07,451 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:14:07,452 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:14:07,452 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:14:07,452 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:14:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:14:07,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:14:07,718 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 50 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 12:14:07,719 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:14:07,719 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:14:07,723 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 12:14:07,784 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-02-04 12:14:07,784 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:14:07,789 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:14:07,808 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-04 12:14:07,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:14:07,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:14:07,810 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-04 12:14:07,835 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 15 treesize of output 12 [2018-02-04 12:14:07,836 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-04 12:14:07,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:14:07,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:14:07,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:14:07,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-02-04 12:14:08,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2018-02-04 12:14:08,208 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 28 treesize of output 26 [2018-02-04 12:14:08,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:14:08,218 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 20 treesize of output 15 [2018-02-04 12:14:08,218 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:14:08,219 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 15 treesize of output 8 [2018-02-04 12:14:08,219 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 12:14:08,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 27 [2018-02-04 12:14:08,235 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-04 12:14:08,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 12:14:08,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-04 12:14:08,249 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:40, output treesize:59 [2018-02-04 12:14:08,345 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-02-04 12:14:08,362 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:14:08,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 43 [2018-02-04 12:14:08,362 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-04 12:14:08,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-04 12:14:08,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1754, Unknown=0, NotChecked=0, Total=1892 [2018-02-04 12:14:08,363 INFO L87 Difference]: Start difference. First operand 120 states and 138 transitions. Second operand 44 states. Received shutdown request... [2018-02-04 12:14:10,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-02-04 12:14:10,712 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-04 12:14:10,715 WARN L185 ceAbstractionStarter]: Timeout [2018-02-04 12:14:10,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:14:10 BoogieIcfgContainer [2018-02-04 12:14:10,716 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 12:14:10,716 INFO L168 Benchmark]: Toolchain (without parser) took 209646.07 ms. Allocated memory was 404.8 MB in the beginning and 618.1 MB in the end (delta: 213.4 MB). Free memory was 361.6 MB in the beginning and 577.0 MB in the end (delta: -215.4 MB). Peak memory consumption was 166.7 MB. Max. memory is 5.3 GB. [2018-02-04 12:14:10,717 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 404.8 MB. Free memory is still 368.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 12:14:10,717 INFO L168 Benchmark]: CACSL2BoogieTranslator took 163.72 ms. Allocated memory is still 404.8 MB. Free memory was 361.6 MB in the beginning and 350.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. [2018-02-04 12:14:10,717 INFO L168 Benchmark]: Boogie Preprocessor took 32.58 ms. Allocated memory is still 404.8 MB. Free memory was 350.9 MB in the beginning and 349.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 12:14:10,718 INFO L168 Benchmark]: RCFGBuilder took 275.62 ms. Allocated memory is still 404.8 MB. Free memory was 349.6 MB in the beginning and 322.3 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 5.3 GB. [2018-02-04 12:14:10,718 INFO L168 Benchmark]: TraceAbstraction took 209171.31 ms. Allocated memory was 404.8 MB in the beginning and 618.1 MB in the end (delta: 213.4 MB). Free memory was 321.0 MB in the beginning and 577.0 MB in the end (delta: -256.0 MB). Peak memory consumption was 126.0 MB. Max. memory is 5.3 GB. [2018-02-04 12:14:10,718 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.09 ms. Allocated memory is still 404.8 MB. Free memory is still 368.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 163.72 ms. Allocated memory is still 404.8 MB. Free memory was 361.6 MB in the beginning and 350.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.58 ms. Allocated memory is still 404.8 MB. Free memory was 350.9 MB in the beginning and 349.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 275.62 ms. Allocated memory is still 404.8 MB. Free memory was 349.6 MB in the beginning and 322.3 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 209171.31 ms. Allocated memory was 404.8 MB in the beginning and 618.1 MB in the end (delta: 213.4 MB). Free memory was 321.0 MB in the beginning and 577.0 MB in the end (delta: -256.0 MB). Peak memory consumption was 126.0 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 (120states) and interpolant automaton (currently 69 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (311 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (120states) and interpolant automaton (currently 69 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (311 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (120states) and interpolant automaton (currently 69 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (311 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 589). Cancelled while BasicCegarLoop was constructing difference of abstraction (120states) and interpolant automaton (currently 69 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (311 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (120states) and interpolant automaton (currently 69 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (311 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 589). Cancelled while BasicCegarLoop was constructing difference of abstraction (120states) and interpolant automaton (currently 69 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (311 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 578]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (120states) and interpolant automaton (currently 69 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (311 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was constructing difference of abstraction (120states) and interpolant automaton (currently 69 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (311 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was constructing difference of abstraction (120states) and interpolant automaton (currently 69 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (311 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was constructing difference of abstraction (120states) and interpolant automaton (currently 69 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (311 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was constructing difference of abstraction (120states) and interpolant automaton (currently 69 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (311 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was constructing difference of abstraction (120states) and interpolant automaton (currently 69 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (311 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was constructing difference of abstraction (120states) and interpolant automaton (currently 69 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (311 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was constructing difference of abstraction (120states) and interpolant automaton (currently 69 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (311 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was constructing difference of abstraction (120states) and interpolant automaton (currently 69 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (311 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was constructing difference of abstraction (120states) and interpolant automaton (currently 69 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (311 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was constructing difference of abstraction (120states) and interpolant automaton (currently 69 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (311 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (120states) and interpolant automaton (currently 69 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (311 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was constructing difference of abstraction (120states) and interpolant automaton (currently 69 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (311 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (120states) and interpolant automaton (currently 69 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (311 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (120states) and interpolant automaton (currently 69 states, 44 states before enhancement), while ReachableStatesComputation was computing reachable states (311 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 90 locations, 21 error locations. TIMEOUT Result, 209.1s OverallTime, 37 OverallIterations, 7 TraceHistogramMax, 164.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2646 SDtfs, 5980 SDslu, 31324 SDs, 0 SdLazy, 26500 SolverSat, 1463 SolverUnsat, 18 SolverUnknown, 0 SolverNotchecked, 66.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2210 GetRequests, 1025 SyntacticMatches, 21 SemanticMatches, 1164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13987 ImplicationChecksByTransitivity, 135.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=32, 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, 36 MinimizatonAttempts, 584 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 42.8s InterpolantComputationTime, 2988 NumberOfCodeBlocks, 2935 NumberOfCodeBlocksAsserted, 72 NumberOfCheckSat, 2932 ConstructedInterpolants, 450 QuantifiedInterpolants, 2576339 SizeOfPredicates, 361 NumberOfNonLiveVariables, 5255 ConjunctsInSsa, 1274 ConjunctsInUnsatCore, 56 InterpolantComputations, 21 PerfectInterpolantSequences, 517/1733 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_cstrstr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_12-14-10-723.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_12-14-10-723.csv Completed graceful shutdown