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/cstrcmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 02:33:09,819 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 02:33:09,821 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 02:33:09,837 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 02:33:09,837 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 02:33:09,839 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 02:33:09,840 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 02:33:09,841 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 02:33:09,843 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 02:33:09,843 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 02:33:09,844 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 02:33:09,844 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 02:33:09,845 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 02:33:09,846 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 02:33:09,847 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 02:33:09,850 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 02:33:09,852 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 02:33:09,855 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 02:33:09,856 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 02:33:09,858 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 02:33:09,860 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 02:33:09,860 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 02:33:09,861 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 02:33:09,862 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 02:33:09,863 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 02:33:09,864 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 02:33:09,865 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 02:33:09,865 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 02:33:09,866 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 02:33:09,866 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 02:33:09,867 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 02:33:09,867 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:33:09,877 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 02:33:09,878 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 02:33:09,879 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 02:33:09,879 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 02:33:09,879 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 02:33:09,879 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 02:33:09,879 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 02:33:09,880 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 02:33:09,880 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 02:33:09,880 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 02:33:09,881 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 02:33:09,881 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 02:33:09,881 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 02:33:09,881 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 02:33:09,881 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 02:33:09,882 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 02:33:09,882 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 02:33:09,882 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 02:33:09,882 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 02:33:09,882 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 02:33:09,883 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 02:33:09,883 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 02:33:09,883 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 02:33:09,883 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 02:33:09,883 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 02:33:09,883 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:33:09,884 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 02:33:09,884 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 02:33:09,884 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 02:33:09,884 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 02:33:09,884 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 02:33:09,885 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 02:33:09,885 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 02:33:09,885 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 02:33:09,885 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 02:33:09,886 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 02:33:09,886 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 02:33:09,932 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 02:33:09,942 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 02:33:09,945 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 02:33:09,947 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 02:33:09,947 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 02:33:09,947 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:33:10,122 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 02:33:10,129 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 02:33:10,130 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 02:33:10,130 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 02:33:10,138 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 02:33:10,139 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:33:10" (1/1) ... [2018-01-25 02:33:10,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e47ad9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:33:10, skipping insertion in model container [2018-01-25 02:33:10,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:33:10" (1/1) ... [2018-01-25 02:33:10,161 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:33:10,201 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:33:10,323 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:33:10,347 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:33:10,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:33:10 WrapperNode [2018-01-25 02:33:10,356 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 02:33:10,356 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 02:33:10,357 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 02:33:10,357 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 02:33:10,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:33:10" (1/1) ... [2018-01-25 02:33:10,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:33:10" (1/1) ... [2018-01-25 02:33:10,378 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:33:10" (1/1) ... [2018-01-25 02:33:10,378 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:33:10" (1/1) ... [2018-01-25 02:33:10,381 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:33:10" (1/1) ... [2018-01-25 02:33:10,384 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:33:10" (1/1) ... [2018-01-25 02:33:10,386 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:33:10" (1/1) ... [2018-01-25 02:33:10,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 02:33:10,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 02:33:10,388 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 02:33:10,388 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 02:33:10,389 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:33:10" (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:33:10,439 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 02:33:10,439 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 02:33:10,439 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcmp [2018-01-25 02:33:10,439 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 02:33:10,439 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 02:33:10,440 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 02:33:10,440 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 02:33:10,440 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 02:33:10,440 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 02:33:10,440 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 02:33:10,440 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcmp [2018-01-25 02:33:10,440 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 02:33:10,440 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 02:33:10,440 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 02:33:10,673 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 02:33:10,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:33:10 BoogieIcfgContainer [2018-01-25 02:33:10,674 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 02:33:10,675 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 02:33:10,675 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 02:33:10,677 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 02:33:10,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 02:33:10" (1/3) ... [2018-01-25 02:33:10,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@415a85ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:33:10, skipping insertion in model container [2018-01-25 02:33:10,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:33:10" (2/3) ... [2018-01-25 02:33:10,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@415a85ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:33:10, skipping insertion in model container [2018-01-25 02:33:10,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:33:10" (3/3) ... [2018-01-25 02:33:10,681 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:33:10,689 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 02:33:10,695 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-25 02:33:10,733 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 02:33:10,734 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 02:33:10,734 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 02:33:10,734 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 02:33:10,734 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 02:33:10,734 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 02:33:10,735 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 02:33:10,735 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 02:33:10,736 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 02:33:10,760 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-01-25 02:33:10,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 02:33:10,769 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:33:10,770 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:33:10,770 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:33:10,776 INFO L82 PathProgramCache]: Analyzing trace with hash 286131230, now seen corresponding path program 1 times [2018-01-25 02:33:10,779 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:33:10,832 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:10,832 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:33:10,833 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:10,833 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:33:10,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:33:10,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:33:11,124 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:33:11,126 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:33:11,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:33:11,127 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:33:11,130 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:33:11,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:33:11,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:33:11,224 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 4 states. [2018-01-25 02:33:11,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:33:11,470 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-01-25 02:33:11,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:33:11,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 02:33:11,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:33:11,482 INFO L225 Difference]: With dead ends: 78 [2018-01-25 02:33:11,482 INFO L226 Difference]: Without dead ends: 52 [2018-01-25 02:33:11,486 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:33:11,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-25 02:33:11,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-25 02:33:11,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-25 02:33:11,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-01-25 02:33:11,522 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 13 [2018-01-25 02:33:11,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:33:11,526 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-01-25 02:33:11,526 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:33:11,526 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-01-25 02:33:11,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 02:33:11,527 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:33:11,527 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:33:11,527 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:33:11,527 INFO L82 PathProgramCache]: Analyzing trace with hash 286131231, now seen corresponding path program 1 times [2018-01-25 02:33:11,527 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:33:11,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:11,529 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:33:11,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:11,530 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:33:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:33:11,548 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:33:11,696 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:33:11,696 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:33:11,696 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:33:11,696 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:33:11,698 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:33:11,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:33:11,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:33:11,699 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states. [2018-01-25 02:33:11,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:33:11,805 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-01-25 02:33:11,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:33:11,806 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-25 02:33:11,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:33:11,807 INFO L225 Difference]: With dead ends: 52 [2018-01-25 02:33:11,808 INFO L226 Difference]: Without dead ends: 51 [2018-01-25 02:33:11,809 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:33:11,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-25 02:33:11,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-25 02:33:11,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-25 02:33:11,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-01-25 02:33:11,816 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 13 [2018-01-25 02:33:11,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:33:11,817 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-01-25 02:33:11,817 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:33:11,817 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-01-25 02:33:11,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 02:33:11,818 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:33:11,818 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:33:11,818 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:33:11,818 INFO L82 PathProgramCache]: Analyzing trace with hash 280133580, now seen corresponding path program 1 times [2018-01-25 02:33:11,818 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:33:11,819 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:11,820 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:33:11,820 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:11,820 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:33:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:33:11,833 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:33:11,862 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:33:11,863 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:33:11,863 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:33:11,863 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:33:11,863 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:33:11,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:33:11,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:33:11,864 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 4 states. [2018-01-25 02:33:11,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:33:11,935 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-01-25 02:33:11,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 02:33:11,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 02:33:11,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:33:11,937 INFO L225 Difference]: With dead ends: 51 [2018-01-25 02:33:11,937 INFO L226 Difference]: Without dead ends: 50 [2018-01-25 02:33:11,937 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:33:11,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-25 02:33:11,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-25 02:33:11,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 02:33:11,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-01-25 02:33:11,944 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 14 [2018-01-25 02:33:11,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:33:11,945 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-01-25 02:33:11,945 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:33:11,945 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-01-25 02:33:11,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 02:33:11,945 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:33:11,946 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:33:11,946 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:33:11,946 INFO L82 PathProgramCache]: Analyzing trace with hash 280133581, now seen corresponding path program 1 times [2018-01-25 02:33:11,946 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:33:11,947 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:11,947 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:33:11,948 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:11,948 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:33:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:33:11,962 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:33:12,033 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:33:12,033 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:33:12,034 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:33:12,034 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:33:12,034 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:33:12,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:33:12,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:33:12,035 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2018-01-25 02:33:12,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:33:12,074 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-01-25 02:33:12,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:33:12,074 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 02:33:12,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:33:12,075 INFO L225 Difference]: With dead ends: 50 [2018-01-25 02:33:12,075 INFO L226 Difference]: Without dead ends: 49 [2018-01-25 02:33:12,075 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:33:12,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-25 02:33:12,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-25 02:33:12,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 02:33:12,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-01-25 02:33:12,080 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 14 [2018-01-25 02:33:12,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:33:12,080 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-01-25 02:33:12,080 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:33:12,081 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-01-25 02:33:12,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 02:33:12,081 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:33:12,081 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:33:12,081 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:33:12,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1890531033, now seen corresponding path program 1 times [2018-01-25 02:33:12,081 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:33:12,082 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:12,082 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:33:12,083 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:12,083 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:33:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:33:12,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:33:12,137 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:33:12,138 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:33:12,138 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:33:12,138 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:33:12,139 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:33:12,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:33:12,139 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:33:12,139 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 5 states. [2018-01-25 02:33:12,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:33:12,237 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-01-25 02:33:12,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:33:12,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-25 02:33:12,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:33:12,239 INFO L225 Difference]: With dead ends: 49 [2018-01-25 02:33:12,239 INFO L226 Difference]: Without dead ends: 46 [2018-01-25 02:33:12,239 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:33:12,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-25 02:33:12,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-25 02:33:12,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-25 02:33:12,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-01-25 02:33:12,246 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 18 [2018-01-25 02:33:12,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:33:12,247 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-01-25 02:33:12,247 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:33:12,247 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-01-25 02:33:12,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 02:33:12,248 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:33:12,248 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:33:12,248 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:33:12,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1890531034, now seen corresponding path program 1 times [2018-01-25 02:33:12,249 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:33:12,250 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:12,250 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:33:12,250 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:12,251 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:33:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:33:12,266 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:33:12,380 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:33:12,381 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:33:12,381 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 02:33:12,381 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:33:12,382 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 02:33:12,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 02:33:12,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:33:12,383 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 8 states. [2018-01-25 02:33:12,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:33:12,502 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2018-01-25 02:33:12,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 02:33:12,503 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-25 02:33:12,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:33:12,507 INFO L225 Difference]: With dead ends: 69 [2018-01-25 02:33:12,507 INFO L226 Difference]: Without dead ends: 66 [2018-01-25 02:33:12,507 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-25 02:33:12,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-25 02:33:12,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2018-01-25 02:33:12,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-25 02:33:12,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-01-25 02:33:12,515 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 18 [2018-01-25 02:33:12,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:33:12,515 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-01-25 02:33:12,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 02:33:12,516 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-01-25 02:33:12,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 02:33:12,516 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:33:12,517 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:33:12,517 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:33:12,517 INFO L82 PathProgramCache]: Analyzing trace with hash -2045951649, now seen corresponding path program 1 times [2018-01-25 02:33:12,517 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:33:12,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:12,518 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:33:12,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:12,518 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:33:12,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:33:12,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:33:12,570 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:33:12,571 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:33:12,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 02:33:12,571 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:33:12,571 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:33:12,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:33:12,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:33:12,572 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 5 states. [2018-01-25 02:33:12,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:33:12,653 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-01-25 02:33:12,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:33:12,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-25 02:33:12,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:33:12,656 INFO L225 Difference]: With dead ends: 55 [2018-01-25 02:33:12,656 INFO L226 Difference]: Without dead ends: 53 [2018-01-25 02:33:12,657 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:33:12,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-25 02:33:12,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-25 02:33:12,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-25 02:33:12,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-01-25 02:33:12,664 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 22 [2018-01-25 02:33:12,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:33:12,664 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-01-25 02:33:12,664 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:33:12,664 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-01-25 02:33:12,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 02:33:12,665 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:33:12,665 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:33:12,665 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:33:12,665 INFO L82 PathProgramCache]: Analyzing trace with hash -2045951648, now seen corresponding path program 1 times [2018-01-25 02:33:12,666 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:33:12,666 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:12,667 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:33:12,667 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:12,667 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:33:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:33:12,679 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:33:12,827 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:33:12,827 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:33:12,828 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 02:33:12,828 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:33:12,828 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 02:33:12,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 02:33:12,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:33:12,829 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 8 states. [2018-01-25 02:33:13,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:33:13,003 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2018-01-25 02:33:13,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 02:33:13,004 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-01-25 02:33:13,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:33:13,005 INFO L225 Difference]: With dead ends: 62 [2018-01-25 02:33:13,005 INFO L226 Difference]: Without dead ends: 60 [2018-01-25 02:33:13,006 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-25 02:33:13,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-25 02:33:13,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2018-01-25 02:33:13,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-25 02:33:13,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-01-25 02:33:13,014 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 22 [2018-01-25 02:33:13,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:33:13,014 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-01-25 02:33:13,014 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 02:33:13,015 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-01-25 02:33:13,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 02:33:13,015 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:33:13,015 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] [2018-01-25 02:33:13,016 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:33:13,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1000289501, now seen corresponding path program 1 times [2018-01-25 02:33:13,016 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:33:13,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:13,017 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:33:13,017 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:13,017 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:33:13,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:33:13,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:33:13,048 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:33:13,048 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:33:13,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:33:13,049 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:33:13,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 02:33:13,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 02:33:13,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 02:33:13,050 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 3 states. [2018-01-25 02:33:13,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:33:13,077 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-01-25 02:33:13,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 02:33:13,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-01-25 02:33:13,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:33:13,079 INFO L225 Difference]: With dead ends: 85 [2018-01-25 02:33:13,079 INFO L226 Difference]: Without dead ends: 57 [2018-01-25 02:33:13,080 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 02:33:13,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-25 02:33:13,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-25 02:33:13,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-25 02:33:13,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2018-01-25 02:33:13,086 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 23 [2018-01-25 02:33:13,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:33:13,087 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-01-25 02:33:13,087 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 02:33:13,087 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2018-01-25 02:33:13,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 02:33:13,088 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:33:13,088 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, 1] [2018-01-25 02:33:13,088 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:33:13,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1354456010, now seen corresponding path program 1 times [2018-01-25 02:33:13,088 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:33:13,089 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:13,089 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:33:13,089 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:13,089 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:33:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:33:13,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:33:13,342 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:33:13,343 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:33:13,343 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-25 02:33:13,343 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:33:13,343 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 02:33:13,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 02:33:13,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-01-25 02:33:13,343 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 12 states. [2018-01-25 02:33:13,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:33:13,757 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2018-01-25 02:33:13,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 02:33:13,758 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-01-25 02:33:13,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:33:13,759 INFO L225 Difference]: With dead ends: 122 [2018-01-25 02:33:13,759 INFO L226 Difference]: Without dead ends: 86 [2018-01-25 02:33:13,760 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-01-25 02:33:13,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-25 02:33:13,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2018-01-25 02:33:13,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-25 02:33:13,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2018-01-25 02:33:13,771 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 26 [2018-01-25 02:33:13,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:33:13,771 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2018-01-25 02:33:13,771 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-25 02:33:13,772 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2018-01-25 02:33:13,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 02:33:13,773 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:33:13,773 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, 1] [2018-01-25 02:33:13,773 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-25 02:33:13,773 INFO L82 PathProgramCache]: Analyzing trace with hash 536807560, now seen corresponding path program 1 times [2018-01-25 02:33:13,774 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:33:13,775 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:13,775 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:33:13,775 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:33:13,775 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:33:13,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:33:13,794 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:33:14,051 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:33:14,052 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:33:14,052 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:33:14,053 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-01-25 02:33:14,054 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [10], [11], [14], [15], [18], [21], [29], [52], [57], [61], [65], [66], [67], [68], [69], [72], [83], [84], [85], [87] [2018-01-25 02:33:14,098 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:33:14,099 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 02:34:16,423 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 02:34:16,424 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 02:34:16,425 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:34:16,425 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:34:16,425 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:34:16,431 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:34:16,431 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:34:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:34:16,484 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:34:16,510 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 02:34:16,510 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 02:34:16,514 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 02:34:16,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 02:34:16 BoogieIcfgContainer [2018-01-25 02:34:16,515 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 02:34:16,516 INFO L168 Benchmark]: Toolchain (without parser) took 66392.97 ms. Allocated memory was 302.5 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 260.8 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 652.1 MB. Max. memory is 5.3 GB. [2018-01-25 02:34:16,517 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 302.5 MB. Free memory is still 266.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 02:34:16,517 INFO L168 Benchmark]: CACSL2BoogieTranslator took 226.27 ms. Allocated memory is still 302.5 MB. Free memory was 259.8 MB in the beginning and 249.5 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 5.3 GB. [2018-01-25 02:34:16,517 INFO L168 Benchmark]: Boogie Preprocessor took 30.96 ms. Allocated memory is still 302.5 MB. Free memory was 249.5 MB in the beginning and 247.5 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:34:16,517 INFO L168 Benchmark]: RCFGBuilder took 286.42 ms. Allocated memory is still 302.5 MB. Free memory was 247.5 MB in the beginning and 229.0 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. [2018-01-25 02:34:16,517 INFO L168 Benchmark]: TraceAbstraction took 65840.16 ms. Allocated memory was 302.5 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 229.0 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 620.2 MB. Max. memory is 5.3 GB. [2018-01-25 02:34:16,519 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.15 ms. Allocated memory is still 302.5 MB. Free memory is still 266.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 226.27 ms. Allocated memory is still 302.5 MB. Free memory was 259.8 MB in the beginning and 249.5 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.96 ms. Allocated memory is still 302.5 MB. Free memory was 249.5 MB in the beginning and 247.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 286.42 ms. Allocated memory is still 302.5 MB. Free memory was 247.5 MB in the beginning and 229.0 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 65840.16 ms. Allocated memory was 302.5 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 229.0 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 620.2 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 27 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 14 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 27 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 14 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 27 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 14 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was analyzing trace of length 27 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 14 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 27 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 14 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was analyzing trace of length 27 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 14 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 27 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 14 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 27 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 14 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 27 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 14 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 27 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 14 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 563). Cancelled while BasicCegarLoop was analyzing trace of length 27 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 14 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 562). Cancelled while BasicCegarLoop was analyzing trace of length 27 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 14 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 563). Cancelled while BasicCegarLoop was analyzing trace of length 27 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 14 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 562). Cancelled while BasicCegarLoop was analyzing trace of length 27 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 14 known predicates. - TimeoutResultAtElement [Line: 551]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 551). Cancelled while BasicCegarLoop was analyzing trace of length 27 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 14 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 56 locations, 15 error locations. TIMEOUT Result, 65.7s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 411 SDtfs, 405 SDslu, 723 SDs, 0 SdLazy, 506 SolverSat, 69 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 62.3s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 23 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 183 NumberOfCodeBlocks, 183 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 173 ConstructedInterpolants, 0 QuantifiedInterpolants, 12817 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 4/4 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/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-34-16-529.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/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-34-16-529.csv Completed graceful shutdown