java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-29 22:50:27,417 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 22:50:27,419 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 22:50:27,432 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 22:50:27,433 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 22:50:27,434 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 22:50:27,435 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 22:50:27,436 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 22:50:27,439 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 22:50:27,439 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 22:50:27,440 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 22:50:27,441 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 22:50:27,442 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 22:50:27,443 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 22:50:27,444 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 22:50:27,446 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 22:50:27,448 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 22:50:27,450 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 22:50:27,451 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 22:50:27,452 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 22:50:27,454 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 22:50:27,455 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 22:50:27,455 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 22:50:27,456 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 22:50:27,456 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 22:50:27,458 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 22:50:27,458 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 22:50:27,458 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 22:50:27,459 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 22:50:27,459 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 22:50:27,459 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 22:50:27,460 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-29 22:50:27,475 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 22:50:27,475 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 22:50:27,476 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 22:50:27,476 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 22:50:27,477 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 22:50:27,477 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 22:50:27,477 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 22:50:27,478 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 22:50:27,478 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 22:50:27,478 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 22:50:27,478 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 22:50:27,478 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 22:50:27,478 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 22:50:27,479 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 22:50:27,479 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 22:50:27,479 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 22:50:27,479 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 22:50:27,479 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 22:50:27,480 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 22:50:27,480 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 22:50:27,480 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 22:50:27,480 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 22:50:27,480 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 22:50:27,480 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 22:50:27,481 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 22:50:27,481 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 22:50:27,481 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 22:50:27,481 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 22:50:27,481 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 22:50:27,482 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 22:50:27,482 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 22:50:27,482 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 22:50:27,483 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 22:50:27,483 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 22:50:27,513 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 22:50:27,522 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 22:50:27,525 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 22:50:27,526 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 22:50:27,526 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 22:50:27,526 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-01-29 22:50:27,661 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 22:50:27,665 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 22:50:27,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 22:50:27,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 22:50:27,672 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 22:50:27,673 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:50:27" (1/1) ... [2018-01-29 22:50:27,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@741a0bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:50:27, skipping insertion in model container [2018-01-29 22:50:27,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:50:27" (1/1) ... [2018-01-29 22:50:27,693 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 22:50:27,731 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 22:50:27,850 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 22:50:27,871 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 22:50:27,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:50:27 WrapperNode [2018-01-29 22:50:27,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 22:50:27,881 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 22:50:27,881 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 22:50:27,881 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 22:50:27,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:50:27" (1/1) ... [2018-01-29 22:50:27,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:50:27" (1/1) ... [2018-01-29 22:50:27,906 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:50:27" (1/1) ... [2018-01-29 22:50:27,907 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:50:27" (1/1) ... [2018-01-29 22:50:27,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:50:27" (1/1) ... [2018-01-29 22:50:27,919 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:50:27" (1/1) ... [2018-01-29 22:50:27,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:50:27" (1/1) ... [2018-01-29 22:50:27,923 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 22:50:27,924 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 22:50:27,924 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 22:50:27,924 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 22:50:27,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:50:27" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 22:50:27,975 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 22:50:27,975 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 22:50:27,975 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlen [2018-01-29 22:50:27,976 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-01-29 22:50:27,976 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrstr [2018-01-29 22:50:27,976 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 22:50:27,976 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-29 22:50:27,976 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-29 22:50:27,976 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 22:50:27,976 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 22:50:27,976 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 22:50:27,976 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-29 22:50:27,976 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlen [2018-01-29 22:50:27,977 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-01-29 22:50:27,977 INFO L128 BoogieDeclarations]: Found specification of procedure cstrstr [2018-01-29 22:50:27,977 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 22:50:27,977 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 22:50:27,977 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 22:50:28,365 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 22:50:28,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:50:28 BoogieIcfgContainer [2018-01-29 22:50:28,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 22:50:28,367 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 22:50:28,367 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 22:50:28,370 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 22:50:28,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:50:27" (1/3) ... [2018-01-29 22:50:28,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@461ab7ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:50:28, skipping insertion in model container [2018-01-29 22:50:28,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:50:27" (2/3) ... [2018-01-29 22:50:28,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@461ab7ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:50:28, skipping insertion in model container [2018-01-29 22:50:28,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:50:28" (3/3) ... [2018-01-29 22:50:28,373 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-01-29 22:50:28,380 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 22:50:28,387 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-01-29 22:50:28,427 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 22:50:28,427 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 22:50:28,427 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 22:50:28,428 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 22:50:28,428 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 22:50:28,428 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 22:50:28,428 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 22:50:28,428 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 22:50:28,429 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 22:50:28,447 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states. [2018-01-29 22:50:28,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-29 22:50:28,454 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:50:28,455 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:50:28,455 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-01-29 22:50:28,459 INFO L82 PathProgramCache]: Analyzing trace with hash 242841825, now seen corresponding path program 1 times [2018-01-29 22:50:28,461 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:50:28,461 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:50:28,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:50:28,502 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:50:28,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:50:28,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:50:28,559 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:50:28,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:50:28,663 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:50:28,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 22:50:28,664 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 22:50:28,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 22:50:28,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 22:50:28,772 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 4 states. [2018-01-29 22:50:28,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:50:28,908 INFO L93 Difference]: Finished difference Result 243 states and 267 transitions. [2018-01-29 22:50:28,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 22:50:28,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-29 22:50:28,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:50:28,919 INFO L225 Difference]: With dead ends: 243 [2018-01-29 22:50:28,919 INFO L226 Difference]: Without dead ends: 146 [2018-01-29 22:50:28,923 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:50:28,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-29 22:50:28,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-01-29 22:50:28,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-01-29 22:50:28,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 156 transitions. [2018-01-29 22:50:28,964 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 156 transitions. Word has length 19 [2018-01-29 22:50:28,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:50:28,964 INFO L432 AbstractCegarLoop]: Abstraction has 146 states and 156 transitions. [2018-01-29 22:50:28,964 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 22:50:28,965 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 156 transitions. [2018-01-29 22:50:28,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-29 22:50:28,965 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:50:28,965 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:50:28,965 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-01-29 22:50:28,966 INFO L82 PathProgramCache]: Analyzing trace with hash 242841826, now seen corresponding path program 1 times [2018-01-29 22:50:28,966 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:50:28,966 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:50:28,967 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:50:28,967 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:50:28,967 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:50:28,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:50:28,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:50:29,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:50:29,123 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:50:29,123 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 22:50:29,125 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 22:50:29,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 22:50:29,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:50:29,126 INFO L87 Difference]: Start difference. First operand 146 states and 156 transitions. Second operand 6 states. [2018-01-29 22:50:29,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:50:29,216 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2018-01-29 22:50:29,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 22:50:29,217 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-29 22:50:29,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:50:29,219 INFO L225 Difference]: With dead ends: 146 [2018-01-29 22:50:29,219 INFO L226 Difference]: Without dead ends: 145 [2018-01-29 22:50:29,220 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-29 22:50:29,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-01-29 22:50:29,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-01-29 22:50:29,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-01-29 22:50:29,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2018-01-29 22:50:29,233 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 19 [2018-01-29 22:50:29,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:50:29,234 INFO L432 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2018-01-29 22:50:29,234 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 22:50:29,234 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2018-01-29 22:50:29,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-29 22:50:29,235 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:50:29,235 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:50:29,235 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-01-29 22:50:29,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1061837988, now seen corresponding path program 1 times [2018-01-29 22:50:29,235 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:50:29,236 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:50:29,237 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:50:29,237 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:50:29,237 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:50:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:50:29,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:50:29,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:50:29,279 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:50:29,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 22:50:29,280 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 22:50:29,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 22:50:29,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 22:50:29,280 INFO L87 Difference]: Start difference. First operand 145 states and 155 transitions. Second operand 4 states. [2018-01-29 22:50:29,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:50:29,353 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2018-01-29 22:50:29,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 22:50:29,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-29 22:50:29,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:50:29,356 INFO L225 Difference]: With dead ends: 145 [2018-01-29 22:50:29,356 INFO L226 Difference]: Without dead ends: 144 [2018-01-29 22:50:29,357 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:50:29,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-01-29 22:50:29,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-01-29 22:50:29,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-29 22:50:29,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 154 transitions. [2018-01-29 22:50:29,366 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 154 transitions. Word has length 20 [2018-01-29 22:50:29,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:50:29,367 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 154 transitions. [2018-01-29 22:50:29,367 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 22:50:29,367 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2018-01-29 22:50:29,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-29 22:50:29,368 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:50:29,368 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:50:29,368 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-01-29 22:50:29,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1061837987, now seen corresponding path program 1 times [2018-01-29 22:50:29,368 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:50:29,368 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:50:29,369 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:50:29,369 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:50:29,369 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:50:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:50:29,382 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:50:29,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:50:29,457 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:50:29,457 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 22:50:29,457 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 22:50:29,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 22:50:29,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 22:50:29,458 INFO L87 Difference]: Start difference. First operand 144 states and 154 transitions. Second operand 5 states. [2018-01-29 22:50:29,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:50:29,510 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2018-01-29 22:50:29,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 22:50:29,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-29 22:50:29,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:50:29,513 INFO L225 Difference]: With dead ends: 144 [2018-01-29 22:50:29,513 INFO L226 Difference]: Without dead ends: 143 [2018-01-29 22:50:29,513 INFO L553 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-01-29 22:50:29,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-29 22:50:29,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-01-29 22:50:29,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-29 22:50:29,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 153 transitions. [2018-01-29 22:50:29,524 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 153 transitions. Word has length 20 [2018-01-29 22:50:29,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:50:29,525 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 153 transitions. [2018-01-29 22:50:29,525 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 22:50:29,525 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 153 transitions. [2018-01-29 22:50:29,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-29 22:50:29,526 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:50:29,526 INFO L350 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] [2018-01-29 22:50:29,526 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-01-29 22:50:29,527 INFO L82 PathProgramCache]: Analyzing trace with hash -736909339, now seen corresponding path program 1 times [2018-01-29 22:50:29,527 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:50:29,527 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:50:29,528 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:50:29,528 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:50:29,528 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:50:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:50:29,542 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:50:29,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:50:29,589 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:50:29,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 22:50:29,589 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 22:50:29,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 22:50:29,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:50:29,590 INFO L87 Difference]: Start difference. First operand 143 states and 153 transitions. Second operand 6 states. [2018-01-29 22:50:29,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:50:29,726 INFO L93 Difference]: Finished difference Result 143 states and 153 transitions. [2018-01-29 22:50:29,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 22:50:29,726 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-01-29 22:50:29,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:50:29,728 INFO L225 Difference]: With dead ends: 143 [2018-01-29 22:50:29,728 INFO L226 Difference]: Without dead ends: 142 [2018-01-29 22:50:29,728 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-29 22:50:29,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-01-29 22:50:29,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-01-29 22:50:29,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-29 22:50:29,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 152 transitions. [2018-01-29 22:50:29,737 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 152 transitions. Word has length 29 [2018-01-29 22:50:29,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:50:29,737 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 152 transitions. [2018-01-29 22:50:29,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 22:50:29,738 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 152 transitions. [2018-01-29 22:50:29,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-29 22:50:29,738 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:50:29,739 INFO L350 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] [2018-01-29 22:50:29,739 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-01-29 22:50:29,739 INFO L82 PathProgramCache]: Analyzing trace with hash -736909338, now seen corresponding path program 1 times [2018-01-29 22:50:29,739 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:50:29,739 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:50:29,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:50:29,740 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:50:29,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:50:29,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:50:29,752 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:50:29,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:50:29,860 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:50:29,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-29 22:50:29,860 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 22:50:29,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 22:50:29,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-29 22:50:29,861 INFO L87 Difference]: Start difference. First operand 142 states and 152 transitions. Second operand 9 states. [2018-01-29 22:50:30,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:50:30,055 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2018-01-29 22:50:30,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-29 22:50:30,055 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-01-29 22:50:30,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:50:30,056 INFO L225 Difference]: With dead ends: 142 [2018-01-29 22:50:30,056 INFO L226 Difference]: Without dead ends: 141 [2018-01-29 22:50:30,057 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-01-29 22:50:30,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-01-29 22:50:30,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-01-29 22:50:30,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-01-29 22:50:30,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 151 transitions. [2018-01-29 22:50:30,065 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 151 transitions. Word has length 29 [2018-01-29 22:50:30,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:50:30,066 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 151 transitions. [2018-01-29 22:50:30,066 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 22:50:30,066 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 151 transitions. [2018-01-29 22:50:30,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-29 22:50:30,067 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:50:30,067 INFO L350 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-01-29 22:50:30,068 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-01-29 22:50:30,068 INFO L82 PathProgramCache]: Analyzing trace with hash -312650031, now seen corresponding path program 1 times [2018-01-29 22:50:30,069 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:50:30,069 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:50:30,070 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:50:30,070 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:50:30,070 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:50:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:50:30,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:50:30,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:50:30,158 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:50:30,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-29 22:50:30,159 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 22:50:30,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 22:50:30,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-29 22:50:30,160 INFO L87 Difference]: Start difference. First operand 141 states and 151 transitions. Second operand 9 states. [2018-01-29 22:50:30,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:50:30,353 INFO L93 Difference]: Finished difference Result 141 states and 151 transitions. [2018-01-29 22:50:30,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 22:50:30,353 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-01-29 22:50:30,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:50:30,355 INFO L225 Difference]: With dead ends: 141 [2018-01-29 22:50:30,355 INFO L226 Difference]: Without dead ends: 140 [2018-01-29 22:50:30,355 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-01-29 22:50:30,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-01-29 22:50:30,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-01-29 22:50:30,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-01-29 22:50:30,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 150 transitions. [2018-01-29 22:50:30,363 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 150 transitions. Word has length 39 [2018-01-29 22:50:30,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:50:30,363 INFO L432 AbstractCegarLoop]: Abstraction has 140 states and 150 transitions. [2018-01-29 22:50:30,363 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 22:50:30,364 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 150 transitions. [2018-01-29 22:50:30,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-29 22:50:30,365 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:50:30,365 INFO L350 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-01-29 22:50:30,365 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-01-29 22:50:30,365 INFO L82 PathProgramCache]: Analyzing trace with hash -312650030, now seen corresponding path program 1 times [2018-01-29 22:50:30,365 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:50:30,365 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:50:30,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:50:30,366 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:50:30,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:50:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:50:30,382 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:50:30,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:50:30,673 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:50:30,673 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-01-29 22:50:30,674 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-29 22:50:30,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-29 22:50:30,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-01-29 22:50:30,678 INFO L87 Difference]: Start difference. First operand 140 states and 150 transitions. Second operand 16 states. [2018-01-29 22:50:31,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:50:31,333 INFO L93 Difference]: Finished difference Result 154 states and 165 transitions. [2018-01-29 22:50:31,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-29 22:50:31,334 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-01-29 22:50:31,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:50:31,337 INFO L225 Difference]: With dead ends: 154 [2018-01-29 22:50:31,337 INFO L226 Difference]: Without dead ends: 153 [2018-01-29 22:50:31,337 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2018-01-29 22:50:31,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-01-29 22:50:31,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 142. [2018-01-29 22:50:31,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-29 22:50:31,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 152 transitions. [2018-01-29 22:50:31,343 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 152 transitions. Word has length 39 [2018-01-29 22:50:31,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:50:31,343 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 152 transitions. [2018-01-29 22:50:31,344 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-29 22:50:31,344 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 152 transitions. [2018-01-29 22:50:31,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-29 22:50:31,345 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:50:31,345 INFO L350 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, 1, 1, 1, 1] [2018-01-29 22:50:31,345 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-01-29 22:50:31,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1428996634, now seen corresponding path program 1 times [2018-01-29 22:50:31,345 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:50:31,345 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:50:31,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:50:31,346 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:50:31,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:50:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:50:31,358 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:50:31,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:50:31,446 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:50:31,447 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 22:50:31,447 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 22:50:31,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 22:50:31,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:50:31,447 INFO L87 Difference]: Start difference. First operand 142 states and 152 transitions. Second operand 6 states. [2018-01-29 22:50:31,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:50:31,698 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2018-01-29 22:50:31,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 22:50:31,698 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-01-29 22:50:31,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:50:31,699 INFO L225 Difference]: With dead ends: 142 [2018-01-29 22:50:31,699 INFO L226 Difference]: Without dead ends: 122 [2018-01-29 22:50:31,700 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-29 22:50:31,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-29 22:50:31,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-01-29 22:50:31,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-29 22:50:31,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2018-01-29 22:50:31,707 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 43 [2018-01-29 22:50:31,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:50:31,708 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2018-01-29 22:50:31,708 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 22:50:31,708 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2018-01-29 22:50:31,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-29 22:50:31,708 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:50:31,709 INFO L350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:50:31,709 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-01-29 22:50:31,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1512512824, now seen corresponding path program 1 times [2018-01-29 22:50:31,709 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:50:31,709 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:50:31,710 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:50:31,710 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:50:31,710 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:50:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:50:31,725 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:50:32,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:50:32,077 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:50:32,077 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:50:32,083 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:50:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:50:32,123 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:50:32,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:50:32,162 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:50:32,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:50:32,171 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 22:50:32,194 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-01-29 22:50:32,196 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-01-29 22:50:32,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:50:32,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:50:32,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:50:32,203 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-29 22:50:32,455 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-01-29 22:50:32,463 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-01-29 22:50:32,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:50:32,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:50:32,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:50:32,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-01-29 22:50:32,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:50:32,626 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:50:32,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2018-01-29 22:50:32,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-01-29 22:50:32,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-01-29 22:50:32,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2018-01-29 22:50:32,628 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand 28 states. [2018-01-29 22:50:33,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:50:33,760 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-01-29 22:50:33,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-29 22:50:33,781 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 46 [2018-01-29 22:50:33,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:50:33,783 INFO L225 Difference]: With dead ends: 130 [2018-01-29 22:50:33,783 INFO L226 Difference]: Without dead ends: 129 [2018-01-29 22:50:33,784 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=230, Invalid=1662, Unknown=0, NotChecked=0, Total=1892 [2018-01-29 22:50:33,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-01-29 22:50:33,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 119. [2018-01-29 22:50:33,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-29 22:50:33,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-01-29 22:50:33,793 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 46 [2018-01-29 22:50:33,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:50:33,794 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-01-29 22:50:33,794 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-01-29 22:50:33,794 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2018-01-29 22:50:33,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-29 22:50:33,795 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:50:33,795 INFO L350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:50:33,795 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-01-29 22:50:33,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1611768986, now seen corresponding path program 1 times [2018-01-29 22:50:33,795 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:50:33,796 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:50:33,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:50:33,797 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:50:33,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:50:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:50:33,808 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:50:33,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:50:33,872 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:50:33,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-29 22:50:33,872 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-29 22:50:33,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-29 22:50:33,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-29 22:50:33,873 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 6 states. [2018-01-29 22:50:33,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:50:33,994 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2018-01-29 22:50:33,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-29 22:50:33,994 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-01-29 22:50:33,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:50:33,995 INFO L225 Difference]: With dead ends: 119 [2018-01-29 22:50:33,996 INFO L226 Difference]: Without dead ends: 118 [2018-01-29 22:50:33,996 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-29 22:50:33,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-29 22:50:34,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-01-29 22:50:34,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-29 22:50:34,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-01-29 22:50:34,005 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 51 [2018-01-29 22:50:34,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:50:34,005 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-01-29 22:50:34,005 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-29 22:50:34,006 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-01-29 22:50:34,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-29 22:50:34,006 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:50:34,006 INFO L350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:50:34,007 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-01-29 22:50:34,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1611768987, now seen corresponding path program 1 times [2018-01-29 22:50:34,007 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:50:34,007 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:50:34,008 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:50:34,008 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:50:34,008 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:50:34,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:50:34,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:50:34,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:50:34,162 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:50:34,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-29 22:50:34,162 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 22:50:34,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 22:50:34,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-29 22:50:34,163 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 9 states. [2018-01-29 22:50:34,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:50:34,263 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2018-01-29 22:50:34,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-29 22:50:34,264 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-01-29 22:50:34,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:50:34,264 INFO L225 Difference]: With dead ends: 127 [2018-01-29 22:50:34,265 INFO L226 Difference]: Without dead ends: 126 [2018-01-29 22:50:34,265 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-01-29 22:50:34,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-29 22:50:34,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 123. [2018-01-29 22:50:34,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-29 22:50:34,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-01-29 22:50:34,274 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 51 [2018-01-29 22:50:34,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:50:34,274 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-01-29 22:50:34,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 22:50:34,275 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-01-29 22:50:34,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-29 22:50:34,276 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:50:34,276 INFO L350 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:50:34,276 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-01-29 22:50:34,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1187964416, now seen corresponding path program 1 times [2018-01-29 22:50:34,277 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:50:34,277 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:50:34,277 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:50:34,278 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:50:34,278 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:50:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:50:34,295 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:50:34,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:50:34,632 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:50:34,632 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:50:34,638 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:50:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:50:34,661 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:50:34,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:50:34,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:50:34,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:50:34,669 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 22:50:34,708 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:50:34,709 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:50:34,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:50:34,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:50:34,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:50:34,715 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-29 22:50:34,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-29 22:50:34,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-29 22:50:34,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:50:34,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:50:34,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:50:34,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-29 22:50:34,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-01-29 22:50:34,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 11 treesize of output 10 [2018-01-29 22:50:34,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:50:34,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:50:34,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-29 22:50:34,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-29 22:50:45,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-01-29 22:50:45,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-29 22:50:45,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:50:45,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-01-29 22:50:45,389 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 22:50:45,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:50:45,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:50:45,403 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-01-29 22:50:45,514 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:50:45,533 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:50:45,534 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 29 [2018-01-29 22:50:45,534 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-29 22:50:45,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-29 22:50:45,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=788, Unknown=5, NotChecked=0, Total=870 [2018-01-29 22:50:45,535 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 30 states. [2018-01-29 22:50:49,903 WARN L146 SmtUtils]: Spent 292ms on a formula simplification. DAG size of input: 77 DAG size of output 55 [2018-01-29 22:50:50,124 WARN L146 SmtUtils]: Spent 188ms on a formula simplification. DAG size of input: 86 DAG size of output 61 [2018-01-29 22:50:52,314 WARN L146 SmtUtils]: Spent 2056ms on a formula simplification. DAG size of input: 80 DAG size of output 58 [2018-01-29 22:51:00,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:51:00,935 INFO L93 Difference]: Finished difference Result 192 states and 205 transitions. [2018-01-29 22:51:00,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-29 22:51:00,935 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 60 [2018-01-29 22:51:00,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:51:00,936 INFO L225 Difference]: With dead ends: 192 [2018-01-29 22:51:00,936 INFO L226 Difference]: Without dead ends: 191 [2018-01-29 22:51:00,937 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=273, Invalid=1791, Unknown=6, NotChecked=0, Total=2070 [2018-01-29 22:51:00,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-01-29 22:51:00,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 178. [2018-01-29 22:51:00,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-01-29 22:51:00,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 201 transitions. [2018-01-29 22:51:00,950 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 201 transitions. Word has length 60 [2018-01-29 22:51:00,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:51:00,950 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 201 transitions. [2018-01-29 22:51:00,950 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-29 22:51:00,951 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 201 transitions. [2018-01-29 22:51:00,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-29 22:51:00,952 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:51:00,952 INFO L350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:51:00,952 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-01-29 22:51:00,952 INFO L82 PathProgramCache]: Analyzing trace with hash -404256531, now seen corresponding path program 1 times [2018-01-29 22:51:00,952 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:51:00,953 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:51:00,953 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:51:00,953 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:51:00,954 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:51:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:51:00,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:51:01,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:51:01,035 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:51:01,035 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-29 22:51:01,035 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 22:51:01,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 22:51:01,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-29 22:51:01,036 INFO L87 Difference]: Start difference. First operand 178 states and 201 transitions. Second operand 8 states. [2018-01-29 22:51:01,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:51:01,202 INFO L93 Difference]: Finished difference Result 188 states and 213 transitions. [2018-01-29 22:51:01,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-29 22:51:01,202 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2018-01-29 22:51:01,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:51:01,203 INFO L225 Difference]: With dead ends: 188 [2018-01-29 22:51:01,203 INFO L226 Difference]: Without dead ends: 186 [2018-01-29 22:51:01,204 INFO L553 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-01-29 22:51:01,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-01-29 22:51:01,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 181. [2018-01-29 22:51:01,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-01-29 22:51:01,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 205 transitions. [2018-01-29 22:51:01,213 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 205 transitions. Word has length 63 [2018-01-29 22:51:01,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:51:01,214 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 205 transitions. [2018-01-29 22:51:01,214 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 22:51:01,214 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 205 transitions. [2018-01-29 22:51:01,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-29 22:51:01,215 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:51:01,215 INFO L350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:51:01,215 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-01-29 22:51:01,215 INFO L82 PathProgramCache]: Analyzing trace with hash -404256530, now seen corresponding path program 1 times [2018-01-29 22:51:01,215 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:51:01,215 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:51:01,216 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:51:01,216 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:51:01,216 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:51:01,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:51:01,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:51:01,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:51:01,324 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:51:01,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-29 22:51:01,324 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-29 22:51:01,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-29 22:51:01,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-29 22:51:01,325 INFO L87 Difference]: Start difference. First operand 181 states and 205 transitions. Second operand 8 states. [2018-01-29 22:51:01,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:51:01,426 INFO L93 Difference]: Finished difference Result 358 states and 407 transitions. [2018-01-29 22:51:01,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-29 22:51:01,426 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2018-01-29 22:51:01,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:51:01,429 INFO L225 Difference]: With dead ends: 358 [2018-01-29 22:51:01,429 INFO L226 Difference]: Without dead ends: 245 [2018-01-29 22:51:01,431 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-29 22:51:01,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-01-29 22:51:01,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 237. [2018-01-29 22:51:01,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-01-29 22:51:01,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 265 transitions. [2018-01-29 22:51:01,463 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 265 transitions. Word has length 63 [2018-01-29 22:51:01,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:51:01,464 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 265 transitions. [2018-01-29 22:51:01,464 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-29 22:51:01,464 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 265 transitions. [2018-01-29 22:51:01,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-29 22:51:01,465 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:51:01,465 INFO L350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:51:01,465 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-01-29 22:51:01,466 INFO L82 PathProgramCache]: Analyzing trace with hash -543419676, now seen corresponding path program 1 times [2018-01-29 22:51:01,466 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:51:01,466 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:51:01,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:51:01,467 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:51:01,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:51:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:51:01,484 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:51:01,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 22:51:01,828 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:51:01,828 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-29 22:51:01,829 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-29 22:51:01,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-29 22:51:01,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-01-29 22:51:01,829 INFO L87 Difference]: Start difference. First operand 237 states and 265 transitions. Second operand 17 states. [2018-01-29 22:51:02,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:51:02,320 INFO L93 Difference]: Finished difference Result 274 states and 293 transitions. [2018-01-29 22:51:02,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-29 22:51:02,321 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 70 [2018-01-29 22:51:02,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:51:02,322 INFO L225 Difference]: With dead ends: 274 [2018-01-29 22:51:02,322 INFO L226 Difference]: Without dead ends: 272 [2018-01-29 22:51:02,322 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2018-01-29 22:51:02,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-01-29 22:51:02,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 245. [2018-01-29 22:51:02,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-01-29 22:51:02,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 275 transitions. [2018-01-29 22:51:02,343 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 275 transitions. Word has length 70 [2018-01-29 22:51:02,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:51:02,344 INFO L432 AbstractCegarLoop]: Abstraction has 245 states and 275 transitions. [2018-01-29 22:51:02,344 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-29 22:51:02,344 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 275 transitions. [2018-01-29 22:51:02,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-29 22:51:02,345 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:51:02,345 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:51:02,345 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-01-29 22:51:02,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1419483589, now seen corresponding path program 2 times [2018-01-29 22:51:02,346 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:51:02,346 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:51:02,347 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:51:02,347 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:51:02,347 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:51:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:51:02,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:51:02,940 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:51:02,941 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:51:02,941 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:51:02,945 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:51:02,961 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:51:02,967 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:51:02,970 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:51:02,975 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:51:02,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 6 treesize of output 5 [2018-01-29 22:51:02,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:51:02,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:51:02,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:51:02,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:51:02,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-29 22:51:03,028 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:51:03,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-29 22:51:03,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:51:03,038 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:51:03,038 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:51:03,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:51:03,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:51:03,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:51:03,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-29 22:51:03,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-29 22:51:03,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-29 22:51:03,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:51:03,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:51:03,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:51:03,095 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-01-29 22:51:03,128 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-01-29 22:51:03,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-29 22:51:03,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:51:03,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:51:03,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-29 22:51:03,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-01-29 22:51:04,263 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-01-29 22:51:04,269 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-01-29 22:51:04,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:51:04,276 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-01-29 22:51:04,277 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 22:51:04,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:51:04,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:51:04,289 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2018-01-29 22:51:04,394 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:51:04,414 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:51:04,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 33 [2018-01-29 22:51:04,414 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-29 22:51:04,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-29 22:51:04,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1031, Unknown=0, NotChecked=0, Total=1122 [2018-01-29 22:51:04,415 INFO L87 Difference]: Start difference. First operand 245 states and 275 transitions. Second operand 34 states. [2018-01-29 22:51:07,495 WARN L146 SmtUtils]: Spent 258ms on a formula simplification. DAG size of input: 55 DAG size of output 39 [2018-01-29 22:51:17,921 WARN L146 SmtUtils]: Spent 10294ms on a formula simplification. DAG size of input: 74 DAG size of output 49 [2018-01-29 22:51:20,308 WARN L146 SmtUtils]: Spent 2319ms on a formula simplification. DAG size of input: 82 DAG size of output 55 [2018-01-29 22:51:22,492 WARN L146 SmtUtils]: Spent 2108ms on a formula simplification. DAG size of input: 61 DAG size of output 47 [2018-01-29 22:51:23,125 WARN L146 SmtUtils]: Spent 464ms on a formula simplification. DAG size of input: 85 DAG size of output 63 [2018-01-29 22:51:23,912 WARN L146 SmtUtils]: Spent 448ms on a formula simplification. DAG size of input: 73 DAG size of output 52 [2018-01-29 22:51:24,322 WARN L146 SmtUtils]: Spent 348ms on a formula simplification. DAG size of input: 79 DAG size of output 55 [2018-01-29 22:51:24,746 WARN L146 SmtUtils]: Spent 369ms on a formula simplification. DAG size of input: 83 DAG size of output 58 [2018-01-29 22:51:25,023 WARN L146 SmtUtils]: Spent 218ms on a formula simplification. DAG size of input: 70 DAG size of output 49 [2018-01-29 22:51:27,245 WARN L146 SmtUtils]: Spent 2153ms on a formula simplification. DAG size of input: 54 DAG size of output 43 [2018-01-29 22:51:27,760 WARN L146 SmtUtils]: Spent 303ms on a formula simplification. DAG size of input: 71 DAG size of output 55 [2018-01-29 22:51:28,030 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 58 DAG size of output 47 [2018-01-29 22:51:30,214 WARN L146 SmtUtils]: Spent 2112ms on a formula simplification. DAG size of input: 68 DAG size of output 53 [2018-01-29 22:51:30,728 WARN L146 SmtUtils]: Spent 422ms on a formula simplification. DAG size of input: 72 DAG size of output 57 [2018-01-29 22:51:30,886 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 72 DAG size of output 49 [2018-01-29 22:51:31,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:51:31,463 INFO L93 Difference]: Finished difference Result 251 states and 281 transitions. [2018-01-29 22:51:31,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-29 22:51:31,463 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 69 [2018-01-29 22:51:31,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:51:31,464 INFO L225 Difference]: With dead ends: 251 [2018-01-29 22:51:31,464 INFO L226 Difference]: Without dead ends: 194 [2018-01-29 22:51:31,466 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 24.9s TimeCoverageRelationStatistics Valid=394, Invalid=2576, Unknown=0, NotChecked=0, Total=2970 [2018-01-29 22:51:31,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-29 22:51:31,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 183. [2018-01-29 22:51:31,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-01-29 22:51:31,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 209 transitions. [2018-01-29 22:51:31,483 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 209 transitions. Word has length 69 [2018-01-29 22:51:31,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:51:31,484 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 209 transitions. [2018-01-29 22:51:31,484 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-29 22:51:31,484 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 209 transitions. [2018-01-29 22:51:31,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-29 22:51:31,485 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:51:31,485 INFO L350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:51:31,485 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-01-29 22:51:31,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1283803242, now seen corresponding path program 1 times [2018-01-29 22:51:31,485 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:51:31,485 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:51:31,486 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:51:31,486 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:51:31,486 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:51:31,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:51:31,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:51:31,574 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 22:51:31,575 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:51:31,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-29 22:51:31,575 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 22:51:31,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 22:51:31,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-29 22:51:31,576 INFO L87 Difference]: Start difference. First operand 183 states and 209 transitions. Second operand 9 states. [2018-01-29 22:51:31,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:51:31,707 INFO L93 Difference]: Finished difference Result 183 states and 209 transitions. [2018-01-29 22:51:31,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 22:51:31,707 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2018-01-29 22:51:31,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:51:31,708 INFO L225 Difference]: With dead ends: 183 [2018-01-29 22:51:31,708 INFO L226 Difference]: Without dead ends: 182 [2018-01-29 22:51:31,709 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-01-29 22:51:31,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-01-29 22:51:31,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-01-29 22:51:31,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-01-29 22:51:31,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 206 transitions. [2018-01-29 22:51:31,726 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 206 transitions. Word has length 73 [2018-01-29 22:51:31,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:51:31,727 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 206 transitions. [2018-01-29 22:51:31,727 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 22:51:31,727 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 206 transitions. [2018-01-29 22:51:31,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-29 22:51:31,728 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:51:31,728 INFO L350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:51:31,728 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-01-29 22:51:31,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1283803241, now seen corresponding path program 1 times [2018-01-29 22:51:31,728 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:51:31,729 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:51:31,729 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:51:31,729 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:51:31,729 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:51:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:51:31,742 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:51:32,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:51:32,124 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:51:32,124 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:51:32,130 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:51:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:51:32,162 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:51:32,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:51:32,245 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:51:32,245 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 18 [2018-01-29 22:51:32,246 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-29 22:51:32,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-29 22:51:32,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-01-29 22:51:32,246 INFO L87 Difference]: Start difference. First operand 182 states and 206 transitions. Second operand 19 states. [2018-01-29 22:51:32,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:51:32,676 INFO L93 Difference]: Finished difference Result 204 states and 228 transitions. [2018-01-29 22:51:32,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-29 22:51:32,676 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 73 [2018-01-29 22:51:32,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:51:32,677 INFO L225 Difference]: With dead ends: 204 [2018-01-29 22:51:32,677 INFO L226 Difference]: Without dead ends: 203 [2018-01-29 22:51:32,678 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=823, Unknown=0, NotChecked=0, Total=930 [2018-01-29 22:51:32,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-01-29 22:51:32,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 185. [2018-01-29 22:51:32,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-29 22:51:32,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 208 transitions. [2018-01-29 22:51:32,689 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 208 transitions. Word has length 73 [2018-01-29 22:51:32,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:51:32,690 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 208 transitions. [2018-01-29 22:51:32,690 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-29 22:51:32,690 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 208 transitions. [2018-01-29 22:51:32,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-29 22:51:32,690 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:51:32,690 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:51:32,690 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-01-29 22:51:32,691 INFO L82 PathProgramCache]: Analyzing trace with hash 2019894685, now seen corresponding path program 1 times [2018-01-29 22:51:32,691 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:51:32,691 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:51:32,691 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:51:32,692 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:51:32,692 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:51:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:51:32,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:51:33,211 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 22:51:33,248 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:51:33,248 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:51:33,253 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:51:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:51:33,279 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:51:33,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:51:33,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:51:33,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:51:33,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:51:33,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:51:33,301 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-29 22:51:33,334 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:51:33,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-29 22:51:33,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:51:33,345 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:51:33,346 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:51:33,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:51:33,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:51:33,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:51:33,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-29 22:51:33,401 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-01-29 22:51:33,403 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-01-29 22:51:33,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:51:33,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:51:33,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:51:33,409 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-29 22:51:33,443 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-01-29 22:51:33,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-29 22:51:33,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:51:33,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:51:33,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-29 22:51:33,456 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-01-29 22:51:38,475 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-01-29 22:51:38,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-01-29 22:51:38,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:51:38,489 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-01-29 22:51:38,489 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 22:51:38,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:51:38,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:51:38,498 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:32 [2018-01-29 22:51:38,610 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 22:51:38,631 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:51:38,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 33 [2018-01-29 22:51:38,631 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-29 22:51:38,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-29 22:51:38,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1030, Unknown=1, NotChecked=0, Total=1122 [2018-01-29 22:51:38,632 INFO L87 Difference]: Start difference. First operand 185 states and 208 transitions. Second operand 34 states. [2018-01-29 22:51:39,533 WARN L146 SmtUtils]: Spent 460ms on a formula simplification. DAG size of input: 48 DAG size of output 32 [2018-01-29 22:51:43,892 WARN L146 SmtUtils]: Spent 4237ms on a formula simplification. DAG size of input: 65 DAG size of output 40 [2018-01-29 22:51:46,466 WARN L146 SmtUtils]: Spent 2435ms on a formula simplification. DAG size of input: 73 DAG size of output 48 [2018-01-29 22:51:46,814 WARN L146 SmtUtils]: Spent 206ms on a formula simplification. DAG size of input: 54 DAG size of output 40 [2018-01-29 22:51:47,794 WARN L146 SmtUtils]: Spent 917ms on a formula simplification. DAG size of input: 76 DAG size of output 54 [2018-01-29 22:51:48,021 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 66 DAG size of output 45 [2018-01-29 22:51:48,461 WARN L146 SmtUtils]: Spent 408ms on a formula simplification. DAG size of input: 74 DAG size of output 51 [2018-01-29 22:51:48,782 WARN L146 SmtUtils]: Spent 283ms on a formula simplification. DAG size of input: 78 DAG size of output 54 [2018-01-29 22:51:51,000 WARN L146 SmtUtils]: Spent 2187ms on a formula simplification. DAG size of input: 63 DAG size of output 42 [2018-01-29 22:51:53,303 WARN L146 SmtUtils]: Spent 2140ms on a formula simplification. DAG size of input: 47 DAG size of output 36 [2018-01-29 22:51:53,902 WARN L146 SmtUtils]: Spent 421ms on a formula simplification. DAG size of input: 59 DAG size of output 44 [2018-01-29 22:51:55,034 WARN L146 SmtUtils]: Spent 505ms on a formula simplification. DAG size of input: 48 DAG size of output 38 [2018-01-29 22:51:55,393 WARN L146 SmtUtils]: Spent 290ms on a formula simplification. DAG size of input: 59 DAG size of output 47 [2018-01-29 22:51:55,985 WARN L146 SmtUtils]: Spent 413ms on a formula simplification. DAG size of input: 63 DAG size of output 50 [2018-01-29 22:51:56,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:51:56,537 INFO L93 Difference]: Finished difference Result 226 states and 241 transitions. [2018-01-29 22:51:56,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-29 22:51:56,538 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 79 [2018-01-29 22:51:56,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:51:56,539 INFO L225 Difference]: With dead ends: 226 [2018-01-29 22:51:56,539 INFO L226 Difference]: Without dead ends: 224 [2018-01-29 22:51:56,540 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 21.8s TimeCoverageRelationStatistics Valid=376, Invalid=2703, Unknown=1, NotChecked=0, Total=3080 [2018-01-29 22:51:56,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-01-29 22:51:56,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 128. [2018-01-29 22:51:56,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-01-29 22:51:56,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2018-01-29 22:51:56,554 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 79 [2018-01-29 22:51:56,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:51:56,554 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2018-01-29 22:51:56,554 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-29 22:51:56,554 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2018-01-29 22:51:56,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-29 22:51:56,555 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:51:56,555 INFO L350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:51:56,556 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-01-29 22:51:56,556 INFO L82 PathProgramCache]: Analyzing trace with hash 74819260, now seen corresponding path program 1 times [2018-01-29 22:51:56,556 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:51:56,556 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:51:56,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:51:56,557 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:51:56,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:51:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:51:56,569 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:51:56,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 22:51:56,658 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:51:56,658 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-29 22:51:56,659 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-29 22:51:56,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-29 22:51:56,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-29 22:51:56,659 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand 9 states. [2018-01-29 22:51:56,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:51:56,926 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2018-01-29 22:51:56,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-29 22:51:56,926 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2018-01-29 22:51:56,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:51:56,928 INFO L225 Difference]: With dead ends: 128 [2018-01-29 22:51:56,928 INFO L226 Difference]: Without dead ends: 126 [2018-01-29 22:51:56,928 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-01-29 22:51:56,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-29 22:51:56,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-01-29 22:51:56,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-29 22:51:56,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2018-01-29 22:51:56,941 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 80 [2018-01-29 22:51:56,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:51:56,941 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2018-01-29 22:51:56,941 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-29 22:51:56,941 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2018-01-29 22:51:56,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-29 22:51:56,942 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:51:56,942 INFO L350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:51:56,942 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-01-29 22:51:56,943 INFO L82 PathProgramCache]: Analyzing trace with hash 74819261, now seen corresponding path program 1 times [2018-01-29 22:51:56,943 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:51:56,943 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:51:56,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:51:56,944 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:51:56,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:51:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:51:56,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:51:57,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 22:51:57,146 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:51:57,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-29 22:51:57,147 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-29 22:51:57,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-29 22:51:57,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-01-29 22:51:57,148 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand 13 states. [2018-01-29 22:51:57,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:51:57,517 INFO L93 Difference]: Finished difference Result 203 states and 218 transitions. [2018-01-29 22:51:57,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-29 22:51:57,520 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2018-01-29 22:51:57,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:51:57,521 INFO L225 Difference]: With dead ends: 203 [2018-01-29 22:51:57,521 INFO L226 Difference]: Without dead ends: 201 [2018-01-29 22:51:57,522 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2018-01-29 22:51:57,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-01-29 22:51:57,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 183. [2018-01-29 22:51:57,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-01-29 22:51:57,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 201 transitions. [2018-01-29 22:51:57,557 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 201 transitions. Word has length 80 [2018-01-29 22:51:57,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:51:57,557 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 201 transitions. [2018-01-29 22:51:57,557 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-29 22:51:57,557 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 201 transitions. [2018-01-29 22:51:57,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-29 22:51:57,558 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:51:57,558 INFO L350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:51:57,559 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-01-29 22:51:57,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1584254756, now seen corresponding path program 1 times [2018-01-29 22:51:57,559 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:51:57,559 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:51:57,560 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:51:57,560 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:51:57,560 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:51:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:51:57,572 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:51:57,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-29 22:51:57,692 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 22:51:57,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-29 22:51:57,693 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-29 22:51:57,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-29 22:51:57,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-29 22:51:57,693 INFO L87 Difference]: Start difference. First operand 183 states and 201 transitions. Second operand 10 states. [2018-01-29 22:51:57,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:51:57,843 INFO L93 Difference]: Finished difference Result 183 states and 201 transitions. [2018-01-29 22:51:57,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-29 22:51:57,843 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 81 [2018-01-29 22:51:57,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:51:57,844 INFO L225 Difference]: With dead ends: 183 [2018-01-29 22:51:57,844 INFO L226 Difference]: Without dead ends: 182 [2018-01-29 22:51:57,845 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-01-29 22:51:57,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-01-29 22:51:57,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-01-29 22:51:57,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-01-29 22:51:57,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 199 transitions. [2018-01-29 22:51:57,857 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 199 transitions. Word has length 81 [2018-01-29 22:51:57,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:51:57,857 INFO L432 AbstractCegarLoop]: Abstraction has 182 states and 199 transitions. [2018-01-29 22:51:57,857 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-29 22:51:57,857 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 199 transitions. [2018-01-29 22:51:57,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-29 22:51:57,858 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:51:57,858 INFO L350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:51:57,858 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-01-29 22:51:57,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1584254755, now seen corresponding path program 1 times [2018-01-29 22:51:57,858 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:51:57,858 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:51:57,859 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:51:57,859 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:51:57,859 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:51:57,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:51:57,871 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:51:58,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:51:58,251 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:51:58,251 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:51:58,257 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:51:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:51:58,285 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:51:58,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:51:58,338 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:51:58,338 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 20 [2018-01-29 22:51:58,338 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-29 22:51:58,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-29 22:51:58,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2018-01-29 22:51:58,339 INFO L87 Difference]: Start difference. First operand 182 states and 199 transitions. Second operand 21 states. [2018-01-29 22:51:58,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:51:58,792 INFO L93 Difference]: Finished difference Result 260 states and 284 transitions. [2018-01-29 22:51:58,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-29 22:51:58,792 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 81 [2018-01-29 22:51:58,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:51:58,793 INFO L225 Difference]: With dead ends: 260 [2018-01-29 22:51:58,794 INFO L226 Difference]: Without dead ends: 259 [2018-01-29 22:51:58,794 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=1132, Unknown=0, NotChecked=0, Total=1260 [2018-01-29 22:51:58,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-01-29 22:51:58,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 193. [2018-01-29 22:51:58,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-01-29 22:51:58,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 211 transitions. [2018-01-29 22:51:58,808 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 211 transitions. Word has length 81 [2018-01-29 22:51:58,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:51:58,808 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 211 transitions. [2018-01-29 22:51:58,808 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-29 22:51:58,808 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 211 transitions. [2018-01-29 22:51:58,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-01-29 22:51:58,809 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:51:58,810 INFO L350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:51:58,810 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-01-29 22:51:58,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1252384409, now seen corresponding path program 1 times [2018-01-29 22:51:58,810 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:51:58,810 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:51:58,811 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:51:58,811 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:51:58,811 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:51:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:51:58,825 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:51:58,963 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:51:58,964 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:51:58,995 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:51:59,000 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:51:59,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:51:59,029 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:51:59,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:51:59,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:51:59,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:51:59,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:51:59,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:51:59,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-29 22:51:59,065 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:51:59,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-29 22:51:59,066 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:51:59,092 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:51:59,107 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:51:59,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:51:59,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:51:59,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:51:59,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-29 22:51:59,159 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-01-29 22:51:59,161 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-01-29 22:51:59,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:51:59,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:51:59,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:51:59,168 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-29 22:51:59,196 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-01-29 22:51:59,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-29 22:51:59,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:51:59,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:51:59,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:51:59,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-01-29 22:52:00,364 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-01-29 22:52:00,370 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-01-29 22:52:00,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-29 22:52:00,379 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-01-29 22:52:00,379 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:00,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:52:00,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:52:00,399 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2018-01-29 22:52:00,564 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:52:00,584 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:52:00,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 29] total 38 [2018-01-29 22:52:00,584 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-29 22:52:00,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-29 22:52:00,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1309, Unknown=0, NotChecked=0, Total=1406 [2018-01-29 22:52:00,585 INFO L87 Difference]: Start difference. First operand 193 states and 211 transitions. Second operand 38 states. [2018-01-29 22:52:04,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:52:04,984 INFO L93 Difference]: Finished difference Result 532 states and 587 transitions. [2018-01-29 22:52:04,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-01-29 22:52:04,984 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 89 [2018-01-29 22:52:04,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:52:04,986 INFO L225 Difference]: With dead ends: 532 [2018-01-29 22:52:04,986 INFO L226 Difference]: Without dead ends: 303 [2018-01-29 22:52:04,989 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1949 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=706, Invalid=8606, Unknown=0, NotChecked=0, Total=9312 [2018-01-29 22:52:04,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-01-29 22:52:05,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 238. [2018-01-29 22:52:05,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-01-29 22:52:05,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 262 transitions. [2018-01-29 22:52:05,012 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 262 transitions. Word has length 89 [2018-01-29 22:52:05,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:52:05,013 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 262 transitions. [2018-01-29 22:52:05,013 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-29 22:52:05,013 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 262 transitions. [2018-01-29 22:52:05,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-01-29 22:52:05,014 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:52:05,014 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:52:05,014 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-01-29 22:52:05,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1176926206, now seen corresponding path program 1 times [2018-01-29 22:52:05,014 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:52:05,014 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:52:05,015 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:05,015 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:52:05,015 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:52:05,030 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:52:05,339 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:52:05,339 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:52:05,339 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:52:05,346 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:52:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:52:05,387 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:52:05,818 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:52:05,839 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:52:05,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 23 [2018-01-29 22:52:05,839 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-29 22:52:05,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-29 22:52:05,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2018-01-29 22:52:05,840 INFO L87 Difference]: Start difference. First operand 238 states and 262 transitions. Second operand 24 states. [2018-01-29 22:52:06,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:52:06,297 INFO L93 Difference]: Finished difference Result 279 states and 304 transitions. [2018-01-29 22:52:06,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-29 22:52:06,297 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 99 [2018-01-29 22:52:06,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:52:06,298 INFO L225 Difference]: With dead ends: 279 [2018-01-29 22:52:06,298 INFO L226 Difference]: Without dead ends: 278 [2018-01-29 22:52:06,299 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=144, Invalid=1116, Unknown=0, NotChecked=0, Total=1260 [2018-01-29 22:52:06,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-01-29 22:52:06,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 241. [2018-01-29 22:52:06,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-01-29 22:52:06,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 264 transitions. [2018-01-29 22:52:06,313 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 264 transitions. Word has length 99 [2018-01-29 22:52:06,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:52:06,313 INFO L432 AbstractCegarLoop]: Abstraction has 241 states and 264 transitions. [2018-01-29 22:52:06,313 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-29 22:52:06,313 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 264 transitions. [2018-01-29 22:52:06,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-01-29 22:52:06,314 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:52:06,314 INFO L350 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:52:06,314 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-01-29 22:52:06,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1409718852, now seen corresponding path program 1 times [2018-01-29 22:52:06,314 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:52:06,314 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:52:06,315 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:06,315 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:52:06,315 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:52:06,329 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:52:06,665 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:52:06,665 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:52:06,665 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:52:06,671 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:52:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:52:06,706 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:52:06,767 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:52:06,801 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:52:06,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16] total 23 [2018-01-29 22:52:06,801 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-29 22:52:06,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-29 22:52:06,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=499, Unknown=0, NotChecked=0, Total=552 [2018-01-29 22:52:06,802 INFO L87 Difference]: Start difference. First operand 241 states and 264 transitions. Second operand 24 states. [2018-01-29 22:52:07,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:52:07,511 INFO L93 Difference]: Finished difference Result 339 states and 369 transitions. [2018-01-29 22:52:07,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-29 22:52:07,511 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 107 [2018-01-29 22:52:07,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:52:07,513 INFO L225 Difference]: With dead ends: 339 [2018-01-29 22:52:07,513 INFO L226 Difference]: Without dead ends: 338 [2018-01-29 22:52:07,513 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=1644, Unknown=0, NotChecked=0, Total=1806 [2018-01-29 22:52:07,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-01-29 22:52:07,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 238. [2018-01-29 22:52:07,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-01-29 22:52:07,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 262 transitions. [2018-01-29 22:52:07,534 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 262 transitions. Word has length 107 [2018-01-29 22:52:07,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:52:07,534 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 262 transitions. [2018-01-29 22:52:07,534 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-29 22:52:07,534 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 262 transitions. [2018-01-29 22:52:07,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-01-29 22:52:07,535 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:52:07,535 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:52:07,535 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-01-29 22:52:07,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1826501582, now seen corresponding path program 2 times [2018-01-29 22:52:07,535 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:52:07,535 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:52:07,536 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:07,536 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:52:07,536 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:07,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:52:07,549 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:52:07,729 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:52:07,729 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:52:07,729 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:52:07,734 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:52:07,751 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:52:07,761 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:52:07,766 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:52:07,770 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:52:07,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:52:07,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:07,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:52:07,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:07,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:52:07,781 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-29 22:52:07,811 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:52:07,812 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:52:07,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:52:07,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:07,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-29 22:52:07,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:07,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:52:07,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-01-29 22:52:07,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-29 22:52:07,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-29 22:52:07,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:07,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:52:07,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:52:07,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-01-29 22:52:07,898 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-01-29 22:52:07,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-29 22:52:07,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:07,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:52:07,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:52:07,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-01-29 22:52:09,595 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-01-29 22:52:09,598 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-01-29 22:52:09,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:09,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-01-29 22:52:09,611 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-29 22:52:09,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:52:09,635 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-01-29 22:52:09,635 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:81 [2018-01-29 22:52:10,024 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:52:10,043 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:52:10,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 34] total 45 [2018-01-29 22:52:10,044 INFO L409 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-01-29 22:52:10,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-01-29 22:52:10,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1864, Unknown=0, NotChecked=0, Total=1980 [2018-01-29 22:52:10,045 INFO L87 Difference]: Start difference. First operand 238 states and 262 transitions. Second operand 45 states. [2018-01-29 22:52:19,876 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 86 DAG size of output 66 [2018-01-29 22:52:21,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:52:21,426 INFO L93 Difference]: Finished difference Result 700 states and 770 transitions. [2018-01-29 22:52:21,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-01-29 22:52:21,427 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 115 [2018-01-29 22:52:21,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:52:21,429 INFO L225 Difference]: With dead ends: 700 [2018-01-29 22:52:21,429 INFO L226 Difference]: Without dead ends: 370 [2018-01-29 22:52:21,433 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2797 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=801, Invalid=12538, Unknown=1, NotChecked=0, Total=13340 [2018-01-29 22:52:21,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-01-29 22:52:21,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 283. [2018-01-29 22:52:21,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-01-29 22:52:21,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 313 transitions. [2018-01-29 22:52:21,464 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 313 transitions. Word has length 115 [2018-01-29 22:52:21,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:52:21,465 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 313 transitions. [2018-01-29 22:52:21,465 INFO L433 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-01-29 22:52:21,465 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 313 transitions. [2018-01-29 22:52:21,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-01-29 22:52:21,466 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:52:21,466 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:52:21,466 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-01-29 22:52:21,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1069027401, now seen corresponding path program 2 times [2018-01-29 22:52:21,466 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:52:21,467 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:52:21,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:21,467 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:52:21,468 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:52:21,483 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:52:22,119 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 27 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:52:22,119 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:52:22,119 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:52:22,126 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:52:22,148 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:52:22,170 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:52:22,176 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:52:22,180 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:52:22,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:52:22,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:22,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:52:22,234 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 22:52:22,478 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 27 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:52:22,498 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:52:22,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 28 [2018-01-29 22:52:22,498 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-29 22:52:22,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-29 22:52:22,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2018-01-29 22:52:22,499 INFO L87 Difference]: Start difference. First operand 283 states and 313 transitions. Second operand 29 states. [2018-01-29 22:52:23,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:52:23,246 INFO L93 Difference]: Finished difference Result 358 states and 389 transitions. [2018-01-29 22:52:23,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-29 22:52:23,246 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 125 [2018-01-29 22:52:23,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:52:23,248 INFO L225 Difference]: With dead ends: 358 [2018-01-29 22:52:23,248 INFO L226 Difference]: Without dead ends: 357 [2018-01-29 22:52:23,249 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 118 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=207, Invalid=2145, Unknown=0, NotChecked=0, Total=2352 [2018-01-29 22:52:23,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-01-29 22:52:23,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 286. [2018-01-29 22:52:23,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-01-29 22:52:23,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 315 transitions. [2018-01-29 22:52:23,270 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 315 transitions. Word has length 125 [2018-01-29 22:52:23,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:52:23,270 INFO L432 AbstractCegarLoop]: Abstraction has 286 states and 315 transitions. [2018-01-29 22:52:23,270 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-29 22:52:23,270 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 315 transitions. [2018-01-29 22:52:23,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-01-29 22:52:23,271 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:52:23,271 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:52:23,271 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-01-29 22:52:23,271 INFO L82 PathProgramCache]: Analyzing trace with hash 305481981, now seen corresponding path program 2 times [2018-01-29 22:52:23,271 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:52:23,271 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:52:23,272 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:23,272 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:52:23,272 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:52:23,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:52:23,814 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 27 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:52:23,814 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:52:23,814 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:52:23,819 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-29 22:52:23,839 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-29 22:52:23,842 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:52:23,845 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:52:23,909 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-01-29 22:52:23,929 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-29 22:52:23,929 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [25] total 28 [2018-01-29 22:52:23,929 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-29 22:52:23,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-29 22:52:23,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=742, Unknown=0, NotChecked=0, Total=812 [2018-01-29 22:52:23,930 INFO L87 Difference]: Start difference. First operand 286 states and 315 transitions. Second operand 29 states. [2018-01-29 22:52:24,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:52:24,969 INFO L93 Difference]: Finished difference Result 421 states and 458 transitions. [2018-01-29 22:52:24,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-29 22:52:24,986 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 133 [2018-01-29 22:52:24,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:52:24,987 INFO L225 Difference]: With dead ends: 421 [2018-01-29 22:52:24,988 INFO L226 Difference]: Without dead ends: 420 [2018-01-29 22:52:24,989 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=302, Invalid=3238, Unknown=0, NotChecked=0, Total=3540 [2018-01-29 22:52:24,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2018-01-29 22:52:25,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 271. [2018-01-29 22:52:25,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-01-29 22:52:25,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 299 transitions. [2018-01-29 22:52:25,008 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 299 transitions. Word has length 133 [2018-01-29 22:52:25,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:52:25,009 INFO L432 AbstractCegarLoop]: Abstraction has 271 states and 299 transitions. [2018-01-29 22:52:25,009 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-29 22:52:25,009 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 299 transitions. [2018-01-29 22:52:25,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-01-29 22:52:25,010 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:52:25,011 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:52:25,011 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-01-29 22:52:25,011 INFO L82 PathProgramCache]: Analyzing trace with hash -973923961, now seen corresponding path program 3 times [2018-01-29 22:52:25,011 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:52:25,011 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:52:25,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:25,012 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:52:25,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:52:25,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:52:25,267 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 8 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:52:25,267 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:52:25,267 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:52:25,272 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 22:52:25,292 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:52:25,300 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:52:25,308 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:52:25,318 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:52:25,322 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:52:25,327 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:52:25,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:52:25,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:25,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:52:25,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:25,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:52:25,338 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-29 22:52:25,368 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:52:25,369 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:52:25,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:52:25,369 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:25,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-29 22:52:25,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:25,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:52:25,381 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-01-29 22:52:25,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-29 22:52:25,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-29 22:52:25,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:25,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:52:25,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:52:25,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:28 [2018-01-29 22:52:25,457 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-01-29 22:52:25,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-29 22:52:25,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:25,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:52:25,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:52:25,469 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-01-29 22:52:26,838 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-01-29 22:52:26,840 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-01-29 22:52:26,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:26,851 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-01-29 22:52:26,851 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-29 22:52:26,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:52:26,875 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-01-29 22:52:26,876 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:52, output treesize:52 [2018-01-29 22:52:27,229 WARN L143 SmtUtils]: Spent 103ms on a formula simplification that was a NOOP. DAG size: 24 [2018-01-29 22:52:27,389 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:52:27,411 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:52:27,411 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 40] total 53 [2018-01-29 22:52:27,412 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-01-29 22:52:27,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-01-29 22:52:27,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=2622, Unknown=0, NotChecked=0, Total=2756 [2018-01-29 22:52:27,412 INFO L87 Difference]: Start difference. First operand 271 states and 299 transitions. Second operand 53 states. [2018-01-29 22:52:36,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:52:36,420 INFO L93 Difference]: Finished difference Result 791 states and 863 transitions. [2018-01-29 22:52:36,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-01-29 22:52:36,420 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 141 [2018-01-29 22:52:36,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:52:36,422 INFO L225 Difference]: With dead ends: 791 [2018-01-29 22:52:36,427 INFO L226 Difference]: Without dead ends: 647 [2018-01-29 22:52:36,429 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4776 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=1054, Invalid=20408, Unknown=0, NotChecked=0, Total=21462 [2018-01-29 22:52:36,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2018-01-29 22:52:36,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 479. [2018-01-29 22:52:36,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-01-29 22:52:36,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 530 transitions. [2018-01-29 22:52:36,481 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 530 transitions. Word has length 141 [2018-01-29 22:52:36,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:52:36,482 INFO L432 AbstractCegarLoop]: Abstraction has 479 states and 530 transitions. [2018-01-29 22:52:36,482 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-01-29 22:52:36,482 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 530 transitions. [2018-01-29 22:52:36,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-01-29 22:52:36,484 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:52:36,484 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:52:36,484 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-01-29 22:52:36,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1335528918, now seen corresponding path program 1 times [2018-01-29 22:52:36,485 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:52:36,485 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:52:36,485 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:36,486 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:52:36,486 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:52:36,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:52:36,671 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 40 proven. 4 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-01-29 22:52:36,671 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:52:36,672 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:52:36,679 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:52:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:52:36,738 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:52:36,894 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-01-29 22:52:36,924 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:52:36,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13] total 19 [2018-01-29 22:52:36,925 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-29 22:52:36,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-29 22:52:36,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2018-01-29 22:52:36,925 INFO L87 Difference]: Start difference. First operand 479 states and 530 transitions. Second operand 20 states. [2018-01-29 22:52:37,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:52:37,438 INFO L93 Difference]: Finished difference Result 689 states and 740 transitions. [2018-01-29 22:52:37,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-01-29 22:52:37,438 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 141 [2018-01-29 22:52:37,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:52:37,439 INFO L225 Difference]: With dead ends: 689 [2018-01-29 22:52:37,439 INFO L226 Difference]: Without dead ends: 422 [2018-01-29 22:52:37,440 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=374, Invalid=1788, Unknown=0, NotChecked=0, Total=2162 [2018-01-29 22:52:37,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-01-29 22:52:37,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 287. [2018-01-29 22:52:37,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-01-29 22:52:37,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 317 transitions. [2018-01-29 22:52:37,475 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 317 transitions. Word has length 141 [2018-01-29 22:52:37,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:52:37,475 INFO L432 AbstractCegarLoop]: Abstraction has 287 states and 317 transitions. [2018-01-29 22:52:37,475 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-29 22:52:37,475 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 317 transitions. [2018-01-29 22:52:37,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-01-29 22:52:37,476 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:52:37,477 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:52:37,477 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-01-29 22:52:37,477 INFO L82 PathProgramCache]: Analyzing trace with hash -203777314, now seen corresponding path program 3 times [2018-01-29 22:52:37,477 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:52:37,477 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:52:37,478 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:37,478 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:52:37,478 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:52:37,495 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:52:38,009 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 50 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-29 22:52:38,009 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:52:38,009 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-29 22:52:38,016 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-29 22:52:38,045 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:52:38,060 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:52:38,073 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:52:38,088 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-29 22:52:38,092 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-29 22:52:38,098 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:52:38,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:52:38,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:38,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:52:38,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-29 22:52:38,147 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-01-29 22:52:38,148 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-01-29 22:52:38,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:38,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:52:38,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:52:38,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-29 22:52:38,581 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-01-29 22:52:38,583 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 28 treesize of output 21 [2018-01-29 22:52:38,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:38,602 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-01-29 22:52:38,602 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-29 22:52:38,616 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-01-29 22:52:38,616 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-29 22:52:38,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-29 22:52:38,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-29 22:52:38,638 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2018-01-29 22:52:38,763 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 20 proven. 29 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-01-29 22:52:38,782 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-29 22:52:38,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 40 [2018-01-29 22:52:38,783 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-29 22:52:38,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-29 22:52:38,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1516, Unknown=0, NotChecked=0, Total=1640 [2018-01-29 22:52:38,784 INFO L87 Difference]: Start difference. First operand 287 states and 317 transitions. Second operand 41 states. [2018-01-29 22:52:41,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 22:52:41,857 INFO L93 Difference]: Finished difference Result 468 states and 507 transitions. [2018-01-29 22:52:41,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-01-29 22:52:41,857 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 151 [2018-01-29 22:52:41,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 22:52:41,859 INFO L225 Difference]: With dead ends: 468 [2018-01-29 22:52:41,859 INFO L226 Difference]: Without dead ends: 467 [2018-01-29 22:52:41,860 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 136 SyntacticMatches, 1 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3661 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1579, Invalid=11303, Unknown=0, NotChecked=0, Total=12882 [2018-01-29 22:52:41,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-01-29 22:52:41,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 283. [2018-01-29 22:52:41,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-01-29 22:52:41,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 312 transitions. [2018-01-29 22:52:41,880 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 312 transitions. Word has length 151 [2018-01-29 22:52:41,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 22:52:41,881 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 312 transitions. [2018-01-29 22:52:41,881 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-29 22:52:41,881 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 312 transitions. [2018-01-29 22:52:41,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-01-29 22:52:41,881 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 22:52:41,882 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 22:52:41,882 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-01-29 22:52:41,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1401321400, now seen corresponding path program 1 times [2018-01-29 22:52:41,882 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 22:52:41,882 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 22:52:41,882 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:41,882 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-29 22:52:41,883 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 22:52:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:52:41,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 22:52:42,440 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-01-29 22:52:42,440 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-29 22:52:42,440 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-29 22:52:42,447 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 22:52:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 22:52:42,501 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-29 22:52:42,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:52:42,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:42,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-29 22:52:42,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:42,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:52:42,518 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-29 22:52:42,525 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:52:42,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-01-29 22:52:42,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:42,537 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:52:42,538 INFO L700 Elim1Store]: detected not equals via solver [2018-01-29 22:52:42,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-29 22:52:42,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:42,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:52:42,543 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-01-29 22:52:42,586 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-01-29 22:52:42,588 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-01-29 22:52:42,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:42,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:52:42,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:52:42,594 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-01-29 22:52:42,620 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-01-29 22:52:42,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-29 22:52:42,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-29 22:52:42,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-29 22:52:42,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-29 22:52:42,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 Received shutdown request... [2018-01-29 22:52:45,116 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-29 22:52:45,117 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-29 22:52:45,121 WARN L185 ceAbstractionStarter]: Timeout [2018-01-29 22:52:45,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 10:52:45 BoogieIcfgContainer [2018-01-29 22:52:45,121 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 22:52:45,122 INFO L168 Benchmark]: Toolchain (without parser) took 137460.60 ms. Allocated memory was 307.8 MB in the beginning and 596.1 MB in the end (delta: 288.4 MB). Free memory was 267.8 MB in the beginning and 378.7 MB in the end (delta: -110.9 MB). Peak memory consumption was 177.5 MB. Max. memory is 5.3 GB. [2018-01-29 22:52:45,123 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 307.8 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 22:52:45,123 INFO L168 Benchmark]: CACSL2BoogieTranslator took 214.71 ms. Allocated memory is still 307.8 MB. Free memory was 266.8 MB in the beginning and 255.8 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-29 22:52:45,123 INFO L168 Benchmark]: Boogie Preprocessor took 42.65 ms. Allocated memory is still 307.8 MB. Free memory was 255.8 MB in the beginning and 253.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-29 22:52:45,123 INFO L168 Benchmark]: RCFGBuilder took 442.39 ms. Allocated memory is still 307.8 MB. Free memory was 253.8 MB in the beginning and 223.1 MB in the end (delta: 30.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 5.3 GB. [2018-01-29 22:52:45,124 INFO L168 Benchmark]: TraceAbstraction took 136754.14 ms. Allocated memory was 307.8 MB in the beginning and 596.1 MB in the end (delta: 288.4 MB). Free memory was 223.1 MB in the beginning and 378.7 MB in the end (delta: -155.5 MB). Peak memory consumption was 132.8 MB. Max. memory is 5.3 GB. [2018-01-29 22:52:45,125 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.11 ms. Allocated memory is still 307.8 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 214.71 ms. Allocated memory is still 307.8 MB. Free memory was 266.8 MB in the beginning and 255.8 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.65 ms. Allocated memory is still 307.8 MB. Free memory was 255.8 MB in the beginning and 253.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 442.39 ms. Allocated memory is still 307.8 MB. Free memory was 253.8 MB in the beginning and 223.1 MB in the end (delta: 30.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 136754.14 ms. Allocated memory was 307.8 MB in the beginning and 596.1 MB in the end (delta: 288.4 MB). Free memory was 223.1 MB in the beginning and 378.7 MB in the end (delta: -155.5 MB). Peak memory consumption was 132.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 158 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 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 158 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 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 158 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 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 158 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 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 158 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 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 158 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 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 158 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 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 158 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 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 158 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 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 158 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 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 158 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 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 158 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 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 158 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 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 158 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 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 158 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 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 158 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 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 158 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 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 158 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 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 158 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 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 158 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 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 158 with TraceHistMax 5, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 28 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 150 locations, 21 error locations. TIMEOUT Result, 136.7s OverallTime, 34 OverallIterations, 5 TraceHistogramMax, 97.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4263 SDtfs, 8857 SDslu, 51259 SDs, 0 SdLazy, 23836 SolverSat, 974 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 24.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2515 GetRequests, 1356 SyntacticMatches, 17 SemanticMatches, 1142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17456 ImplicationChecksByTransitivity, 98.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=479occurred in iteration=31, 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.5s AutomataMinimizationTime, 33 MinimizatonAttempts, 1282 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 33.2s InterpolantComputationTime, 3887 NumberOfCodeBlocks, 3821 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 3839 ConstructedInterpolants, 352 QuantifiedInterpolants, 3726074 SizeOfPredicates, 347 NumberOfNonLiveVariables, 4199 ConjunctsInSsa, 856 ConjunctsInUnsatCore, 48 InterpolantComputations, 19 PerfectInterpolantSequences, 542/1095 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_22-52-45-135.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_22-52-45-135.csv Completed graceful shutdown