java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf -i ../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 03:16:02,883 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 03:16:02,884 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 03:16:02,900 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 03:16:02,900 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 03:16:02,901 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 03:16:02,903 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 03:16:02,904 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 03:16:02,907 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 03:16:02,908 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 03:16:02,909 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 03:16:02,909 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 03:16:02,910 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 03:16:02,911 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 03:16:02,912 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 03:16:02,915 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 03:16:02,917 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 03:16:02,920 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 03:16:02,921 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 03:16:02,922 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 03:16:02,925 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 03:16:02,925 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 03:16:02,925 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 03:16:02,927 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 03:16:02,927 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 03:16:02,929 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 03:16:02,929 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 03:16:02,930 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 03:16:02,930 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 03:16:02,930 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 03:16:02,931 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 03:16:02,931 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf [2018-01-25 03:16:02,941 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 03:16:02,941 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 03:16:02,941 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 03:16:02,942 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 03:16:02,942 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 03:16:02,942 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 03:16:02,942 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 03:16:02,942 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 03:16:02,943 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 03:16:02,943 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 03:16:02,944 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 03:16:02,944 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 03:16:02,944 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 03:16:02,944 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 03:16:02,944 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 03:16:02,944 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 03:16:02,944 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 03:16:02,945 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 03:16:02,945 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 03:16:02,945 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 03:16:02,945 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 03:16:02,945 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 03:16:02,945 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 03:16:02,946 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 03:16:02,946 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 03:16:02,946 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:16:02,946 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 03:16:02,946 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 03:16:02,946 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 03:16:02,947 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 03:16:02,947 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 03:16:02,947 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 03:16:02,947 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 03:16:02,947 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 03:16:02,947 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 03:16:02,948 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 03:16:02,948 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 03:16:02,982 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 03:16:02,994 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 03:16:02,998 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 03:16:02,999 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 03:16:03,000 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 03:16:03,000 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_false-valid-free.i [2018-01-25 03:16:03,184 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 03:16:03,190 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 03:16:03,191 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 03:16:03,191 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 03:16:03,197 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 03:16:03,198 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:16:03" (1/1) ... [2018-01-25 03:16:03,200 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10256132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:16:03, skipping insertion in model container [2018-01-25 03:16:03,201 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:16:03" (1/1) ... [2018-01-25 03:16:03,215 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:16:03,257 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:16:03,376 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:16:03,408 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:16:03,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:16:03 WrapperNode [2018-01-25 03:16:03,441 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 03:16:03,442 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 03:16:03,442 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 03:16:03,442 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 03:16:03,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:16:03" (1/1) ... [2018-01-25 03:16:03,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:16:03" (1/1) ... [2018-01-25 03:16:03,473 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:16:03" (1/1) ... [2018-01-25 03:16:03,473 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:16:03" (1/1) ... [2018-01-25 03:16:03,477 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:16:03" (1/1) ... [2018-01-25 03:16:03,481 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:16:03" (1/1) ... [2018-01-25 03:16:03,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:16:03" (1/1) ... [2018-01-25 03:16:03,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 03:16:03,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 03:16:03,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 03:16:03,484 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 03:16:03,485 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:16:03" (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 03:16:03,553 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 03:16:03,553 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 03:16:03,553 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-25 03:16:03,554 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 03:16:03,554 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 03:16:03,554 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 03:16:03,554 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 03:16:03,554 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 03:16:03,554 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 03:16:03,554 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 03:16:03,555 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 03:16:03,555 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 03:16:03,555 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-25 03:16:03,555 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 03:16:03,555 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 03:16:03,555 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 03:16:03,798 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 03:16:03,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:16:03 BoogieIcfgContainer [2018-01-25 03:16:03,799 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 03:16:03,799 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 03:16:03,800 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 03:16:03,801 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 03:16:03,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 03:16:03" (1/3) ... [2018-01-25 03:16:03,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bdeed8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:16:03, skipping insertion in model container [2018-01-25 03:16:03,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:16:03" (2/3) ... [2018-01-25 03:16:03,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bdeed8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:16:03, skipping insertion in model container [2018-01-25 03:16:03,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:16:03" (3/3) ... [2018-01-25 03:16:03,805 INFO L105 eAbstractionObserver]: Analyzing ICFG 960521-1_1_false-valid-free.i [2018-01-25 03:16:03,812 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 03:16:03,818 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-01-25 03:16:03,870 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 03:16:03,871 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 03:16:03,871 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 03:16:03,871 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 03:16:03,871 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 03:16:03,871 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 03:16:03,871 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 03:16:03,872 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 03:16:03,873 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 03:16:03,895 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-01-25 03:16:03,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-25 03:16:03,903 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:16:03,904 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:16:03,904 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 03:16:03,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1352732268, now seen corresponding path program 1 times [2018-01-25 03:16:03,912 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:16:03,974 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:16:03,975 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:16:03,975 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:16:03,975 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:16:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:16:04,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:16:04,086 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 03:16:04,089 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:16:04,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 03:16:04,089 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:16:04,091 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-25 03:16:04,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-25 03:16:04,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 03:16:04,106 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 2 states. [2018-01-25 03:16:04,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:16:04,133 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2018-01-25 03:16:04,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-25 03:16:04,134 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-01-25 03:16:04,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:16:04,143 INFO L225 Difference]: With dead ends: 103 [2018-01-25 03:16:04,143 INFO L226 Difference]: Without dead ends: 53 [2018-01-25 03:16:04,148 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 03:16:04,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-25 03:16:04,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-25 03:16:04,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-25 03:16:04,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-01-25 03:16:04,292 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 12 [2018-01-25 03:16:04,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:16:04,292 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-01-25 03:16:04,293 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-25 03:16:04,293 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-01-25 03:16:04,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 03:16:04,294 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:16:04,294 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:16:04,294 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 03:16:04,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1000920166, now seen corresponding path program 1 times [2018-01-25 03:16:04,295 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:16:04,296 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:16:04,296 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:16:04,296 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:16:04,296 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:16:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:16:04,334 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:16:04,435 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 03:16:04,436 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:16:04,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:16:04,436 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:16:04,437 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:16:04,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:16:04,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:16:04,438 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 4 states. [2018-01-25 03:16:04,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:16:04,678 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2018-01-25 03:16:04,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:16:04,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 03:16:04,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:16:04,680 INFO L225 Difference]: With dead ends: 53 [2018-01-25 03:16:04,680 INFO L226 Difference]: Without dead ends: 52 [2018-01-25 03:16:04,681 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:16:04,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-25 03:16:04,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-25 03:16:04,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-25 03:16:04,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-01-25 03:16:04,691 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 14 [2018-01-25 03:16:04,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:16:04,691 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-01-25 03:16:04,691 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:16:04,692 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-01-25 03:16:04,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 03:16:04,693 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:16:04,693 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:16:04,694 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 03:16:04,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1000920165, now seen corresponding path program 1 times [2018-01-25 03:16:04,694 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:16:04,695 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:16:04,696 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:16:04,696 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:16:04,698 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:16:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:16:04,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:16:04,830 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 03:16:04,830 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:16:04,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:16:04,830 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:16:04,831 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:16:04,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:16:04,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:16:04,832 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 5 states. [2018-01-25 03:16:04,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:16:04,986 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-01-25 03:16:04,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:16:04,987 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 03:16:04,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:16:04,988 INFO L225 Difference]: With dead ends: 52 [2018-01-25 03:16:04,988 INFO L226 Difference]: Without dead ends: 51 [2018-01-25 03:16:04,989 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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 03:16:04,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-25 03:16:04,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-25 03:16:04,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-25 03:16:04,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-01-25 03:16:04,995 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 14 [2018-01-25 03:16:04,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:16:04,995 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-01-25 03:16:04,995 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:16:04,995 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-01-25 03:16:04,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 03:16:04,996 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:16:04,996 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:16:04,996 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 03:16:04,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1559748963, now seen corresponding path program 1 times [2018-01-25 03:16:04,996 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:16:04,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:16:04,997 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:16:04,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:16:04,998 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:16:05,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:16:05,025 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:16:05,132 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 03:16:05,132 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:16:05,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:16:05,132 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:16:05,133 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:16:05,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:16:05,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:16:05,134 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 6 states. [2018-01-25 03:16:05,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:16:05,407 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-01-25 03:16:05,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:16:05,410 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-25 03:16:05,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:16:05,412 INFO L225 Difference]: With dead ends: 51 [2018-01-25 03:16:05,412 INFO L226 Difference]: Without dead ends: 48 [2018-01-25 03:16:05,413 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 03:16:05,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-25 03:16:05,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-25 03:16:05,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-25 03:16:05,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-01-25 03:16:05,420 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 20 [2018-01-25 03:16:05,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:16:05,421 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-01-25 03:16:05,421 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:16:05,421 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2018-01-25 03:16:05,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 03:16:05,421 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:16:05,422 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:16:05,422 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 03:16:05,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1559748962, now seen corresponding path program 1 times [2018-01-25 03:16:05,422 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:16:05,423 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:16:05,423 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:16:05,423 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:16:05,423 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:16:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:16:05,462 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:16:05,701 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 03:16:05,701 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:16:05,702 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:16:05,702 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:16:05,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 03:16:05,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 03:16:05,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:16:05,703 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 7 states. [2018-01-25 03:16:06,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:16:06,011 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-01-25 03:16:06,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 03:16:06,012 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-01-25 03:16:06,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:16:06,015 INFO L225 Difference]: With dead ends: 85 [2018-01-25 03:16:06,015 INFO L226 Difference]: Without dead ends: 58 [2018-01-25 03:16:06,015 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-25 03:16:06,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-25 03:16:06,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2018-01-25 03:16:06,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 03:16:06,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-01-25 03:16:06,022 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 20 [2018-01-25 03:16:06,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:16:06,023 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-01-25 03:16:06,023 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 03:16:06,023 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-01-25 03:16:06,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 03:16:06,024 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:16:06,024 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] [2018-01-25 03:16:06,024 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 03:16:06,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1905865099, now seen corresponding path program 1 times [2018-01-25 03:16:06,025 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:16:06,026 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:16:06,026 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:16:06,026 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:16:06,026 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:16:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:16:06,047 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:16:06,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:16:06,124 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:16:06,124 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:16:06,125 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-01-25 03:16:06,127 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [12], [14], [16], [42], [46], [48], [51], [57], [58], [59], [60], [61], [64], [90], [91], [92], [94] [2018-01-25 03:16:06,174 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:16:06,175 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 03:16:24,750 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 03:16:24,752 INFO L268 AbstractInterpreter]: Visited 22 different actions 31 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 27 variables. [2018-01-25 03:16:24,770 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 03:16:24,770 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:16:24,771 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 03:16:24,779 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:16:24,779 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:16:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:16:24,836 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:16:24,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:16:24,891 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:16:24,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:16:24,966 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 03:16:24,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [7] total 11 [2018-01-25 03:16:24,967 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:16:24,967 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:16:24,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:16:24,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-01-25 03:16:24,968 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 5 states. [2018-01-25 03:16:25,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:16:25,011 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2018-01-25 03:16:25,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:16:25,011 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-25 03:16:25,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:16:25,013 INFO L225 Difference]: With dead ends: 115 [2018-01-25 03:16:25,013 INFO L226 Difference]: Without dead ends: 86 [2018-01-25 03:16:25,013 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-01-25 03:16:25,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-25 03:16:25,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 71. [2018-01-25 03:16:25,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-25 03:16:25,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-01-25 03:16:25,020 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 24 [2018-01-25 03:16:25,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:16:25,020 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-01-25 03:16:25,020 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:16:25,020 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-01-25 03:16:25,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 03:16:25,021 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:16:25,021 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:16:25,021 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-01-25 03:16:25,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1500155222, now seen corresponding path program 1 times [2018-01-25 03:16:25,022 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:16:25,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:16:25,022 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:16:25,023 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:16:25,023 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:16:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:16:25,037 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:16:25,237 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:16:25,237 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:16:25,238 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:16:25,238 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-01-25 03:16:25,238 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [12], [14], [16], [42], [46], [48], [51], [53], [57], [58], [59], [60], [61], [64], [90], [91], [92], [94] [2018-01-25 03:16:25,240 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:16:25,240 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 03:16:52,938 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 03:16:52,939 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 03:16:52,939 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 03:16:52,939 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:16:52,939 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 03:16:52,948 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:16:52,948 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:16:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:16:53,014 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:16:53,016 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 03:16:53,016 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 03:16:53,025 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 03:16:53,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 03:16:53 BoogieIcfgContainer [2018-01-25 03:16:53,025 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 03:16:53,026 INFO L168 Benchmark]: Toolchain (without parser) took 49841.56 ms. Allocated memory was 298.8 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 258.7 MB in the beginning and 864.3 MB in the end (delta: -605.5 MB). Peak memory consumption was 810.0 MB. Max. memory is 5.3 GB. [2018-01-25 03:16:53,030 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 298.8 MB. Free memory is still 264.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 03:16:53,030 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.76 ms. Allocated memory is still 298.8 MB. Free memory was 257.8 MB in the beginning and 247.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-25 03:16:53,031 INFO L168 Benchmark]: Boogie Preprocessor took 41.34 ms. Allocated memory is still 298.8 MB. Free memory was 247.7 MB in the beginning and 245.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 03:16:53,031 INFO L168 Benchmark]: RCFGBuilder took 315.15 ms. Allocated memory is still 298.8 MB. Free memory was 245.6 MB in the beginning and 226.6 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. [2018-01-25 03:16:53,031 INFO L168 Benchmark]: TraceAbstraction took 49226.12 ms. Allocated memory was 298.8 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 226.6 MB in the beginning and 864.3 MB in the end (delta: -637.7 MB). Peak memory consumption was 777.9 MB. Max. memory is 5.3 GB. [2018-01-25 03:16:53,033 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.17 ms. Allocated memory is still 298.8 MB. Free memory is still 264.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 250.76 ms. Allocated memory is still 298.8 MB. Free memory was 257.8 MB in the beginning and 247.7 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.34 ms. Allocated memory is still 298.8 MB. Free memory was 247.7 MB in the beginning and 245.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 315.15 ms. Allocated memory is still 298.8 MB. Free memory was 245.6 MB in the beginning and 226.6 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 49226.12 ms. Allocated memory was 298.8 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 226.6 MB in the beginning and 864.3 MB in the end (delta: -637.7 MB). Peak memory consumption was 777.9 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 : 8 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 321 LocStat_NO_SUPPORTING_DISEQUALITIES : 38 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 28 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 67 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 30 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 4.774587 RENAME_VARIABLES(MILLISECONDS) : 0.676338 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.338626 PROJECTAWAY(MILLISECONDS) : 0.091387 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.049144 DISJOIN(MILLISECONDS) : 0.590742 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.700035 ADD_EQUALITY(MILLISECONDS) : 0.033477 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010453 #CONJOIN_DISJUNCTIVE : 52 #RENAME_VARIABLES : 95 #UNFREEZE : 0 #CONJOIN : 112 #PROJECTAWAY : 80 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 9 #RENAME_VARIABLES_DISJUNCTIVE : 89 #ADD_EQUALITY : 69 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 628). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 28 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 56 locations, 17 error locations. TIMEOUT Result, 49.1s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 255 SDtfs, 270 SDslu, 312 SDs, 0 SdLazy, 261 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 46.3s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 24 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 11561 SizeOfPredicates, 2 NumberOfNonLiveVariables, 132 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 7/9 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/960521-1_1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_03-16-53-045.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_03-16-53-045.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_03-16-53-045.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-free.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_03-16-53-045.csv Completed graceful shutdown