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/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:44:36,073 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:44:36,074 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:44:36,090 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:44:36,090 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:44:36,092 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:44:36,093 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:44:36,094 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:44:36,097 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:44:36,098 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:44:36,099 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:44:36,099 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:44:36,100 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:44:36,101 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:44:36,102 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:44:36,105 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:44:36,107 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:44:36,109 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:44:36,111 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:44:36,112 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:44:36,114 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:44:36,115 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:44:36,115 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:44:36,116 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:44:36,117 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:44:36,118 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:44:36,119 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:44:36,119 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:44:36,120 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:44:36,120 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:44:36,121 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:44:36,121 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 05:44:36,129 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:44:36,130 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:44:36,130 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:44:36,131 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:44:36,131 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:44:36,131 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:44:36,131 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:44:36,131 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:44:36,132 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:44:36,132 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:44:36,132 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:44:36,132 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:44:36,132 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:44:36,132 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:44:36,132 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:44:36,133 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:44:36,133 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:44:36,133 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:44:36,133 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:44:36,133 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:44:36,133 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:44:36,133 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:44:36,134 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:44:36,134 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:44:36,134 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:44:36,134 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:44:36,134 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:44:36,135 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:44:36,135 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:44:36,135 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:44:36,135 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:44:36,135 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:44:36,135 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:44:36,135 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:44:36,136 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:44:36,136 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:44:36,171 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:44:36,181 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:44:36,184 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:44:36,186 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:44:36,186 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:44:36,187 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-01-25 05:44:36,374 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:44:36,379 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:44:36,380 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:44:36,380 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:44:36,385 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:44:36,386 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:44:36" (1/1) ... [2018-01-25 05:44:36,388 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aad67c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:44:36, skipping insertion in model container [2018-01-25 05:44:36,389 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:44:36" (1/1) ... [2018-01-25 05:44:36,402 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:44:36,440 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:44:36,555 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:44:36,571 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:44:36,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:44:36 WrapperNode [2018-01-25 05:44:36,582 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:44:36,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:44:36,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:44:36,582 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:44:36,601 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:44:36" (1/1) ... [2018-01-25 05:44:36,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:44:36" (1/1) ... [2018-01-25 05:44:36,614 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:44:36" (1/1) ... [2018-01-25 05:44:36,615 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:44:36" (1/1) ... [2018-01-25 05:44:36,621 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:44:36" (1/1) ... [2018-01-25 05:44:36,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:44:36" (1/1) ... [2018-01-25 05:44:36,627 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:44:36" (1/1) ... [2018-01-25 05:44:36,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:44:36,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:44:36,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:44:36,630 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:44:36,632 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:44:36" (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 05:44:36,686 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:44:36,686 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:44:36,686 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-25 05:44:36,687 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:44:36,687 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 05:44:36,687 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 05:44:36,687 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:44:36,687 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:44:36,687 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:44:36,688 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:44:36,688 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:44:36,688 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-01-25 05:44:36,688 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-01-25 05:44:36,688 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 05:44:36,688 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 05:44:36,689 INFO L128 BoogieDeclarations]: Found specification of procedure memcpy [2018-01-25 05:44:36,689 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-25 05:44:36,689 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:44:36,689 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:44:36,689 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:44:36,840 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-25 05:44:36,981 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:44:36,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:44:36 BoogieIcfgContainer [2018-01-25 05:44:36,982 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:44:36,983 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:44:36,983 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:44:36,985 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:44:36,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:44:36" (1/3) ... [2018-01-25 05:44:36,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@95e4054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:44:36, skipping insertion in model container [2018-01-25 05:44:36,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:44:36" (2/3) ... [2018-01-25 05:44:36,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@95e4054 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:44:36, skipping insertion in model container [2018-01-25 05:44:36,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:44:36" (3/3) ... [2018-01-25 05:44:36,987 INFO L105 eAbstractionObserver]: Analyzing ICFG test-memleak_nexttime_true-valid-memsafety_true-termination.i [2018-01-25 05:44:36,994 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:44:36,999 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-01-25 05:44:37,045 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:44:37,045 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:44:37,045 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:44:37,045 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:44:37,046 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:44:37,046 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:44:37,046 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:44:37,046 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:44:37,047 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:44:37,068 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-01-25 05:44:37,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-25 05:44:37,074 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:44:37,075 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-25 05:44:37,075 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-25 05:44:37,080 INFO L82 PathProgramCache]: Analyzing trace with hash 2931467, now seen corresponding path program 1 times [2018-01-25 05:44:37,083 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:44:37,129 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:44:37,130 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:44:37,130 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:44:37,130 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:44:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:44:37,176 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:44:37,228 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 05:44:37,230 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:44:37,231 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 05:44:37,231 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:44:37,233 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:44:37,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:44:37,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:44:37,251 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. [2018-01-25 05:44:37,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:44:37,479 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2018-01-25 05:44:37,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:44:37,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-25 05:44:37,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:44:37,494 INFO L225 Difference]: With dead ends: 65 [2018-01-25 05:44:37,495 INFO L226 Difference]: Without dead ends: 57 [2018-01-25 05:44:37,498 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 05:44:37,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-25 05:44:37,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-25 05:44:37,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-25 05:44:37,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-01-25 05:44:37,536 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 4 [2018-01-25 05:44:37,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:44:37,536 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-01-25 05:44:37,536 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:44:37,537 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-01-25 05:44:37,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-25 05:44:37,537 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:44:37,537 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-25 05:44:37,537 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-25 05:44:37,537 INFO L82 PathProgramCache]: Analyzing trace with hash 2931468, now seen corresponding path program 1 times [2018-01-25 05:44:37,537 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:44:37,538 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:44:37,538 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:44:37,538 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:44:37,539 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:44:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:44:37,558 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:44:37,625 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 05:44:37,625 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:44:37,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 05:44:37,625 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:44:37,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:44:37,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:44:37,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:44:37,627 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 3 states. [2018-01-25 05:44:37,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:44:37,687 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-01-25 05:44:37,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:44:37,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-25 05:44:37,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:44:37,689 INFO L225 Difference]: With dead ends: 57 [2018-01-25 05:44:37,689 INFO L226 Difference]: Without dead ends: 53 [2018-01-25 05:44:37,690 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 05:44:37,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-25 05:44:37,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-25 05:44:37,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-25 05:44:37,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-01-25 05:44:37,700 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 4 [2018-01-25 05:44:37,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:44:37,700 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-01-25 05:44:37,700 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:44:37,700 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-01-25 05:44:37,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:44:37,701 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:44:37,701 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:44:37,701 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-25 05:44:37,702 INFO L82 PathProgramCache]: Analyzing trace with hash -240006955, now seen corresponding path program 1 times [2018-01-25 05:44:37,702 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:44:37,703 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:44:37,703 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:44:37,703 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:44:37,703 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:44:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:44:37,737 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:44:37,816 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 05:44:37,817 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:44:37,817 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 05:44:37,817 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:44:37,818 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:44:37,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:44:37,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:44:37,818 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 3 states. [2018-01-25 05:44:37,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:44:37,907 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-01-25 05:44:37,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:44:37,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-01-25 05:44:37,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:44:37,908 INFO L225 Difference]: With dead ends: 53 [2018-01-25 05:44:37,908 INFO L226 Difference]: Without dead ends: 51 [2018-01-25 05:44:37,909 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:44:37,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-25 05:44:37,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-25 05:44:37,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-25 05:44:37,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-01-25 05:44:37,916 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 14 [2018-01-25 05:44:37,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:44:37,916 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-01-25 05:44:37,916 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:44:37,916 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-01-25 05:44:37,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:44:37,917 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:44:37,917 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:44:37,917 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-25 05:44:37,917 INFO L82 PathProgramCache]: Analyzing trace with hash -240006954, now seen corresponding path program 1 times [2018-01-25 05:44:37,917 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:44:37,918 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:44:37,918 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:44:37,918 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:44:37,918 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:44:37,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:44:37,943 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:44:38,038 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 05:44:38,038 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:44:38,038 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:44:38,038 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:44:38,039 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:44:38,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:44:38,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:44:38,039 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 4 states. [2018-01-25 05:44:38,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:44:38,121 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-01-25 05:44:38,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:44:38,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 05:44:38,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:44:38,124 INFO L225 Difference]: With dead ends: 51 [2018-01-25 05:44:38,124 INFO L226 Difference]: Without dead ends: 49 [2018-01-25 05:44:38,124 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 05:44:38,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-25 05:44:38,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-25 05:44:38,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 05:44:38,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-01-25 05:44:38,129 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 14 [2018-01-25 05:44:38,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:44:38,129 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-01-25 05:44:38,129 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:44:38,129 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-01-25 05:44:38,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 05:44:38,130 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:44:38,130 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:44:38,130 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-25 05:44:38,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1149718964, now seen corresponding path program 1 times [2018-01-25 05:44:38,130 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:44:38,131 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:44:38,131 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:44:38,131 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:44:38,131 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:44:38,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:44:38,159 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:44:38,426 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 05:44:38,427 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:44:38,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:44:38,427 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:44:38,427 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:44:38,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:44:38,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:44:38,428 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 8 states. [2018-01-25 05:44:38,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:44:38,579 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-01-25 05:44:38,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:44:38,580 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-01-25 05:44:38,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:44:38,581 INFO L225 Difference]: With dead ends: 49 [2018-01-25 05:44:38,581 INFO L226 Difference]: Without dead ends: 46 [2018-01-25 05:44:38,581 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-01-25 05:44:38,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-25 05:44:38,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-25 05:44:38,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-25 05:44:38,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-01-25 05:44:38,586 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 15 [2018-01-25 05:44:38,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:44:38,587 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-01-25 05:44:38,587 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:44:38,587 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-01-25 05:44:38,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 05:44:38,587 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:44:38,588 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:44:38,588 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-25 05:44:38,588 INFO L82 PathProgramCache]: Analyzing trace with hash 536104684, now seen corresponding path program 1 times [2018-01-25 05:44:38,588 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:44:38,589 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:44:38,589 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:44:38,589 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:44:38,589 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:44:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:44:38,610 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:44:38,652 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 05:44:38,652 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:44:38,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 05:44:38,653 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:44:38,653 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:44:38,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:44:38,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:44:38,654 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 3 states. [2018-01-25 05:44:38,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:44:38,705 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-01-25 05:44:38,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:44:38,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-01-25 05:44:38,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:44:38,707 INFO L225 Difference]: With dead ends: 46 [2018-01-25 05:44:38,707 INFO L226 Difference]: Without dead ends: 44 [2018-01-25 05:44:38,708 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 05:44:38,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-25 05:44:38,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-01-25 05:44:38,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-25 05:44:38,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-01-25 05:44:38,714 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 27 [2018-01-25 05:44:38,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:44:38,715 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-01-25 05:44:38,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:44:38,715 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-01-25 05:44:38,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 05:44:38,716 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:44:38,716 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:44:38,716 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-25 05:44:38,716 INFO L82 PathProgramCache]: Analyzing trace with hash 536104686, now seen corresponding path program 1 times [2018-01-25 05:44:38,717 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:44:38,718 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:44:38,718 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:44:38,718 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:44:38,718 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:44:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:44:38,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:44:38,792 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 05:44:38,793 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:44:38,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:44:38,793 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:44:38,794 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:44:38,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:44:38,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:44:38,794 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 4 states. [2018-01-25 05:44:38,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:44:38,833 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-01-25 05:44:38,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:44:38,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-01-25 05:44:38,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:44:38,835 INFO L225 Difference]: With dead ends: 74 [2018-01-25 05:44:38,835 INFO L226 Difference]: Without dead ends: 46 [2018-01-25 05:44:38,835 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:44:38,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-25 05:44:38,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-25 05:44:38,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-25 05:44:38,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-01-25 05:44:38,842 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 27 [2018-01-25 05:44:38,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:44:38,842 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-01-25 05:44:38,842 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:44:38,842 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-01-25 05:44:38,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 05:44:38,843 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:44:38,843 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:44:38,843 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-25 05:44:38,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1523422321, now seen corresponding path program 1 times [2018-01-25 05:44:38,843 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:44:38,844 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:44:38,844 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:44:38,844 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:44:38,844 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:44:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:44:38,863 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:44:38,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:44:38,925 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:44:38,925 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:44:38,926 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-01-25 05:44:38,928 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [10], [11], [12], [13], [14], [15], [19], [21], [22], [24], [28], [42], [43], [44], [47], [50], [53], [56], [60], [61], [62], [63], [66], [67], [68] [2018-01-25 05:44:38,990 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:44:38,990 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 05:45:02,985 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 05:45:02,986 INFO L268 AbstractInterpreter]: Visited 28 different actions 52 times. Merged at 11 different actions 21 times. Never widened. Found 4 fixpoints after 4 different actions. Largest state had 26 variables. [2018-01-25 05:45:03,005 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 05:45:03,006 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:45:03,006 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 05:45:03,014 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:45:03,014 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:45:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:45:03,064 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:45:03,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:45:03,096 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:45:03,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:45:03,343 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:45:03,343 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 05:45:03,349 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:45:03,349 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:45:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:45:03,419 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:45:03,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:45:03,424 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:45:03,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:45:03,499 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 05:45:03,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5] total 11 [2018-01-25 05:45:03,499 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 05:45:03,499 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:45:03,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:45:03,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-01-25 05:45:03,500 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 8 states. [2018-01-25 05:45:03,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:45:03,544 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2018-01-25 05:45:03,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:45:03,544 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-01-25 05:45:03,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:45:03,545 INFO L225 Difference]: With dead ends: 77 [2018-01-25 05:45:03,545 INFO L226 Difference]: Without dead ends: 48 [2018-01-25 05:45:03,546 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 104 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-01-25 05:45:03,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-25 05:45:03,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-01-25 05:45:03,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-25 05:45:03,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-01-25 05:45:03,550 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 28 [2018-01-25 05:45:03,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:45:03,550 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-01-25 05:45:03,551 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:45:03,551 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-01-25 05:45:03,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 05:45:03,551 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:45:03,551 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:45:03,551 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-25 05:45:03,551 INFO L82 PathProgramCache]: Analyzing trace with hash -944250098, now seen corresponding path program 2 times [2018-01-25 05:45:03,552 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:45:03,552 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:45:03,552 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:45:03,552 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:45:03,553 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:45:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:45:03,575 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:45:03,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:45:03,632 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:45:03,632 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:45:03,632 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 05:45:03,632 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:45:03,632 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:45:03,632 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:45:03,644 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 05:45:03,644 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 05:45:03,670 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 05:45:03,674 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 05:45:03,676 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:45: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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 05:45:03,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 05:45:03,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 05:45:03,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 05:45:03,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-25 05:45:03,711 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 05:45:03,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-25 05:45:03,788 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 05:45:03,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [6] total 8 [2018-01-25 05:45:03,789 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:45:03,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:45:03,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:45:03,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:45:03,790 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 3 states. [2018-01-25 05:45:03,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:45:03,811 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-01-25 05:45:03,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:45:03,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-01-25 05:45:03,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:45:03,813 INFO L225 Difference]: With dead ends: 48 [2018-01-25 05:45:03,813 INFO L226 Difference]: Without dead ends: 46 [2018-01-25 05:45:03,813 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:45:03,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-25 05:45:03,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-25 05:45:03,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-25 05:45:03,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-01-25 05:45:03,819 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 29 [2018-01-25 05:45:03,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:45:03,819 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-01-25 05:45:03,819 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:45:03,819 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-01-25 05:45:03,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-25 05:45:03,821 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:45:03,821 INFO L322 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:45:03,821 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr7RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr4RequiresViolation, ULTIMATE.initErr0RequiresViolation, ULTIMATE.initErr6RequiresViolation, ULTIMATE.initErr5RequiresViolation, fooErr1RequiresViolation, fooErr5RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr4RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-25 05:45:03,821 INFO L82 PathProgramCache]: Analyzing trace with hash -2111815019, now seen corresponding path program 1 times [2018-01-25 05:45:03,821 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:45:03,822 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:45:03,822 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 05:45:03,822 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:45:03,822 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:45:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:45:03,857 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:45:03,940 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-25 05:45:03,940 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:45:03,940 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:45:03,940 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2018-01-25 05:45:03,941 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [10], [11], [12], [13], [14], [15], [19], [21], [22], [24], [30], [31], [35], [42], [43], [44], [47], [50], [53], [56], [60], [61], [62], [63], [64], [65], [66], [67], [68] [2018-01-25 05:45:03,942 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:45:03,942 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 05:45:24,385 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 05:45:24,386 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 05:45:24,386 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:45:24,386 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:45:24,386 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 05:45:24,391 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:45:24,391 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:45:24,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:45:24,430 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:45:24,434 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 05:45:24,434 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 05:45:24,438 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 05:45:24,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:45:24 BoogieIcfgContainer [2018-01-25 05:45:24,438 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:45:24,439 INFO L168 Benchmark]: Toolchain (without parser) took 48065.00 ms. Allocated memory was 306.7 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 266.6 MB in the beginning and 788.6 MB in the end (delta: -522.0 MB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. [2018-01-25 05:45:24,439 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 306.7 MB. Free memory is still 272.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:45:24,440 INFO L168 Benchmark]: CACSL2BoogieTranslator took 202.27 ms. Allocated memory is still 306.7 MB. Free memory was 265.6 MB in the beginning and 254.7 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:45:24,440 INFO L168 Benchmark]: Boogie Preprocessor took 47.57 ms. Allocated memory is still 306.7 MB. Free memory was 254.7 MB in the beginning and 252.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:45:24,440 INFO L168 Benchmark]: RCFGBuilder took 352.05 ms. Allocated memory is still 306.7 MB. Free memory was 252.7 MB in the beginning and 231.7 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:45:24,440 INFO L168 Benchmark]: TraceAbstraction took 47455.68 ms. Allocated memory was 306.7 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 231.7 MB in the beginning and 788.6 MB in the end (delta: -556.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. [2018-01-25 05:45:24,441 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.21 ms. Allocated memory is still 306.7 MB. Free memory is still 272.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 202.27 ms. Allocated memory is still 306.7 MB. Free memory was 265.6 MB in the beginning and 254.7 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 47.57 ms. Allocated memory is still 306.7 MB. Free memory was 254.7 MB in the beginning and 252.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 352.05 ms. Allocated memory is still 306.7 MB. Free memory was 252.7 MB in the beginning and 231.7 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 47455.68 ms. Allocated memory was 306.7 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 231.7 MB in the beginning and 788.6 MB in the end (delta: -556.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 27 LocStat_MAX_WEQGRAPH_SIZE : 16 LocStat_MAX_SIZEOF_WEQEDGELABEL : 6 LocStat_NO_SUPPORTING_EQUALITIES : 381 LocStat_NO_SUPPORTING_DISEQUALITIES : 163 LocStat_NO_DISJUNCTIONS : -54 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 36 TransStat_MAX_WEQGRAPH_SIZE : 6 TransStat_MAX_SIZEOF_WEQEDGELABEL : 2 TransStat_NO_SUPPORTING_EQUALITIES : 94 TransStat_NO_SUPPORTING_DISEQUALITIES : 16 TransStat_NO_DISJUNCTIONS : 37 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.857526 RENAME_VARIABLES(MILLISECONDS) : 0.118054 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.358722 PROJECTAWAY(MILLISECONDS) : 0.038327 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.027259 DISJOIN(MILLISECONDS) : 2.172116 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.138276 ADD_EQUALITY(MILLISECONDS) : 0.012528 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.005171 #CONJOIN_DISJUNCTIVE : 89 #RENAME_VARIABLES : 172 #UNFREEZE : 0 #CONJOIN : 228 #PROJECTAWAY : 146 #ADD_WEAK_EQUALITY : 46 #DISJOIN : 13 #RENAME_VARIABLES_DISJUNCTIVE : 170 #ADD_EQUALITY : 121 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 740). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 743). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 743). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 744). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 751). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 750). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 750). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 751). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 750). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 751). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 751). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 750). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - TimeoutResultAtElement [Line: 746]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 746). Cancelled while BasicCegarLoop was analyzing trace of length 40 with TraceHistMax 4, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 6 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 60 locations, 23 error locations. TIMEOUT Result, 47.4s OverallTime, 10 OverallIterations, 4 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 337 SDtfs, 117 SDslu, 342 SDs, 0 SdLazy, 224 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 171 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 44.5s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 247 NumberOfCodeBlocks, 245 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 317 ConstructedInterpolants, 0 QuantifiedInterpolants, 13711 SizeOfPredicates, 3 NumberOfNonLiveVariables, 498 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 6/14 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/test-memleak_nexttime_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-45-24-450.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-memleak_nexttime_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_05-45-24-450.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-memleak_nexttime_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_05-45-24-450.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-memleak_nexttime_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_05-45-24-450.csv Completed graceful shutdown