java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label11_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 00:59:34,145 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 00:59:34,147 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 00:59:34,159 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 00:59:34,160 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 00:59:34,161 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 00:59:34,162 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 00:59:34,166 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 00:59:34,168 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 00:59:34,169 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 00:59:34,170 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 00:59:34,170 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 00:59:34,171 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 00:59:34,172 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 00:59:34,173 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 00:59:34,174 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 00:59:34,175 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 00:59:34,177 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 00:59:34,179 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 00:59:34,180 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 00:59:34,181 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 00:59:34,183 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 00:59:34,185 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 00:59:34,186 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 00:59:34,186 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 00:59:34,187 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 00:59:34,188 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 00:59:34,188 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 00:59:34,189 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 00:59:34,190 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 00:59:34,191 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 00:59:34,191 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 00:59:34,192 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 00:59:34,192 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 00:59:34,193 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 00:59:34,194 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 00:59:34,194 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-07 00:59:34,210 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 00:59:34,211 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 00:59:34,212 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 00:59:34,213 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 00:59:34,213 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 00:59:34,213 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 00:59:34,213 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 00:59:34,213 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 00:59:34,214 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 00:59:34,214 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 00:59:34,214 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 00:59:34,215 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 00:59:34,215 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 00:59:34,216 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 00:59:34,216 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 00:59:34,216 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 00:59:34,216 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 00:59:34,216 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 00:59:34,216 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 00:59:34,218 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 00:59:34,218 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 00:59:34,218 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 00:59:34,219 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 00:59:34,219 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 00:59:34,219 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 00:59:34,220 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 00:59:34,220 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 00:59:34,220 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 00:59:34,220 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 00:59:34,220 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 00:59:34,221 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 00:59:34,221 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 00:59:34,221 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 00:59:34,221 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 00:59:34,296 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 00:59:34,310 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 00:59:34,314 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 00:59:34,316 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 00:59:34,316 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 00:59:34,317 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label11_true-unreach-call_false-termination.c [2018-11-07 00:59:34,378 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5cd3aba1/c059ea58a03a43c48d0c2ffcc0203ed3/FLAG8ca77ff82 [2018-11-07 00:59:34,997 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 00:59:34,999 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label11_true-unreach-call_false-termination.c [2018-11-07 00:59:35,015 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5cd3aba1/c059ea58a03a43c48d0c2ffcc0203ed3/FLAG8ca77ff82 [2018-11-07 00:59:35,034 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5cd3aba1/c059ea58a03a43c48d0c2ffcc0203ed3 [2018-11-07 00:59:35,047 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 00:59:35,050 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 00:59:35,051 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 00:59:35,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 00:59:35,059 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 00:59:35,060 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:59:35" (1/1) ... [2018-11-07 00:59:35,064 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@311ff004 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:35, skipping insertion in model container [2018-11-07 00:59:35,064 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:59:35" (1/1) ... [2018-11-07 00:59:35,076 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 00:59:35,154 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 00:59:35,679 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 00:59:35,686 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 00:59:35,805 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 00:59:35,825 INFO L193 MainTranslator]: Completed translation [2018-11-07 00:59:35,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:35 WrapperNode [2018-11-07 00:59:35,826 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 00:59:35,827 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 00:59:35,827 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 00:59:35,827 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 00:59:35,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:35" (1/1) ... [2018-11-07 00:59:35,948 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:35" (1/1) ... [2018-11-07 00:59:35,959 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 00:59:35,960 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 00:59:35,960 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 00:59:35,960 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 00:59:35,970 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:35" (1/1) ... [2018-11-07 00:59:35,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:35" (1/1) ... [2018-11-07 00:59:35,975 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:35" (1/1) ... [2018-11-07 00:59:35,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:35" (1/1) ... [2018-11-07 00:59:36,039 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:35" (1/1) ... [2018-11-07 00:59:36,057 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:35" (1/1) ... [2018-11-07 00:59:36,066 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:35" (1/1) ... [2018-11-07 00:59:36,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 00:59:36,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 00:59:36,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 00:59:36,085 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 00:59:36,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:35" (1/1) ... No working directory specified, using /storage/repos/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-11-07 00:59:36,156 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 00:59:36,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 00:59:36,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 00:59:36,157 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 00:59:36,157 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 00:59:36,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 00:59:36,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 00:59:36,158 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 00:59:36,158 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 00:59:39,222 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 00:59:39,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:59:39 BoogieIcfgContainer [2018-11-07 00:59:39,228 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 00:59:39,229 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 00:59:39,229 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 00:59:39,233 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 00:59:39,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:59:35" (1/3) ... [2018-11-07 00:59:39,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ad110f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:59:39, skipping insertion in model container [2018-11-07 00:59:39,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:59:35" (2/3) ... [2018-11-07 00:59:39,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ad110f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:59:39, skipping insertion in model container [2018-11-07 00:59:39,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:59:39" (3/3) ... [2018-11-07 00:59:39,237 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label11_true-unreach-call_false-termination.c [2018-11-07 00:59:39,250 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 00:59:39,261 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 00:59:39,281 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 00:59:39,339 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 00:59:39,339 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 00:59:39,339 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 00:59:39,339 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 00:59:39,340 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 00:59:39,340 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 00:59:39,340 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 00:59:39,340 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 00:59:39,381 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-07 00:59:39,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-11-07 00:59:39,398 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 00:59:39,399 INFO L375 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, 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, 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, 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, 1, 1, 1, 1] [2018-11-07 00:59:39,402 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 00:59:39,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 00:59:39,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1894719720, now seen corresponding path program 1 times [2018-11-07 00:59:39,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 00:59:39,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:59:39,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 00:59:39,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:59:39,473 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 00:59:39,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 00:59:40,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 00:59:40,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 00:59:40,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 00:59:40,179 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 00:59:40,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 00:59:40,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 00:59:40,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 00:59:40,204 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-11-07 00:59:41,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 00:59:41,734 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-11-07 00:59:41,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 00:59:41,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2018-11-07 00:59:41,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 00:59:41,758 INFO L225 Difference]: With dead ends: 550 [2018-11-07 00:59:41,758 INFO L226 Difference]: Without dead ends: 340 [2018-11-07 00:59:41,765 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 00:59:41,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-07 00:59:41,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-11-07 00:59:41,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-07 00:59:41,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 562 transitions. [2018-11-07 00:59:41,839 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 562 transitions. Word has length 116 [2018-11-07 00:59:41,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 00:59:41,840 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 562 transitions. [2018-11-07 00:59:41,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 00:59:41,841 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 562 transitions. [2018-11-07 00:59:41,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-07 00:59:41,848 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 00:59:41,849 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 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, 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, 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, 1, 1] [2018-11-07 00:59:41,849 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 00:59:41,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 00:59:41,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1844932745, now seen corresponding path program 1 times [2018-11-07 00:59:41,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 00:59:41,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:59:41,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 00:59:41,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:59:41,852 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 00:59:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 00:59:42,023 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 00:59:42,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 00:59:42,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 00:59:42,024 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 00:59:42,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 00:59:42,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 00:59:42,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 00:59:42,028 INFO L87 Difference]: Start difference. First operand 340 states and 562 transitions. Second operand 6 states. [2018-11-07 00:59:43,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 00:59:43,843 INFO L93 Difference]: Finished difference Result 888 states and 1491 transitions. [2018-11-07 00:59:43,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 00:59:43,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-11-07 00:59:43,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 00:59:43,851 INFO L225 Difference]: With dead ends: 888 [2018-11-07 00:59:43,852 INFO L226 Difference]: Without dead ends: 554 [2018-11-07 00:59:43,855 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 00:59:43,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-11-07 00:59:43,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 539. [2018-11-07 00:59:43,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-11-07 00:59:43,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 827 transitions. [2018-11-07 00:59:43,901 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 827 transitions. Word has length 127 [2018-11-07 00:59:43,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 00:59:43,901 INFO L480 AbstractCegarLoop]: Abstraction has 539 states and 827 transitions. [2018-11-07 00:59:43,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 00:59:43,902 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 827 transitions. [2018-11-07 00:59:43,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-07 00:59:43,908 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 00:59:43,908 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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, 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, 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, 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, 1] [2018-11-07 00:59:43,908 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 00:59:43,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 00:59:43,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1950525493, now seen corresponding path program 1 times [2018-11-07 00:59:43,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 00:59:43,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:59:43,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 00:59:43,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:59:43,910 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 00:59:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 00:59:44,513 WARN L179 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-07 00:59:44,778 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 00:59:44,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 00:59:44,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 00:59:44,779 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 00:59:44,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 00:59:44,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 00:59:44,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 00:59:44,781 INFO L87 Difference]: Start difference. First operand 539 states and 827 transitions. Second operand 5 states. [2018-11-07 00:59:46,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 00:59:46,760 INFO L93 Difference]: Finished difference Result 1210 states and 1896 transitions. [2018-11-07 00:59:46,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 00:59:46,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2018-11-07 00:59:46,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 00:59:46,770 INFO L225 Difference]: With dead ends: 1210 [2018-11-07 00:59:46,770 INFO L226 Difference]: Without dead ends: 536 [2018-11-07 00:59:46,773 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 00:59:46,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-11-07 00:59:46,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2018-11-07 00:59:46,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-11-07 00:59:46,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 787 transitions. [2018-11-07 00:59:46,819 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 787 transitions. Word has length 128 [2018-11-07 00:59:46,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 00:59:46,820 INFO L480 AbstractCegarLoop]: Abstraction has 536 states and 787 transitions. [2018-11-07 00:59:46,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 00:59:46,820 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 787 transitions. [2018-11-07 00:59:46,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-07 00:59:46,825 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 00:59:46,825 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 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, 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, 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-11-07 00:59:46,825 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 00:59:46,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 00:59:46,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1220128141, now seen corresponding path program 1 times [2018-11-07 00:59:46,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 00:59:46,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:59:46,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 00:59:46,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:59:46,828 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 00:59:46,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 00:59:47,531 WARN L179 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-11-07 00:59:47,866 WARN L179 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-11-07 00:59:47,943 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 00:59:47,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 00:59:47,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 00:59:47,943 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 00:59:47,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 00:59:47,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 00:59:47,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 00:59:47,945 INFO L87 Difference]: Start difference. First operand 536 states and 787 transitions. Second operand 5 states. [2018-11-07 00:59:49,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 00:59:49,726 INFO L93 Difference]: Finished difference Result 1204 states and 1799 transitions. [2018-11-07 00:59:49,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 00:59:49,729 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2018-11-07 00:59:49,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 00:59:49,733 INFO L225 Difference]: With dead ends: 1204 [2018-11-07 00:59:49,733 INFO L226 Difference]: Without dead ends: 535 [2018-11-07 00:59:49,735 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 00:59:49,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2018-11-07 00:59:49,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2018-11-07 00:59:49,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-11-07 00:59:49,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 782 transitions. [2018-11-07 00:59:49,752 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 782 transitions. Word has length 129 [2018-11-07 00:59:49,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 00:59:49,753 INFO L480 AbstractCegarLoop]: Abstraction has 535 states and 782 transitions. [2018-11-07 00:59:49,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 00:59:49,753 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 782 transitions. [2018-11-07 00:59:49,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-07 00:59:49,756 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 00:59:49,756 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 00:59:49,756 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 00:59:49,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 00:59:49,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1858048063, now seen corresponding path program 1 times [2018-11-07 00:59:49,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 00:59:49,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:59:49,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 00:59:49,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:59:49,758 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 00:59:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 00:59:49,990 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 00:59:49,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 00:59:49,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 00:59:49,990 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 00:59:49,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 00:59:49,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 00:59:49,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 00:59:49,992 INFO L87 Difference]: Start difference. First operand 535 states and 782 transitions. Second operand 3 states. [2018-11-07 00:59:50,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 00:59:50,832 INFO L93 Difference]: Finished difference Result 1521 states and 2300 transitions. [2018-11-07 00:59:50,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 00:59:50,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2018-11-07 00:59:50,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 00:59:50,843 INFO L225 Difference]: With dead ends: 1521 [2018-11-07 00:59:50,843 INFO L226 Difference]: Without dead ends: 992 [2018-11-07 00:59:50,846 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 00:59:50,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-11-07 00:59:50,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 992. [2018-11-07 00:59:50,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 992 states. [2018-11-07 00:59:50,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1411 transitions. [2018-11-07 00:59:50,878 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1411 transitions. Word has length 134 [2018-11-07 00:59:50,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 00:59:50,879 INFO L480 AbstractCegarLoop]: Abstraction has 992 states and 1411 transitions. [2018-11-07 00:59:50,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 00:59:50,879 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1411 transitions. [2018-11-07 00:59:50,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-07 00:59:50,883 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 00:59:50,883 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 00:59:50,884 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 00:59:50,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 00:59:50,884 INFO L82 PathProgramCache]: Analyzing trace with hash -865633433, now seen corresponding path program 1 times [2018-11-07 00:59:50,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 00:59:50,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:59:50,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 00:59:50,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:59:50,886 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 00:59:50,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 00:59:51,073 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 00:59:51,099 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 00:59:51,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 00:59:51,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 00:59:51,100 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 00:59:51,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 00:59:51,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 00:59:51,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 00:59:51,101 INFO L87 Difference]: Start difference. First operand 992 states and 1411 transitions. Second operand 6 states. [2018-11-07 00:59:52,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 00:59:52,117 INFO L93 Difference]: Finished difference Result 2947 states and 4374 transitions. [2018-11-07 00:59:52,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 00:59:52,118 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2018-11-07 00:59:52,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 00:59:52,130 INFO L225 Difference]: With dead ends: 2947 [2018-11-07 00:59:52,130 INFO L226 Difference]: Without dead ends: 1961 [2018-11-07 00:59:52,138 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 00:59:52,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2018-11-07 00:59:52,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1928. [2018-11-07 00:59:52,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-11-07 00:59:52,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2554 transitions. [2018-11-07 00:59:52,209 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2554 transitions. Word has length 135 [2018-11-07 00:59:52,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 00:59:52,210 INFO L480 AbstractCegarLoop]: Abstraction has 1928 states and 2554 transitions. [2018-11-07 00:59:52,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 00:59:52,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2554 transitions. [2018-11-07 00:59:52,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-07 00:59:52,218 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 00:59:52,218 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 00:59:52,218 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 00:59:52,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 00:59:52,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1578661412, now seen corresponding path program 1 times [2018-11-07 00:59:52,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 00:59:52,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:59:52,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 00:59:52,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:59:52,221 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 00:59:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 00:59:52,518 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 43 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 00:59:52,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 00:59:52,518 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 00:59:52,520 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 152 with the following transitions: [2018-11-07 00:59:52,522 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 00:59:52,597 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 00:59:52,597 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 01:00:01,752 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 01:00:01,754 INFO L272 AbstractInterpreter]: Visited 69 different actions 69 times. Never merged. Never widened. Never found a fixpoint. Largest state had 42 variables. [2018-11-07 01:00:01,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:00:01,765 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 01:00:04,735 INFO L227 lantSequenceWeakener]: Weakened 95 states. On average, predicates are now at 79.81% of their original sizes. [2018-11-07 01:00:04,736 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 01:00:06,097 INFO L415 sIntCurrentIteration]: We unified 150 AI predicates to 150 [2018-11-07 01:00:06,097 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 01:00:06,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 01:00:06,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2018-11-07 01:00:06,098 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 01:00:06,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 01:00:06,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 01:00:06,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-07 01:00:06,100 INFO L87 Difference]: Start difference. First operand 1928 states and 2554 transitions. Second operand 12 states. [2018-11-07 01:00:19,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 01:00:19,370 INFO L93 Difference]: Finished difference Result 3911 states and 5191 transitions. [2018-11-07 01:00:19,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 01:00:19,371 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 151 [2018-11-07 01:00:19,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 01:00:19,384 INFO L225 Difference]: With dead ends: 3911 [2018-11-07 01:00:19,384 INFO L226 Difference]: Without dead ends: 1989 [2018-11-07 01:00:19,390 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 156 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2018-11-07 01:00:19,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states. [2018-11-07 01:00:19,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1989. [2018-11-07 01:00:19,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2018-11-07 01:00:19,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 2620 transitions. [2018-11-07 01:00:19,464 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 2620 transitions. Word has length 151 [2018-11-07 01:00:19,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 01:00:19,464 INFO L480 AbstractCegarLoop]: Abstraction has 1989 states and 2620 transitions. [2018-11-07 01:00:19,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 01:00:19,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 2620 transitions. [2018-11-07 01:00:19,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-07 01:00:19,475 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 01:00:19,476 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 01:00:19,476 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 01:00:19,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:00:19,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1993472409, now seen corresponding path program 1 times [2018-11-07 01:00:19,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 01:00:19,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:00:19,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 01:00:19,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 01:00:19,478 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 01:00:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 01:00:19,748 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 47 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-07 01:00:19,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 01:00:19,748 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 01:00:19,749 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 161 with the following transitions: [2018-11-07 01:00:19,749 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 01:00:19,756 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 01:00:19,757 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 01:00:48,907 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 01:00:48,908 INFO L272 AbstractInterpreter]: Visited 121 different actions 188 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 01:00:48,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 01:00:48,915 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 01:00:53,835 INFO L227 lantSequenceWeakener]: Weakened 111 states. On average, predicates are now at 81.03% of their original sizes. [2018-11-07 01:00:53,835 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 01:01:45,105 INFO L415 sIntCurrentIteration]: We unified 159 AI predicates to 159 [2018-11-07 01:01:45,106 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 01:01:45,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 01:01:45,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [6] total 29 [2018-11-07 01:01:45,106 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 01:01:45,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-07 01:01:45,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-07 01:01:45,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2018-11-07 01:01:45,108 INFO L87 Difference]: Start difference. First operand 1989 states and 2620 transitions. Second operand 25 states. Received shutdown request... [2018-11-07 01:03:52,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-07 01:03:52,787 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 01:03:52,793 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 01:03:52,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:03:52 BoogieIcfgContainer [2018-11-07 01:03:52,794 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 01:03:52,795 INFO L168 Benchmark]: Toolchain (without parser) took 257747.16 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -681.0 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-11-07 01:03:52,796 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 01:03:52,797 INFO L168 Benchmark]: CACSL2BoogieTranslator took 775.41 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-07 01:03:52,799 INFO L168 Benchmark]: Boogie Procedure Inliner took 132.38 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -799.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. [2018-11-07 01:03:52,800 INFO L168 Benchmark]: Boogie Preprocessor took 124.24 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 01:03:52,800 INFO L168 Benchmark]: RCFGBuilder took 3143.54 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 104.2 MB). Peak memory consumption was 104.2 MB. Max. memory is 7.1 GB. [2018-11-07 01:03:52,802 INFO L168 Benchmark]: TraceAbstraction took 253565.30 ms. Allocated memory was 2.3 GB in the beginning and 3.4 GB in the end (delta: 1.1 GB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: -17.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-11-07 01:03:52,808 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 775.41 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 132.38 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 733.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -799.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 124.24 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3143.54 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 104.2 MB). Peak memory consumption was 104.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 253565.30 ms. Allocated memory was 2.3 GB in the beginning and 3.4 GB in the end (delta: 1.1 GB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: -17.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 503]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 503). Cancelled while BasicCegarLoop was constructing difference of abstraction (1989states) and FLOYD_HOARE automaton (currently 18 states, 25 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 37 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. TIMEOUT Result, 253.4s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 150.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 977 SDtfs, 3325 SDslu, 637 SDs, 0 SdLazy, 4428 SolverSat, 846 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 53.0s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 374 GetRequests, 286 SyntacticMatches, 14 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 75.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1989occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 38.4s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, 0.994115745595737 AbsIntWeakeningRatio, 0.2459546925566343 AbsIntAvgWeakeningVarsNumRemoved, 1478.8349514563106 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 48 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1080 NumberOfCodeBlocks, 1080 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1072 ConstructedInterpolants, 0 QuantifiedInterpolants, 814335 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 155/172 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown