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/ldv-memsafety/memleaks_test18_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 20:39:35,035 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 20:39:35,037 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 20:39:35,052 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 20:39:35,052 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 20:39:35,053 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 20:39:35,054 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 20:39:35,056 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 20:39:35,057 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 20:39:35,058 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 20:39:35,058 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 20:39:35,058 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 20:39:35,059 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 20:39:35,060 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 20:39:35,061 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 20:39:35,064 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 20:39:35,066 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 20:39:35,068 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 20:39:35,069 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 20:39:35,070 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 20:39:35,073 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 20:39:35,073 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 20:39:35,073 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 20:39:35,074 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 20:39:35,075 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 20:39:35,076 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 20:39:35,076 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 20:39:35,077 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 20:39:35,077 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 20:39:35,077 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 20:39:35,078 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 20:39:35,078 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 20:39:35,088 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 20:39:35,088 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 20:39:35,089 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 20:39:35,089 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 20:39:35,089 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 20:39:35,089 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 20:39:35,090 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 20:39:35,090 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-24 20:39:35,090 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 20:39:35,091 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 20:39:35,091 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 20:39:35,091 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 20:39:35,091 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 20:39:35,092 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 20:39:35,092 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 20:39:35,092 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 20:39:35,092 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 20:39:35,092 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 20:39:35,093 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 20:39:35,093 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 20:39:35,093 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 20:39:35,093 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 20:39:35,093 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 20:39:35,094 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 20:39:35,094 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 20:39:35,094 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 20:39:35,094 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 20:39:35,094 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 20:39:35,095 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 20:39:35,095 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 20:39:35,095 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 20:39:35,095 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 20:39:35,095 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 20:39:35,096 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 20:39:35,096 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 20:39:35,097 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 20:39:35,097 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 20:39:35,131 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 20:39:35,144 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 20:39:35,148 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 20:39:35,149 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 20:39:35,150 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 20:39:35,151 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_1_false-valid-memtrack_true-termination.i [2018-01-24 20:39:35,314 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 20:39:35,320 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 20:39:35,321 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 20:39:35,321 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 20:39:35,327 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 20:39:35,328 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 08:39:35" (1/1) ... [2018-01-24 20:39:35,332 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43c0846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:39:35, skipping insertion in model container [2018-01-24 20:39:35,332 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 08:39:35" (1/1) ... [2018-01-24 20:39:35,351 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 20:39:35,402 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 20:39:35,515 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 20:39:35,533 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 20:39:35,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:39:35 WrapperNode [2018-01-24 20:39:35,539 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 20:39:35,540 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 20:39:35,540 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 20:39:35,540 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 20:39:35,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:39:35" (1/1) ... [2018-01-24 20:39:35,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:39:35" (1/1) ... [2018-01-24 20:39:35,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:39:35" (1/1) ... [2018-01-24 20:39:35,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:39:35" (1/1) ... [2018-01-24 20:39:35,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:39:35" (1/1) ... [2018-01-24 20:39:35,571 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:39:35" (1/1) ... [2018-01-24 20:39:35,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:39:35" (1/1) ... [2018-01-24 20:39:35,573 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 20:39:35,574 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 20:39:35,574 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 20:39:35,574 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 20:39:35,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:39:35" (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 20:39:35,629 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 20:39:35,629 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 20:39:35,629 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 20:39:35,629 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 20:39:35,629 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 20:39:35,630 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 20:39:35,630 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 20:39:35,630 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 20:39:35,630 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 20:39:35,630 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 20:39:35,630 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 20:39:35,631 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 20:39:35,631 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 20:39:35,631 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 20:39:35,631 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 20:39:35,631 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 20:39:35,631 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 20:39:35,631 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 20:39:35,822 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 20:39:35,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 08:39:35 BoogieIcfgContainer [2018-01-24 20:39:35,823 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 20:39:35,824 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 20:39:35,824 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 20:39:35,825 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 20:39:35,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 08:39:35" (1/3) ... [2018-01-24 20:39:35,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f552d16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 08:39:35, skipping insertion in model container [2018-01-24 20:39:35,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:39:35" (2/3) ... [2018-01-24 20:39:35,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f552d16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 08:39:35, skipping insertion in model container [2018-01-24 20:39:35,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 08:39:35" (3/3) ... [2018-01-24 20:39:35,828 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test18_1_false-valid-memtrack_true-termination.i [2018-01-24 20:39:35,834 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 20:39:35,840 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-24 20:39:35,890 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 20:39:35,891 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 20:39:35,891 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 20:39:35,891 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 20:39:35,891 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 20:39:35,891 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 20:39:35,892 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 20:39:35,892 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 20:39:35,893 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 20:39:35,913 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-01-24 20:39:35,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 20:39:35,920 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:39:35,921 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:39:35,922 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 20:39:35,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1647065445, now seen corresponding path program 1 times [2018-01-24 20:39:35,928 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:39:35,974 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:39:35,974 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:39:35,974 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:39:35,974 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:39:36,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:39:36,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:39:36,108 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 20:39:36,111 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:39:36,111 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 20:39:36,111 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:39:36,114 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 20:39:36,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 20:39:36,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 20:39:36,131 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2018-01-24 20:39:36,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:39:36,310 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2018-01-24 20:39:36,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 20:39:36,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-24 20:39:36,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:39:36,320 INFO L225 Difference]: With dead ends: 86 [2018-01-24 20:39:36,320 INFO L226 Difference]: Without dead ends: 62 [2018-01-24 20:39:36,323 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 20:39:36,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-24 20:39:36,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2018-01-24 20:39:36,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 20:39:36,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2018-01-24 20:39:36,359 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 17 [2018-01-24 20:39:36,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:39:36,360 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2018-01-24 20:39:36,360 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 20:39:36,360 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2018-01-24 20:39:36,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 20:39:36,362 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:39:36,362 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:39:36,362 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 20:39:36,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1810172163, now seen corresponding path program 1 times [2018-01-24 20:39:36,363 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:39:36,365 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:39:36,365 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:39:36,365 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:39:36,365 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:39:36,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:39:36,390 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:39:36,467 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 20:39:36,467 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:39:36,468 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 20:39:36,468 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:39:36,469 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 20:39:36,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 20:39:36,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 20:39:36,470 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand 6 states. [2018-01-24 20:39:36,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:39:36,581 INFO L93 Difference]: Finished difference Result 80 states and 96 transitions. [2018-01-24 20:39:36,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 20:39:36,581 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 20:39:36,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:39:36,583 INFO L225 Difference]: With dead ends: 80 [2018-01-24 20:39:36,583 INFO L226 Difference]: Without dead ends: 76 [2018-01-24 20:39:36,584 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 20:39:36,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-24 20:39:36,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2018-01-24 20:39:36,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-24 20:39:36,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2018-01-24 20:39:36,595 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 19 [2018-01-24 20:39:36,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:39:36,595 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2018-01-24 20:39:36,596 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 20:39:36,596 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-01-24 20:39:36,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 20:39:36,596 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:39:36,597 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:39:36,597 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 20:39:36,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1893738511, now seen corresponding path program 1 times [2018-01-24 20:39:36,597 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:39:36,598 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:39:36,598 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:39:36,598 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:39:36,599 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:39:36,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:39:36,613 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:39:36,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:39:36,677 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:39:36,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 20:39:36,677 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:39:36,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 20:39:36,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 20:39:36,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:39:36,678 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand 5 states. [2018-01-24 20:39:36,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:39:36,699 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2018-01-24 20:39:36,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 20:39:36,699 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-24 20:39:36,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:39:36,700 INFO L225 Difference]: With dead ends: 86 [2018-01-24 20:39:36,700 INFO L226 Difference]: Without dead ends: 42 [2018-01-24 20:39:36,701 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:39:36,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-24 20:39:36,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-01-24 20:39:36,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-24 20:39:36,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-01-24 20:39:36,705 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 20 [2018-01-24 20:39:36,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:39:36,705 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-01-24 20:39:36,705 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 20:39:36,705 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-01-24 20:39:36,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 20:39:36,706 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:39:36,706 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:39:36,706 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 20:39:36,707 INFO L82 PathProgramCache]: Analyzing trace with hash 389514349, now seen corresponding path program 1 times [2018-01-24 20:39:36,707 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:39:36,708 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:39:36,708 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:39:36,708 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:39:36,708 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:39:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:39:36,719 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:39:36,776 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 20:39:36,776 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:39:36,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 20:39:36,776 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:39:36,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 20:39:36,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 20:39:36,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 20:39:36,777 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 6 states. [2018-01-24 20:39:36,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:39:36,886 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-01-24 20:39:36,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 20:39:36,886 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-24 20:39:36,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:39:36,888 INFO L225 Difference]: With dead ends: 50 [2018-01-24 20:39:36,888 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 20:39:36,888 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 20:39:36,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 20:39:36,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-01-24 20:39:36,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 20:39:36,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-01-24 20:39:36,895 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 22 [2018-01-24 20:39:36,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:39:36,895 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-01-24 20:39:36,895 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 20:39:36,896 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-01-24 20:39:36,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 20:39:36,896 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:39:36,897 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:39:36,897 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 20:39:36,897 INFO L82 PathProgramCache]: Analyzing trace with hash 389514350, now seen corresponding path program 1 times [2018-01-24 20:39:36,897 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:39:36,899 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:39:36,899 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:39:36,899 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:39:36,899 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:39:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:39:36,914 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:39:36,955 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 20:39:36,956 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:39:36,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 20:39:36,956 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:39:36,957 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 20:39:36,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 20:39:36,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-24 20:39:36,957 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 4 states. [2018-01-24 20:39:36,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:39:36,995 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2018-01-24 20:39:36,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 20:39:36,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-01-24 20:39:36,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:39:36,996 INFO L225 Difference]: With dead ends: 86 [2018-01-24 20:39:36,996 INFO L226 Difference]: Without dead ends: 68 [2018-01-24 20:39:36,997 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-24 20:39:36,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-24 20:39:37,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 48. [2018-01-24 20:39:37,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 20:39:37,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-01-24 20:39:37,003 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 22 [2018-01-24 20:39:37,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:39:37,003 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-01-24 20:39:37,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 20:39:37,003 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-01-24 20:39:37,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 20:39:37,004 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:39:37,004 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:39:37,004 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 20:39:37,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1824781139, now seen corresponding path program 1 times [2018-01-24 20:39:37,004 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:39:37,005 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:39:37,005 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:39:37,005 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:39:37,006 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:39:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:39:37,020 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:39:37,063 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 20:39:37,064 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:39:37,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 20:39:37,064 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:39:37,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 20:39:37,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 20:39:37,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:39:37,065 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 5 states. [2018-01-24 20:39:37,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:39:37,082 INFO L93 Difference]: Finished difference Result 98 states and 111 transitions. [2018-01-24 20:39:37,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 20:39:37,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-24 20:39:37,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:39:37,084 INFO L225 Difference]: With dead ends: 98 [2018-01-24 20:39:37,085 INFO L226 Difference]: Without dead ends: 62 [2018-01-24 20:39:37,085 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:39:37,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-24 20:39:37,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2018-01-24 20:39:37,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 20:39:37,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-01-24 20:39:37,094 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 26 [2018-01-24 20:39:37,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:39:37,095 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-01-24 20:39:37,095 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 20:39:37,095 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-01-24 20:39:37,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 20:39:37,096 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:39:37,096 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:39:37,097 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 20:39:37,097 INFO L82 PathProgramCache]: Analyzing trace with hash -85684427, now seen corresponding path program 1 times [2018-01-24 20:39:37,097 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:39:37,098 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:39:37,098 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:39:37,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:39:37,099 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:39:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:39:37,118 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:39:37,278 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:39:37,278 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:39:37,278 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 20:39:37,279 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-24 20:39:37,281 INFO L201 CegarAbsIntRunner]: [3], [6], [7], [8], [10], [11], [12], [16], [18], [22], [26], [31], [33], [38], [40], [70], [72], [73], [74], [76], [77], [78], [79] [2018-01-24 20:39:37,340 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 20:39:37,340 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 20:39:38,745 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-24 20:39:38,746 INFO L268 AbstractInterpreter]: Visited 23 different actions 28 times. Never merged. Never widened. Never found a fixpoint. Largest state had 19 variables. [2018-01-24 20:39:38,756 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-24 20:39:39,335 INFO L232 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 76.37% of their original sizes. [2018-01-24 20:39:39,335 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-24 20:39:39,840 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-24 20:39:39,841 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 20:39:39,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [8] total 21 [2018-01-24 20:39:39,841 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:39:39,841 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 20:39:39,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 20:39:39,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=159, Unknown=2, NotChecked=0, Total=210 [2018-01-24 20:39:39,842 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 15 states. [2018-01-24 20:39:48,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:39:48,274 INFO L93 Difference]: Finished difference Result 108 states and 121 transitions. [2018-01-24 20:39:48,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 20:39:48,274 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-01-24 20:39:48,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:39:48,276 INFO L225 Difference]: With dead ends: 108 [2018-01-24 20:39:48,276 INFO L226 Difference]: Without dead ends: 92 [2018-01-24 20:39:48,276 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=293, Unknown=2, NotChecked=0, Total=380 [2018-01-24 20:39:48,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-24 20:39:48,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 64. [2018-01-24 20:39:48,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-24 20:39:48,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2018-01-24 20:39:48,288 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 28 [2018-01-24 20:39:48,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:39:48,288 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2018-01-24 20:39:48,288 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 20:39:48,288 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2018-01-24 20:39:48,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 20:39:48,289 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:39:48,290 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:39:48,290 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 20:39:48,290 INFO L82 PathProgramCache]: Analyzing trace with hash -85684426, now seen corresponding path program 1 times [2018-01-24 20:39:48,290 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:39:48,291 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:39:48,292 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:39:48,292 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:39:48,292 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:39:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:39:48,311 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:39:48,619 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:39:48,619 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:39:48,619 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 20:39:48,620 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-24 20:39:48,620 INFO L201 CegarAbsIntRunner]: [3], [6], [7], [8], [10], [11], [12], [16], [18], [22], [26], [31], [33], [38], [41], [70], [72], [73], [74], [76], [77], [78], [79] [2018-01-24 20:39:48,621 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 20:39:48,621 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 20:39:49,217 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 20:39:49,217 INFO L268 AbstractInterpreter]: Visited 23 different actions 28 times. Never merged. Never widened. Never found a fixpoint. Largest state had 19 variables. [2018-01-24 20:39:49,244 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 20:39:49,244 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:39:49,244 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 20:39:49,263 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:39:49,264 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 20:39:49,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:39:49,299 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 20:39:49,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-24 20:39:49,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 20:39:49,550 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 23 treesize of output 22 [2018-01-24 20:39:49,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 20:39:49,565 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 25 treesize of output 24 [2018-01-24 20:39:49,566 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 20:39:49,653 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 22 treesize of output 21 [2018-01-24 20:39:49,654 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 20:39:49,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 20:39:49,670 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-24 20:39:49,945 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 20:39:49,946 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 20:39:49,946 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 52 treesize of output 46 [2018-01-24 20:39:49,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 20:39:50,017 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 20:39:50,018 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 20:39:50,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 60 [2018-01-24 20:39:50,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 20:39:50,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-01-24 20:39:50,104 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 20:39:50,169 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 20:39:50,170 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 20:39:50,171 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 46 treesize of output 40 [2018-01-24 20:39:50,171 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 20:39:50,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-24 20:39:50,251 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-24 20:39:50,424 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:39:50,424 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 20:39:51,224 WARN L146 SmtUtils]: Spent 672ms on a formula simplification. DAG size of input: 46 DAG size of output 34 [2018-01-24 20:39:51,242 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 27 [2018-01-24 20:39:57,145 WARN L146 SmtUtils]: Spent 5780ms on a formula simplification. DAG size of input: 84 DAG size of output 31 [2018-01-24 20:39:57,161 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-24 20:39:57,468 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-01-24 20:39:57,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 20:39:57,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 28 treesize of output 31 [2018-01-24 20:39:57,512 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-01-24 20:39:57,512 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 20:39:57,517 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 20:39:57,530 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-24 20:39:57,531 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 20:39:57,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 20:39:57,548 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:86, output treesize:15 [2018-01-24 20:39:58,232 WARN L143 SmtUtils]: Spent 135ms on a formula simplification that was a NOOP. DAG size: 51 [2018-01-24 20:39:58,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 52 treesize of output 55 [2018-01-24 20:39:58,333 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-01-24 20:39:58,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 20:39:58,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 20:39:58,378 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-01-24 20:39:58,378 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 20:39:58,403 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-01-24 20:39:58,404 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 20:39:58,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 20:39:58,426 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:118, output treesize:53 [2018-01-24 20:39:58,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:39:58,535 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:39:58,535 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 20:39:58,539 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:39:58,539 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 20:39:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:39:58,578 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 20:39:58,585 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 23 treesize of output 22 [2018-01-24 20:39:58,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 20:39:58,604 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 26 treesize of output 25 [2018-01-24 20:39:58,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 20:39:58,605 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 22 treesize of output 21 [2018-01-24 20:39:58,606 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 20:39:58,625 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 25 treesize of output 24 [2018-01-24 20:39:58,626 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 20:39:58,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 20:39:58,653 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-24 20:39:58,764 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 20:39:58,765 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 20:39:58,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 67 [2018-01-24 20:39:58,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 20:39:58,835 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 20:39:58,835 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 20:39:58,836 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 46 treesize of output 40 [2018-01-24 20:39:58,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 20:39:58,889 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 20:39:58,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 48 [2018-01-24 20:39:58,891 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 20:39:58,936 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 20:39:58,937 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 20:39:58,938 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 44 treesize of output 38 [2018-01-24 20:39:58,938 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 20:39:58,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-24 20:39:58,980 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-24 20:39:59,048 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:39:59,049 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 20:39:59,148 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 27 [2018-01-24 20:40:09,631 WARN L146 SmtUtils]: Spent 8009ms on a formula simplification. DAG size of input: 84 DAG size of output 31 [2018-01-24 20:40:09,640 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-24 20:40:16,997 WARN L143 SmtUtils]: Spent 4072ms on a formula simplification that was a NOOP. DAG size: 73 [2018-01-24 20:40:17,004 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-24 20:40:17,012 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-24 20:40:17,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2018-01-24 20:40:17,210 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-01-24 20:40:17,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 20:40:17,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 20:40:17,238 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-24 20:40:17,239 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 20:40:17,254 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-24 20:40:17,254 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 20:40:17,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 20:40:17,267 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:86, output treesize:15 [2018-01-24 20:40:20,679 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-01-24 20:40:20,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 20:40:20,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-01-24 20:40:20,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 20:40:20,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 49 [2018-01-24 20:40:20,802 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-01-24 20:40:20,802 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 20:40:20,812 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 20:40:20,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 20:40:20,836 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:118, output treesize:53 [2018-01-24 20:40:22,933 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:40:22,935 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 20:40:22,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10, 10, 10] total 29 [2018-01-24 20:40:22,936 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 20:40:22,936 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 20:40:22,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 20:40:22,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=779, Unknown=3, NotChecked=0, Total=870 [2018-01-24 20:40:22,937 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand 19 states. [2018-01-24 20:40:23,387 WARN L146 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 67 DAG size of output 64 Received shutdown request... [2018-01-24 20:40:31,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 20:40:31,600 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 20:40:31,643 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 20:40:31,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 08:40:31 BoogieIcfgContainer [2018-01-24 20:40:31,643 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 20:40:31,644 INFO L168 Benchmark]: Toolchain (without parser) took 56328.97 ms. Allocated memory was 302.0 MB in the beginning and 1.1 GB in the end (delta: 823.7 MB). Free memory was 259.3 MB in the beginning and 709.0 MB in the end (delta: -449.7 MB). Peak memory consumption was 373.9 MB. Max. memory is 5.3 GB. [2018-01-24 20:40:31,644 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 302.0 MB. Free memory is still 266.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 20:40:31,644 INFO L168 Benchmark]: CACSL2BoogieTranslator took 218.37 ms. Allocated memory is still 302.0 MB. Free memory was 259.3 MB in the beginning and 246.3 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. [2018-01-24 20:40:31,645 INFO L168 Benchmark]: Boogie Preprocessor took 33.83 ms. Allocated memory is still 302.0 MB. Free memory was 246.3 MB in the beginning and 244.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 20:40:31,645 INFO L168 Benchmark]: RCFGBuilder took 249.25 ms. Allocated memory is still 302.0 MB. Free memory was 244.3 MB in the beginning and 227.7 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. [2018-01-24 20:40:31,645 INFO L168 Benchmark]: TraceAbstraction took 55819.33 ms. Allocated memory was 302.0 MB in the beginning and 1.1 GB in the end (delta: 823.7 MB). Free memory was 227.7 MB in the beginning and 709.0 MB in the end (delta: -481.3 MB). Peak memory consumption was 342.4 MB. Max. memory is 5.3 GB. [2018-01-24 20:40:31,648 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.18 ms. Allocated memory is still 302.0 MB. Free memory is still 266.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 218.37 ms. Allocated memory is still 302.0 MB. Free memory was 259.3 MB in the beginning and 246.3 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.83 ms. Allocated memory is still 302.0 MB. Free memory was 246.3 MB in the beginning and 244.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 249.25 ms. Allocated memory is still 302.0 MB. Free memory was 244.3 MB in the beginning and 227.7 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 55819.33 ms. Allocated memory was 302.0 MB in the beginning and 1.1 GB in the end (delta: 823.7 MB). Free memory was 227.7 MB in the beginning and 709.0 MB in the end (delta: -481.3 MB). Peak memory consumption was 342.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 134 LocStat_NO_SUPPORTING_DISEQUALITIES : 20 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 31 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 40 TransStat_NO_SUPPORTING_DISEQUALITIES : 8 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.198907 RENAME_VARIABLES(MILLISECONDS) : 0.098491 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.163617 PROJECTAWAY(MILLISECONDS) : 0.037437 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.109095 DISJOIN(MILLISECONDS) : 0.531040 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.126187 ADD_EQUALITY(MILLISECONDS) : 0.012881 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.015884 #CONJOIN_DISJUNCTIVE : 44 #RENAME_VARIABLES : 77 #UNFREEZE : 0 #CONJOIN : 76 #PROJECTAWAY : 73 #ADD_WEAK_EQUALITY : 3 #DISJOIN : 6 #RENAME_VARIABLES_DISJUNCTIVE : 75 #ADD_EQUALITY : 40 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 7 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 22 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 143 LocStat_NO_SUPPORTING_DISEQUALITIES : 23 LocStat_NO_DISJUNCTIONS : -44 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 31 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 42 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 34 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.224054 RENAME_VARIABLES(MILLISECONDS) : 0.046283 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.092653 PROJECTAWAY(MILLISECONDS) : 0.045296 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.047649 DISJOIN(MILLISECONDS) : 0.318279 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.059657 ADD_EQUALITY(MILLISECONDS) : 0.012874 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.003888 #CONJOIN_DISJUNCTIVE : 44 #RENAME_VARIABLES : 78 #UNFREEZE : 0 #CONJOIN : 77 #PROJECTAWAY : 76 #ADD_WEAK_EQUALITY : 3 #DISJOIN : 7 #RENAME_VARIABLES_DISJUNCTIVE : 75 #ADD_EQUALITY : 42 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 6 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1458]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1458). Cancelled while BasicCegarLoop was constructing difference of abstraction (64states) and interpolant automaton (currently 10 states, 19 states before enhancement), while ReachableStatesComputation was computing reachable states (19 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (64states) and interpolant automaton (currently 10 states, 19 states before enhancement), while ReachableStatesComputation was computing reachable states (19 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was constructing difference of abstraction (64states) and interpolant automaton (currently 10 states, 19 states before enhancement), while ReachableStatesComputation was computing reachable states (19 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1448). Cancelled while BasicCegarLoop was constructing difference of abstraction (64states) and interpolant automaton (currently 10 states, 19 states before enhancement), while ReachableStatesComputation was computing reachable states (19 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (64states) and interpolant automaton (currently 10 states, 19 states before enhancement), while ReachableStatesComputation was computing reachable states (19 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (64states) and interpolant automaton (currently 10 states, 19 states before enhancement), while ReachableStatesComputation was computing reachable states (19 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1453). Cancelled while BasicCegarLoop was constructing difference of abstraction (64states) and interpolant automaton (currently 10 states, 19 states before enhancement), while ReachableStatesComputation was computing reachable states (19 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 43 locations, 7 error locations. TIMEOUT Result, 55.7s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 17.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 320 SDtfs, 286 SDslu, 842 SDs, 0 SdLazy, 278 SolverSat, 52 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 13.6s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 194 GetRequests, 105 SyntacticMatches, 18 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 35.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.1s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.8761463844797178 AbsIntWeakeningRatio, 1.0 AbsIntAvgWeakeningVarsNumRemoved, 5.296296296296297 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 93 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 34.4s InterpolantComputationTime, 238 NumberOfCodeBlocks, 238 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 282 ConstructedInterpolants, 54 QuantifiedInterpolants, 118458 SizeOfPredicates, 18 NumberOfNonLiveVariables, 218 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 13/40 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/memleaks_test18_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_20-40-31-659.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_20-40-31-659.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_20-40-31-659.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_20-40-31-659.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_20-40-31-659.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_20-40-31-659.csv Completed graceful shutdown