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_mostprecise.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 19:48:26,214 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 19:48:26,215 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 19:48:26,230 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 19:48:26,231 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 19:48:26,232 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 19:48:26,233 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 19:48:26,235 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 19:48:26,237 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 19:48:26,238 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 19:48:26,239 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 19:48:26,239 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 19:48:26,240 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 19:48:26,241 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 19:48:26,242 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 19:48:26,245 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 19:48:26,247 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 19:48:26,249 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 19:48:26,250 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 19:48:26,252 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 19:48:26,254 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 19:48:26,254 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 19:48:26,254 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 19:48:26,255 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 19:48:26,256 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 19:48:26,258 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 19:48:26,258 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 19:48:26,259 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 19:48:26,259 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 19:48:26,259 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 19:48:26,259 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 19:48:26,260 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_mostprecise.epf [2018-01-24 19:48:26,268 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 19:48:26,269 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 19:48:26,269 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 19:48:26,269 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 19:48:26,269 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 19:48:26,269 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 19:48:26,270 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 19:48:26,270 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-24 19:48:26,270 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 19:48:26,270 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 19:48:26,270 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 19:48:26,270 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 19:48:26,271 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 19:48:26,271 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 19:48:26,271 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 19:48:26,271 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 19:48:26,271 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 19:48:26,271 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 19:48:26,271 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 19:48:26,272 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 19:48:26,272 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 19:48:26,272 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 19:48:26,272 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 19:48:26,272 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 19:48:26,272 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 19:48:26,273 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 19:48:26,273 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 19:48:26,273 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 19:48:26,273 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 19:48:26,273 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 19:48:26,273 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 19:48:26,274 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 19:48:26,274 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 19:48:26,274 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 19:48:26,274 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 19:48:26,275 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 19:48:26,275 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 19:48:26,307 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 19:48:26,318 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 19:48:26,321 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 19:48:26,322 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 19:48:26,323 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 19:48:26,323 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-01-24 19:48:26,482 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 19:48:26,487 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 19:48:26,488 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 19:48:26,488 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 19:48:26,493 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 19:48:26,494 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 07:48:26" (1/1) ... [2018-01-24 19:48:26,497 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d8c01df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:48:26, skipping insertion in model container [2018-01-24 19:48:26,497 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 07:48:26" (1/1) ... [2018-01-24 19:48:26,511 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 19:48:26,550 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 19:48:26,672 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 19:48:26,693 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 19:48:26,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:48:26 WrapperNode [2018-01-24 19:48:26,701 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 19:48:26,702 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 19:48:26,702 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 19:48:26,702 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 19:48:26,715 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:48:26" (1/1) ... [2018-01-24 19:48:26,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:48:26" (1/1) ... [2018-01-24 19:48:26,724 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:48:26" (1/1) ... [2018-01-24 19:48:26,724 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:48:26" (1/1) ... [2018-01-24 19:48:26,729 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:48:26" (1/1) ... [2018-01-24 19:48:26,732 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:48:26" (1/1) ... [2018-01-24 19:48:26,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:48:26" (1/1) ... [2018-01-24 19:48:26,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 19:48:26,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 19:48:26,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 19:48:26,737 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 19:48:26,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:48:26" (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-24 19:48:26,787 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 19:48:26,787 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 19:48:26,787 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrspn [2018-01-24 19:48:26,787 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 19:48:26,788 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 19:48:26,788 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 19:48:26,788 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 19:48:26,788 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 19:48:26,788 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 19:48:26,788 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 19:48:26,789 INFO L128 BoogieDeclarations]: Found specification of procedure cstrspn [2018-01-24 19:48:26,789 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 19:48:26,789 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 19:48:26,789 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 19:48:27,028 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 19:48:27,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 07:48:27 BoogieIcfgContainer [2018-01-24 19:48:27,029 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 19:48:27,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 19:48:27,030 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 19:48:27,031 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 19:48:27,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 07:48:26" (1/3) ... [2018-01-24 19:48:27,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e4af9d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 07:48:27, skipping insertion in model container [2018-01-24 19:48:27,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 07:48:26" (2/3) ... [2018-01-24 19:48:27,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e4af9d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 07:48:27, skipping insertion in model container [2018-01-24 19:48:27,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 07:48:27" (3/3) ... [2018-01-24 19:48:27,035 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-01-24 19:48:27,042 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 19:48:27,050 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-24 19:48:27,095 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 19:48:27,095 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 19:48:27,095 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 19:48:27,096 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 19:48:27,096 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 19:48:27,096 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 19:48:27,096 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 19:48:27,096 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 19:48:27,097 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 19:48:27,119 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-01-24 19:48:27,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 19:48:27,126 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:48:27,127 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:48:27,128 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-01-24 19:48:27,132 INFO L82 PathProgramCache]: Analyzing trace with hash 380982983, now seen corresponding path program 1 times [2018-01-24 19:48:27,134 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:48:27,175 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:48:27,175 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:48:27,175 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:48:27,175 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:48:27,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:48:27,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:48:27,360 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-24 19:48:27,363 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:48:27,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 19:48:27,363 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:48:27,366 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 19:48:27,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 19:48:27,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 19:48:27,445 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 4 states. [2018-01-24 19:48:27,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:48:27,611 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2018-01-24 19:48:27,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 19:48:27,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 19:48:27,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:48:27,620 INFO L225 Difference]: With dead ends: 96 [2018-01-24 19:48:27,620 INFO L226 Difference]: Without dead ends: 54 [2018-01-24 19:48:27,624 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 19:48:27,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-24 19:48:27,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-24 19:48:27,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 19:48:27,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-01-24 19:48:27,658 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 13 [2018-01-24 19:48:27,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:48:27,659 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-01-24 19:48:27,659 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 19:48:27,659 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-01-24 19:48:27,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 19:48:27,659 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:48:27,660 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:48:27,660 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-01-24 19:48:27,660 INFO L82 PathProgramCache]: Analyzing trace with hash 380982984, now seen corresponding path program 1 times [2018-01-24 19:48:27,660 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:48:27,661 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:48:27,662 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:48:27,662 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:48:27,662 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:48:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:48:27,682 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:48:27,854 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-24 19:48:27,855 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:48:27,855 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 19:48:27,855 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:48:27,857 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 19:48:27,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 19:48:27,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 19:48:27,858 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 6 states. [2018-01-24 19:48:27,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:48:27,963 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-01-24 19:48:27,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 19:48:27,964 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-24 19:48:27,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:48:27,965 INFO L225 Difference]: With dead ends: 54 [2018-01-24 19:48:27,965 INFO L226 Difference]: Without dead ends: 53 [2018-01-24 19:48:27,966 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-24 19:48:27,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-24 19:48:27,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-24 19:48:27,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 19:48:27,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-01-24 19:48:27,974 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 13 [2018-01-24 19:48:27,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:48:27,974 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-01-24 19:48:27,974 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 19:48:27,974 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-01-24 19:48:27,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 19:48:27,975 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:48:27,975 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:48:27,975 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-01-24 19:48:27,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1074429420, now seen corresponding path program 1 times [2018-01-24 19:48:27,975 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:48:27,976 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:48:27,976 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:48:27,977 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:48:27,977 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:48:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:48:27,990 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:48:28,013 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-24 19:48:28,014 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:48:28,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 19:48:28,014 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:48:28,014 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 19:48:28,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 19:48:28,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 19:48:28,015 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 4 states. [2018-01-24 19:48:28,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:48:28,118 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-01-24 19:48:28,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 19:48:28,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 19:48:28,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:48:28,120 INFO L225 Difference]: With dead ends: 53 [2018-01-24 19:48:28,120 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 19:48:28,120 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-24 19:48:28,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 19:48:28,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-24 19:48:28,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 19:48:28,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-01-24 19:48:28,127 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 14 [2018-01-24 19:48:28,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:48:28,128 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-01-24 19:48:28,128 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 19:48:28,128 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-01-24 19:48:28,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 19:48:28,129 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:48:28,129 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 19:48:28,129 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-01-24 19:48:28,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1074429419, now seen corresponding path program 1 times [2018-01-24 19:48:28,129 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:48:28,130 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:48:28,130 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:48:28,131 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:48:28,131 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:48:28,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:48:28,144 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:48:28,213 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-24 19:48:28,213 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:48:28,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 19:48:28,213 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:48:28,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 19:48:28,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 19:48:28,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 19:48:28,214 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-01-24 19:48:28,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:48:28,285 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-01-24 19:48:28,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 19:48:28,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 19:48:28,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:48:28,287 INFO L225 Difference]: With dead ends: 52 [2018-01-24 19:48:28,287 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 19:48:28,287 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-24 19:48:28,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 19:48:28,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-24 19:48:28,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 19:48:28,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-01-24 19:48:28,294 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 14 [2018-01-24 19:48:28,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:48:28,294 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-01-24 19:48:28,294 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 19:48:28,294 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-01-24 19:48:28,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 19:48:28,295 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:48:28,295 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-24 19:48:28,295 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-01-24 19:48:28,295 INFO L82 PathProgramCache]: Analyzing trace with hash -425895657, now seen corresponding path program 1 times [2018-01-24 19:48:28,295 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:48:28,296 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:48:28,296 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:48:28,297 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:48:28,297 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:48:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:48:28,310 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:48:28,352 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-24 19:48:28,353 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:48:28,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 19:48:28,353 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:48:28,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 19:48:28,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 19:48:28,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 19:48:28,354 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 5 states. [2018-01-24 19:48:28,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:48:28,440 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-01-24 19:48:28,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 19:48:28,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 19:48:28,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:48:28,441 INFO L225 Difference]: With dead ends: 51 [2018-01-24 19:48:28,441 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 19:48:28,442 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-24 19:48:28,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 19:48:28,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-24 19:48:28,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 19:48:28,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-01-24 19:48:28,449 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 18 [2018-01-24 19:48:28,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:48:28,449 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-01-24 19:48:28,449 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 19:48:28,449 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-01-24 19:48:28,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 19:48:28,450 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:48:28,450 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-24 19:48:28,451 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-01-24 19:48:28,451 INFO L82 PathProgramCache]: Analyzing trace with hash -425895656, now seen corresponding path program 1 times [2018-01-24 19:48:28,451 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:48:28,452 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:48:28,452 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:48:28,452 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:48:28,452 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:48:28,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:48:28,467 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:48:28,560 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-24 19:48:28,560 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:48:28,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 19:48:28,560 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:48:28,561 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 19:48:28,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 19:48:28,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 19:48:28,561 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 8 states. [2018-01-24 19:48:28,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:48:28,671 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2018-01-24 19:48:28,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 19:48:28,671 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-24 19:48:28,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:48:28,675 INFO L225 Difference]: With dead ends: 75 [2018-01-24 19:48:28,675 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 19:48:28,675 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-24 19:48:28,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 19:48:28,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2018-01-24 19:48:28,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 19:48:28,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-01-24 19:48:28,683 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 18 [2018-01-24 19:48:28,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:48:28,683 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-01-24 19:48:28,683 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 19:48:28,683 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-01-24 19:48:28,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 19:48:28,684 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:48:28,684 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] [2018-01-24 19:48:28,685 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-01-24 19:48:28,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1156031168, now seen corresponding path program 1 times [2018-01-24 19:48:28,685 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:48:28,686 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:48:28,686 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:48:28,686 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:48:28,686 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:48:28,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:48:28,701 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:48:28,747 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-24 19:48:28,747 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:48:28,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 19:48:28,747 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:48:28,748 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 19:48:28,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 19:48:28,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 19:48:28,748 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 6 states. [2018-01-24 19:48:28,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:48:28,833 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-01-24 19:48:28,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 19:48:28,865 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-24 19:48:28,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:48:28,866 INFO L225 Difference]: With dead ends: 56 [2018-01-24 19:48:28,866 INFO L226 Difference]: Without dead ends: 53 [2018-01-24 19:48:28,866 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-24 19:48:28,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-24 19:48:28,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-01-24 19:48:28,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 19:48:28,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-01-24 19:48:28,872 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 23 [2018-01-24 19:48:28,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:48:28,872 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-01-24 19:48:28,872 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 19:48:28,873 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-01-24 19:48:28,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 19:48:28,873 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:48:28,874 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] [2018-01-24 19:48:28,874 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-01-24 19:48:28,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1156031167, now seen corresponding path program 1 times [2018-01-24 19:48:28,874 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:48:28,875 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:48:28,875 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:48:28,875 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:48:28,875 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:48:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:48:28,887 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:48:28,998 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-24 19:48:28,998 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:48:28,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 19:48:28,998 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:48:28,999 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 19:48:28,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 19:48:28,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 19:48:29,000 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 9 states. [2018-01-24 19:48:29,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:48:29,145 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-01-24 19:48:29,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 19:48:29,146 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-01-24 19:48:29,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:48:29,147 INFO L225 Difference]: With dead ends: 70 [2018-01-24 19:48:29,147 INFO L226 Difference]: Without dead ends: 67 [2018-01-24 19:48:29,147 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-24 19:48:29,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-24 19:48:29,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2018-01-24 19:48:29,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-24 19:48:29,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-01-24 19:48:29,155 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 23 [2018-01-24 19:48:29,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:48:29,156 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-01-24 19:48:29,156 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 19:48:29,156 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-01-24 19:48:29,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 19:48:29,157 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:48:29,157 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, 1, 1] [2018-01-24 19:48:29,157 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-01-24 19:48:29,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1785224664, now seen corresponding path program 1 times [2018-01-24 19:48:29,157 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:48:29,158 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:48:29,158 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:48:29,158 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:48:29,158 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:48:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:48:29,171 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:48:29,215 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-24 19:48:29,215 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:48:29,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 19:48:29,215 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:48:29,216 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 19:48:29,216 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 19:48:29,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 19:48:29,216 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 3 states. [2018-01-24 19:48:29,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:48:29,230 INFO L93 Difference]: Finished difference Result 98 states and 113 transitions. [2018-01-24 19:48:29,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 19:48:29,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-01-24 19:48:29,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:48:29,232 INFO L225 Difference]: With dead ends: 98 [2018-01-24 19:48:29,232 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 19:48:29,232 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-24 19:48:29,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 19:48:29,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-24 19:48:29,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-24 19:48:29,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2018-01-24 19:48:29,239 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 28 [2018-01-24 19:48:29,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:48:29,240 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-01-24 19:48:29,240 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 19:48:29,240 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2018-01-24 19:48:29,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 19:48:29,241 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:48:29,241 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, 1, 1, 1, 1] [2018-01-24 19:48:29,241 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-01-24 19:48:29,241 INFO L82 PathProgramCache]: Analyzing trace with hash -419708018, now seen corresponding path program 1 times [2018-01-24 19:48:29,241 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:48:29,242 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:48:29,242 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:48:29,242 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:48:29,242 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:48:29,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:48:29,257 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:48:29,344 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-24 19:48:29,344 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 19:48:29,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 19:48:29,344 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:48:29,344 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 19:48:29,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 19:48:29,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 19:48:29,345 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand 6 states. [2018-01-24 19:48:29,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 19:48:29,505 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-01-24 19:48:29,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 19:48:29,506 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-01-24 19:48:29,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 19:48:29,506 INFO L225 Difference]: With dead ends: 60 [2018-01-24 19:48:29,507 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 19:48:29,507 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 19:48:29,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 19:48:29,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-24 19:48:29,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 19:48:29,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-01-24 19:48:29,513 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 28 [2018-01-24 19:48:29,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 19:48:29,513 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-01-24 19:48:29,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 19:48:29,513 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-01-24 19:48:29,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 19:48:29,514 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 19:48:29,514 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, 1, 1, 1, 1] [2018-01-24 19:48:29,515 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrspnErr7RequiresViolation, cstrspnErr5RequiresViolation, cstrspnErr1RequiresViolation, cstrspnErr0RequiresViolation, cstrspnErr6RequiresViolation, cstrspnErr8RequiresViolation, cstrspnErr2RequiresViolation, cstrspnErr4RequiresViolation, cstrspnErr3RequiresViolation, cstrspnErr9RequiresViolation]=== [2018-01-24 19:48:29,515 INFO L82 PathProgramCache]: Analyzing trace with hash -2090509973, now seen corresponding path program 1 times [2018-01-24 19:48:29,515 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 19:48:29,516 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:48:29,516 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:48:29,516 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 19:48:29,516 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 19:48:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:48:29,534 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 19:48:29,733 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-24 19:48:29,733 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:48:29,733 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 19:48:29,734 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-01-24 19:48:29,736 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [8], [16], [18], [19], [20], [21], [22], [25], [36], [40], [41], [48], [49], [52], [56], [58], [60], [61], [64], [65], [68], [76], [94], [95], [96], [98] [2018-01-24 19:48:29,781 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 19:48:29,781 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 19:49:29,224 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 19:49:29,225 INFO L268 AbstractInterpreter]: Visited 29 different actions 45 times. Merged at 8 different actions 16 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-01-24 19:49:29,240 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 19:49:29,240 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 19:49:29,240 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-24 19:49:29,255 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 19:49:29,255 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 19:49:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 19:49:29,296 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 19:49:29,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 19:49:29,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:49:29,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:49:29,438 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 19:49:29,489 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 19:49:29,490 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 19:49:29,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-24 19:49:29,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 19:49:29,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:49:29,494 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-24 19:49:29,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 19:49:29,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 19:49:29,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:49:29,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:49:29,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:49:29,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-01-24 19:49:29,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-01-24 19:49:29,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-24 19:49:29,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:49:29,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:49:29,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-24 19:49:29,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:26, output treesize:22 [2018-01-24 19:49:29,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-01-24 19:49:29,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-24 19:49:29,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:49:29,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-01-24 19:49:29,744 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 19:49:29,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:49:29,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:49:29,750 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:29, output treesize:3 [2018-01-24 19:49:29,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 19:49:29,786 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 19:49:29,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-01-24 19:49:29,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-01-24 19:49:29,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 19:49:29,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:49:29,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 19:49:29,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:3 [2018-01-24 19:49:29,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 19:49:29,973 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 19:49:29,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12, 8] imperfect sequences [12] total 27 [2018-01-24 19:49:29,973 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 19:49:29,973 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 19:49:29,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 19:49:29,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=633, Unknown=0, NotChecked=0, Total=702 [2018-01-24 19:49:29,974 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 12 states. Received shutdown request... [2018-01-24 19:49:31,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 19:49:31,174 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 19:49:31,177 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 19:49:31,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 07:49:31 BoogieIcfgContainer [2018-01-24 19:49:31,177 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 19:49:31,178 INFO L168 Benchmark]: Toolchain (without parser) took 64695.69 ms. Allocated memory was 307.2 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 266.1 MB in the beginning and 1.9 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB. [2018-01-24 19:49:31,178 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 307.2 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 19:49:31,179 INFO L168 Benchmark]: CACSL2BoogieTranslator took 213.54 ms. Allocated memory is still 307.2 MB. Free memory was 266.1 MB in the beginning and 256.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-24 19:49:31,179 INFO L168 Benchmark]: Boogie Preprocessor took 34.65 ms. Allocated memory is still 307.2 MB. Free memory was 256.1 MB in the beginning and 254.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 19:49:31,179 INFO L168 Benchmark]: RCFGBuilder took 292.44 ms. Allocated memory is still 307.2 MB. Free memory was 254.1 MB in the beginning and 233.2 MB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 5.3 GB. [2018-01-24 19:49:31,180 INFO L168 Benchmark]: TraceAbstraction took 64147.54 ms. Allocated memory was 307.2 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 233.2 MB in the beginning and 1.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.7 GB. Max. memory is 5.3 GB. [2018-01-24 19:49:31,181 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 307.2 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 213.54 ms. Allocated memory is still 307.2 MB. Free memory was 266.1 MB in the beginning and 256.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.65 ms. Allocated memory is still 307.2 MB. Free memory was 256.1 MB in the beginning and 254.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 292.44 ms. Allocated memory is still 307.2 MB. Free memory was 254.1 MB in the beginning and 233.2 MB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 64147.54 ms. Allocated memory was 307.2 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 233.2 MB in the beginning and 1.9 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.7 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 28 LocStat_MAX_WEQGRAPH_SIZE : 9 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 390 LocStat_NO_SUPPORTING_DISEQUALITIES : 84 LocStat_NO_DISJUNCTIONS : -56 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 35 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 68 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 38 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 3.311430 RENAME_VARIABLES(MILLISECONDS) : 0.449820 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 3.261592 PROJECTAWAY(MILLISECONDS) : 5.494279 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.034050 DISJOIN(MILLISECONDS) : 0.413264 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.474720 ADD_EQUALITY(MILLISECONDS) : 0.012616 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011540 #CONJOIN_DISJUNCTIVE : 82 #RENAME_VARIABLES : 135 #UNFREEZE : 0 #CONJOIN : 141 #PROJECTAWAY : 109 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 15 #RENAME_VARIABLES_DISJUNCTIVE : 123 #ADD_EQUALITY : 70 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (50states) and interpolant automaton (currently 10 states, 12 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 29. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (50states) and interpolant automaton (currently 10 states, 12 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 29. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (50states) and interpolant automaton (currently 10 states, 12 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 29. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (50states) and interpolant automaton (currently 10 states, 12 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 29. - TimeoutResultAtElement [Line: 555]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 555). Cancelled while BasicCegarLoop was constructing difference of abstraction (50states) and interpolant automaton (currently 10 states, 12 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 29. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (50states) and interpolant automaton (currently 10 states, 12 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 29. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (50states) and interpolant automaton (currently 10 states, 12 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 29. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (50states) and interpolant automaton (currently 10 states, 12 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 29. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (50states) and interpolant automaton (currently 10 states, 12 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 29. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (50states) and interpolant automaton (currently 10 states, 12 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 29. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (50states) and interpolant automaton (currently 10 states, 12 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 29. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (50states) and interpolant automaton (currently 10 states, 12 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 29. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (50states) and interpolant automaton (currently 10 states, 12 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 29. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (50states) and interpolant automaton (currently 10 states, 12 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 29. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (50states) and interpolant automaton (currently 10 states, 12 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 29. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 58 locations, 15 error locations. TIMEOUT Result, 64.0s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 456 SDtfs, 465 SDslu, 831 SDs, 0 SdLazy, 689 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 144 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 59.5s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 32 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 269 ConstructedInterpolants, 6 QuantifiedInterpolants, 29250 SizeOfPredicates, 18 NumberOfNonLiveVariables, 136 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 6/8 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/cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_19-49-31-189.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_19-49-31-189.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_19-49-31-189.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrspn-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_19-49-31-189.csv Completed graceful shutdown