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_smtcomp.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_2_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 06:05:30,889 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 06:05:30,891 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 06:05:30,905 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 06:05:30,905 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 06:05:30,906 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 06:05:30,907 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 06:05:30,909 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 06:05:30,911 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 06:05:30,912 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 06:05:30,912 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 06:05:30,913 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 06:05:30,913 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 06:05:30,914 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 06:05:30,915 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 06:05:30,917 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 06:05:30,919 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 06:05:30,921 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 06:05:30,923 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 06:05:30,924 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 06:05:30,926 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 06:05:30,927 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 06:05:30,927 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 06:05:30,928 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 06:05:30,928 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 06:05:30,930 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 06:05:30,930 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 06:05:30,931 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 06:05:30,931 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 06:05:30,931 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 06:05:30,932 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 06:05:30,932 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_smtcomp.epf [2018-01-25 06:05:30,942 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 06:05:30,942 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 06:05:30,943 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 06:05:30,943 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 06:05:30,943 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 06:05:30,944 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 06:05:30,944 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 06:05:30,944 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 06:05:30,945 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 06:05:30,945 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 06:05:30,945 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 06:05:30,945 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 06:05:30,945 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 06:05:30,946 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 06:05:30,946 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 06:05:30,946 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 06:05:30,946 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 06:05:30,946 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 06:05:30,946 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 06:05:30,947 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 06:05:30,947 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 06:05:30,947 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 06:05:30,947 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 06:05:30,947 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 06:05:30,948 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 06:05:30,948 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 06:05:30,948 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 06:05:30,948 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 06:05:30,948 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 06:05:30,949 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 06:05:30,949 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 06:05:30,949 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 06:05:30,949 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 06:05:30,949 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 06:05:30,950 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 06:05:30,950 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 06:05:30,983 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 06:05:30,995 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 06:05:30,999 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 06:05:31,000 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 06:05:31,001 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 06:05:31,001 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_2_false-valid-memtrack_true-termination.i [2018-01-25 06:05:31,196 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 06:05:31,202 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 06:05:31,203 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 06:05:31,203 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 06:05:31,207 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 06:05:31,208 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:05:31" (1/1) ... [2018-01-25 06:05:31,211 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b5209c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:05:31, skipping insertion in model container [2018-01-25 06:05:31,212 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:05:31" (1/1) ... [2018-01-25 06:05:31,224 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:05:31,272 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:05:31,380 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:05:31,396 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:05:31,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:05:31 WrapperNode [2018-01-25 06:05:31,401 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 06:05:31,402 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 06:05:31,402 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 06:05:31,402 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 06:05:31,416 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:05:31" (1/1) ... [2018-01-25 06:05:31,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:05:31" (1/1) ... [2018-01-25 06:05:31,426 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:05:31" (1/1) ... [2018-01-25 06:05:31,426 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:05:31" (1/1) ... [2018-01-25 06:05:31,430 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:05:31" (1/1) ... [2018-01-25 06:05:31,432 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:05:31" (1/1) ... [2018-01-25 06:05:31,433 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:05:31" (1/1) ... [2018-01-25 06:05:31,435 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 06:05:31,435 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 06:05:31,435 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 06:05:31,435 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 06:05:31,436 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:05:31" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 06:05:31,479 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 06:05:31,479 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 06:05:31,479 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 06:05:31,480 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 06:05:31,480 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 06:05:31,480 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 06:05:31,480 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 06:05:31,480 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 06:05:31,480 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 06:05:31,481 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 06:05:31,481 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 06:05:31,481 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 06:05:31,481 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 06:05:31,481 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 06:05:31,481 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 06:05:31,482 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 06:05:31,482 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 06:05:31,482 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 06:05:31,660 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 06:05:31,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:05:31 BoogieIcfgContainer [2018-01-25 06:05:31,661 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 06:05:31,662 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 06:05:31,662 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 06:05:31,664 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 06:05:31,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 06:05:31" (1/3) ... [2018-01-25 06:05:31,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73a1ad5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:05:31, skipping insertion in model container [2018-01-25 06:05:31,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:05:31" (2/3) ... [2018-01-25 06:05:31,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73a1ad5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:05:31, skipping insertion in model container [2018-01-25 06:05:31,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:05:31" (3/3) ... [2018-01-25 06:05:31,666 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test18_2_false-valid-memtrack_true-termination.i [2018-01-25 06:05:31,672 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 06:05:31,678 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-25 06:05:31,714 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 06:05:31,715 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 06:05:31,715 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 06:05:31,715 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 06:05:31,715 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 06:05:31,715 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 06:05:31,715 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 06:05:31,715 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 06:05:31,716 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 06:05:31,738 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-01-25 06:05:31,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 06:05:31,743 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:05:31,744 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:05:31,744 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 06:05:31,748 INFO L82 PathProgramCache]: Analyzing trace with hash -100423179, now seen corresponding path program 1 times [2018-01-25 06:05:31,750 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:05:31,794 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:05:31,794 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:05:31,794 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:05:31,795 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:05:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:05:31,847 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:05:31,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:05:31,941 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:05:31,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 06:05:31,941 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:05:31,943 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 06:05:31,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 06:05:31,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 06:05:31,956 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-01-25 06:05:32,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:05:32,175 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2018-01-25 06:05:32,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 06:05:32,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-25 06:05:32,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:05:32,186 INFO L225 Difference]: With dead ends: 84 [2018-01-25 06:05:32,187 INFO L226 Difference]: Without dead ends: 68 [2018-01-25 06:05:32,191 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-25 06:05:32,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-25 06:05:32,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2018-01-25 06:05:32,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 06:05:32,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2018-01-25 06:05:32,233 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 17 [2018-01-25 06:05:32,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:05:32,234 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2018-01-25 06:05:32,234 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 06:05:32,234 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-01-25 06:05:32,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 06:05:32,236 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:05:32,236 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-25 06:05:32,236 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 06:05:32,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1898895127, now seen corresponding path program 1 times [2018-01-25 06:05:32,236 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:05:32,238 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:05:32,239 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:05:32,239 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:05:32,239 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:05:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:05:32,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:05:32,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:05:32,322 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:05:32,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:05:32,323 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:05:32,325 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:05:32,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:05:32,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:05:32,325 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand 6 states. [2018-01-25 06:05:32,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:05:32,401 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2018-01-25 06:05:32,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:05:32,402 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-25 06:05:32,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:05:32,404 INFO L225 Difference]: With dead ends: 82 [2018-01-25 06:05:32,404 INFO L226 Difference]: Without dead ends: 78 [2018-01-25 06:05:32,405 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-25 06:05:32,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-25 06:05:32,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2018-01-25 06:05:32,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 06:05:32,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-01-25 06:05:32,415 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 19 [2018-01-25 06:05:32,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:05:32,415 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-01-25 06:05:32,415 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:05:32,415 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-01-25 06:05:32,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 06:05:32,416 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:05:32,417 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] [2018-01-25 06:05:32,417 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 06:05:32,417 INFO L82 PathProgramCache]: Analyzing trace with hash -538007597, now seen corresponding path program 1 times [2018-01-25 06:05:32,417 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:05:32,419 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:05:32,419 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:05:32,419 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:05:32,419 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:05:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:05:32,437 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:05:32,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:05:32,483 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:05:32,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 06:05:32,483 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:05:32,484 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:05:32,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:05:32,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:05:32,484 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 4 states. [2018-01-25 06:05:32,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:05:32,512 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2018-01-25 06:05:32,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 06:05:32,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-01-25 06:05:32,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:05:32,514 INFO L225 Difference]: With dead ends: 90 [2018-01-25 06:05:32,514 INFO L226 Difference]: Without dead ends: 86 [2018-01-25 06:05:32,514 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:05:32,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-25 06:05:32,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 56. [2018-01-25 06:05:32,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-25 06:05:32,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2018-01-25 06:05:32,522 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 21 [2018-01-25 06:05:32,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:05:32,522 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2018-01-25 06:05:32,522 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:05:32,522 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2018-01-25 06:05:32,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 06:05:32,523 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:05:32,523 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:05:32,523 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 06:05:32,523 INFO L82 PathProgramCache]: Analyzing trace with hash -483541835, now seen corresponding path program 1 times [2018-01-25 06:05:32,523 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:05:32,524 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:05:32,525 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:05:32,525 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:05:32,525 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:05:32,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:05:32,537 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:05:32,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-25 06:05:32,589 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:05:32,589 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:05:32,590 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-25 06:05:32,592 INFO L201 CegarAbsIntRunner]: [3], [9], [10], [11], [12], [16], [18], [22], [26], [31], [33], [38], [40], [73], [75], [76], [77], [79], [80], [81], [82] [2018-01-25 06:05:32,637 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:05:32,637 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:05:32,755 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-25 06:05:32,757 INFO L268 AbstractInterpreter]: Visited 14 different actions 14 times. Never merged. Never widened. Never found a fixpoint. Largest state had 17 variables. [2018-01-25 06:05:32,764 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-25 06:05:32,838 INFO L232 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 67.07% of their original sizes. [2018-01-25 06:05:32,838 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-25 06:05:32,872 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-25 06:05:32,873 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-25 06:05:32,873 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2018-01-25 06:05:32,873 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:05:32,874 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:05:32,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:05:32,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:05:32,874 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand 7 states. [2018-01-25 06:05:33,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:05:33,571 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2018-01-25 06:05:33,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 06:05:33,607 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-01-25 06:05:33,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:05:33,608 INFO L225 Difference]: With dead ends: 91 [2018-01-25 06:05:33,608 INFO L226 Difference]: Without dead ends: 47 [2018-01-25 06:05:33,609 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:05:33,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-25 06:05:33,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-25 06:05:33,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-25 06:05:33,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-01-25 06:05:33,617 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 24 [2018-01-25 06:05:33,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:05:33,617 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-01-25 06:05:33,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:05:33,617 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-01-25 06:05:33,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 06:05:33,618 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:05:33,618 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-25 06:05:33,619 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 06:05:33,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1986913619, now seen corresponding path program 1 times [2018-01-25 06:05:33,619 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:05:33,620 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:05:33,621 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:05:33,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:05:33,621 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:05:33,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:05:33,637 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:05:33,707 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-25 06:05:33,707 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:05:33,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:05:33,708 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:05:33,708 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 06:05:33,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 06:05:33,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:05:33,709 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 5 states. [2018-01-25 06:05:33,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:05:33,731 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2018-01-25 06:05:33,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:05:33,732 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-25 06:05:33,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:05:33,733 INFO L225 Difference]: With dead ends: 86 [2018-01-25 06:05:33,733 INFO L226 Difference]: Without dead ends: 51 [2018-01-25 06:05:33,734 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-25 06:05:33,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-25 06:05:33,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-01-25 06:05:33,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 06:05:33,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-01-25 06:05:33,741 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 26 [2018-01-25 06:05:33,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:05:33,742 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-01-25 06:05:33,742 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 06:05:33,742 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-01-25 06:05:33,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 06:05:33,743 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:05:33,743 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-25 06:05:33,743 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 06:05:33,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1019008117, now seen corresponding path program 1 times [2018-01-25 06:05:33,744 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:05:33,745 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:05:33,745 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:05:33,745 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:05:33,745 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:05:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:05:33,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:05:33,918 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-25 06:05:33,918 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:05:33,918 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:05:33,918 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-25 06:05:33,919 INFO L201 CegarAbsIntRunner]: [3], [6], [7], [8], [10], [11], [12], [16], [18], [22], [26], [31], [33], [38], [40], [73], [75], [76], [77], [79], [80], [81], [82] [2018-01-25 06:05:33,920 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:05:33,920 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:05:34,128 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-25 06:05:34,128 INFO L268 AbstractInterpreter]: Visited 23 different actions 28 times. Never merged. Never widened. Never found a fixpoint. Largest state had 19 variables. [2018-01-25 06:05:34,145 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-25 06:05:34,283 INFO L232 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 76.37% of their original sizes. [2018-01-25 06:05:34,284 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-25 06:05:34,575 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-25 06:05:34,576 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-25 06:05:34,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [8] total 21 [2018-01-25 06:05:34,576 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:05:34,576 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-25 06:05:34,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-25 06:05:34,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=158, Unknown=3, NotChecked=0, Total=210 [2018-01-25 06:05:34,577 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 15 states. [2018-01-25 06:05:37,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:05:37,254 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2018-01-25 06:05:37,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-25 06:05:37,254 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-01-25 06:05:37,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:05:37,255 INFO L225 Difference]: With dead ends: 100 [2018-01-25 06:05:37,255 INFO L226 Difference]: Without dead ends: 81 [2018-01-25 06:05:37,256 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=292, Unknown=3, NotChecked=0, Total=380 [2018-01-25 06:05:37,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-25 06:05:37,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 68. [2018-01-25 06:05:37,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-25 06:05:37,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2018-01-25 06:05:37,265 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 28 [2018-01-25 06:05:37,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:05:37,265 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2018-01-25 06:05:37,266 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-25 06:05:37,266 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2018-01-25 06:05:37,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 06:05:37,267 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:05:37,267 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-25 06:05:37,267 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr7RequiresViolation, entry_pointErr5RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-25 06:05:37,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1019008118, now seen corresponding path program 1 times [2018-01-25 06:05:37,267 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:05:37,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:05:37,269 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:05:37,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:05:37,269 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:05:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:05:37,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:05:37,781 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-25 06:05:37,781 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:05:37,781 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:05:37,782 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-25 06:05:37,782 INFO L201 CegarAbsIntRunner]: [3], [6], [7], [8], [10], [11], [12], [16], [18], [22], [26], [31], [33], [38], [41], [73], [75], [76], [77], [79], [80], [81], [82] [2018-01-25 06:05:37,783 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:05:37,783 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 06:05:37,873 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 06:05:37,874 INFO L268 AbstractInterpreter]: Visited 23 different actions 28 times. Never merged. Never widened. Never found a fixpoint. Largest state had 19 variables. [2018-01-25 06:05:37,878 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 06:05:37,879 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:05:37,879 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 06:05:37,896 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:05:37,896 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:05:37,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:05:37,935 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:05:38,082 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-25 06:05:38,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:05:38,178 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-25 06:05:38,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:05:38,192 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-25 06:05:38,193 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 06:05:38,291 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-25 06:05:38,292 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 06:05:38,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 06:05:38,383 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-25 06:05:38,906 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:05:38,908 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:05:38,909 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-25 06:05:38,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:05:38,959 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:05:38,960 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:05:38,960 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-25 06:05:38,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:05:39,005 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:05:39,006 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:05:39,006 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 45 treesize of output 39 [2018-01-25 06:05:39,007 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 06:05:39,042 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-25 06:05:39,043 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 06:05:39,077 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-25 06:05:39,077 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-25 06:05:39,173 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-25 06:05:39,173 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:05:40,416 WARN L146 SmtUtils]: Spent 1074ms on a formula simplification. DAG size of input: 46 DAG size of output 32 [2018-01-25 06:05:40,433 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-01-25 06:05:52,907 WARN L146 SmtUtils]: Spent 10250ms on a formula simplification. DAG size of input: 76 DAG size of output 34 [2018-01-25 06:05:52,939 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 50 [2018-01-25 06:06:03,359 WARN L146 SmtUtils]: Spent 8066ms on a formula simplification. DAG size of input: 81 DAG size of output 71 [2018-01-25 06:06:03,369 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-25 06:06:03,382 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-25 06:06:03,668 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-25 06:06:03,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:06:03,683 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 32 treesize of output 26 [2018-01-25 06:06:03,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:06:03,697 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 26 treesize of output 29 [2018-01-25 06:06:03,716 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-25 06:06:03,716 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 06:06:03,721 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:06:03,743 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-25 06:06:03,743 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:82, output treesize:15 [2018-01-25 06:06:12,477 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 50 treesize of output 44 [2018-01-25 06:06:12,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:06:12,503 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-25 06:06:12,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:06:12,530 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 44 treesize of output 47 [2018-01-25 06:06:12,557 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-25 06:06:12,557 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 06:06:12,566 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:06:12,589 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-25 06:06:12,589 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:114, output treesize:53 [2018-01-25 06:06:12,720 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-25 06:06:12,752 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:06:12,752 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-25 06:06:12,756 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:06:12,756 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:06:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:06:12,807 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:06:12,824 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-25 06:06:12,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:06:12,826 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-25 06:06:12,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:06:12,841 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-25 06:06:12,842 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 06:06:12,857 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-25 06:06:12,857 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 06:06:12,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-25 06:06:12,871 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-25 06:06:12,960 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:06:12,968 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:06:12,969 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 54 treesize of output 48 [2018-01-25 06:06:12,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 06:06:13,027 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:06:13,028 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 41 treesize of output 50 [2018-01-25 06:06:13,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:06:13,084 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:06:13,084 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 06:06:13,085 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 45 treesize of output 39 [2018-01-25 06:06:13,085 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 06:06:13,133 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-25 06:06:13,133 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 06:06:13,179 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-25 06:06:13,179 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-25 06:06:13,310 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-25 06:06:13,310 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 06:06:13,412 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-01-25 06:06:17,795 WARN L146 SmtUtils]: Spent 2077ms on a formula simplification. DAG size of input: 76 DAG size of output 29 [2018-01-25 06:06:17,807 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-25 06:06:26,125 WARN L143 SmtUtils]: Spent 4017ms on a formula simplification that was a NOOP. DAG size: 71 [2018-01-25 06:06:26,130 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-25 06:06:26,138 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-25 06:06:26,252 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 32 treesize of output 35 [2018-01-25 06:06:26,271 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-25 06:06:26,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:06:26,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:06:26,290 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-25 06:06:26,290 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 06:06:26,302 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-25 06:06:26,303 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 06:06:26,319 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-25 06:06:26,319 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:82, output treesize:15 [2018-01-25 06:06:28,344 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 50 treesize of output 53 [2018-01-25 06:06:28,377 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-25 06:06:28,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-25 06:06:28,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 06:06:28,413 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-25 06:06:28,414 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-25 06:06:28,438 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-25 06:06:28,439 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-25 06:06:28,461 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-25 06:06:28,461 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:114, output treesize:53 [2018-01-25 06:06:30,661 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-25 06:06:30,663 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 06:06:30,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10, 10, 10] total 29 [2018-01-25 06:06:30,663 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 06:06:30,664 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-25 06:06:30,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-25 06:06:30,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=777, Unknown=8, NotChecked=0, Total=870 [2018-01-25 06:06:30,665 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand 19 states. [2018-01-25 06:06:32,402 WARN L146 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 55 DAG size of output 52 [2018-01-25 06:06:32,561 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 67 DAG size of output 64 Received shutdown request... [2018-01-25 06:06:38,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 06:06:38,817 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 06:06:38,821 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 06:06:38,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 06:06:38 BoogieIcfgContainer [2018-01-25 06:06:38,821 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 06:06:38,822 INFO L168 Benchmark]: Toolchain (without parser) took 67625.42 ms. Allocated memory was 304.1 MB in the beginning and 636.5 MB in the end (delta: 332.4 MB). Free memory was 263.0 MB in the beginning and 407.4 MB in the end (delta: -144.4 MB). Peak memory consumption was 188.0 MB. Max. memory is 5.3 GB. [2018-01-25 06:06:38,823 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 304.1 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 06:06:38,823 INFO L168 Benchmark]: CACSL2BoogieTranslator took 199.05 ms. Allocated memory is still 304.1 MB. Free memory was 263.0 MB in the beginning and 249.0 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-25 06:06:38,823 INFO L168 Benchmark]: Boogie Preprocessor took 32.89 ms. Allocated memory is still 304.1 MB. Free memory was 249.0 MB in the beginning and 247.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 06:06:38,823 INFO L168 Benchmark]: RCFGBuilder took 226.12 ms. Allocated memory is still 304.1 MB. Free memory was 247.0 MB in the beginning and 230.0 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-25 06:06:38,823 INFO L168 Benchmark]: TraceAbstraction took 67159.77 ms. Allocated memory was 304.1 MB in the beginning and 636.5 MB in the end (delta: 332.4 MB). Free memory was 230.0 MB in the beginning and 407.4 MB in the end (delta: -177.4 MB). Peak memory consumption was 155.0 MB. Max. memory is 5.3 GB. [2018-01-25 06:06:38,825 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.19 ms. Allocated memory is still 304.1 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 199.05 ms. Allocated memory is still 304.1 MB. Free memory was 263.0 MB in the beginning and 249.0 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.89 ms. Allocated memory is still 304.1 MB. Free memory was 249.0 MB in the beginning and 247.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 226.12 ms. Allocated memory is still 304.1 MB. Free memory was 247.0 MB in the beginning and 230.0 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 67159.77 ms. Allocated memory was 304.1 MB in the beginning and 636.5 MB in the end (delta: 332.4 MB). Free memory was 230.0 MB in the beginning and 407.4 MB in the end (delta: -177.4 MB). Peak memory consumption was 155.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 13 LocStat_MAX_WEQGRAPH_SIZE : 1 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 61 LocStat_NO_SUPPORTING_DISEQUALITIES : 0 LocStat_NO_DISJUNCTIONS : -26 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 22 TransStat_MAX_WEQGRAPH_SIZE : 1 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 26 TransStat_NO_SUPPORTING_DISEQUALITIES : 2 TransStat_NO_DISJUNCTIONS : 23 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.527457 RENAME_VARIABLES(MILLISECONDS) : 0.102886 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.208486 PROJECTAWAY(MILLISECONDS) : 0.026997 ADD_WEAK_EQUALITY(MILLISECONDS) : 3.256092 DISJOIN(MILLISECONDS) : 0.000000 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.130636 ADD_EQUALITY(MILLISECONDS) : 0.029505 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.023093 #CONJOIN_DISJUNCTIVE : 21 #RENAME_VARIABLES : 43 #UNFREEZE : 0 #CONJOIN : 44 #PROJECTAWAY : 44 #ADD_WEAK_EQUALITY : 1 #DISJOIN : 0 #RENAME_VARIABLES_DISJUNCTIVE : 42 #ADD_EQUALITY : 26 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 - 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.244018 RENAME_VARIABLES(MILLISECONDS) : 0.141889 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.198439 PROJECTAWAY(MILLISECONDS) : 0.023892 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.080654 DISJOIN(MILLISECONDS) : 0.746943 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.170137 ADD_EQUALITY(MILLISECONDS) : 0.019241 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.017178 #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.283039 RENAME_VARIABLES(MILLISECONDS) : 0.097777 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.116489 PROJECTAWAY(MILLISECONDS) : 0.038786 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.041874 DISJOIN(MILLISECONDS) : 0.386667 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.121252 ADD_EQUALITY(MILLISECONDS) : 0.019952 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.004606 #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: 1460]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1460). Cancelled while BasicCegarLoop was constructing difference of abstraction (68states) and interpolant automaton (currently 10 states, 19 states before enhancement), while ReachableStatesComputation was computing reachable states (18 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1456). Cancelled while BasicCegarLoop was constructing difference of abstraction (68states) and interpolant automaton (currently 10 states, 19 states before enhancement), while ReachableStatesComputation was computing reachable states (18 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1454). Cancelled while BasicCegarLoop was constructing difference of abstraction (68states) and interpolant automaton (currently 10 states, 19 states before enhancement), while ReachableStatesComputation was computing reachable states (18 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 (68states) and interpolant automaton (currently 10 states, 19 states before enhancement), while ReachableStatesComputation was computing reachable states (18 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 (68states) and interpolant automaton (currently 10 states, 19 states before enhancement), while ReachableStatesComputation was computing reachable states (18 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1456). Cancelled while BasicCegarLoop was constructing difference of abstraction (68states) and interpolant automaton (currently 10 states, 19 states before enhancement), while ReachableStatesComputation was computing reachable states (18 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1454). Cancelled while BasicCegarLoop was constructing difference of abstraction (68states) and interpolant automaton (currently 10 states, 19 states before enhancement), while ReachableStatesComputation was computing reachable states (18 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was constructing difference of abstraction (68states) and interpolant automaton (currently 10 states, 19 states before enhancement), while ReachableStatesComputation was computing reachable states (18 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was constructing difference of abstraction (68states) and interpolant automaton (currently 10 states, 19 states before enhancement), while ReachableStatesComputation was computing reachable states (18 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 46 locations, 9 error locations. TIMEOUT Result, 67.1s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 11.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 298 SDtfs, 304 SDslu, 756 SDs, 0 SdLazy, 280 SolverSat, 63 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 205 GetRequests, 123 SyntacticMatches, 14 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 55.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 3 AbstIntIterations, 2 AbstIntStrong, 0.8817857142857142 AbsIntWeakeningRatio, 1.0 AbsIntAvgWeakeningVarsNumRemoved, 3.62 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 83 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 53.6s InterpolantComputationTime, 219 NumberOfCodeBlocks, 219 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 264 ConstructedInterpolants, 54 QuantifiedInterpolants, 121290 SizeOfPredicates, 18 NumberOfNonLiveVariables, 218 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 11 InterpolantComputations, 4 PerfectInterpolantSequences, 15/44 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_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_06-06-38-839.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_06-06-38-839.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_06-06-38-839.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_06-06-38-839.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_06-06-38-839.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-25_06-06-38-839.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-25_06-06-38-839.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_2_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_06-06-38-839.csv Completed graceful shutdown