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-ccafca9-m [2018-02-03 22:54:59,014 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-03 22:54:59,015 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-03 22:54:59,026 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-03 22:54:59,026 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-03 22:54:59,027 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-03 22:54:59,028 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-03 22:54:59,030 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-03 22:54:59,031 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-03 22:54:59,032 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-03 22:54:59,033 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-03 22:54:59,033 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-03 22:54:59,034 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-03 22:54:59,035 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-03 22:54:59,035 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-03 22:54:59,037 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-03 22:54:59,039 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-03 22:54:59,040 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-03 22:54:59,041 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-03 22:54:59,041 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-03 22:54:59,043 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-03 22:54:59,043 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-03 22:54:59,043 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-03 22:54:59,044 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-03 22:54:59,045 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-03 22:54:59,046 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-03 22:54:59,046 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-03 22:54:59,047 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-03 22:54:59,047 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-03 22:54:59,047 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-03 22:54:59,047 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-03 22:54:59,048 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-03 22:54:59,057 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-03 22:54:59,058 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-03 22:54:59,059 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-03 22:54:59,059 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-03 22:54:59,059 INFO L133 SettingsManager]: * Use SBE=true [2018-02-03 22:54:59,059 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-03 22:54:59,059 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-03 22:54:59,060 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-03 22:54:59,060 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-03 22:54:59,060 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-03 22:54:59,060 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-03 22:54:59,060 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-03 22:54:59,060 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-03 22:54:59,060 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-03 22:54:59,061 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-03 22:54:59,061 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-03 22:54:59,061 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-03 22:54:59,061 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-03 22:54:59,061 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-03 22:54:59,061 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-03 22:54:59,061 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-03 22:54:59,062 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-03 22:54:59,062 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-03 22:54:59,062 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-03 22:54:59,062 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-03 22:54:59,089 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-03 22:54:59,098 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-03 22:54:59,101 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-03 22:54:59,102 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-03 22:54:59,102 INFO L276 PluginConnector]: CDTParser initialized [2018-02-03 22:54:59,103 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-03 22:54:59,218 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-03 22:54:59,220 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-03 22:54:59,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-03 22:54:59,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-03 22:54:59,226 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-03 22:54:59,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 10:54:59" (1/1) ... [2018-02-03 22:54:59,229 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 03.02 10:54:59, skipping insertion in model container [2018-02-03 22:54:59,229 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 10:54:59" (1/1) ... [2018-02-03 22:54:59,243 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 22:54:59,271 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 22:54:59,352 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 22:54:59,364 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 22:54:59,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:54:59 WrapperNode [2018-02-03 22:54:59,370 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-03 22:54:59,370 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-03 22:54:59,375 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-03 22:54:59,375 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-03 22:54:59,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:54:59" (1/1) ... [2018-02-03 22:54:59,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:54:59" (1/1) ... [2018-02-03 22:54:59,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:54:59" (1/1) ... [2018-02-03 22:54:59,396 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:54:59" (1/1) ... [2018-02-03 22:54:59,399 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:54:59" (1/1) ... [2018-02-03 22:54:59,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:54:59" (1/1) ... [2018-02-03 22:54:59,402 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:54:59" (1/1) ... [2018-02-03 22:54:59,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-03 22:54:59,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-03 22:54:59,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-03 22:54:59,404 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-03 22:54:59,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:54:59" (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-03 22:54:59,440 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-03 22:54:59,441 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-03 22:54:59,441 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlen [2018-02-03 22:54:59,441 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-02-03 22:54:59,441 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrstr [2018-02-03 22:54:59,441 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-03 22:54:59,441 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-03 22:54:59,441 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-03 22:54:59,441 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-03 22:54:59,441 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-03 22:54:59,441 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-03 22:54:59,441 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-03 22:54:59,441 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlen [2018-02-03 22:54:59,441 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-02-03 22:54:59,442 INFO L128 BoogieDeclarations]: Found specification of procedure cstrstr [2018-02-03 22:54:59,442 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-03 22:54:59,442 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-03 22:54:59,442 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-03 22:54:59,680 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-03 22:54:59,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 10:54:59 BoogieIcfgContainer [2018-02-03 22:54:59,680 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-03 22:54:59,681 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-03 22:54:59,681 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-03 22:54:59,683 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-03 22:54:59,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.02 10:54:59" (1/3) ... [2018-02-03 22:54:59,685 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 03.02 10:54:59, skipping insertion in model container [2018-02-03 22:54:59,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:54:59" (2/3) ... [2018-02-03 22:54:59,685 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 03.02 10:54:59, skipping insertion in model container [2018-02-03 22:54:59,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 10:54:59" (3/3) ... [2018-02-03 22:54:59,687 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-02-03 22:54:59,692 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-03 22:54:59,697 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-02-03 22:54:59,720 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-03 22:54:59,720 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-03 22:54:59,721 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-03 22:54:59,721 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-03 22:54:59,721 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-03 22:54:59,721 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-03 22:54:59,721 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-03 22:54:59,721 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-03 22:54:59,722 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-03 22:54:59,732 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2018-02-03 22:54:59,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-03 22:54:59,740 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:54:59,741 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:54:59,741 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-03 22:54:59,744 INFO L82 PathProgramCache]: Analyzing trace with hash -718609434, now seen corresponding path program 1 times [2018-02-03 22:54:59,745 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:54:59,745 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:54:59,774 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:59,774 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:54:59,774 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:59,816 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:54:59,887 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-03 22:54:59,889 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:54:59,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 22:54:59,890 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 22:54:59,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 22:54:59,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 22:54:59,953 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 4 states. [2018-02-03 22:55:00,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:55:00,050 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2018-02-03 22:55:00,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 22:55:00,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-03 22:55:00,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:55:00,058 INFO L225 Difference]: With dead ends: 89 [2018-02-03 22:55:00,059 INFO L226 Difference]: Without dead ends: 86 [2018-02-03 22:55:00,060 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-03 22:55:00,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-03 22:55:00,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-02-03 22:55:00,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-02-03 22:55:00,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2018-02-03 22:55:00,086 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 13 [2018-02-03 22:55:00,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:55:00,086 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2018-02-03 22:55:00,086 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 22:55:00,086 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2018-02-03 22:55:00,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-03 22:55:00,087 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:55:00,087 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:55:00,087 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-03 22:55:00,087 INFO L82 PathProgramCache]: Analyzing trace with hash -718609433, now seen corresponding path program 1 times [2018-02-03 22:55:00,087 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:55:00,088 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:55:00,088 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:00,089 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:55:00,089 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:55:00,103 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:55:00,169 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-03 22:55:00,169 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:55:00,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:55:00,170 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:55:00,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:55:00,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:55:00,171 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand 6 states. [2018-02-03 22:55:00,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:55:00,230 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-02-03 22:55:00,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:55:00,231 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-03 22:55:00,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:55:00,232 INFO L225 Difference]: With dead ends: 85 [2018-02-03 22:55:00,233 INFO L226 Difference]: Without dead ends: 85 [2018-02-03 22:55:00,233 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-03 22:55:00,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-03 22:55:00,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-02-03 22:55:00,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-02-03 22:55:00,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2018-02-03 22:55:00,239 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 13 [2018-02-03 22:55:00,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:55:00,239 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2018-02-03 22:55:00,240 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:55:00,240 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2018-02-03 22:55:00,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-03 22:55:00,240 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:55:00,240 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:55:00,240 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-03 22:55:00,241 INFO L82 PathProgramCache]: Analyzing trace with hash -802055959, now seen corresponding path program 1 times [2018-02-03 22:55:00,241 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:55:00,241 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:55:00,241 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:00,241 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:55:00,242 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:55:00,252 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:55:00,285 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-03 22:55:00,285 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:55:00,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 22:55:00,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 22:55:00,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 22:55:00,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 22:55:00,285 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand 4 states. [2018-02-03 22:55:00,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:55:00,321 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2018-02-03 22:55:00,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 22:55:00,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-03 22:55:00,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:55:00,322 INFO L225 Difference]: With dead ends: 84 [2018-02-03 22:55:00,322 INFO L226 Difference]: Without dead ends: 84 [2018-02-03 22:55:00,323 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-03 22:55:00,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-02-03 22:55:00,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-02-03 22:55:00,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-02-03 22:55:00,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2018-02-03 22:55:00,326 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 14 [2018-02-03 22:55:00,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:55:00,326 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2018-02-03 22:55:00,326 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 22:55:00,326 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2018-02-03 22:55:00,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-03 22:55:00,326 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:55:00,327 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:55:00,327 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-03 22:55:00,327 INFO L82 PathProgramCache]: Analyzing trace with hash -802055958, now seen corresponding path program 1 times [2018-02-03 22:55:00,327 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:55:00,327 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:55:00,328 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:00,328 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:55:00,328 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:55:00,338 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:55:00,381 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-03 22:55:00,381 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:55:00,381 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 22:55:00,381 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 22:55:00,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 22:55:00,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:55:00,382 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 5 states. [2018-02-03 22:55:00,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:55:00,410 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2018-02-03 22:55:00,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:55:00,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-03 22:55:00,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:55:00,411 INFO L225 Difference]: With dead ends: 83 [2018-02-03 22:55:00,411 INFO L226 Difference]: Without dead ends: 83 [2018-02-03 22:55:00,411 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-03 22:55:00,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-02-03 22:55:00,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-02-03 22:55:00,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-03 22:55:00,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2018-02-03 22:55:00,414 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 14 [2018-02-03 22:55:00,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:55:00,414 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2018-02-03 22:55:00,415 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 22:55:00,415 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2018-02-03 22:55:00,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-03 22:55:00,415 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:55:00,415 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:55:00,415 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-03 22:55:00,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1145880583, now seen corresponding path program 1 times [2018-02-03 22:55:00,415 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:55:00,415 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:55:00,416 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:00,416 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:55:00,416 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:55:00,423 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:55:00,469 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-03 22:55:00,469 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:55:00,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 22:55:00,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 22:55:00,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 22:55:00,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:55:00,471 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 5 states. [2018-02-03 22:55:00,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:55:00,529 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2018-02-03 22:55:00,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 22:55:00,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-03 22:55:00,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:55:00,530 INFO L225 Difference]: With dead ends: 82 [2018-02-03 22:55:00,530 INFO L226 Difference]: Without dead ends: 82 [2018-02-03 22:55:00,531 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-03 22:55:00,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-02-03 22:55:00,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-02-03 22:55:00,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-03 22:55:00,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-02-03 22:55:00,535 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 17 [2018-02-03 22:55:00,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:55:00,535 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-02-03 22:55:00,535 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 22:55:00,535 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-02-03 22:55:00,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-03 22:55:00,535 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:55:00,535 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:55:00,535 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-03 22:55:00,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1145880582, now seen corresponding path program 1 times [2018-02-03 22:55:00,536 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:55:00,536 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:55:00,536 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:00,536 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:55:00,536 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:00,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:55:00,548 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:55:00,603 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-03 22:55:00,604 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:55:00,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-03 22:55:00,604 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 22:55:00,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 22:55:00,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:55:00,605 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 8 states. [2018-02-03 22:55:00,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:55:00,693 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2018-02-03 22:55:00,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 22:55:00,694 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-02-03 22:55:00,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:55:00,695 INFO L225 Difference]: With dead ends: 81 [2018-02-03 22:55:00,695 INFO L226 Difference]: Without dead ends: 81 [2018-02-03 22:55:00,695 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-03 22:55:00,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-03 22:55:00,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-02-03 22:55:00,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-03 22:55:00,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2018-02-03 22:55:00,700 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 17 [2018-02-03 22:55:00,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:55:00,700 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2018-02-03 22:55:00,700 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 22:55:00,700 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2018-02-03 22:55:00,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-03 22:55:00,701 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:55:00,701 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-03 22:55:00,701 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-03 22:55:00,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1883098626, now seen corresponding path program 1 times [2018-02-03 22:55:00,701 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:55:00,701 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:55:00,702 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:00,702 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:55:00,702 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:55:00,712 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:55:00,753 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-03 22:55:00,753 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:55:00,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-03 22:55:00,754 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-03 22:55:00,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-03 22:55:00,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-03 22:55:00,754 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 7 states. [2018-02-03 22:55:00,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:55:00,856 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2018-02-03 22:55:00,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-03 22:55:00,856 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-03 22:55:00,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:55:00,857 INFO L225 Difference]: With dead ends: 80 [2018-02-03 22:55:00,857 INFO L226 Difference]: Without dead ends: 80 [2018-02-03 22:55:00,857 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-03 22:55:00,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-03 22:55:00,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-02-03 22:55:00,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-03 22:55:00,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-02-03 22:55:00,862 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 23 [2018-02-03 22:55:00,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:55:00,862 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-02-03 22:55:00,862 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-03 22:55:00,862 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-02-03 22:55:00,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-03 22:55:00,863 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:55:00,863 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-03 22:55:00,863 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-03 22:55:00,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1883098625, now seen corresponding path program 1 times [2018-02-03 22:55:00,864 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:55:00,864 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:55:00,865 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:00,865 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:55:00,865 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:55:00,880 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:55:00,959 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-03 22:55:00,960 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:55:00,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-03 22:55:00,960 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-03 22:55:00,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-03 22:55:00,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-03 22:55:00,961 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 10 states. [2018-02-03 22:55:01,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:55:01,073 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2018-02-03 22:55:01,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-03 22:55:01,073 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-02-03 22:55:01,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:55:01,076 INFO L225 Difference]: With dead ends: 104 [2018-02-03 22:55:01,076 INFO L226 Difference]: Without dead ends: 104 [2018-02-03 22:55:01,076 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-03 22:55:01,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-03 22:55:01,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2018-02-03 22:55:01,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-03 22:55:01,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2018-02-03 22:55:01,080 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 23 [2018-02-03 22:55:01,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:55:01,081 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2018-02-03 22:55:01,081 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-03 22:55:01,081 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2018-02-03 22:55:01,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-03 22:55:01,081 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:55:01,081 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-03 22:55:01,081 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-03 22:55:01,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1390800317, now seen corresponding path program 1 times [2018-02-03 22:55:01,081 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:55:01,082 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:55:01,082 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:01,082 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:55:01,082 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:55:01,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:55:01,259 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-03 22:55:01,259 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:55:01,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-03 22:55:01,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-03 22:55:01,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-03 22:55:01,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-03 22:55:01,260 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 13 states. [2018-02-03 22:55:01,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:55:01,596 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2018-02-03 22:55:01,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-03 22:55:01,596 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-02-03 22:55:01,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:55:01,597 INFO L225 Difference]: With dead ends: 104 [2018-02-03 22:55:01,597 INFO L226 Difference]: Without dead ends: 104 [2018-02-03 22:55:01,597 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2018-02-03 22:55:01,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-02-03 22:55:01,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 96. [2018-02-03 22:55:01,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-03 22:55:01,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2018-02-03 22:55:01,602 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 23 [2018-02-03 22:55:01,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:55:01,602 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2018-02-03 22:55:01,602 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-03 22:55:01,602 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2018-02-03 22:55:01,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-03 22:55:01,603 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:55:01,603 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-03 22:55:01,603 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-03 22:55:01,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1853436480, now seen corresponding path program 1 times [2018-02-03 22:55:01,604 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:55:01,604 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:55:01,604 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:01,605 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:55:01,605 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:55:01,617 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:55:01,850 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-03 22:55:01,850 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:55:01,850 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-03 22:55:01,855 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:55:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:55:01,878 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:55:01,905 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-03 22:55:01,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:55:01,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:55:01,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-03 22:55:01,918 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-03 22:55:01,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-03 22:55:01,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:55:01,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:55:01,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:55:01,929 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-02-03 22:55:02,028 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-03 22:55:02,035 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-03 22:55:02,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:55:02,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:55:02,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:55:02,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-02-03 22:55:02,194 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-03 22:55:02,211 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:55:02,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-02-03 22:55:02,212 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-03 22:55:02,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-03 22:55:02,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-02-03 22:55:02,212 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 22 states. [2018-02-03 22:55:03,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:55:03,013 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2018-02-03 22:55:03,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-03 22:55:03,015 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 27 [2018-02-03 22:55:03,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:55:03,015 INFO L225 Difference]: With dead ends: 100 [2018-02-03 22:55:03,015 INFO L226 Difference]: Without dead ends: 100 [2018-02-03 22:55:03,019 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=183, Invalid=1077, Unknown=0, NotChecked=0, Total=1260 [2018-02-03 22:55:03,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-02-03 22:55:03,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2018-02-03 22:55:03,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-03 22:55:03,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2018-02-03 22:55:03,023 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 27 [2018-02-03 22:55:03,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:55:03,024 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2018-02-03 22:55:03,024 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-03 22:55:03,024 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2018-02-03 22:55:03,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-03 22:55:03,025 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:55:03,025 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-03 22:55:03,025 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-03 22:55:03,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1699013504, now seen corresponding path program 1 times [2018-02-03 22:55:03,025 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:55:03,026 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:55:03,027 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:03,027 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:55:03,027 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:55:03,036 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:55:03,081 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-03 22:55:03,081 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:55:03,081 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:55:03,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:55:03,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:55:03,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:55:03,082 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand 6 states. [2018-02-03 22:55:03,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:55:03,198 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2018-02-03 22:55:03,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 22:55:03,198 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-02-03 22:55:03,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:55:03,199 INFO L225 Difference]: With dead ends: 92 [2018-02-03 22:55:03,199 INFO L226 Difference]: Without dead ends: 68 [2018-02-03 22:55:03,199 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-03 22:55:03,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-03 22:55:03,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-02-03 22:55:03,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-02-03 22:55:03,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-02-03 22:55:03,204 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 28 [2018-02-03 22:55:03,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:55:03,204 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-02-03 22:55:03,204 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:55:03,204 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-02-03 22:55:03,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-03 22:55:03,204 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:55:03,204 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-03 22:55:03,204 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-03 22:55:03,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1948682038, now seen corresponding path program 1 times [2018-02-03 22:55:03,205 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:55:03,205 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:55:03,205 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:03,205 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:55:03,205 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:55:03,212 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:55:03,240 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-03 22:55:03,240 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:55:03,241 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:55:03,241 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:55:03,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:55:03,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:55:03,241 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 6 states. [2018-02-03 22:55:03,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:55:03,319 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-02-03 22:55:03,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:55:03,319 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-02-03 22:55:03,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:55:03,320 INFO L225 Difference]: With dead ends: 67 [2018-02-03 22:55:03,320 INFO L226 Difference]: Without dead ends: 67 [2018-02-03 22:55:03,320 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-03 22:55:03,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-03 22:55:03,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-02-03 22:55:03,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-03 22:55:03,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2018-02-03 22:55:03,322 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 31 [2018-02-03 22:55:03,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:55:03,323 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2018-02-03 22:55:03,323 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:55:03,323 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2018-02-03 22:55:03,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-03 22:55:03,323 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:55:03,324 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-03 22:55:03,324 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-03 22:55:03,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1948682039, now seen corresponding path program 1 times [2018-02-03 22:55:03,324 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:55:03,324 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:55:03,325 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:03,325 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:55:03,325 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:55:03,332 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:55:03,401 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-03 22:55:03,401 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:55:03,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 22:55:03,401 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 22:55:03,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 22:55:03,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-03 22:55:03,402 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 9 states. [2018-02-03 22:55:03,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:55:03,500 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2018-02-03 22:55:03,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-03 22:55:03,500 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-02-03 22:55:03,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:55:03,501 INFO L225 Difference]: With dead ends: 72 [2018-02-03 22:55:03,501 INFO L226 Difference]: Without dead ends: 72 [2018-02-03 22:55:03,501 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-03 22:55:03,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-03 22:55:03,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-02-03 22:55:03,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-03 22:55:03,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-02-03 22:55:03,503 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 31 [2018-02-03 22:55:03,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:55:03,503 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-02-03 22:55:03,503 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 22:55:03,503 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-02-03 22:55:03,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-03 22:55:03,504 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:55:03,504 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-03 22:55:03,504 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-03 22:55:03,505 INFO L82 PathProgramCache]: Analyzing trace with hash -211494479, now seen corresponding path program 1 times [2018-02-03 22:55:03,505 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:55:03,505 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:55:03,505 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:03,506 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:55:03,506 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:55:03,516 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:55:03,633 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-03 22:55:03,633 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:55:03,633 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-03 22:55:03,633 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-03 22:55:03,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-03 22:55:03,634 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-03 22:55:03,634 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 13 states. [2018-02-03 22:55:03,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:55:03,781 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-02-03 22:55:03,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-03 22:55:03,781 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-02-03 22:55:03,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:55:03,782 INFO L225 Difference]: With dead ends: 89 [2018-02-03 22:55:03,782 INFO L226 Difference]: Without dead ends: 70 [2018-02-03 22:55:03,782 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-03 22:55:03,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-03 22:55:03,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-02-03 22:55:03,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-03 22:55:03,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2018-02-03 22:55:03,786 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 36 [2018-02-03 22:55:03,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:55:03,786 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2018-02-03 22:55:03,786 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-03 22:55:03,786 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2018-02-03 22:55:03,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-03 22:55:03,787 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:55:03,795 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-03 22:55:03,795 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-03 22:55:03,796 INFO L82 PathProgramCache]: Analyzing trace with hash -188862225, now seen corresponding path program 1 times [2018-02-03 22:55:03,796 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:55:03,799 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:55:03,799 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:03,799 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:55:03,799 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:55:03,809 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:55:03,986 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-03 22:55:03,986 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:55:03,986 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-03 22:55:03,991 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:55:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:55:04,012 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:55:04,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:55:04,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:55:04,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:55:04,018 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-03 22:55:04,041 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:55:04,042 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:55:04,043 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-03 22:55:04,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:55:04,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:55:04,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-03 22:55:04,067 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-03 22:55:04,068 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-03 22:55:04,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:55:04,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:55:04,072 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-03 22:55:04,072 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-02-03 22:55:04,096 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-03 22:55:04,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-03 22:55:04,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:55:04,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:55:04,105 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-03 22:55:04,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-02-03 22:55:08,464 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-03 22:55:08,466 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-03 22:55:08,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:55:08,478 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-03 22:55:08,478 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-03 22:55:08,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:55:08,495 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-03 22:55:08,495 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-02-03 22:55:08,564 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-03 22:55:08,599 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:55:08,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 26 [2018-02-03 22:55:08,599 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-03 22:55:08,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-03 22:55:08,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=632, Unknown=2, NotChecked=0, Total=702 [2018-02-03 22:55:08,600 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand 27 states. [2018-02-03 22:55:11,122 WARN L146 SmtUtils]: Spent 2161ms on a formula simplification. DAG size of input: 48 DAG size of output 39 [2018-02-03 22:55:28,096 WARN L146 SmtUtils]: Spent 2139ms on a formula simplification. DAG size of input: 54 DAG size of output 45 [2018-02-03 22:55:28,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:55:28,475 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2018-02-03 22:55:28,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-03 22:55:28,475 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 36 [2018-02-03 22:55:28,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:55:28,476 INFO L225 Difference]: With dead ends: 109 [2018-02-03 22:55:28,476 INFO L226 Difference]: Without dead ends: 109 [2018-02-03 22:55:28,476 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=201, Invalid=1352, Unknown=7, NotChecked=0, Total=1560 [2018-02-03 22:55:28,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-03 22:55:28,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 97. [2018-02-03 22:55:28,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-03 22:55:28,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2018-02-03 22:55:28,478 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 36 [2018-02-03 22:55:28,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:55:28,478 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2018-02-03 22:55:28,478 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-03 22:55:28,478 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2018-02-03 22:55:28,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-03 22:55:28,479 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:55:28,479 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-03 22:55:28,479 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-03 22:55:28,479 INFO L82 PathProgramCache]: Analyzing trace with hash -7823713, now seen corresponding path program 1 times [2018-02-03 22:55:28,479 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:55:28,479 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:55:28,479 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:28,480 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:55:28,480 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:28,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:55:28,484 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:55:28,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:55:28,518 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:55:28,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-03 22:55:28,518 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-03 22:55:28,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-03 22:55:28,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-03 22:55:28,519 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand 7 states. [2018-02-03 22:55:28,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:55:28,591 INFO L93 Difference]: Finished difference Result 95 states and 114 transitions. [2018-02-03 22:55:28,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-03 22:55:28,592 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-02-03 22:55:28,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:55:28,593 INFO L225 Difference]: With dead ends: 95 [2018-02-03 22:55:28,593 INFO L226 Difference]: Without dead ends: 95 [2018-02-03 22:55:28,593 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-03 22:55:28,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-03 22:55:28,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-02-03 22:55:28,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-03 22:55:28,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 114 transitions. [2018-02-03 22:55:28,596 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 114 transitions. Word has length 39 [2018-02-03 22:55:28,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:55:28,596 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 114 transitions. [2018-02-03 22:55:28,596 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-03 22:55:28,596 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2018-02-03 22:55:28,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-03 22:55:28,597 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:55:28,597 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-03 22:55:28,597 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-03 22:55:28,597 INFO L82 PathProgramCache]: Analyzing trace with hash -7823712, now seen corresponding path program 1 times [2018-02-03 22:55:28,597 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:55:28,597 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:55:28,598 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:28,598 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:55:28,598 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:55:28,611 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:55:28,677 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-03 22:55:28,677 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:55:28,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 22:55:28,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 22:55:28,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 22:55:28,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:55:28,679 INFO L87 Difference]: Start difference. First operand 95 states and 114 transitions. Second operand 8 states. [2018-02-03 22:55:28,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:55:28,720 INFO L93 Difference]: Finished difference Result 133 states and 155 transitions. [2018-02-03 22:55:28,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 22:55:28,721 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-02-03 22:55:28,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:55:28,721 INFO L225 Difference]: With dead ends: 133 [2018-02-03 22:55:28,721 INFO L226 Difference]: Without dead ends: 133 [2018-02-03 22:55:28,721 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-03 22:55:28,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-03 22:55:28,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-02-03 22:55:28,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-02-03 22:55:28,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 154 transitions. [2018-02-03 22:55:28,725 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 154 transitions. Word has length 39 [2018-02-03 22:55:28,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:55:28,725 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 154 transitions. [2018-02-03 22:55:28,725 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 22:55:28,725 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 154 transitions. [2018-02-03 22:55:28,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-03 22:55:28,726 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:55:28,726 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-03 22:55:28,726 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-03 22:55:28,726 INFO L82 PathProgramCache]: Analyzing trace with hash -701857031, now seen corresponding path program 2 times [2018-02-03 22:55:28,726 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:55:28,727 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:55:28,727 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:28,727 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:55:28,727 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:28,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:55:28,738 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:55:29,141 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-03 22:55:29,141 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:55:29,142 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-03 22:55:29,149 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:55:29,170 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 22:55:29,170 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:55:29,173 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:55:29,179 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-03 22:55:29,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:55:29,183 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-03 22:55:29,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:55:29,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:55:29,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-03 22:55:29,237 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:55:29,238 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-03 22:55:29,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:55:29,244 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:55:29,245 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:55:29,245 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-03 22:55:29,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:55:29,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:55:29,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-03 22:55:29,287 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-03 22:55:29,288 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-03 22:55:29,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:55:29,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:55:29,293 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-03 22:55:29,293 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-02-03 22:55:29,317 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-03 22:55:29,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-03 22:55:29,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:55:29,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:55:29,327 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-03 22:55:29,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-02-03 22:55:30,836 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-03 22:55:30,838 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-03 22:55:30,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:55:30,845 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-03 22:55:30,845 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-03 22:55:30,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:55:30,855 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-03 22:55:30,855 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2018-02-03 22:55:30,921 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-03 22:55:30,938 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:55:30,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 29 [2018-02-03 22:55:30,938 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-03 22:55:30,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-03 22:55:30,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=793, Unknown=0, NotChecked=0, Total=870 [2018-02-03 22:55:30,939 INFO L87 Difference]: Start difference. First operand 131 states and 154 transitions. Second operand 30 states. [2018-02-03 22:55:32,148 WARN L146 SmtUtils]: Spent 314ms on a formula simplification. DAG size of input: 55 DAG size of output 39 [2018-02-03 22:55:32,958 WARN L146 SmtUtils]: Spent 429ms on a formula simplification. DAG size of input: 70 DAG size of output 56 [2018-02-03 22:55:33,511 WARN L146 SmtUtils]: Spent 444ms on a formula simplification. DAG size of input: 61 DAG size of output 47 [2018-02-03 22:55:36,524 WARN L146 SmtUtils]: Spent 2236ms on a formula simplification. DAG size of input: 68 DAG size of output 52 [2018-02-03 22:55:37,547 WARN L146 SmtUtils]: Spent 921ms on a formula simplification. DAG size of input: 74 DAG size of output 55 [2018-02-03 22:55:37,920 WARN L146 SmtUtils]: Spent 251ms on a formula simplification. DAG size of input: 78 DAG size of output 58 [2018-02-03 22:55:42,714 WARN L146 SmtUtils]: Spent 2247ms on a formula simplification. DAG size of input: 54 DAG size of output 43 [2018-02-03 22:55:44,057 WARN L146 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 58 DAG size of output 47 [2018-02-03 22:55:44,394 WARN L146 SmtUtils]: Spent 245ms on a formula simplification. DAG size of input: 68 DAG size of output 53 [2018-02-03 22:55:46,586 WARN L146 SmtUtils]: Spent 2119ms on a formula simplification. DAG size of input: 72 DAG size of output 56 [2018-02-03 22:55:47,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:55:47,138 INFO L93 Difference]: Finished difference Result 134 states and 156 transitions. [2018-02-03 22:55:47,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-03 22:55:47,138 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 41 [2018-02-03 22:55:47,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:55:47,138 INFO L225 Difference]: With dead ends: 134 [2018-02-03 22:55:47,139 INFO L226 Difference]: Without dead ends: 99 [2018-02-03 22:55:47,139 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=269, Invalid=1801, Unknown=0, NotChecked=0, Total=2070 [2018-02-03 22:55:47,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-03 22:55:47,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 67. [2018-02-03 22:55:47,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-03 22:55:47,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-02-03 22:55:47,140 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 41 [2018-02-03 22:55:47,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:55:47,140 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-02-03 22:55:47,140 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-03 22:55:47,141 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-02-03 22:55:47,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-03 22:55:47,141 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:55:47,141 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-03 22:55:47,141 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-03 22:55:47,141 INFO L82 PathProgramCache]: Analyzing trace with hash 648064035, now seen corresponding path program 1 times [2018-02-03 22:55:47,141 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:55:47,141 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:55:47,142 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:47,142 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:55:47,142 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:55:47,150 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:55:47,340 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-03 22:55:47,340 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:55:47,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-02-03 22:55:47,340 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-03 22:55:47,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-03 22:55:47,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-02-03 22:55:47,341 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 16 states. [2018-02-03 22:55:47,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:55:47,666 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2018-02-03 22:55:47,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-03 22:55:47,667 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-02-03 22:55:47,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:55:47,667 INFO L225 Difference]: With dead ends: 119 [2018-02-03 22:55:47,668 INFO L226 Difference]: Without dead ends: 119 [2018-02-03 22:55:47,668 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2018-02-03 22:55:47,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-03 22:55:47,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 98. [2018-02-03 22:55:47,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-02-03 22:55:47,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 120 transitions. [2018-02-03 22:55:47,671 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 120 transitions. Word has length 43 [2018-02-03 22:55:47,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:55:47,671 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 120 transitions. [2018-02-03 22:55:47,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-03 22:55:47,671 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 120 transitions. [2018-02-03 22:55:47,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-03 22:55:47,672 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:55:47,672 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-03 22:55:47,672 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-03 22:55:47,672 INFO L82 PathProgramCache]: Analyzing trace with hash 19279971, now seen corresponding path program 1 times [2018-02-03 22:55:47,672 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:55:47,672 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:55:47,673 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:47,673 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:55:47,673 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:55:47,678 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:55:47,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:55:47,724 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:55:47,724 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-03 22:55:47,730 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:55:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:55:47,749 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:55:47,807 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-03 22:55:47,839 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-03 22:55:47,840 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 11 [2018-02-03 22:55:47,840 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-03 22:55:47,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-03 22:55:47,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-02-03 22:55:47,840 INFO L87 Difference]: Start difference. First operand 98 states and 120 transitions. Second operand 12 states. [2018-02-03 22:55:47,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:55:47,941 INFO L93 Difference]: Finished difference Result 97 states and 117 transitions. [2018-02-03 22:55:47,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-03 22:55:47,942 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-02-03 22:55:47,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:55:47,942 INFO L225 Difference]: With dead ends: 97 [2018-02-03 22:55:47,942 INFO L226 Difference]: Without dead ends: 97 [2018-02-03 22:55:47,943 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-03 22:55:47,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-03 22:55:47,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-02-03 22:55:47,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-03 22:55:47,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 117 transitions. [2018-02-03 22:55:47,945 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 117 transitions. Word has length 45 [2018-02-03 22:55:47,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:55:47,945 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 117 transitions. [2018-02-03 22:55:47,946 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-03 22:55:47,946 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2018-02-03 22:55:47,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-03 22:55:47,946 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:55:47,946 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-03 22:55:47,946 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-03 22:55:47,946 INFO L82 PathProgramCache]: Analyzing trace with hash 19279972, now seen corresponding path program 1 times [2018-02-03 22:55:47,947 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:55:47,947 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:55:47,947 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:47,947 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:55:47,947 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:55:47,954 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:55:48,094 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-03 22:55:48,094 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:55:48,095 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-03 22:55:48,099 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:55:48,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:55:48,116 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:55:48,197 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-03 22:55:48,214 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:55:48,214 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 22 [2018-02-03 22:55:48,215 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-03 22:55:48,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-03 22:55:48,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2018-02-03 22:55:48,215 INFO L87 Difference]: Start difference. First operand 97 states and 117 transitions. Second operand 23 states. [2018-02-03 22:55:48,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:55:48,468 INFO L93 Difference]: Finished difference Result 141 states and 170 transitions. [2018-02-03 22:55:48,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-03 22:55:48,468 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 45 [2018-02-03 22:55:48,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:55:48,468 INFO L225 Difference]: With dead ends: 141 [2018-02-03 22:55:48,469 INFO L226 Difference]: Without dead ends: 141 [2018-02-03 22:55:48,469 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-03 22:55:48,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-02-03 22:55:48,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 118. [2018-02-03 22:55:48,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-03 22:55:48,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 149 transitions. [2018-02-03 22:55:48,471 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 149 transitions. Word has length 45 [2018-02-03 22:55:48,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:55:48,472 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 149 transitions. [2018-02-03 22:55:48,472 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-03 22:55:48,472 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 149 transitions. [2018-02-03 22:55:48,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-03 22:55:48,472 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:55:48,473 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-03 22:55:48,473 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-03 22:55:48,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1348184644, now seen corresponding path program 1 times [2018-02-03 22:55:48,473 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:55:48,473 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:55:48,474 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:48,474 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:55:48,474 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:48,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:55:48,481 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:55:48,538 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-03 22:55:48,538 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:55:48,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-03 22:55:48,539 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 22:55:48,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 22:55:48,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:55:48,539 INFO L87 Difference]: Start difference. First operand 118 states and 149 transitions. Second operand 8 states. [2018-02-03 22:55:48,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:55:48,619 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2018-02-03 22:55:48,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 22:55:48,620 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-02-03 22:55:48,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:55:48,621 INFO L225 Difference]: With dead ends: 117 [2018-02-03 22:55:48,621 INFO L226 Difference]: Without dead ends: 117 [2018-02-03 22:55:48,622 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-03 22:55:48,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-03 22:55:48,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-02-03 22:55:48,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-03 22:55:48,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 145 transitions. [2018-02-03 22:55:48,625 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 145 transitions. Word has length 47 [2018-02-03 22:55:48,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:55:48,625 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 145 transitions. [2018-02-03 22:55:48,625 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 22:55:48,625 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 145 transitions. [2018-02-03 22:55:48,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-03 22:55:48,625 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:55:48,625 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-03 22:55:48,625 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-03 22:55:48,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1348184645, now seen corresponding path program 1 times [2018-02-03 22:55:48,626 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:55:48,626 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:55:48,626 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:48,626 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:55:48,626 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:55:48,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:55:48,654 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-03 22:55:48,654 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:55:48,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 22:55:48,654 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 22:55:48,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 22:55:48,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:55:48,654 INFO L87 Difference]: Start difference. First operand 117 states and 145 transitions. Second operand 5 states. [2018-02-03 22:55:48,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:55:48,681 INFO L93 Difference]: Finished difference Result 119 states and 143 transitions. [2018-02-03 22:55:48,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 22:55:48,681 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-02-03 22:55:48,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:55:48,682 INFO L225 Difference]: With dead ends: 119 [2018-02-03 22:55:48,682 INFO L226 Difference]: Without dead ends: 119 [2018-02-03 22:55:48,682 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-03 22:55:48,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-03 22:55:48,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 114. [2018-02-03 22:55:48,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-02-03 22:55:48,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 138 transitions. [2018-02-03 22:55:48,684 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 138 transitions. Word has length 47 [2018-02-03 22:55:48,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:55:48,684 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 138 transitions. [2018-02-03 22:55:48,684 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 22:55:48,684 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 138 transitions. [2018-02-03 22:55:48,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-03 22:55:48,685 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:55:48,685 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-03 22:55:48,685 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-03 22:55:48,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1381663923, now seen corresponding path program 1 times [2018-02-03 22:55:48,685 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:55:48,685 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:55:48,685 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:48,686 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:55:48,686 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:55:48,693 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:55:48,991 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-03 22:55:48,991 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:55:48,991 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-03 22:55:48,996 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:55:49,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:55:49,014 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:55:49,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:55:49,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:55:49,020 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-03 22:55:49,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:55:49,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:55:49,023 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-03 22:55:49,045 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:55:49,046 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-03 22:55:49,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:55:49,053 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:55:49,053 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:55:49,054 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-03 22:55:49,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:55:49,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:55:49,057 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-03 22:55:49,089 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-03 22:55:49,090 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-03 22:55:49,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:55:49,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:55:49,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:55:49,095 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-02-03 22:55:49,119 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-03 22:55:49,121 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-03 22:55:49,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:55:49,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:55:49,128 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-03 22:55:49,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-02-03 22:55:49,714 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-03 22:55:49,716 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-03 22:55:49,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:55:49,724 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-03 22:55:49,725 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-03 22:55:49,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:55:49,733 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-03 22:55:49,733 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:32 [2018-02-03 22:55:49,813 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-03 22:55:49,843 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:55:49,843 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 29 [2018-02-03 22:55:49,844 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-03 22:55:49,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-03 22:55:49,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=791, Unknown=0, NotChecked=0, Total=870 [2018-02-03 22:55:49,844 INFO L87 Difference]: Start difference. First operand 114 states and 138 transitions. Second operand 30 states. [2018-02-03 22:55:50,682 WARN L146 SmtUtils]: Spent 500ms on a formula simplification. DAG size of input: 48 DAG size of output 32 [2018-02-03 22:55:53,047 WARN L146 SmtUtils]: Spent 2194ms on a formula simplification. DAG size of input: 63 DAG size of output 49 [2018-02-03 22:55:55,239 WARN L146 SmtUtils]: Spent 2087ms on a formula simplification. DAG size of input: 54 DAG size of output 40 [2018-02-03 22:55:57,785 WARN L146 SmtUtils]: Spent 2130ms on a formula simplification. DAG size of input: 61 DAG size of output 45 [2018-02-03 22:55:58,907 WARN L146 SmtUtils]: Spent 1093ms on a formula simplification. DAG size of input: 69 DAG size of output 51 [2018-02-03 22:56:00,122 WARN L146 SmtUtils]: Spent 1186ms on a formula simplification. DAG size of input: 73 DAG size of output 54 [2018-02-03 22:56:00,794 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 47 DAG size of output 36 [2018-02-03 22:56:01,472 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 48 DAG size of output 38 [2018-02-03 22:56:03,885 WARN L146 SmtUtils]: Spent 334ms on a formula simplification. DAG size of input: 59 DAG size of output 47 [2018-02-03 22:56:04,125 WARN L146 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 63 DAG size of output 50 [2018-02-03 22:56:04,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:56:04,982 INFO L93 Difference]: Finished difference Result 133 states and 152 transitions. [2018-02-03 22:56:04,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-03 22:56:04,983 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 48 [2018-02-03 22:56:04,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:56:04,983 INFO L225 Difference]: With dead ends: 133 [2018-02-03 22:56:04,983 INFO L226 Difference]: Without dead ends: 133 [2018-02-03 22:56:04,984 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=278, Invalid=1977, Unknown=1, NotChecked=0, Total=2256 [2018-02-03 22:56:04,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-03 22:56:04,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 76. [2018-02-03 22:56:04,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-03 22:56:04,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2018-02-03 22:56:04,985 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 48 [2018-02-03 22:56:04,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:56:04,986 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2018-02-03 22:56:04,986 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-03 22:56:04,986 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2018-02-03 22:56:04,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-03 22:56:04,986 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:56:04,986 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-03 22:56:04,986 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-03 22:56:04,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1474955739, now seen corresponding path program 1 times [2018-02-03 22:56:04,987 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:56:04,987 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:56:04,987 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:56:04,987 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:56:04,988 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:56:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:56:04,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:56:05,029 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-03 22:56:05,029 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:56:05,029 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-03 22:56:05,034 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:56:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:56:05,050 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:56:05,080 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-03 22:56:05,098 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-03 22:56:05,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 10 [2018-02-03 22:56:05,099 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-03 22:56:05,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-03 22:56:05,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-02-03 22:56:05,099 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 11 states. [2018-02-03 22:56:05,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:56:05,176 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2018-02-03 22:56:05,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-03 22:56:05,176 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2018-02-03 22:56:05,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:56:05,177 INFO L225 Difference]: With dead ends: 75 [2018-02-03 22:56:05,177 INFO L226 Difference]: Without dead ends: 75 [2018-02-03 22:56:05,177 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-03 22:56:05,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-03 22:56:05,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-02-03 22:56:05,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-03 22:56:05,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2018-02-03 22:56:05,178 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 49 [2018-02-03 22:56:05,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:56:05,178 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2018-02-03 22:56:05,178 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-03 22:56:05,178 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2018-02-03 22:56:05,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-03 22:56:05,179 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:56:05,179 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-03 22:56:05,179 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-03 22:56:05,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1474955738, now seen corresponding path program 1 times [2018-02-03 22:56:05,179 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:56:05,179 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:56:05,179 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:56:05,180 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:56:05,180 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:56:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:56:05,185 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:56:05,303 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-03 22:56:05,303 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:56:05,303 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-03 22:56:05,308 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:56:05,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:56:05,325 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:56:05,435 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-03 22:56:05,467 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:56:05,468 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2018-02-03 22:56:05,468 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-03 22:56:05,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-03 22:56:05,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2018-02-03 22:56:05,469 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 25 states. [2018-02-03 22:56:05,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:56:05,796 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2018-02-03 22:56:05,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-03 22:56:05,796 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 49 [2018-02-03 22:56:05,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:56:05,797 INFO L225 Difference]: With dead ends: 106 [2018-02-03 22:56:05,797 INFO L226 Difference]: Without dead ends: 106 [2018-02-03 22:56:05,797 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-03 22:56:05,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-02-03 22:56:05,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2018-02-03 22:56:05,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-03 22:56:05,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2018-02-03 22:56:05,799 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 49 [2018-02-03 22:56:05,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:56:05,799 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2018-02-03 22:56:05,799 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-03 22:56:05,799 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2018-02-03 22:56:05,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-03 22:56:05,800 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:56:05,800 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-03 22:56:05,800 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-03 22:56:05,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1071735008, now seen corresponding path program 1 times [2018-02-03 22:56:05,800 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:56:05,800 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:56:05,801 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:56:05,801 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:56:05,801 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:56:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:56:05,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:56:05,898 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-03 22:56:05,899 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:56:05,899 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-03 22:56:05,907 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:56:05,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:56:05,939 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:56:05,953 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-03 22:56:05,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:56:05,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:56:05,957 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-03 22:56:05,986 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:56:05,987 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:56:05,988 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-03 22:56:05,988 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:56:05,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:56:05,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-03 22:56:06,022 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-03 22:56:06,024 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-03 22:56:06,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:56:06,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:56:06,035 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-03 22:56:06,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-02-03 22:56:06,063 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-03 22:56:06,066 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-03 22:56:06,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:56:06,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:56:06,080 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-03 22:56:06,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-02-03 22:56:10,556 WARN L143 SmtUtils]: Spent 2007ms on a formula simplification that was a NOOP. DAG size: 57 [2018-02-03 22:56:12,676 WARN L143 SmtUtils]: Spent 2011ms on a formula simplification that was a NOOP. DAG size: 62 [2018-02-03 22:56:13,567 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-03 22:56:13,569 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:56:13,572 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-03 22:56:13,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:56:13,585 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-03 22:56:13,585 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 22:56:13,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:56:13,609 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-03 22:56:13,610 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:75, output treesize:51 [2018-02-03 22:56:13,692 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-03 22:56:13,709 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:56:13,709 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 25] total 34 [2018-02-03 22:56:13,709 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-03 22:56:13,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-03 22:56:13,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1033, Unknown=1, NotChecked=0, Total=1122 [2018-02-03 22:56:13,710 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand 34 states. [2018-02-03 22:56:15,997 WARN L143 SmtUtils]: Spent 2017ms on a formula simplification that was a NOOP. DAG size: 55 [2018-02-03 22:56:20,726 WARN L143 SmtUtils]: Spent 2032ms on a formula simplification that was a NOOP. DAG size: 77 [2018-02-03 22:56:28,482 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 95 DAG size of output 68 [2018-02-03 22:56:30,946 WARN L146 SmtUtils]: Spent 2094ms on a formula simplification. DAG size of input: 97 DAG size of output 70 [2018-02-03 22:56:49,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:56:49,608 INFO L93 Difference]: Finished difference Result 141 states and 155 transitions. [2018-02-03 22:56:49,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-03 22:56:49,608 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 52 [2018-02-03 22:56:49,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:56:49,608 INFO L225 Difference]: With dead ends: 141 [2018-02-03 22:56:49,608 INFO L226 Difference]: Without dead ends: 103 [2018-02-03 22:56:49,609 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=390, Invalid=4576, Unknown=4, NotChecked=0, Total=4970 [2018-02-03 22:56:49,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-02-03 22:56:49,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 83. [2018-02-03 22:56:49,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-02-03 22:56:49,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2018-02-03 22:56:49,611 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 52 [2018-02-03 22:56:49,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:56:49,611 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2018-02-03 22:56:49,611 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-03 22:56:49,611 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2018-02-03 22:56:49,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-03 22:56:49,612 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:56:49,612 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-03 22:56:49,612 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-03 22:56:49,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1302686214, now seen corresponding path program 2 times [2018-02-03 22:56:49,612 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:56:49,612 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:56:49,612 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:56:49,612 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:56:49,612 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:56:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:56:49,621 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:56:49,735 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-03 22:56:49,735 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:56:49,735 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-03 22:56:49,739 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:56:49,760 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 22:56:49,760 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:56:49,763 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:56:49,766 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-03 22:56:49,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:56:49,771 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-03 22:56:49,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:56:49,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:56:49,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-03 22:56:49,796 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:56:49,797 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-03 22:56:49,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:56:49,803 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:56:49,804 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:56:49,804 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-03 22:56:49,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:56:49,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:56:49,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-03 22:56:49,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, 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-03 22:56:49,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 13 treesize of output 12 [2018-02-03 22:56:49,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:56:49,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:56:49,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:56:49,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-02-03 22:56:49,860 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-03 22:56:49,861 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-03 22:56:49,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:56:49,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:56:49,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:56:49,869 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-02-03 22:56:50,849 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-03 22:56:50,854 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-03 22:56:50,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:56:50,862 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-03 22:56:50,863 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 22:56:50,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:56:50,883 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-03 22:56:50,883 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:81 [2018-02-03 22:56:51,058 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-03 22:56:51,075 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:56:51,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 25] total 36 [2018-02-03 22:56:51,076 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-03 22:56:51,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-03 22:56:51,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1168, Unknown=0, NotChecked=0, Total=1260 [2018-02-03 22:56:51,076 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 36 states. [2018-02-03 22:56:54,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:56:54,305 INFO L93 Difference]: Finished difference Result 176 states and 196 transitions. [2018-02-03 22:56:54,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-03 22:56:54,305 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 65 [2018-02-03 22:56:54,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:56:54,305 INFO L225 Difference]: With dead ends: 176 [2018-02-03 22:56:54,305 INFO L226 Difference]: Without dead ends: 117 [2018-02-03 22:56:54,306 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=385, Invalid=4727, Unknown=0, NotChecked=0, Total=5112 [2018-02-03 22:56:54,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-02-03 22:56:54,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 93. [2018-02-03 22:56:54,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-03 22:56:54,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2018-02-03 22:56:54,308 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 65 [2018-02-03 22:56:54,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:56:54,308 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2018-02-03 22:56:54,308 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-03 22:56:54,309 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2018-02-03 22:56:54,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-03 22:56:54,309 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:56:54,309 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-03 22:56:54,309 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-03 22:56:54,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1081639798, now seen corresponding path program 1 times [2018-02-03 22:56:54,310 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:56:54,310 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:56:54,310 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:56:54,310 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:56:54,310 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:56:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:56:54,320 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:56:54,525 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-03 22:56:54,525 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:56:54,525 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-03 22:56:54,530 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:56:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:56:54,552 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:56:54,586 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-03 22:56:54,603 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:56:54,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 20 [2018-02-03 22:56:54,604 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-03 22:56:54,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-03 22:56:54,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2018-02-03 22:56:54,604 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand 21 states. [2018-02-03 22:56:54,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:56:54,886 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2018-02-03 22:56:54,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-03 22:56:54,886 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 71 [2018-02-03 22:56:54,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:56:54,887 INFO L225 Difference]: With dead ends: 112 [2018-02-03 22:56:54,887 INFO L226 Difference]: Without dead ends: 112 [2018-02-03 22:56:54,887 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-03 22:56:54,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-03 22:56:54,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 95. [2018-02-03 22:56:54,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-03 22:56:54,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2018-02-03 22:56:54,889 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 71 [2018-02-03 22:56:54,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:56:54,889 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2018-02-03 22:56:54,889 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-03 22:56:54,889 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2018-02-03 22:56:54,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-03 22:56:54,890 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:56:54,890 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-03 22:56:54,890 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-03 22:56:54,890 INFO L82 PathProgramCache]: Analyzing trace with hash 2131279692, now seen corresponding path program 1 times [2018-02-03 22:56:54,890 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:56:54,890 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:56:54,891 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:56:54,891 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:56:54,891 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:56:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:56:54,901 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:56:55,161 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-03 22:56:55,161 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:56:55,161 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-03 22:56:55,167 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:56:55,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:56:55,189 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:56:55,225 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-03 22:56:55,241 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:56:55,241 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 21 [2018-02-03 22:56:55,242 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-03 22:56:55,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-03 22:56:55,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2018-02-03 22:56:55,242 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 22 states. [2018-02-03 22:56:55,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:56:55,660 INFO L93 Difference]: Finished difference Result 127 states and 142 transitions. [2018-02-03 22:56:55,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-03 22:56:55,660 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 75 [2018-02-03 22:56:55,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:56:55,660 INFO L225 Difference]: With dead ends: 127 [2018-02-03 22:56:55,661 INFO L226 Difference]: Without dead ends: 127 [2018-02-03 22:56:55,661 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=889, Unknown=0, NotChecked=0, Total=992 [2018-02-03 22:56:55,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-03 22:56:55,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 96. [2018-02-03 22:56:55,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-03 22:56:55,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2018-02-03 22:56:55,663 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 75 [2018-02-03 22:56:55,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:56:55,663 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2018-02-03 22:56:55,664 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-03 22:56:55,664 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2018-02-03 22:56:55,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-03 22:56:55,664 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:56:55,664 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-03 22:56:55,664 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-03 22:56:55,664 INFO L82 PathProgramCache]: Analyzing trace with hash 119487994, now seen corresponding path program 3 times [2018-02-03 22:56:55,664 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:56:55,665 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:56:55,665 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:56:55,665 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:56:55,665 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:56:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:56:55,672 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:56:55,836 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-03 22:56:55,836 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:56:55,836 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-03 22:56:55,843 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-03 22:56:55,886 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-03 22:56:55,886 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:56:55,890 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:56:55,893 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-03 22:56:55,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:56:55,897 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-03 22:56:55,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:56:55,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:56:55,900 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-03 22:56:55,928 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:56:55,928 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:56:55,929 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-03 22:56:55,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:56:55,939 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-03 22:56:55,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:56:55,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:56:55,944 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-03 22:56:55,979 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-03 22:56:55,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-03 22:56:55,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:56:55,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:56:55,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:56:55,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:28 [2018-02-03 22:56:56,011 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-03 22:56:56,012 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-03 22:56:56,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:56:56,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:56:56,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:56:56,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-02-03 22:56:56,736 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-03 22:56:56,740 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-03 22:56:56,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:56:56,747 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-03 22:56:56,747 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 22:56:56,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:56:56,761 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-03 22:56:56,761 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:59, output treesize:66 [2018-02-03 22:56:56,962 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-03 22:56:56,978 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:56:56,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 28] total 41 [2018-02-03 22:56:56,979 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-03 22:56:56,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-03 22:56:56,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1540, Unknown=0, NotChecked=0, Total=1640 [2018-02-03 22:56:56,979 INFO L87 Difference]: Start difference. First operand 96 states and 109 transitions. Second operand 41 states. [2018-02-03 22:57:00,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:57:00,294 INFO L93 Difference]: Finished difference Result 333 states and 380 transitions. [2018-02-03 22:57:00,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-02-03 22:57:00,294 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 78 [2018-02-03 22:57:00,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:57:00,294 INFO L225 Difference]: With dead ends: 333 [2018-02-03 22:57:00,295 INFO L226 Difference]: Without dead ends: 193 [2018-02-03 22:57:00,296 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-03 22:57:00,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-03 22:57:00,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 157. [2018-02-03 22:57:00,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-03 22:57:00,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 187 transitions. [2018-02-03 22:57:00,299 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 187 transitions. Word has length 78 [2018-02-03 22:57:00,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:57:00,299 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 187 transitions. [2018-02-03 22:57:00,299 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-03 22:57:00,299 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 187 transitions. [2018-02-03 22:57:00,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-03 22:57:00,299 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:57:00,300 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-03 22:57:00,300 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-03 22:57:00,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1554803288, now seen corresponding path program 2 times [2018-02-03 22:57:00,300 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:57:00,300 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:57:00,300 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:57:00,300 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:57:00,301 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:57:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:57:00,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:57:00,492 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-03 22:57:00,492 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:57:00,493 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-03 22:57:00,498 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:57:00,530 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 22:57:00,531 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:57:00,533 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:57:00,699 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-03 22:57:00,715 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:57:00,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 29 [2018-02-03 22:57:00,715 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-03 22:57:00,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-03 22:57:00,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2018-02-03 22:57:00,716 INFO L87 Difference]: Start difference. First operand 157 states and 187 transitions. Second operand 30 states. [2018-02-03 22:57:01,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:57:01,116 INFO L93 Difference]: Finished difference Result 213 states and 247 transitions. [2018-02-03 22:57:01,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-03 22:57:01,116 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 84 [2018-02-03 22:57:01,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:57:01,117 INFO L225 Difference]: With dead ends: 213 [2018-02-03 22:57:01,117 INFO L226 Difference]: Without dead ends: 213 [2018-02-03 22:57:01,118 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-03 22:57:01,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-02-03 22:57:01,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 167. [2018-02-03 22:57:01,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-02-03 22:57:01,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 200 transitions. [2018-02-03 22:57:01,121 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 200 transitions. Word has length 84 [2018-02-03 22:57:01,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:57:01,122 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 200 transitions. [2018-02-03 22:57:01,122 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-03 22:57:01,122 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 200 transitions. [2018-02-03 22:57:01,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-02-03 22:57:01,122 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:57:01,123 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-03 22:57:01,123 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-03 22:57:01,123 INFO L82 PathProgramCache]: Analyzing trace with hash 432851257, now seen corresponding path program 1 times [2018-02-03 22:57:01,123 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:57:01,123 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:57:01,124 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:57:01,124 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:57:01,124 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:57:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:57:01,144 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:57:01,834 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-03 22:57:01,834 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:57:01,834 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-03 22:57:01,839 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:57:01,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:57:01,871 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:57:01,874 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-03 22:57:01,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:57:01,879 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-03 22:57:01,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:57:01,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:57:01,882 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-03 22:57:01,926 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:57:01,927 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-03 22:57:01,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:57:01,934 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:57:01,935 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:57:01,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 11 treesize of output 4 [2018-02-03 22:57:01,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:57:01,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:57:01,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-03 22:57:01,993 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-03 22:57:01,994 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-03 22:57:01,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:57:01,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:57:01,999 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-03 22:57:02,000 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-02-03 22:57:02,032 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-03 22:57:02,033 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-03 22:57:02,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:57:02,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:57:02,043 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-03 22:57:02,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2018-02-03 22:57:03,507 WARN L146 SmtUtils]: Spent 337ms on a formula simplification. DAG size of input: 52 DAG size of output 32 [2018-02-03 22:57:04,773 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-03 22:57:04,778 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-03 22:57:04,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:57:04,785 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-03 22:57:04,785 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 22:57:04,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:57:04,801 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-03 22:57:04,801 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2018-02-03 22:57:04,928 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-03 22:57:04,945 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:57:04,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29] total 55 [2018-02-03 22:57:04,946 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-03 22:57:04,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-03 22:57:04,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=2900, Unknown=0, NotChecked=0, Total=3080 [2018-02-03 22:57:04,946 INFO L87 Difference]: Start difference. First operand 167 states and 200 transitions. Second operand 56 states. [2018-02-03 22:57:26,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:57:26,893 INFO L93 Difference]: Finished difference Result 231 states and 262 transitions. [2018-02-03 22:57:26,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-03 22:57:26,893 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 87 [2018-02-03 22:57:26,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:57:26,894 INFO L225 Difference]: With dead ends: 231 [2018-02-03 22:57:26,894 INFO L226 Difference]: Without dead ends: 231 [2018-02-03 22:57:26,895 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1910 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=599, Invalid=8331, Unknown=0, NotChecked=0, Total=8930 [2018-02-03 22:57:26,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-02-03 22:57:26,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 108. [2018-02-03 22:57:26,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-02-03 22:57:26,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2018-02-03 22:57:26,897 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 123 transitions. Word has length 87 [2018-02-03 22:57:26,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:57:26,897 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 123 transitions. [2018-02-03 22:57:26,897 INFO L433 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-02-03 22:57:26,897 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 123 transitions. [2018-02-03 22:57:26,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-03 22:57:26,898 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:57:26,898 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-03 22:57:26,898 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-03 22:57:26,898 INFO L82 PathProgramCache]: Analyzing trace with hash 21370394, now seen corresponding path program 2 times [2018-02-03 22:57:26,898 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:57:26,898 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:57:26,898 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:57:26,898 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:57:26,898 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:57:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:57:26,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:57:27,104 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-03 22:57:27,104 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:57:27,104 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-03 22:57:27,109 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:57:27,135 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-03 22:57:27,135 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:57:27,137 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:57:27,213 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-03 22:57:27,243 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-03 22:57:27,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [18] total 21 [2018-02-03 22:57:27,244 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-03 22:57:27,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-03 22:57:27,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2018-02-03 22:57:27,244 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. Second operand 22 states. [2018-02-03 22:57:27,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:57:27,692 INFO L93 Difference]: Finished difference Result 153 states and 171 transitions. [2018-02-03 22:57:27,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-03 22:57:27,692 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 88 [2018-02-03 22:57:27,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:57:27,693 INFO L225 Difference]: With dead ends: 153 [2018-02-03 22:57:27,693 INFO L226 Difference]: Without dead ends: 153 [2018-02-03 22:57:27,693 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-03 22:57:27,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-03 22:57:27,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 113. [2018-02-03 22:57:27,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-03 22:57:27,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 132 transitions. [2018-02-03 22:57:27,695 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 132 transitions. Word has length 88 [2018-02-03 22:57:27,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:57:27,695 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 132 transitions. [2018-02-03 22:57:27,695 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-03 22:57:27,695 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 132 transitions. [2018-02-03 22:57:27,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-03 22:57:27,696 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:57:27,696 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-03 22:57:27,696 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-03 22:57:27,696 INFO L82 PathProgramCache]: Analyzing trace with hash 657968236, now seen corresponding path program 4 times [2018-02-03 22:57:27,696 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:57:27,696 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:57:27,697 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:57:27,697 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:57:27,697 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:57:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:57:27,705 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:57:27,866 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-03 22:57:27,866 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:57:27,867 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-03 22:57:27,872 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-03 22:57:27,906 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-03 22:57:27,906 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:57:27,910 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:57:27,912 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-03 22:57:27,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:57:27,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:57:27,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:57:27,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:57:27,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-03 22:57:27,946 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:57:27,947 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-03 22:57:27,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:57:27,953 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:57:27,953 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:57:27,954 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-03 22:57:27,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:57:27,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:57:27,962 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-03 22:57:27,992 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-03 22:57:27,993 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-03 22:57:27,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:57:27,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:57:27,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:57:27,996 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-02-03 22:57:28,014 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-03 22:57:28,017 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-03 22:57:28,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:57:28,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:57:28,023 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-03 22:57:28,024 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-02-03 22:57:31,901 WARN L146 SmtUtils]: Spent 263ms on a formula simplification. DAG size of input: 44 DAG size of output 27 [2018-02-03 22:57:36,005 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-03 22:57:36,009 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-03 22:57:36,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:57:36,015 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-03 22:57:36,015 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 22:57:36,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:57:36,037 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-03 22:57:36,037 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2018-02-03 22:57:36,133 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-03 22:57:36,150 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:57:36,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 31] total 46 [2018-02-03 22:57:36,150 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-02-03 22:57:36,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-02-03 22:57:36,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1949, Unknown=1, NotChecked=0, Total=2070 [2018-02-03 22:57:36,151 INFO L87 Difference]: Start difference. First operand 113 states and 132 transitions. Second operand 46 states. [2018-02-03 22:57:50,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:57:50,071 INFO L93 Difference]: Finished difference Result 250 states and 282 transitions. [2018-02-03 22:57:50,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-02-03 22:57:50,072 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 91 [2018-02-03 22:57:50,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:57:50,072 INFO L225 Difference]: With dead ends: 250 [2018-02-03 22:57:50,072 INFO L226 Difference]: Without dead ends: 152 [2018-02-03 22:57:50,073 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1736 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=560, Invalid=8945, Unknown=1, NotChecked=0, Total=9506 [2018-02-03 22:57:50,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-02-03 22:57:50,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 117. [2018-02-03 22:57:50,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-03 22:57:50,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 135 transitions. [2018-02-03 22:57:50,075 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 135 transitions. Word has length 91 [2018-02-03 22:57:50,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:57:50,075 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 135 transitions. [2018-02-03 22:57:50,075 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-02-03 22:57:50,075 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 135 transitions. [2018-02-03 22:57:50,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-02-03 22:57:50,076 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:57:50,076 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-03 22:57:50,076 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-03 22:57:50,076 INFO L82 PathProgramCache]: Analyzing trace with hash -2017086444, now seen corresponding path program 5 times [2018-02-03 22:57:50,076 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:57:50,076 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:57:50,077 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:57:50,077 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:57:50,077 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:57:50,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:57:50,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:57:50,320 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-03 22:57:50,321 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:57:50,351 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-03 22:57:50,356 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-03 22:57:50,430 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-02-03 22:57:50,430 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:57:50,433 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:57:50,435 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-03 22:57:50,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:57:50,439 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-03 22:57:50,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:57:50,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:57:50,442 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-03 22:57:50,479 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:57:50,480 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-03 22:57:50,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:57:50,485 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:57:50,486 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:57:50,486 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-03 22:57:50,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:57:50,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:57:50,489 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-03 22:57:50,519 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-03 22:57:50,521 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-03 22:57:50,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:57:50,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:57:50,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:57:50,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-02-03 22:57:50,545 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-03 22:57:50,546 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-03 22:57:50,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:57:50,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:57:50,551 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-03 22:57:50,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-02-03 22:57:51,606 WARN L146 SmtUtils]: Spent 228ms on a formula simplification. DAG size of input: 39 DAG size of output 28 [2018-02-03 22:57:52,086 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-03 22:57:52,093 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-03 22:57:52,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:57:52,160 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-03 22:57:52,161 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 22:57:52,188 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-03 22:57:52,188 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 22:57:52,189 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-03 22:57:52,189 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-03 22:57:52,228 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-03 22:57:52,229 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-03 22:57:52,256 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-03 22:57:52,257 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-03 22:57:52,280 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-03 22:57:52,281 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-03 22:57:52,308 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-03 22:57:52,308 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-02-03 22:57:52,329 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-03 22:57:52,329 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-02-03 22:57:52,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-03 22:57:52,351 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-03 22:57:52,351 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:56, output treesize:32 [2018-02-03 22:57:52,452 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-03 22:57:52,470 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:57:52,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23] total 40 [2018-02-03 22:57:52,471 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-03 22:57:52,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-03 22:57:52,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1450, Unknown=0, NotChecked=0, Total=1560 [2018-02-03 22:57:52,471 INFO L87 Difference]: Start difference. First operand 117 states and 135 transitions. Second operand 40 states. [2018-02-03 22:57:56,506 WARN L146 SmtUtils]: Spent 310ms on a formula simplification. DAG size of input: 61 DAG size of output 45 [2018-02-03 22:57:56,725 WARN L146 SmtUtils]: Spent 175ms on a formula simplification. DAG size of input: 62 DAG size of output 46 [2018-02-03 22:57:57,256 WARN L146 SmtUtils]: Spent 174ms on a formula simplification. DAG size of input: 59 DAG size of output 43 [2018-02-03 22:57:58,298 WARN L146 SmtUtils]: Spent 177ms on a formula simplification. DAG size of input: 57 DAG size of output 41 [2018-02-03 22:57:59,784 WARN L146 SmtUtils]: Spent 583ms on a formula simplification. DAG size of input: 58 DAG size of output 42 [2018-02-03 22:58:00,912 WARN L146 SmtUtils]: Spent 264ms on a formula simplification. DAG size of input: 55 DAG size of output 39 [2018-02-03 22:58:01,630 WARN L143 SmtUtils]: Spent 102ms on a formula simplification that was a NOOP. DAG size: 39 [2018-02-03 22:58:06,049 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 62 DAG size of output 60 [2018-02-03 22:58:07,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:58:07,601 INFO L93 Difference]: Finished difference Result 271 states and 306 transitions. [2018-02-03 22:58:07,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-03 22:58:07,601 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 104 [2018-02-03 22:58:07,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:58:07,602 INFO L225 Difference]: With dead ends: 271 [2018-02-03 22:58:07,602 INFO L226 Difference]: Without dead ends: 159 [2018-02-03 22:58:07,602 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1158 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=603, Invalid=6369, Unknown=0, NotChecked=0, Total=6972 [2018-02-03 22:58:07,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-03 22:58:07,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 120. [2018-02-03 22:58:07,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-03 22:58:07,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 138 transitions. [2018-02-03 22:58:07,604 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 138 transitions. Word has length 104 [2018-02-03 22:58:07,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:58:07,605 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 138 transitions. [2018-02-03 22:58:07,605 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-03 22:58:07,605 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 138 transitions. [2018-02-03 22:58:07,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-02-03 22:58:07,605 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:58:07,605 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-03 22:58:07,605 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-03 22:58:07,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1898575794, now seen corresponding path program 3 times [2018-02-03 22:58:07,606 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:58:07,606 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:58:07,606 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:58:07,607 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:58:07,607 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:58:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:58:07,618 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:58:07,936 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-03 22:58:07,936 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:58:07,936 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-03 22:58:07,941 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-03 22:58:08,010 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-02-03 22:58:08,010 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:58:08,018 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:58:08,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:58:08,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:58:08,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:58:08,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-03 22:58:08,073 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-03 22:58:08,074 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-03 22:58:08,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:58:08,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:58:08,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:58:08,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-02-03 22:58:08,483 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-03 22:58:08,488 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-03 22:58:08,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:58:08,499 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-03 22:58:08,499 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 22:58:08,500 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-03 22:58:08,500 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 22:58:08,516 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-03 22:58:08,516 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-03 22:58:08,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-03 22:58:08,531 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-03 22:58:08,531 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:40, output treesize:59 [2018-02-03 22:58:08,628 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-03 22:58:08,646 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:58:08,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 43 [2018-02-03 22:58:08,646 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-03 22:58:08,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-03 22:58:08,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1754, Unknown=0, NotChecked=0, Total=1892 [2018-02-03 22:58:08,647 INFO L87 Difference]: Start difference. First operand 120 states and 138 transitions. Second operand 44 states. [2018-02-03 22:58:10,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:58:10,953 INFO L93 Difference]: Finished difference Result 331 states and 380 transitions. [2018-02-03 22:58:10,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-02-03 22:58:10,954 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 110 [2018-02-03 22:58:10,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:58:10,955 INFO L225 Difference]: With dead ends: 331 [2018-02-03 22:58:10,955 INFO L226 Difference]: Without dead ends: 331 [2018-02-03 22:58:10,956 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3066 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1110, Invalid=10446, Unknown=0, NotChecked=0, Total=11556 [2018-02-03 22:58:10,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-02-03 22:58:10,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 138. [2018-02-03 22:58:10,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-02-03 22:58:10,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 162 transitions. [2018-02-03 22:58:10,958 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 162 transitions. Word has length 110 [2018-02-03 22:58:10,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:58:10,958 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 162 transitions. [2018-02-03 22:58:10,958 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-03 22:58:10,958 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 162 transitions. [2018-02-03 22:58:10,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-02-03 22:58:10,959 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:58:10,959 INFO L351 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 22:58:10,959 INFO L371 AbstractCegarLoop]: === Iteration 38 === [cstrlenErr1RequiresViolation, cstrlenErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation, cstrstrErr2RequiresViolation, cstrstrErr3RequiresViolation, cstrstrErr1RequiresViolation, cstrstrErr0RequiresViolation]=== [2018-02-03 22:58:10,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1285268270, now seen corresponding path program 4 times [2018-02-03 22:58:10,959 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:58:10,959 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:58:10,960 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:58:10,960 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:58:10,960 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:58:10,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:58:10,973 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:58:11,287 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 78 proven. 213 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-03 22:58:11,288 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:58:11,288 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:58:11,296 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-03 22:58:11,359 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-03 22:58:11,359 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:58:11,367 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:58:11,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-02-03 22:58:11,384 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-03 22:58:11,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:58:11,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:58:11,387 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-03 22:58:11,388 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:14, output treesize:10 [2018-02-03 22:58:14,188 WARN L143 SmtUtils]: Spent 2003ms on a formula simplification that was a NOOP. DAG size: 19 Received shutdown request... [2018-02-03 22:58:26,636 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-03 22:58:26,636 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-03 22:58:26,639 WARN L185 ceAbstractionStarter]: Timeout [2018-02-03 22:58:26,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.02 10:58:26 BoogieIcfgContainer [2018-02-03 22:58:26,640 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-03 22:58:26,640 INFO L168 Benchmark]: Toolchain (without parser) took 207421.42 ms. Allocated memory was 399.5 MB in the beginning and 599.8 MB in the end (delta: 200.3 MB). Free memory was 353.5 MB in the beginning and 468.8 MB in the end (delta: -115.2 MB). Peak memory consumption was 85.1 MB. Max. memory is 5.3 GB. [2018-02-03 22:58:26,641 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 399.5 MB. Free memory is still 360.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-03 22:58:26,641 INFO L168 Benchmark]: CACSL2BoogieTranslator took 149.73 ms. Allocated memory is still 399.5 MB. Free memory was 353.5 MB in the beginning and 342.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. [2018-02-03 22:58:26,641 INFO L168 Benchmark]: Boogie Preprocessor took 33.24 ms. Allocated memory is still 399.5 MB. Free memory was 342.8 MB in the beginning and 341.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-03 22:58:26,641 INFO L168 Benchmark]: RCFGBuilder took 276.52 ms. Allocated memory is still 399.5 MB. Free memory was 341.5 MB in the beginning and 313.7 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. [2018-02-03 22:58:26,642 INFO L168 Benchmark]: TraceAbstraction took 206958.87 ms. Allocated memory was 399.5 MB in the beginning and 599.8 MB in the end (delta: 200.3 MB). Free memory was 312.4 MB in the beginning and 468.8 MB in the end (delta: -156.4 MB). Peak memory consumption was 43.9 MB. Max. memory is 5.3 GB. [2018-02-03 22:58:26,643 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.12 ms. Allocated memory is still 399.5 MB. Free memory is still 360.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 149.73 ms. Allocated memory is still 399.5 MB. Free memory was 353.5 MB in the beginning and 342.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.24 ms. Allocated memory is still 399.5 MB. Free memory was 342.8 MB in the beginning and 341.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 276.52 ms. Allocated memory is still 399.5 MB. Free memory was 341.5 MB in the beginning and 313.7 MB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 206958.87 ms. Allocated memory was 399.5 MB in the beginning and 599.8 MB in the end (delta: 200.3 MB). Free memory was 312.4 MB in the beginning and 468.8 MB in the end (delta: -156.4 MB). Peak memory consumption was 43.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 129 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 129 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 129 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 589). Cancelled while BasicCegarLoop was analyzing trace of length 129 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 129 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 589). Cancelled while BasicCegarLoop was analyzing trace of length 129 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 578]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 129 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 129 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 129 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 129 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 129 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 129 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 129 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 129 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 129 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was analyzing trace of length 129 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was analyzing trace of length 129 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 129 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 570). Cancelled while BasicCegarLoop was analyzing trace of length 129 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 129 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 129 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 90 locations, 21 error locations. TIMEOUT Result, 206.9s OverallTime, 38 OverallIterations, 8 TraceHistogramMax, 152.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2616 SDtfs, 6319 SDslu, 29660 SDs, 0 SdLazy, 25694 SolverSat, 1529 SolverUnsat, 14 SolverUnknown, 0 SolverNotchecked, 72.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2207 GetRequests, 1024 SyntacticMatches, 21 SemanticMatches, 1162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13879 ImplicationChecksByTransitivity, 111.7s 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, 37 MinimizatonAttempts, 810 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 37.2s InterpolantComputationTime, 2988 NumberOfCodeBlocks, 2935 NumberOfCodeBlocksAsserted, 72 NumberOfCheckSat, 2932 ConstructedInterpolants, 450 QuantifiedInterpolants, 2583683 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-03_22-58-26-649.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-03_22-58-26-649.csv Completed graceful shutdown