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_Taipan+AI_EQ_preciseopt.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 02:42:20,396 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 02:42:20,399 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 02:42:20,420 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 02:42:20,420 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 02:42:20,421 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 02:42:20,422 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 02:42:20,425 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 02:42:20,427 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 02:42:20,428 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 02:42:20,429 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 02:42:20,430 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 02:42:20,431 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 02:42:20,432 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 02:42:20,433 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 02:42:20,436 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 02:42:20,438 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 02:42:20,441 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 02:42:20,442 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 02:42:20,443 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 02:42:20,446 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 02:42:20,446 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 02:42:20,447 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 02:42:20,448 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 02:42:20,448 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 02:42:20,450 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 02:42:20,450 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 02:42:20,451 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 02:42:20,452 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 02:42:20,452 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 02:42:20,453 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 02:42:20,453 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf [2018-01-25 02:42:20,471 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 02:42:20,472 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 02:42:20,473 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 02:42:20,473 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 02:42:20,473 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 02:42:20,473 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 02:42:20,473 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 02:42:20,474 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 02:42:20,474 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 02:42:20,475 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 02:42:20,475 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 02:42:20,475 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 02:42:20,475 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 02:42:20,475 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 02:42:20,476 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 02:42:20,476 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 02:42:20,476 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 02:42:20,476 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 02:42:20,476 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 02:42:20,476 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 02:42:20,477 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 02:42:20,477 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 02:42:20,477 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 02:42:20,477 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 02:42:20,477 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 02:42:20,478 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:42:20,478 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 02:42:20,478 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 02:42:20,478 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 02:42:20,478 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 02:42:20,479 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 02:42:20,479 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 02:42:20,479 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 02:42:20,479 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 02:42:20,479 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 02:42:20,480 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 02:42:20,480 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 02:42:20,544 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 02:42:20,560 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 02:42:20,564 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 02:42:20,566 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 02:42:20,566 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 02:42:20,568 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:42:20,766 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 02:42:20,774 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 02:42:20,775 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 02:42:20,775 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 02:42:20,787 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 02:42:20,788 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:42:20" (1/1) ... [2018-01-25 02:42:20,792 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5054e5f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:42:20, skipping insertion in model container [2018-01-25 02:42:20,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:42:20" (1/1) ... [2018-01-25 02:42:20,806 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:42:20,848 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:42:20,982 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:42:21,001 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:42:21,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:42:21 WrapperNode [2018-01-25 02:42:21,010 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 02:42:21,012 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 02:42:21,012 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 02:42:21,012 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 02:42:21,030 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:42:21" (1/1) ... [2018-01-25 02:42:21,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:42:21" (1/1) ... [2018-01-25 02:42:21,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:42:21" (1/1) ... [2018-01-25 02:42:21,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:42:21" (1/1) ... [2018-01-25 02:42:21,044 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:42:21" (1/1) ... [2018-01-25 02:42:21,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:42:21" (1/1) ... [2018-01-25 02:42:21,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:42:21" (1/1) ... [2018-01-25 02:42:21,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 02:42:21,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 02:42:21,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 02:42:21,053 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 02:42:21,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:42:21" (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-25 02:42:21,120 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 02:42:21,120 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 02:42:21,120 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcmp [2018-01-25 02:42:21,120 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 02:42:21,121 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 02:42:21,121 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 02:42:21,121 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 02:42:21,121 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 02:42:21,121 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 02:42:21,121 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 02:42:21,122 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcmp [2018-01-25 02:42:21,122 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 02:42:21,122 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 02:42:21,122 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 02:42:21,380 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 02:42:21,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:42:21 BoogieIcfgContainer [2018-01-25 02:42:21,380 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 02:42:21,381 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 02:42:21,381 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 02:42:21,383 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 02:42:21,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 02:42:20" (1/3) ... [2018-01-25 02:42:21,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d574751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:42:21, skipping insertion in model container [2018-01-25 02:42:21,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:42:21" (2/3) ... [2018-01-25 02:42:21,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d574751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:42:21, skipping insertion in model container [2018-01-25 02:42:21,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:42:21" (3/3) ... [2018-01-25 02:42:21,386 INFO L105 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:42:21,393 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 02:42:21,399 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-25 02:42:21,436 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 02:42:21,437 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 02:42:21,437 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 02:42:21,437 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 02:42:21,437 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 02:42:21,437 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 02:42:21,437 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 02:42:21,437 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 02:42:21,438 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 02:42:21,462 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-01-25 02:42:21,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 02:42:21,470 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:42:21,471 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:42:21,471 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:42:21,477 INFO L82 PathProgramCache]: Analyzing trace with hash 955833556, now seen corresponding path program 1 times [2018-01-25 02:42:21,480 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:42:21,525 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:42:21,526 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:42:21,526 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:42:21,526 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:42:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:42:21,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:42:21,748 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-25 02:42:21,750 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:42:21,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:42:21,751 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:42:21,753 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:42:21,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:42:21,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:42:21,767 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 4 states. [2018-01-25 02:42:22,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:42:22,004 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-01-25 02:42:22,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:42:22,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 02:42:22,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:42:22,018 INFO L225 Difference]: With dead ends: 73 [2018-01-25 02:42:22,018 INFO L226 Difference]: Without dead ends: 49 [2018-01-25 02:42:22,022 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:42:22,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-25 02:42:22,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-25 02:42:22,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 02:42:22,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-01-25 02:42:22,064 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 13 [2018-01-25 02:42:22,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:42:22,064 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-01-25 02:42:22,064 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:42:22,065 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-01-25 02:42:22,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 02:42:22,065 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:42:22,065 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:42:22,065 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:42:22,066 INFO L82 PathProgramCache]: Analyzing trace with hash 955833557, now seen corresponding path program 1 times [2018-01-25 02:42:22,066 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:42:22,067 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:42:22,068 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:42:22,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:42:22,068 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:42:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:42:22,086 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:42:22,272 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-25 02:42:22,272 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:42:22,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:42:22,272 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:42:22,274 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:42:22,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:42:22,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:42:22,275 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 6 states. [2018-01-25 02:42:22,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:42:22,404 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-01-25 02:42:22,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:42:22,404 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-25 02:42:22,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:42:22,406 INFO L225 Difference]: With dead ends: 49 [2018-01-25 02:42:22,406 INFO L226 Difference]: Without dead ends: 48 [2018-01-25 02:42:22,407 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:42:22,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-25 02:42:22,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-25 02:42:22,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-25 02:42:22,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-01-25 02:42:22,414 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 13 [2018-01-25 02:42:22,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:42:22,415 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-01-25 02:42:22,415 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:42:22,415 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2018-01-25 02:42:22,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 02:42:22,416 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:42:22,416 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:42:22,416 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:42:22,417 INFO L82 PathProgramCache]: Analyzing trace with hash -433930803, now seen corresponding path program 1 times [2018-01-25 02:42:22,417 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:42:22,418 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:42:22,418 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:42:22,418 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:42:22,419 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:42:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:42:22,437 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:42:22,534 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-25 02:42:22,535 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:42:22,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:42:22,535 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:42:22,535 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:42:22,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:42:22,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:42:22,536 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 5 states. [2018-01-25 02:42:22,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:42:22,726 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2018-01-25 02:42:22,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:42:22,727 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 02:42:22,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:42:22,728 INFO L225 Difference]: With dead ends: 48 [2018-01-25 02:42:22,729 INFO L226 Difference]: Without dead ends: 47 [2018-01-25 02:42:22,729 INFO L525 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-25 02:42:22,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-25 02:42:22,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-25 02:42:22,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-25 02:42:22,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-01-25 02:42:22,737 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 14 [2018-01-25 02:42:22,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:42:22,737 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-01-25 02:42:22,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:42:22,737 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-01-25 02:42:22,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 02:42:22,738 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:42:22,738 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:42:22,738 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:42:22,739 INFO L82 PathProgramCache]: Analyzing trace with hash -433930804, now seen corresponding path program 1 times [2018-01-25 02:42:22,739 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:42:22,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:42:22,740 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:42:22,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:42:22,741 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:42:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:42:22,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:42:22,786 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-25 02:42:22,786 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:42:22,786 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:42:22,786 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:42:22,787 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:42:22,787 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:42:22,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:42:22,787 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 4 states. [2018-01-25 02:42:22,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:42:22,953 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-01-25 02:42:22,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:42:22,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 02:42:22,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:42:22,955 INFO L225 Difference]: With dead ends: 47 [2018-01-25 02:42:22,955 INFO L226 Difference]: Without dead ends: 46 [2018-01-25 02:42:22,956 INFO L525 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-25 02:42:22,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-25 02:42:22,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-25 02:42:22,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-25 02:42:22,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-01-25 02:42:22,965 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 14 [2018-01-25 02:42:22,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:42:22,966 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-01-25 02:42:22,966 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:42:22,966 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-01-25 02:42:22,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 02:42:22,967 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:42:22,967 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:42:22,968 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:42:22,969 INFO L82 PathProgramCache]: Analyzing trace with hash 2009852195, now seen corresponding path program 1 times [2018-01-25 02:42:22,969 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:42:22,970 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:42:22,970 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:42:22,971 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:42:22,971 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:42:23,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:42:23,001 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:42:23,087 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-25 02:42:23,088 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:42:23,088 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:42:23,088 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:42:23,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:42:23,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:42:23,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:42:23,089 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 5 states. [2018-01-25 02:42:23,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:42:23,239 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-01-25 02:42:23,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:42:23,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-25 02:42:23,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:42:23,241 INFO L225 Difference]: With dead ends: 46 [2018-01-25 02:42:23,241 INFO L226 Difference]: Without dead ends: 44 [2018-01-25 02:42:23,242 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:42:23,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-25 02:42:23,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-01-25 02:42:23,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-25 02:42:23,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-01-25 02:42:23,248 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 18 [2018-01-25 02:42:23,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:42:23,249 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2018-01-25 02:42:23,249 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:42:23,249 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-01-25 02:42:23,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 02:42:23,250 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:42:23,250 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:42:23,250 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:42:23,251 INFO L82 PathProgramCache]: Analyzing trace with hash 2009852196, now seen corresponding path program 1 times [2018-01-25 02:42:23,251 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:42:23,252 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:42:23,252 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:42:23,252 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:42:23,253 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:42:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:42:23,267 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:42:23,362 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-25 02:42:23,362 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:42:23,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 02:42:23,362 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:42:23,363 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 02:42:23,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 02:42:23,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:42:23,363 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 8 states. [2018-01-25 02:42:23,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:42:23,467 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-01-25 02:42:23,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 02:42:23,468 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-25 02:42:23,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:42:23,471 INFO L225 Difference]: With dead ends: 61 [2018-01-25 02:42:23,471 INFO L226 Difference]: Without dead ends: 59 [2018-01-25 02:42:23,472 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-25 02:42:23,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-25 02:42:23,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2018-01-25 02:42:23,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 02:42:23,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-01-25 02:42:23,479 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 18 [2018-01-25 02:42:23,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:42:23,480 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-01-25 02:42:23,480 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 02:42:23,480 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-01-25 02:42:23,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 02:42:23,481 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:42:23,481 INFO L322 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-25 02:42:23,481 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:42:23,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1267324412, now seen corresponding path program 1 times [2018-01-25 02:42:23,482 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:42:23,483 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:42:23,483 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:42:23,483 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:42:23,483 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:42:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:42:23,497 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:42:23,555 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-25 02:42:23,556 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:42:23,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:42:23,556 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:42:23,556 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:42:23,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:42:23,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:42:23,557 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 6 states. [2018-01-25 02:42:23,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:42:23,645 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-01-25 02:42:23,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:42:23,648 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-25 02:42:23,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:42:23,649 INFO L225 Difference]: With dead ends: 50 [2018-01-25 02:42:23,650 INFO L226 Difference]: Without dead ends: 49 [2018-01-25 02:42:23,650 INFO L525 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-25 02:42:23,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-25 02:42:23,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-25 02:42:23,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 02:42:23,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-01-25 02:42:23,656 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 20 [2018-01-25 02:42:23,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:42:23,657 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-01-25 02:42:23,657 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:42:23,657 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-01-25 02:42:23,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 02:42:23,657 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:42:23,658 INFO L322 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-25 02:42:23,658 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:42:23,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1267324411, now seen corresponding path program 1 times [2018-01-25 02:42:23,658 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:42:23,659 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:42:23,659 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:42:23,659 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:42:23,659 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:42:23,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:42:23,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:42:23,811 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-25 02:42:23,811 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:42:23,811 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 02:42:23,811 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:42:23,812 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 02:42:23,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 02:42:23,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-25 02:42:23,812 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 9 states. [2018-01-25 02:42:23,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:42:23,946 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-01-25 02:42:23,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 02:42:23,947 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-01-25 02:42:23,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:42:23,947 INFO L225 Difference]: With dead ends: 50 [2018-01-25 02:42:23,947 INFO L226 Difference]: Without dead ends: 49 [2018-01-25 02:42:23,948 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-25 02:42:23,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-25 02:42:23,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-25 02:42:23,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 02:42:23,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-01-25 02:42:23,952 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 20 [2018-01-25 02:42:23,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:42:23,952 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-01-25 02:42:23,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 02:42:23,952 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-01-25 02:42:23,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 02:42:23,953 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:42:23,953 INFO L322 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] [2018-01-25 02:42:23,953 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:42:23,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1871951781, now seen corresponding path program 1 times [2018-01-25 02:42:23,953 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:42:23,954 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:42:23,954 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:42:23,954 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:42:23,954 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:42:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:42:23,965 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:42:24,008 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-25 02:42:24,008 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:42:24,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:42:24,009 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:42:24,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:42:24,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:42:24,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:42:24,010 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 6 states. [2018-01-25 02:42:24,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:42:24,117 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-01-25 02:42:24,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:42:24,118 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-25 02:42:24,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:42:24,119 INFO L225 Difference]: With dead ends: 49 [2018-01-25 02:42:24,119 INFO L226 Difference]: Without dead ends: 48 [2018-01-25 02:42:24,119 INFO L525 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-25 02:42:24,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-25 02:42:24,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-25 02:42:24,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-25 02:42:24,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-01-25 02:42:24,131 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 22 [2018-01-25 02:42:24,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:42:24,132 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-01-25 02:42:24,132 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:42:24,132 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-01-25 02:42:24,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 02:42:24,133 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:42:24,133 INFO L322 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] [2018-01-25 02:42:24,133 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:42:24,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1871951782, now seen corresponding path program 1 times [2018-01-25 02:42:24,133 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:42:24,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:42:24,135 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:42:24,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:42:24,135 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:42:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:42:24,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:42:24,251 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-25 02:42:24,252 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:42:24,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 02:42:24,252 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:42:24,252 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 02:42:24,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 02:42:24,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:42:24,253 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 8 states. [2018-01-25 02:42:24,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:42:24,436 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-01-25 02:42:24,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 02:42:24,437 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-01-25 02:42:24,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:42:24,438 INFO L225 Difference]: With dead ends: 58 [2018-01-25 02:42:24,438 INFO L226 Difference]: Without dead ends: 57 [2018-01-25 02:42:24,438 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-25 02:42:24,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-25 02:42:24,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2018-01-25 02:42:24,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 02:42:24,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-01-25 02:42:24,445 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 22 [2018-01-25 02:42:24,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:42:24,445 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-01-25 02:42:24,445 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 02:42:24,445 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-01-25 02:42:24,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 02:42:24,446 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:42:24,446 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:42:24,447 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:42:24,447 INFO L82 PathProgramCache]: Analyzing trace with hash -645685358, now seen corresponding path program 1 times [2018-01-25 02:42:24,447 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:42:24,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:42:24,448 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:42:24,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:42:24,448 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:42:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:42:24,459 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:42:24,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:42:24,518 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:42:24,549 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:42:24,550 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:42:24,550 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:42:24,550 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:42:24,550 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:42:24,550 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 6 states. [2018-01-25 02:42:24,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:42:24,636 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-01-25 02:42:24,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:42:24,637 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-25 02:42:24,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:42:24,637 INFO L225 Difference]: With dead ends: 49 [2018-01-25 02:42:24,637 INFO L226 Difference]: Without dead ends: 48 [2018-01-25 02:42:24,638 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-25 02:42:24,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-25 02:42:24,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-25 02:42:24,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-25 02:42:24,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-01-25 02:42:24,644 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 24 [2018-01-25 02:42:24,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:42:24,644 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-01-25 02:42:24,644 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:42:24,644 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-01-25 02:42:24,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 02:42:24,645 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:42:24,645 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:42:24,645 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:42:24,646 INFO L82 PathProgramCache]: Analyzing trace with hash -645685357, now seen corresponding path program 1 times [2018-01-25 02:42:24,646 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:42:24,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:42:24,646 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:42:24,647 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:42:24,647 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:42:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:42:24,656 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:42:24,967 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-25 02:42:24,967 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:42:24,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 02:42:24,967 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:42:24,967 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 02:42:24,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 02:42:24,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-25 02:42:24,968 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 9 states. [2018-01-25 02:42:25,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:42:25,157 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-01-25 02:42:25,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 02:42:25,158 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-01-25 02:42:25,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:42:25,158 INFO L225 Difference]: With dead ends: 58 [2018-01-25 02:42:25,158 INFO L226 Difference]: Without dead ends: 57 [2018-01-25 02:42:25,159 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-01-25 02:42:25,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-25 02:42:25,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2018-01-25 02:42:25,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 02:42:25,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-01-25 02:42:25,171 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 24 [2018-01-25 02:42:25,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:42:25,171 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-01-25 02:42:25,171 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 02:42:25,171 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-01-25 02:42:25,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 02:42:25,172 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:42:25,172 INFO L322 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] [2018-01-25 02:42:25,172 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:42:25,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1460131898, now seen corresponding path program 1 times [2018-01-25 02:42:25,173 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:42:25,173 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:42:25,174 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:42:25,174 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:42:25,174 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:42:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:42:25,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:42:25,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:42:25,405 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:42:25,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-25 02:42:25,405 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:42:25,405 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 02:42:25,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 02:42:25,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-25 02:42:25,406 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 12 states. [2018-01-25 02:42:25,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:42:25,669 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2018-01-25 02:42:25,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-25 02:42:25,669 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-01-25 02:42:25,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:42:25,670 INFO L225 Difference]: With dead ends: 106 [2018-01-25 02:42:25,670 INFO L226 Difference]: Without dead ends: 81 [2018-01-25 02:42:25,671 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-01-25 02:42:25,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-25 02:42:25,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2018-01-25 02:42:25,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-01-25 02:42:25,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-01-25 02:42:25,677 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 25 [2018-01-25 02:42:25,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:42:25,677 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-01-25 02:42:25,677 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-25 02:42:25,677 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-01-25 02:42:25,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-25 02:42:25,678 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:42:25,679 INFO L322 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] [2018-01-25 02:42:25,679 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:42:25,679 INFO L82 PathProgramCache]: Analyzing trace with hash -228811844, now seen corresponding path program 1 times [2018-01-25 02:42:25,679 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:42:25,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:42:25,680 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:42:25,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:42:25,681 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:42:25,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:42:25,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:42:25,891 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-25 02:42:25,892 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:42:25,892 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:42:25,893 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-01-25 02:42:25,894 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [10], [11], [12], [19], [20], [26], [42], [47], [51], [55], [56], [57], [58], [59], [62], [73], [74], [75], [77] [2018-01-25 02:42:25,941 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:42:25,941 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 02:43:21,364 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 02:43:21,365 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 02:43:21,367 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 02:43:21,367 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:43:21,367 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-25 02:43:21,374 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:43:21,374 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:43:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:43:21,425 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:43:21,466 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 02:43:21,466 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 02:43:21,471 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 02:43:21,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 02:43:21 BoogieIcfgContainer [2018-01-25 02:43:21,472 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 02:43:21,473 INFO L168 Benchmark]: Toolchain (without parser) took 60705.94 ms. Allocated memory was 298.8 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 258.8 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 725.9 MB. Max. memory is 5.3 GB. [2018-01-25 02:43:21,474 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 298.8 MB. Free memory is still 264.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 02:43:21,474 INFO L168 Benchmark]: CACSL2BoogieTranslator took 236.13 ms. Allocated memory is still 298.8 MB. Free memory was 257.8 MB in the beginning and 247.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-25 02:43:21,474 INFO L168 Benchmark]: Boogie Preprocessor took 40.53 ms. Allocated memory is still 298.8 MB. Free memory was 247.6 MB in the beginning and 245.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:43:21,475 INFO L168 Benchmark]: RCFGBuilder took 328.03 ms. Allocated memory is still 298.8 MB. Free memory was 245.6 MB in the beginning and 227.5 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 5.3 GB. [2018-01-25 02:43:21,475 INFO L168 Benchmark]: TraceAbstraction took 60090.40 ms. Allocated memory was 298.8 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 226.5 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 693.7 MB. Max. memory is 5.3 GB. [2018-01-25 02:43:21,477 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.25 ms. Allocated memory is still 298.8 MB. Free memory is still 264.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 236.13 ms. Allocated memory is still 298.8 MB. Free memory was 257.8 MB in the beginning and 247.6 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.53 ms. Allocated memory is still 298.8 MB. Free memory was 247.6 MB in the beginning and 245.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 328.03 ms. Allocated memory is still 298.8 MB. Free memory was 245.6 MB in the beginning and 227.5 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 60090.40 ms. Allocated memory was 298.8 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 226.5 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 693.7 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 543). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 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 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 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 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 26 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 53 locations, 15 error locations. TIMEOUT Result, 60.0s OverallTime, 14 OverallIterations, 2 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 466 SDtfs, 517 SDslu, 1262 SDs, 0 SdLazy, 947 SolverSat, 73 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 55.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 33 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 247 NumberOfCodeBlocks, 247 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 234 ConstructedInterpolants, 0 QuantifiedInterpolants, 18020 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: 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_cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_02-43-21-485.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_02-43-21-485.csv Completed graceful shutdown