java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label06_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:08:19,122 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:08:19,124 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:08:19,136 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:08:19,137 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:08:19,138 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:08:19,139 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:08:19,143 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:08:19,147 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:08:19,148 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:08:19,149 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:08:19,150 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:08:19,151 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:08:19,154 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:08:19,156 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:08:19,157 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:08:19,158 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:08:19,160 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:08:19,161 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:08:19,163 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:08:19,164 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:08:19,166 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:08:19,171 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:08:19,174 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:08:19,174 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:08:19,175 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:08:19,176 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:08:19,180 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:08:19,181 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:08:19,182 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:08:19,182 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:08:19,184 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:08:19,184 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:08:19,184 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:08:19,187 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:08:19,188 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:08:19,189 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-27 06:08:19,219 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:08:19,219 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:08:19,220 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 06:08:19,220 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 06:08:19,220 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 06:08:19,220 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 06:08:19,221 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-27 06:08:19,223 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 06:08:19,223 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-27 06:08:19,223 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 06:08:19,223 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 06:08:19,224 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 06:08:19,224 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 06:08:19,224 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 06:08:19,225 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:08:19,225 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:08:19,225 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:08:19,226 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 06:08:19,226 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 06:08:19,226 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 06:08:19,226 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:08:19,226 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 06:08:19,227 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:08:19,227 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:08:19,227 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 06:08:19,227 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 06:08:19,227 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 06:08:19,228 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:08:19,228 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 06:08:19,228 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 06:08:19,228 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 06:08:19,228 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 06:08:19,229 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 06:08:19,230 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 06:08:19,230 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 06:08:19,231 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 06:08:19,277 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:08:19,291 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:08:19,296 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:08:19,297 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:08:19,298 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:08:19,298 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label06_true-unreach-call_false-termination.c [2018-10-27 06:08:19,356 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ef4cfa6e5/ac9dbf80c070466a9da8bdee97a6d65d/FLAGd6be5fd6e [2018-10-27 06:08:19,955 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:08:19,957 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label06_true-unreach-call_false-termination.c [2018-10-27 06:08:19,978 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ef4cfa6e5/ac9dbf80c070466a9da8bdee97a6d65d/FLAGd6be5fd6e [2018-10-27 06:08:19,992 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/ef4cfa6e5/ac9dbf80c070466a9da8bdee97a6d65d [2018-10-27 06:08:20,003 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:08:20,005 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 06:08:20,006 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:08:20,006 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:08:20,010 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:08:20,012 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:08:19" (1/1) ... [2018-10-27 06:08:20,015 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@206c1d7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:20, skipping insertion in model container [2018-10-27 06:08:20,015 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:08:19" (1/1) ... [2018-10-27 06:08:20,026 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:08:20,082 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:08:20,547 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:08:20,551 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:08:20,659 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:08:20,683 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:08:20,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:20 WrapperNode [2018-10-27 06:08:20,684 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:08:20,685 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:08:20,686 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:08:20,686 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:08:20,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:20" (1/1) ... [2018-10-27 06:08:20,732 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:20" (1/1) ... [2018-10-27 06:08:20,913 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:08:20,914 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:08:20,914 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:08:20,914 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:08:20,925 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:20" (1/1) ... [2018-10-27 06:08:20,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:20" (1/1) ... [2018-10-27 06:08:20,938 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:20" (1/1) ... [2018-10-27 06:08:20,939 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:20" (1/1) ... [2018-10-27 06:08:20,961 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:20" (1/1) ... [2018-10-27 06:08:20,973 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:20" (1/1) ... [2018-10-27 06:08:20,979 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:20" (1/1) ... [2018-10-27 06:08:20,985 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:08:20,986 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:08:20,986 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:08:20,986 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:08:20,987 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 06:08:21,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 06:08:21,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 06:08:21,065 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-27 06:08:21,065 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-27 06:08:21,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:08:21,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:08:21,065 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 06:08:21,067 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 06:08:24,477 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:08:24,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:24 BoogieIcfgContainer [2018-10-27 06:08:24,478 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:08:24,479 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 06:08:24,479 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 06:08:24,483 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 06:08:24,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 06:08:19" (1/3) ... [2018-10-27 06:08:24,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@274c7641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 06:08:24, skipping insertion in model container [2018-10-27 06:08:24,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:08:20" (2/3) ... [2018-10-27 06:08:24,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@274c7641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 06:08:24, skipping insertion in model container [2018-10-27 06:08:24,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:08:24" (3/3) ... [2018-10-27 06:08:24,488 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label06_true-unreach-call_false-termination.c [2018-10-27 06:08:24,500 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 06:08:24,511 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 06:08:24,533 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 06:08:24,577 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 06:08:24,577 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 06:08:24,578 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 06:08:24,578 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:08:24,578 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:08:24,578 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 06:08:24,579 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:08:24,579 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 06:08:24,608 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-10-27 06:08:24,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-27 06:08:24,625 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:08:24,627 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:24,630 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:08:24,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:24,639 INFO L82 PathProgramCache]: Analyzing trace with hash 482475453, now seen corresponding path program 1 times [2018-10-27 06:08:24,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:08:24,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:24,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:24,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:24,710 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:08:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:25,311 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 06:08:25,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:25,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:08:25,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:08:25,483 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:08:25,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 06:08:25,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:08:25,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:08:25,512 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-10-27 06:08:26,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:26,845 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-10-27 06:08:26,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:08:26,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2018-10-27 06:08:26,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:08:26,867 INFO L225 Difference]: With dead ends: 550 [2018-10-27 06:08:26,867 INFO L226 Difference]: Without dead ends: 340 [2018-10-27 06:08:26,874 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-10-27 06:08:26,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-27 06:08:26,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-10-27 06:08:26,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-27 06:08:26,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 541 transitions. [2018-10-27 06:08:26,958 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 541 transitions. Word has length 131 [2018-10-27 06:08:26,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:08:26,959 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 541 transitions. [2018-10-27 06:08:26,959 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 06:08:26,960 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 541 transitions. [2018-10-27 06:08:26,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-27 06:08:26,970 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:08:26,970 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:26,970 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:08:26,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:26,971 INFO L82 PathProgramCache]: Analyzing trace with hash -359292034, now seen corresponding path program 1 times [2018-10-27 06:08:26,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:08:26,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:26,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:26,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:26,973 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:08:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:27,238 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-27 06:08:27,423 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:27,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:08:27,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 06:08:27,424 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:08:27,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 06:08:27,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 06:08:27,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 06:08:27,427 INFO L87 Difference]: Start difference. First operand 340 states and 541 transitions. Second operand 6 states. [2018-10-27 06:08:29,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:29,360 INFO L93 Difference]: Finished difference Result 1075 states and 1784 transitions. [2018-10-27 06:08:29,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 06:08:29,363 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2018-10-27 06:08:29,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:08:29,374 INFO L225 Difference]: With dead ends: 1075 [2018-10-27 06:08:29,374 INFO L226 Difference]: Without dead ends: 741 [2018-10-27 06:08:29,380 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-27 06:08:29,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-10-27 06:08:29,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 724. [2018-10-27 06:08:29,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-10-27 06:08:29,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1120 transitions. [2018-10-27 06:08:29,444 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1120 transitions. Word has length 142 [2018-10-27 06:08:29,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:08:29,444 INFO L481 AbstractCegarLoop]: Abstraction has 724 states and 1120 transitions. [2018-10-27 06:08:29,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 06:08:29,445 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1120 transitions. [2018-10-27 06:08:29,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-27 06:08:29,451 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:08:29,451 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:29,451 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:08:29,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:29,454 INFO L82 PathProgramCache]: Analyzing trace with hash -879449942, now seen corresponding path program 1 times [2018-10-27 06:08:29,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:08:29,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:29,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:29,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:29,457 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:08:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:29,940 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:29,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:08:29,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:08:29,941 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:08:29,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 06:08:29,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:08:29,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:08:29,942 INFO L87 Difference]: Start difference. First operand 724 states and 1120 transitions. Second operand 5 states. [2018-10-27 06:08:31,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:31,981 INFO L93 Difference]: Finished difference Result 1578 states and 2483 transitions. [2018-10-27 06:08:31,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:08:31,982 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2018-10-27 06:08:31,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:08:31,992 INFO L225 Difference]: With dead ends: 1578 [2018-10-27 06:08:31,993 INFO L226 Difference]: Without dead ends: 721 [2018-10-27 06:08:31,997 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:08:31,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2018-10-27 06:08:32,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 721. [2018-10-27 06:08:32,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2018-10-27 06:08:32,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1044 transitions. [2018-10-27 06:08:32,043 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1044 transitions. Word has length 143 [2018-10-27 06:08:32,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:08:32,044 INFO L481 AbstractCegarLoop]: Abstraction has 721 states and 1044 transitions. [2018-10-27 06:08:32,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 06:08:32,044 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1044 transitions. [2018-10-27 06:08:32,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-27 06:08:32,048 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:08:32,048 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:08:32,049 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:08:32,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:32,049 INFO L82 PathProgramCache]: Analyzing trace with hash 353210034, now seen corresponding path program 1 times [2018-10-27 06:08:32,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:08:32,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:32,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:32,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:32,054 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:08:32,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:32,279 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:32,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:08:32,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:08:32,280 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:08:32,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 06:08:32,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:08:32,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:08:32,281 INFO L87 Difference]: Start difference. First operand 721 states and 1044 transitions. Second operand 3 states. [2018-10-27 06:08:34,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:34,013 INFO L93 Difference]: Finished difference Result 1871 states and 2749 transitions. [2018-10-27 06:08:34,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:08:34,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2018-10-27 06:08:34,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:08:34,024 INFO L225 Difference]: With dead ends: 1871 [2018-10-27 06:08:34,024 INFO L226 Difference]: Without dead ends: 1156 [2018-10-27 06:08:34,028 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-10-27 06:08:34,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2018-10-27 06:08:34,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1153. [2018-10-27 06:08:34,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2018-10-27 06:08:34,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1553 transitions. [2018-10-27 06:08:34,075 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1553 transitions. Word has length 147 [2018-10-27 06:08:34,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:08:34,076 INFO L481 AbstractCegarLoop]: Abstraction has 1153 states and 1553 transitions. [2018-10-27 06:08:34,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 06:08:34,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1553 transitions. [2018-10-27 06:08:34,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-27 06:08:34,084 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:08:34,084 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2018-10-27 06:08:34,084 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:08:34,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:34,085 INFO L82 PathProgramCache]: Analyzing trace with hash -2123069123, now seen corresponding path program 1 times [2018-10-27 06:08:34,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:08:34,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:34,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:34,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:34,086 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:08:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:34,286 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-27 06:08:34,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:08:34,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 06:08:34,287 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:08:34,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 06:08:34,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 06:08:34,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 06:08:34,288 INFO L87 Difference]: Start difference. First operand 1153 states and 1553 transitions. Second operand 4 states. [2018-10-27 06:08:35,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:35,388 INFO L93 Difference]: Finished difference Result 3973 states and 5595 transitions. [2018-10-27 06:08:35,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:08:35,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2018-10-27 06:08:35,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:08:35,420 INFO L225 Difference]: With dead ends: 3973 [2018-10-27 06:08:35,420 INFO L226 Difference]: Without dead ends: 2826 [2018-10-27 06:08:35,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-10-27 06:08:35,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2826 states. [2018-10-27 06:08:35,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2826 to 2796. [2018-10-27 06:08:35,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2796 states. [2018-10-27 06:08:35,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2796 states to 2796 states and 3650 transitions. [2018-10-27 06:08:35,540 INFO L78 Accepts]: Start accepts. Automaton has 2796 states and 3650 transitions. Word has length 168 [2018-10-27 06:08:35,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:08:35,540 INFO L481 AbstractCegarLoop]: Abstraction has 2796 states and 3650 transitions. [2018-10-27 06:08:35,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 06:08:35,541 INFO L276 IsEmpty]: Start isEmpty. Operand 2796 states and 3650 transitions. [2018-10-27 06:08:35,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-27 06:08:35,553 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:08:35,553 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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-10-27 06:08:35,553 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:08:35,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:35,554 INFO L82 PathProgramCache]: Analyzing trace with hash -813161529, now seen corresponding path program 1 times [2018-10-27 06:08:35,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:08:35,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:35,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:35,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:35,555 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:08:35,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:35,788 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:08:35,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:35,788 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:08:35,789 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 180 with the following transitions: [2018-10-27 06:08:35,791 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [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], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [685], [687], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 06:08:35,856 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:08:35,856 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:08:36,456 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 06:08:36,458 INFO L272 AbstractInterpreter]: Visited 132 different actions 132 times. Never merged. Never widened. Never found a fixpoint. Largest state had 42 variables. [2018-10-27 06:08:36,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:36,501 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 06:08:37,047 INFO L227 lantSequenceWeakener]: Weakened 170 states. On average, predicates are now at 80.59% of their original sizes. [2018-10-27 06:08:37,047 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 06:08:37,313 INFO L415 sIntCurrentIteration]: We unified 178 AI predicates to 178 [2018-10-27 06:08:37,313 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 06:08:37,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 06:08:37,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-27 06:08:37,315 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:08:37,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 06:08:37,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 06:08:37,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 06:08:37,316 INFO L87 Difference]: Start difference. First operand 2796 states and 3650 transitions. Second operand 6 states. [2018-10-27 06:08:45,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:45,994 INFO L93 Difference]: Finished difference Result 5724 states and 7459 transitions. [2018-10-27 06:08:45,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 06:08:45,995 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 179 [2018-10-27 06:08:45,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:08:46,011 INFO L225 Difference]: With dead ends: 5724 [2018-10-27 06:08:46,012 INFO L226 Difference]: Without dead ends: 2934 [2018-10-27 06:08:46,023 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 179 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-27 06:08:46,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2018-10-27 06:08:46,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 2932. [2018-10-27 06:08:46,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2932 states. [2018-10-27 06:08:46,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2932 states to 2932 states and 3792 transitions. [2018-10-27 06:08:46,105 INFO L78 Accepts]: Start accepts. Automaton has 2932 states and 3792 transitions. Word has length 179 [2018-10-27 06:08:46,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:08:46,105 INFO L481 AbstractCegarLoop]: Abstraction has 2932 states and 3792 transitions. [2018-10-27 06:08:46,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 06:08:46,105 INFO L276 IsEmpty]: Start isEmpty. Operand 2932 states and 3792 transitions. [2018-10-27 06:08:46,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-27 06:08:46,117 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:08:46,117 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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, 1] [2018-10-27 06:08:46,118 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:08:46,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:46,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1518221820, now seen corresponding path program 1 times [2018-10-27 06:08:46,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:08:46,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:46,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:46,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:46,120 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:08:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:46,414 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 06:08:46,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:46,415 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:08:46,415 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 189 with the following transitions: [2018-10-27 06:08:46,416 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [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], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [685], [687], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 06:08:46,422 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:08:46,422 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:08:46,700 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 06:08:46,701 INFO L272 AbstractInterpreter]: Visited 136 different actions 266 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-27 06:08:46,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:46,740 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 06:08:47,056 INFO L227 lantSequenceWeakener]: Weakened 185 states. On average, predicates are now at 82.01% of their original sizes. [2018-10-27 06:08:47,057 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 06:08:47,369 INFO L415 sIntCurrentIteration]: We unified 187 AI predicates to 187 [2018-10-27 06:08:47,370 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 06:08:47,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 06:08:47,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-10-27 06:08:47,370 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:08:47,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 06:08:47,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:08:47,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:08:47,372 INFO L87 Difference]: Start difference. First operand 2932 states and 3792 transitions. Second operand 10 states. [2018-10-27 06:08:51,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:51,851 INFO L93 Difference]: Finished difference Result 5863 states and 7618 transitions. [2018-10-27 06:08:51,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 06:08:51,852 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 188 [2018-10-27 06:08:51,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:08:51,868 INFO L225 Difference]: With dead ends: 5863 [2018-10-27 06:08:51,868 INFO L226 Difference]: Without dead ends: 3073 [2018-10-27 06:08:51,881 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 195 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-10-27 06:08:51,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3073 states. [2018-10-27 06:08:51,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3073 to 3070. [2018-10-27 06:08:51,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3070 states. [2018-10-27 06:08:51,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3070 states to 3070 states and 3940 transitions. [2018-10-27 06:08:51,961 INFO L78 Accepts]: Start accepts. Automaton has 3070 states and 3940 transitions. Word has length 188 [2018-10-27 06:08:51,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:08:51,962 INFO L481 AbstractCegarLoop]: Abstraction has 3070 states and 3940 transitions. [2018-10-27 06:08:51,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 06:08:51,962 INFO L276 IsEmpty]: Start isEmpty. Operand 3070 states and 3940 transitions. [2018-10-27 06:08:51,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-27 06:08:51,975 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:08:51,975 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-27 06:08:51,976 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:08:51,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:51,976 INFO L82 PathProgramCache]: Analyzing trace with hash 241118704, now seen corresponding path program 1 times [2018-10-27 06:08:51,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:08:51,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:51,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:51,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:51,977 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:08:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:08:52,344 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 100 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 06:08:52,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:08:52,345 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:08:52,345 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 222 with the following transitions: [2018-10-27 06:08:52,346 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [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], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [685], [687], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 06:08:52,351 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:08:52,352 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:08:52,694 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 06:08:52,694 INFO L272 AbstractInterpreter]: Visited 136 different actions 266 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-10-27 06:08:52,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:52,700 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 06:08:52,989 INFO L227 lantSequenceWeakener]: Weakened 218 states. On average, predicates are now at 81.95% of their original sizes. [2018-10-27 06:08:52,990 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 06:08:53,168 INFO L415 sIntCurrentIteration]: We unified 220 AI predicates to 220 [2018-10-27 06:08:53,169 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 06:08:53,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 06:08:53,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-10-27 06:08:53,169 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:08:53,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 06:08:53,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:08:53,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:08:53,170 INFO L87 Difference]: Start difference. First operand 3070 states and 3940 transitions. Second operand 10 states. [2018-10-27 06:08:59,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:08:59,429 INFO L93 Difference]: Finished difference Result 6140 states and 7912 transitions. [2018-10-27 06:08:59,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-27 06:08:59,429 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 221 [2018-10-27 06:08:59,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:08:59,443 INFO L225 Difference]: With dead ends: 6140 [2018-10-27 06:08:59,443 INFO L226 Difference]: Without dead ends: 3350 [2018-10-27 06:08:59,454 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 229 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-10-27 06:08:59,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3350 states. [2018-10-27 06:08:59,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3350 to 3347. [2018-10-27 06:08:59,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3347 states. [2018-10-27 06:08:59,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3347 states to 3347 states and 4239 transitions. [2018-10-27 06:08:59,531 INFO L78 Accepts]: Start accepts. Automaton has 3347 states and 4239 transitions. Word has length 221 [2018-10-27 06:08:59,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:08:59,531 INFO L481 AbstractCegarLoop]: Abstraction has 3347 states and 4239 transitions. [2018-10-27 06:08:59,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 06:08:59,531 INFO L276 IsEmpty]: Start isEmpty. Operand 3347 states and 4239 transitions. [2018-10-27 06:08:59,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-27 06:08:59,544 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:08:59,545 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-27 06:08:59,545 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:08:59,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:08:59,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1707455469, now seen corresponding path program 1 times [2018-10-27 06:08:59,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:08:59,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:59,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:08:59,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:08:59,547 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:08:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:00,512 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 98 proven. 52 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-27 06:09:00,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:00,512 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:09:00,513 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 231 with the following transitions: [2018-10-27 06:09:00,513 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [97], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [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], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [685], [687], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-10-27 06:09:00,521 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 06:09:00,527 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 06:09:01,003 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 06:09:01,004 INFO L272 AbstractInterpreter]: Visited 138 different actions 554 times. Merged at 9 different actions 38 times. Widened at 1 different actions 1 times. Found 8 fixpoints after 3 different actions. Largest state had 42 variables. [2018-10-27 06:09:01,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:01,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 06:09:01,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:01,018 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-27 06:09:01,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:01,029 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 06:09:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:01,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:01,495 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 116 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-10-27 06:09:01,495 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 06:09:02,546 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 104 proven. 44 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-10-27 06:09:02,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 06:09:02,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-10-27 06:09:02,580 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 06:09:02,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 06:09:02,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 06:09:02,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-10-27 06:09:02,582 INFO L87 Difference]: Start difference. First operand 3347 states and 4239 transitions. Second operand 11 states. [2018-10-27 06:09:05,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:05,817 INFO L93 Difference]: Finished difference Result 7283 states and 9388 transitions. [2018-10-27 06:09:05,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 06:09:05,823 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 230 [2018-10-27 06:09:05,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:09:05,841 INFO L225 Difference]: With dead ends: 7283 [2018-10-27 06:09:05,841 INFO L226 Difference]: Without dead ends: 4355 [2018-10-27 06:09:05,857 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 461 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-10-27 06:09:05,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4355 states. [2018-10-27 06:09:05,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4355 to 4211. [2018-10-27 06:09:05,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4211 states. [2018-10-27 06:09:05,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4211 states to 4211 states and 5270 transitions. [2018-10-27 06:09:05,963 INFO L78 Accepts]: Start accepts. Automaton has 4211 states and 5270 transitions. Word has length 230 [2018-10-27 06:09:05,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:09:05,963 INFO L481 AbstractCegarLoop]: Abstraction has 4211 states and 5270 transitions. [2018-10-27 06:09:05,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 06:09:05,964 INFO L276 IsEmpty]: Start isEmpty. Operand 4211 states and 5270 transitions. [2018-10-27 06:09:05,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-27 06:09:05,979 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 06:09:05,979 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-27 06:09:05,980 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 06:09:05,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:05,980 INFO L82 PathProgramCache]: Analyzing trace with hash 649665019, now seen corresponding path program 2 times [2018-10-27 06:09:05,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 06:09:05,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:05,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:05,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:05,982 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 06:09:06,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:06,420 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 98 proven. 54 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-27 06:09:06,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:06,421 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 06:09:06,421 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 06:09:06,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 06:09:06,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:06,421 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:09:06,431 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 06:09:06,431 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 06:09:06,523 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-27 06:09:06,523 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:09:06,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:06,693 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-10-27 06:09:06,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 06:09:07,010 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-10-27 06:09:07,045 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 06:09:07,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-10-27 06:09:07,046 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 06:09:07,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 06:09:07,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:09:07,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:09:07,047 INFO L87 Difference]: Start difference. First operand 4211 states and 5270 transitions. Second operand 3 states. [2018-10-27 06:09:08,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:08,331 INFO L93 Difference]: Finished difference Result 9785 states and 12545 transitions. [2018-10-27 06:09:08,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:09:08,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2018-10-27 06:09:08,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 06:09:08,332 INFO L225 Difference]: With dead ends: 9785 [2018-10-27 06:09:08,332 INFO L226 Difference]: Without dead ends: 0 [2018-10-27 06:09:08,363 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 459 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:09:08,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-27 06:09:08,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-27 06:09:08,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-27 06:09:08,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-27 06:09:08,366 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 230 [2018-10-27 06:09:08,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 06:09:08,366 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:09:08,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 06:09:08,366 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:09:08,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-27 06:09:08,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-27 06:09:08,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-27 06:09:09,009 WARN L179 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 20 [2018-10-27 06:09:10,409 WARN L179 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 185 DAG size of output: 94 [2018-10-27 06:09:10,614 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 47 [2018-10-27 06:09:10,819 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 47 [2018-10-27 06:09:10,821 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-27 06:09:10,822 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a20~0)| ~a20~0) (= |old(~a16~0)| ~a16~0)) [2018-10-27 06:09:10,822 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 06:09:10,822 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-10-27 06:09:10,822 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-10-27 06:09:10,822 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,822 INFO L425 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,822 INFO L425 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,823 INFO L425 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,823 INFO L425 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,823 INFO L425 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,823 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-10-27 06:09:10,823 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-10-27 06:09:10,823 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-10-27 06:09:10,823 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-10-27 06:09:10,823 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-10-27 06:09:10,823 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-10-27 06:09:10,824 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-10-27 06:09:10,824 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-10-27 06:09:10,824 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-10-27 06:09:10,824 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-10-27 06:09:10,824 INFO L425 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,824 INFO L425 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,824 INFO L425 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,824 INFO L425 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,824 INFO L425 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,824 INFO L425 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,825 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-10-27 06:09:10,825 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-10-27 06:09:10,825 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-27 06:09:10,825 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-10-27 06:09:10,825 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-10-27 06:09:10,825 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-10-27 06:09:10,825 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-10-27 06:09:10,825 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-10-27 06:09:10,825 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-10-27 06:09:10,826 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-10-27 06:09:10,826 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-10-27 06:09:10,826 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-10-27 06:09:10,826 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-10-27 06:09:10,826 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-10-27 06:09:10,826 INFO L425 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-10-27 06:09:10,826 INFO L425 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,826 INFO L425 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,826 INFO L425 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,827 INFO L425 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,827 INFO L425 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,827 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-10-27 06:09:10,827 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-10-27 06:09:10,827 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-10-27 06:09:10,827 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-10-27 06:09:10,827 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-10-27 06:09:10,827 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-10-27 06:09:10,828 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-10-27 06:09:10,828 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-10-27 06:09:10,828 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-10-27 06:09:10,828 INFO L425 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,828 INFO L425 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,828 INFO L425 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,828 INFO L425 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,828 INFO L425 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,829 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-10-27 06:09:10,829 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-10-27 06:09:10,829 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-10-27 06:09:10,829 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-10-27 06:09:10,829 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-10-27 06:09:10,829 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-10-27 06:09:10,829 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-10-27 06:09:10,829 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-10-27 06:09:10,830 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-10-27 06:09:10,830 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-10-27 06:09:10,830 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-10-27 06:09:10,830 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-10-27 06:09:10,830 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-10-27 06:09:10,830 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 548) no Hoare annotation was computed. [2018-10-27 06:09:10,830 INFO L425 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,830 INFO L425 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,831 INFO L425 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,831 INFO L425 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,831 INFO L425 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,831 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-10-27 06:09:10,831 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-10-27 06:09:10,831 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-10-27 06:09:10,831 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-10-27 06:09:10,831 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-10-27 06:09:10,831 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-10-27 06:09:10,832 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-10-27 06:09:10,832 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-10-27 06:09:10,832 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-10-27 06:09:10,832 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,832 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,832 INFO L425 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,832 INFO L425 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,832 INFO L425 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,833 INFO L425 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,833 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-10-27 06:09:10,833 INFO L425 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,833 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-10-27 06:09:10,833 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-10-27 06:09:10,833 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-10-27 06:09:10,833 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-10-27 06:09:10,833 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-10-27 06:09:10,833 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-10-27 06:09:10,833 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-10-27 06:09:10,834 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-10-27 06:09:10,834 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-10-27 06:09:10,834 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-10-27 06:09:10,834 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-10-27 06:09:10,834 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-10-27 06:09:10,834 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-10-27 06:09:10,834 INFO L425 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,834 INFO L425 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,834 INFO L425 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,835 INFO L425 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,835 INFO L425 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,835 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-10-27 06:09:10,835 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-10-27 06:09:10,835 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-10-27 06:09:10,835 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-10-27 06:09:10,835 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-10-27 06:09:10,835 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-10-27 06:09:10,835 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-10-27 06:09:10,835 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-10-27 06:09:10,836 INFO L425 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,836 INFO L425 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,836 INFO L425 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,836 INFO L425 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,836 INFO L425 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,836 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-10-27 06:09:10,836 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-10-27 06:09:10,836 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-10-27 06:09:10,836 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-10-27 06:09:10,837 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-10-27 06:09:10,837 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-10-27 06:09:10,837 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-10-27 06:09:10,837 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-10-27 06:09:10,837 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-10-27 06:09:10,837 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-10-27 06:09:10,837 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse18 (= |old(~a20~0)| ~a20~0)) (.cse19 (= |old(~a16~0)| ~a16~0))) (let ((.cse5 (not (= ~a8~0 13))) (.cse4 (= 13 |old(~a8~0)|)) (.cse15 (not (= 1 |old(~a17~0)|))) (.cse13 (not (= 5 |old(~a16~0)|))) (.cse8 (= ~a17~0 1)) (.cse16 (= 1 |old(~a7~0)|)) (.cse17 (not (= ~a7~0 1))) (.cse3 (= 15 ~a8~0)) (.cse9 (= ~a21~0 1)) (.cse10 (= ~a7~0 0)) (.cse14 (= |calculate_output_#in~input| 0)) (.cse6 (= 6 |old(~a16~0)|)) (.cse11 (not (= 0 |old(~a7~0)|))) (.cse12 (not (= 1 |old(~a21~0)|))) (.cse0 (not (= 1 |old(~a20~0)|))) (.cse1 (not (= 15 |old(~a8~0)|))) (.cse20 (< 4 |old(~a16~0)|)) (.cse21 (and .cse18 .cse19)) (.cse2 (not (= 8 ~a12~0))) (.cse7 (< 0 |old(~a20~0)|))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse2 .cse5) (or .cse6 .cse1 .cse2 .cse3 .cse7) (or (and .cse8 .cse9 .cse10) (or .cse11 .cse12 .cse1 (not (= 0 |old(~a20~0)|)) .cse13 .cse2) .cse14 .cse15) (or .cse16 .cse0 .cse2 .cse17) (or .cse12 .cse0 (not (= 4 |old(~a16~0)|)) (and (= 1 ~a7~0) (= 13 ~a8~0) (= 1 ~a21~0) (= 1 ~a17~0)) .cse2 (not .cse16) (not .cse4) .cse15) (or .cse6 (and .cse18 .cse19 .cse5) .cse4 .cse2 .cse7) (or .cse6 .cse16 .cse4 .cse2 .cse17 .cse7) (or .cse6 .cse11 .cse12 .cse0 .cse1 (and .cse9 .cse10) (= 0 |old(~a16~0)|) .cse2 .cse14) (or .cse16 .cse20 .cse17 .cse2 .cse7) (or .cse0 .cse21 .cse2) (or .cse11 .cse12 .cse2 .cse14 .cse15 .cse0 .cse1 .cse13 .cse8) (or .cse16 .cse1 .cse2 (and .cse17 .cse18 .cse19 .cse3) .cse7) (or (and .cse9 (= ~a17~0 0) .cse10) .cse14 (or (not .cse6) .cse11 .cse12 .cse0 .cse1 (not (= 0 |old(~a17~0)|)) .cse2)) (or .cse20 .cse21 .cse2 .cse7)))) [2018-10-27 06:09:10,838 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-10-27 06:09:10,838 INFO L425 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,838 INFO L425 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,838 INFO L425 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,838 INFO L425 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,838 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-10-27 06:09:10,838 INFO L425 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,838 INFO L425 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,838 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-10-27 06:09:10,839 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-10-27 06:09:10,839 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-10-27 06:09:10,839 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-10-27 06:09:10,839 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-10-27 06:09:10,839 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-10-27 06:09:10,839 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-10-27 06:09:10,839 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-10-27 06:09:10,839 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-10-27 06:09:10,840 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-10-27 06:09:10,840 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-10-27 06:09:10,840 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-10-27 06:09:10,840 INFO L425 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,840 INFO L425 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,840 INFO L425 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,840 INFO L425 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,840 INFO L425 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,840 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-10-27 06:09:10,841 INFO L425 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,841 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-10-27 06:09:10,841 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-10-27 06:09:10,841 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-10-27 06:09:10,841 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-10-27 06:09:10,841 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-10-27 06:09:10,841 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-10-27 06:09:10,841 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-10-27 06:09:10,841 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-10-27 06:09:10,842 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-10-27 06:09:10,842 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-10-27 06:09:10,842 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-10-27 06:09:10,842 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-10-27 06:09:10,842 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-10-27 06:09:10,842 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-10-27 06:09:10,842 INFO L425 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,842 INFO L425 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,842 INFO L425 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,843 INFO L425 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,843 INFO L425 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,843 INFO L425 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-10-27 06:09:10,843 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-10-27 06:09:10,843 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-10-27 06:09:10,843 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-10-27 06:09:10,843 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-10-27 06:09:10,843 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-10-27 06:09:10,843 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-10-27 06:09:10,843 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-10-27 06:09:10,843 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-10-27 06:09:10,844 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-10-27 06:09:10,844 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-10-27 06:09:10,844 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 06:09:10,844 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a7~0 0) (= ~a17~0 1) (= ~a12~0 8) (= ~a21~0 1) (= ~a20~0 1) (= 15 ~a8~0) (= ~a16~0 5)) [2018-10-27 06:09:10,844 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 06:09:10,844 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 06:09:10,844 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a21~0)|)) (not (= 1 |old(~a20~0)|)) (not (= 15 |old(~a8~0)|)) (and (= ~a17~0 1) (= ~a21~0 1) (= 15 ~a8~0) (= ~a7~0 0) (= ~a20~0 1) (= ~a16~0 5)) (not (= 5 |old(~a16~0)|)) (not (= 8 ~a12~0)) (not (= 1 |old(~a17~0)|))) [2018-10-27 06:09:10,844 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-10-27 06:09:10,845 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse0 (<= ~a20~0 0))) (or (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a21~0)|)) (and (not (= ~a7~0 1)) (= 15 ~a8~0) .cse0) (and (not (= ~a16~0 6)) .cse0 (not (= ~a8~0 13))) (and .cse0 (<= ~a16~0 4)) (not (= 8 ~a12~0)) (= |old(~a20~0)| ~a20~0) (not (= 1 |old(~a17~0)|)) (not (= 1 |old(~a20~0)|)) (not (= 15 |old(~a8~0)|)) (not (= 5 |old(~a16~0)|)))) [2018-10-27 06:09:10,845 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-10-27 06:09:10,845 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-10-27 06:09:10,845 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-10-27 06:09:10,845 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse0 (<= ~a20~0 0))) (or (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a21~0)|)) (and (not (= ~a7~0 1)) (= 15 ~a8~0) .cse0) (and (not (= ~a16~0 6)) .cse0 (not (= ~a8~0 13))) (and .cse0 (<= ~a16~0 4)) (not (= 8 ~a12~0)) (= |old(~a20~0)| ~a20~0) (not (= 1 |old(~a17~0)|)) (not (= 1 |old(~a20~0)|)) (not (= 15 |old(~a8~0)|)) (not (= 5 |old(~a16~0)|)))) [2018-10-27 06:09:10,845 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-10-27 06:09:10,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 06:09:10 BoogieIcfgContainer [2018-10-27 06:09:10,857 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 06:09:10,858 INFO L168 Benchmark]: Toolchain (without parser) took 50853.67 ms. Allocated memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: 1.5 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -802.6 MB). Peak memory consumption was 734.1 MB. Max. memory is 7.1 GB. [2018-10-27 06:09:10,859 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 06:09:10,859 INFO L168 Benchmark]: CACSL2BoogieTranslator took 678.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-27 06:09:10,860 INFO L168 Benchmark]: Boogie Procedure Inliner took 228.39 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 692.1 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -776.6 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2018-10-27 06:09:10,861 INFO L168 Benchmark]: Boogie Preprocessor took 71.29 ms. Allocated memory is still 2.2 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 06:09:10,862 INFO L168 Benchmark]: RCFGBuilder took 3492.51 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 107.0 MB). Peak memory consumption was 107.0 MB. Max. memory is 7.1 GB. [2018-10-27 06:09:10,862 INFO L168 Benchmark]: TraceAbstraction took 46377.82 ms. Allocated memory was 2.2 GB in the beginning and 3.0 GB in the end (delta: 844.6 MB). Free memory was 2.0 GB in the beginning and 2.2 GB in the end (delta: -164.7 MB). Peak memory consumption was 679.9 MB. Max. memory is 7.1 GB. [2018-10-27 06:09:10,867 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 678.61 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 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 228.39 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 692.1 MB). Free memory was 1.3 GB in the beginning and 2.1 GB in the end (delta: -776.6 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 71.29 ms. Allocated memory is still 2.2 GB. Free memory is still 2.1 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3492.51 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 107.0 MB). Peak memory consumption was 107.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 46377.82 ms. Allocated memory was 2.2 GB in the beginning and 3.0 GB in the end (delta: 844.6 MB). Free memory was 2.0 GB in the beginning and 2.2 GB in the end (delta: -164.7 MB). Peak memory consumption was 679.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 548]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((!(0 == \old(a7)) || !(1 == \old(a21))) || ((!(a7 == 1) && 15 == a8) && a20 <= 0)) || ((!(a16 == 6) && a20 <= 0) && !(a8 == 13))) || (a20 <= 0 && a16 <= 4)) || !(8 == a12)) || \old(a20) == a20) || !(1 == \old(a17))) || !(1 == \old(a20))) || !(15 == \old(a8))) || !(5 == \old(a16)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 46.2s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 32.3s AutomataDifference, 0.0s DeadEndRemovalTime, 2.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 1386 SDtfs, 5210 SDslu, 1387 SDs, 0 SdLazy, 7141 SolverSat, 1165 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.7s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 1584 GetRequests, 1498 SyntacticMatches, 10 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4211occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.8s AbstIntTime, 4 AbstIntIterations, 3 AbstIntStrong, 0.9975497877882603 AbsIntWeakeningRatio, 0.2 AbsIntAvgWeakeningVarsNumRemoved, 29.39145299145299 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 202 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 170 PreInvPairs, 254 NumberOfFragments, 604 HoareAnnotationTreeSize, 170 FomulaSimplifications, 3148 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 2173 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 2239 NumberOfCodeBlocks, 2172 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2685 ConstructedInterpolants, 0 QuantifiedInterpolants, 1457172 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1010 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 1246/1430 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...