java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem01_label52_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 12:50:52,091 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 12:50:52,093 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 12:50:52,105 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 12:50:52,106 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 12:50:52,107 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 12:50:52,108 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 12:50:52,110 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 12:50:52,112 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 12:50:52,113 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 12:50:52,114 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 12:50:52,114 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 12:50:52,115 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 12:50:52,116 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 12:50:52,118 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 12:50:52,118 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 12:50:52,119 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 12:50:52,121 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 12:50:52,123 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 12:50:52,125 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 12:50:52,126 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 12:50:52,128 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 12:50:52,130 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 12:50:52,130 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 12:50:52,131 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 12:50:52,132 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 12:50:52,133 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 12:50:52,134 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 12:50:52,135 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 12:50:52,136 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 12:50:52,136 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 12:50:52,137 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 12:50:52,137 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 12:50:52,138 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 12:50:52,139 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 12:50:52,139 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 12:50:52,140 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-11-07 12:50:52,157 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 12:50:52,157 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 12:50:52,161 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 12:50:52,161 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 12:50:52,161 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 12:50:52,162 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 12:50:52,162 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 12:50:52,162 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 12:50:52,162 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 12:50:52,162 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 12:50:52,165 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 12:50:52,165 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 12:50:52,166 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 12:50:52,166 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 12:50:52,166 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 12:50:52,167 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 12:50:52,167 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 12:50:52,167 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 12:50:52,167 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 12:50:52,167 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 12:50:52,169 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 12:50:52,169 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 12:50:52,169 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 12:50:52,169 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 12:50:52,170 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 12:50:52,170 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 12:50:52,170 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 12:50:52,170 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 12:50:52,170 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 12:50:52,171 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 12:50:52,171 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 12:50:52,171 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 12:50:52,172 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 12:50:52,172 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 12:50:52,243 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 12:50:52,257 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 12:50:52,261 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 12:50:52,263 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 12:50:52,263 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 12:50:52,264 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label52_true-unreach-call_false-termination.c [2018-11-07 12:50:52,323 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70b2a7ce6/6b3661f596f84ef4bad19c898e4260f5/FLAGb136b4d23 [2018-11-07 12:50:52,923 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 12:50:52,925 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label52_true-unreach-call_false-termination.c [2018-11-07 12:50:52,939 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70b2a7ce6/6b3661f596f84ef4bad19c898e4260f5/FLAGb136b4d23 [2018-11-07 12:50:52,961 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70b2a7ce6/6b3661f596f84ef4bad19c898e4260f5 [2018-11-07 12:50:52,972 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 12:50:52,974 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 12:50:52,975 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 12:50:52,975 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 12:50:52,979 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 12:50:52,980 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:50:52" (1/1) ... [2018-11-07 12:50:52,983 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d73b804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:50:52, skipping insertion in model container [2018-11-07 12:50:52,984 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:50:52" (1/1) ... [2018-11-07 12:50:52,995 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 12:50:53,062 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 12:50:53,582 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:50:53,588 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 12:50:53,725 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 12:50:53,744 INFO L193 MainTranslator]: Completed translation [2018-11-07 12:50:53,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:50:53 WrapperNode [2018-11-07 12:50:53,745 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 12:50:53,747 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 12:50:53,747 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 12:50:53,747 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 12:50:53,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:50:53" (1/1) ... [2018-11-07 12:50:53,869 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:50:53" (1/1) ... [2018-11-07 12:50:53,880 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 12:50:53,880 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 12:50:53,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 12:50:53,880 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 12:50:53,892 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:50:53" (1/1) ... [2018-11-07 12:50:53,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:50:53" (1/1) ... [2018-11-07 12:50:53,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:50:53" (1/1) ... [2018-11-07 12:50:53,899 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:50:53" (1/1) ... [2018-11-07 12:50:53,946 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:50:53" (1/1) ... [2018-11-07 12:50:53,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:50:53" (1/1) ... [2018-11-07 12:50:53,975 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:50:53" (1/1) ... [2018-11-07 12:50:53,981 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 12:50:53,982 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 12:50:53,982 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 12:50:53,982 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 12:50:53,984 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:50:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 12:50:54,053 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 12:50:54,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 12:50:54,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 12:50:54,053 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 12:50:54,053 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 12:50:54,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 12:50:54,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 12:50:54,054 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 12:50:54,054 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 12:50:57,113 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 12:50:57,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:50:57 BoogieIcfgContainer [2018-11-07 12:50:57,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 12:50:57,115 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 12:50:57,115 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 12:50:57,119 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 12:50:57,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:50:52" (1/3) ... [2018-11-07 12:50:57,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@486f34d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:50:57, skipping insertion in model container [2018-11-07 12:50:57,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:50:53" (2/3) ... [2018-11-07 12:50:57,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@486f34d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:50:57, skipping insertion in model container [2018-11-07 12:50:57,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:50:57" (3/3) ... [2018-11-07 12:50:57,123 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label52_true-unreach-call_false-termination.c [2018-11-07 12:50:57,134 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 12:50:57,143 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 12:50:57,162 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 12:50:57,210 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 12:50:57,210 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 12:50:57,210 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 12:50:57,211 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 12:50:57,211 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 12:50:57,211 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 12:50:57,211 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 12:50:57,211 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 12:50:57,236 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states. [2018-11-07 12:50:57,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-07 12:50:57,251 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:50:57,253 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, 1, 1] [2018-11-07 12:50:57,255 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:50:57,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:50:57,261 INFO L82 PathProgramCache]: Analyzing trace with hash -197406427, now seen corresponding path program 1 times [2018-11-07 12:50:57,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:50:57,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:50:57,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:50:57,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:50:57,313 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:50:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:50:57,885 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 12:50:58,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:50:58,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:50:58,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 12:50:58,046 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:50:58,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:50:58,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:50:58,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:50:58,075 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 3 states. [2018-11-07 12:50:59,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:50:59,498 INFO L93 Difference]: Finished difference Result 550 states and 941 transitions. [2018-11-07 12:50:59,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:50:59,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2018-11-07 12:50:59,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:50:59,520 INFO L225 Difference]: With dead ends: 550 [2018-11-07 12:50:59,521 INFO L226 Difference]: Without dead ends: 340 [2018-11-07 12:50:59,528 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 12:50:59,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-11-07 12:50:59,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-11-07 12:50:59,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-11-07 12:50:59,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 569 transitions. [2018-11-07 12:50:59,609 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 569 transitions. Word has length 133 [2018-11-07 12:50:59,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:50:59,611 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 569 transitions. [2018-11-07 12:50:59,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:50:59,611 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 569 transitions. [2018-11-07 12:50:59,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-07 12:50:59,623 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:50:59,623 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2018-11-07 12:50:59,624 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:50:59,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:50:59,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1386763570, now seen corresponding path program 1 times [2018-11-07 12:50:59,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:50:59,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:50:59,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:50:59,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:50:59,629 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:50:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:50:59,829 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:50:59,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 12:50:59,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 12:50:59,830 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:50:59,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 12:50:59,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 12:50:59,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 12:50:59,834 INFO L87 Difference]: Start difference. First operand 340 states and 569 transitions. Second operand 5 states. [2018-11-07 12:51:01,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:51:01,605 INFO L93 Difference]: Finished difference Result 1079 states and 1888 transitions. [2018-11-07 12:51:01,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 12:51:01,608 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2018-11-07 12:51:01,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:51:01,617 INFO L225 Difference]: With dead ends: 1079 [2018-11-07 12:51:01,618 INFO L226 Difference]: Without dead ends: 745 [2018-11-07 12:51:01,622 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 12:51:01,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2018-11-07 12:51:01,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 733. [2018-11-07 12:51:01,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2018-11-07 12:51:01,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1163 transitions. [2018-11-07 12:51:01,672 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1163 transitions. Word has length 143 [2018-11-07 12:51:01,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:51:01,672 INFO L480 AbstractCegarLoop]: Abstraction has 733 states and 1163 transitions. [2018-11-07 12:51:01,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 12:51:01,672 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1163 transitions. [2018-11-07 12:51:01,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-07 12:51:01,679 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:51:01,679 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:51:01,680 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:51:01,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:51:01,680 INFO L82 PathProgramCache]: Analyzing trace with hash 130268386, now seen corresponding path program 1 times [2018-11-07 12:51:01,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:51:01,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:51:01,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:51:01,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:51:01,682 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:51:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:51:01,968 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 12:51:01,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:51:01,969 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:51:01,970 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 154 with the following transitions: [2018-11-07 12:51:01,973 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [689], [697], [701], [703], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:51:02,041 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:51:02,042 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:51:05,332 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:51:05,335 INFO L272 AbstractInterpreter]: Visited 68 different actions 68 times. Never merged. Never widened. Never found a fixpoint. Largest state had 42 variables. [2018-11-07 12:51:05,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:51:05,379 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:51:07,785 INFO L227 lantSequenceWeakener]: Weakened 82 states. On average, predicates are now at 79.49% of their original sizes. [2018-11-07 12:51:07,785 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:51:08,855 INFO L415 sIntCurrentIteration]: We unified 152 AI predicates to 152 [2018-11-07 12:51:08,859 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:51:08,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:51:08,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2018-11-07 12:51:08,860 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:51:08,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 12:51:08,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 12:51:08,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-07 12:51:08,861 INFO L87 Difference]: Start difference. First operand 733 states and 1163 transitions. Second operand 12 states. [2018-11-07 12:51:18,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:51:18,147 INFO L93 Difference]: Finished difference Result 1521 states and 2423 transitions. [2018-11-07 12:51:18,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 12:51:18,147 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 153 [2018-11-07 12:51:18,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:51:18,153 INFO L225 Difference]: With dead ends: 1521 [2018-11-07 12:51:18,154 INFO L226 Difference]: Without dead ends: 794 [2018-11-07 12:51:18,157 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 158 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2018-11-07 12:51:18,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-11-07 12:51:18,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 794. [2018-11-07 12:51:18,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2018-11-07 12:51:18,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1232 transitions. [2018-11-07 12:51:18,189 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1232 transitions. Word has length 153 [2018-11-07 12:51:18,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:51:18,190 INFO L480 AbstractCegarLoop]: Abstraction has 794 states and 1232 transitions. [2018-11-07 12:51:18,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 12:51:18,190 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1232 transitions. [2018-11-07 12:51:18,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-07 12:51:18,197 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:51:18,197 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-11-07 12:51:18,198 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:51:18,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:51:18,198 INFO L82 PathProgramCache]: Analyzing trace with hash -2100798917, now seen corresponding path program 1 times [2018-11-07 12:51:18,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:51:18,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:51:18,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:51:18,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:51:18,202 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:51:18,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:51:18,699 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:51:18,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:51:18,700 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:51:18,700 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 156 with the following transitions: [2018-11-07 12:51:18,701 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [689], [697], [701], [703], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:51:18,709 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:51:18,710 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:51:22,837 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:51:22,837 INFO L272 AbstractInterpreter]: Visited 137 different actions 202 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 12:51:22,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:51:22,874 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:51:24,293 INFO L227 lantSequenceWeakener]: Weakened 152 states. On average, predicates are now at 80.69% of their original sizes. [2018-11-07 12:51:24,294 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:51:24,762 INFO L415 sIntCurrentIteration]: We unified 154 AI predicates to 154 [2018-11-07 12:51:24,765 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:51:24,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:51:24,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-07 12:51:24,765 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:51:24,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 12:51:24,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 12:51:24,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 12:51:24,767 INFO L87 Difference]: Start difference. First operand 794 states and 1232 transitions. Second operand 11 states. [2018-11-07 12:51:41,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:51:41,563 INFO L93 Difference]: Finished difference Result 2256 states and 3581 transitions. [2018-11-07 12:51:41,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-07 12:51:41,564 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 155 [2018-11-07 12:51:41,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:51:41,572 INFO L225 Difference]: With dead ends: 2256 [2018-11-07 12:51:41,572 INFO L226 Difference]: Without dead ends: 1529 [2018-11-07 12:51:41,576 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 165 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-11-07 12:51:41,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2018-11-07 12:51:41,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1504. [2018-11-07 12:51:41,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1504 states. [2018-11-07 12:51:41,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 2018 transitions. [2018-11-07 12:51:41,621 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 2018 transitions. Word has length 155 [2018-11-07 12:51:41,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:51:41,621 INFO L480 AbstractCegarLoop]: Abstraction has 1504 states and 2018 transitions. [2018-11-07 12:51:41,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 12:51:41,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 2018 transitions. [2018-11-07 12:51:41,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-07 12:51:41,628 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:51:41,628 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 12:51:41,628 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:51:41,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:51:41,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1272000863, now seen corresponding path program 1 times [2018-11-07 12:51:41,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:51:41,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:51:41,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:51:41,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:51:41,630 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:51:41,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:51:41,989 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 12:51:41,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:51:41,990 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:51:41,990 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 163 with the following transitions: [2018-11-07 12:51:41,991 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [689], [697], [701], [703], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:51:41,995 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:51:41,996 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:51:44,119 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:51:44,119 INFO L272 AbstractInterpreter]: Visited 137 different actions 203 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 12:51:44,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:51:44,147 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:51:45,184 INFO L227 lantSequenceWeakener]: Weakened 131 states. On average, predicates are now at 81.05% of their original sizes. [2018-11-07 12:51:45,184 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:51:45,680 INFO L415 sIntCurrentIteration]: We unified 161 AI predicates to 161 [2018-11-07 12:51:45,681 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:51:45,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:51:45,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [7] total 25 [2018-11-07 12:51:45,682 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:51:45,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 12:51:45,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 12:51:45,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2018-11-07 12:51:45,683 INFO L87 Difference]: Start difference. First operand 1504 states and 2018 transitions. Second operand 20 states. [2018-11-07 12:52:10,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:52:10,999 INFO L93 Difference]: Finished difference Result 3226 states and 4396 transitions. [2018-11-07 12:52:10,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 12:52:10,999 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 162 [2018-11-07 12:52:11,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:52:11,008 INFO L225 Difference]: With dead ends: 3226 [2018-11-07 12:52:11,009 INFO L226 Difference]: Without dead ends: 1789 [2018-11-07 12:52:11,014 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 178 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=253, Invalid=1079, Unknown=0, NotChecked=0, Total=1332 [2018-11-07 12:52:11,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2018-11-07 12:52:11,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1642. [2018-11-07 12:52:11,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1642 states. [2018-11-07 12:52:11,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 2164 transitions. [2018-11-07 12:52:11,063 INFO L78 Accepts]: Start accepts. Automaton has 1642 states and 2164 transitions. Word has length 162 [2018-11-07 12:52:11,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:52:11,063 INFO L480 AbstractCegarLoop]: Abstraction has 1642 states and 2164 transitions. [2018-11-07 12:52:11,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 12:52:11,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 2164 transitions. [2018-11-07 12:52:11,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-07 12:52:11,069 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:52:11,070 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1] [2018-11-07 12:52:11,070 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:52:11,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:52:11,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1641310418, now seen corresponding path program 1 times [2018-11-07 12:52:11,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:52:11,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:52:11,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:52:11,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:52:11,072 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:52:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:52:11,240 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 44 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 12:52:11,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:52:11,241 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:52:11,241 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 175 with the following transitions: [2018-11-07 12:52:11,241 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [17], [18], [22], [26], [30], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [569], [577], [585], [593], [601], [609], [617], [625], [633], [641], [649], [657], [665], [673], [681], [689], [697], [701], [703], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:52:11,245 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:52:11,246 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:52:17,154 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:52:17,154 INFO L272 AbstractInterpreter]: Visited 139 different actions 486 times. Merged at 8 different actions 31 times. Never widened. Found 7 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 12:52:17,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:52:17,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:52:17,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:52:17,160 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 12:52:17,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:52:17,171 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:52:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:52:17,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:52:17,660 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 42 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-07 12:52:17,661 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:52:17,907 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-07 12:52:18,019 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-07 12:52:18,372 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 44 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 12:52:18,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 12:52:18,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2018-11-07 12:52:18,398 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 12:52:18,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 12:52:18,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 12:52:18,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-11-07 12:52:18,400 INFO L87 Difference]: Start difference. First operand 1642 states and 2164 transitions. Second operand 8 states. [2018-11-07 12:52:23,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:52:23,706 INFO L93 Difference]: Finished difference Result 5411 states and 7866 transitions. [2018-11-07 12:52:23,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 12:52:23,707 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 174 [2018-11-07 12:52:23,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:52:23,724 INFO L225 Difference]: With dead ends: 5411 [2018-11-07 12:52:23,724 INFO L226 Difference]: Without dead ends: 2608 [2018-11-07 12:52:23,742 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=215, Invalid=777, Unknown=0, NotChecked=0, Total=992 [2018-11-07 12:52:23,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2608 states. [2018-11-07 12:52:23,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2608 to 2498. [2018-11-07 12:52:23,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2498 states. [2018-11-07 12:52:23,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2498 states to 2498 states and 3085 transitions. [2018-11-07 12:52:23,839 INFO L78 Accepts]: Start accepts. Automaton has 2498 states and 3085 transitions. Word has length 174 [2018-11-07 12:52:23,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:52:23,839 INFO L480 AbstractCegarLoop]: Abstraction has 2498 states and 3085 transitions. [2018-11-07 12:52:23,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 12:52:23,840 INFO L276 IsEmpty]: Start isEmpty. Operand 2498 states and 3085 transitions. [2018-11-07 12:52:23,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-11-07 12:52:23,849 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:52:23,850 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 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] [2018-11-07 12:52:23,850 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:52:23,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:52:23,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1741067028, now seen corresponding path program 1 times [2018-11-07 12:52:23,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:52:23,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:52:23,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:52:23,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:52:23,852 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:52:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:52:24,355 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 78 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-07 12:52:24,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:52:24,356 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:52:24,356 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 202 with the following transitions: [2018-11-07 12:52:24,356 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [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], [689], [697], [701], [703], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:52:24,359 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:52:24,359 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:52:27,369 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:52:27,370 INFO L272 AbstractInterpreter]: Visited 138 different actions 205 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-07 12:52:27,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:52:27,393 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:52:30,384 INFO L227 lantSequenceWeakener]: Weakened 88 states. On average, predicates are now at 81.56% of their original sizes. [2018-11-07 12:52:30,384 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:52:31,403 INFO L415 sIntCurrentIteration]: We unified 200 AI predicates to 200 [2018-11-07 12:52:31,403 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:52:31,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:52:31,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [6] total 26 [2018-11-07 12:52:31,404 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:52:31,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-07 12:52:31,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-07 12:52:31,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2018-11-07 12:52:31,405 INFO L87 Difference]: Start difference. First operand 2498 states and 3085 transitions. Second operand 22 states. [2018-11-07 12:52:51,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:52:51,646 INFO L93 Difference]: Finished difference Result 5213 states and 6485 transitions. [2018-11-07 12:52:51,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 12:52:51,646 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 201 [2018-11-07 12:52:51,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:52:51,660 INFO L225 Difference]: With dead ends: 5213 [2018-11-07 12:52:51,660 INFO L226 Difference]: Without dead ends: 2920 [2018-11-07 12:52:51,669 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 213 GetRequests, 174 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=274, Invalid=916, Unknown=0, NotChecked=0, Total=1190 [2018-11-07 12:52:51,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2018-11-07 12:52:51,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 2772. [2018-11-07 12:52:51,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2772 states. [2018-11-07 12:52:51,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2772 states to 2772 states and 3375 transitions. [2018-11-07 12:52:51,741 INFO L78 Accepts]: Start accepts. Automaton has 2772 states and 3375 transitions. Word has length 201 [2018-11-07 12:52:51,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:52:51,742 INFO L480 AbstractCegarLoop]: Abstraction has 2772 states and 3375 transitions. [2018-11-07 12:52:51,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-07 12:52:51,742 INFO L276 IsEmpty]: Start isEmpty. Operand 2772 states and 3375 transitions. [2018-11-07 12:52:51,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-11-07 12:52:51,752 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:52:51,752 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 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] [2018-11-07 12:52:51,753 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:52:51,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:52:51,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1355517047, now seen corresponding path program 1 times [2018-11-07 12:52:51,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:52:51,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:52:51,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:52:51,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:52:51,754 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:52:51,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:52:52,094 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 76 proven. 32 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-07 12:52:52,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:52:52,094 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:52:52,095 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 211 with the following transitions: [2018-11-07 12:52:52,095 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [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], [689], [697], [701], [703], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:52:52,098 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:52:52,098 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:52:56,714 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:52:56,714 INFO L272 AbstractInterpreter]: Visited 140 different actions 494 times. Merged at 9 different actions 35 times. Never widened. Found 8 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 12:52:56,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:52:56,725 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:52:56,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:52:56,725 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 12:52:56,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:52:56,741 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:52:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:52:56,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:52:56,939 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 94 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-07 12:52:56,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:52:57,094 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 82 proven. 14 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-07 12:52:57,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 12:52:57,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2018-11-07 12:52:57,115 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 12:52:57,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-07 12:52:57,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-07 12:52:57,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-11-07 12:52:57,117 INFO L87 Difference]: Start difference. First operand 2772 states and 3375 transitions. Second operand 12 states. [2018-11-07 12:53:02,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:53:02,992 INFO L93 Difference]: Finished difference Result 16575 states and 23253 transitions. [2018-11-07 12:53:03,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-07 12:53:03,004 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 210 [2018-11-07 12:53:03,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:53:03,109 INFO L225 Difference]: With dead ends: 16575 [2018-11-07 12:53:03,109 INFO L226 Difference]: Without dead ends: 13790 [2018-11-07 12:53:03,165 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 453 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=532, Invalid=2018, Unknown=0, NotChecked=0, Total=2550 [2018-11-07 12:53:03,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13790 states. [2018-11-07 12:53:03,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13790 to 13228. [2018-11-07 12:53:03,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13228 states. [2018-11-07 12:53:03,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13228 states to 13228 states and 17365 transitions. [2018-11-07 12:53:03,678 INFO L78 Accepts]: Start accepts. Automaton has 13228 states and 17365 transitions. Word has length 210 [2018-11-07 12:53:03,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:53:03,678 INFO L480 AbstractCegarLoop]: Abstraction has 13228 states and 17365 transitions. [2018-11-07 12:53:03,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-07 12:53:03,679 INFO L276 IsEmpty]: Start isEmpty. Operand 13228 states and 17365 transitions. [2018-11-07 12:53:03,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-07 12:53:03,728 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:53:03,729 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 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] [2018-11-07 12:53:03,729 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:53:03,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:53:03,729 INFO L82 PathProgramCache]: Analyzing trace with hash 41954039, now seen corresponding path program 1 times [2018-11-07 12:53:03,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:53:03,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:03,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:53:03,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:03,731 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:53:03,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:53:04,275 WARN L179 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-07 12:53:04,426 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 98 proven. 25 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-07 12:53:04,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:53:04,426 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:53:04,426 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 220 with the following transitions: [2018-11-07 12:53:04,427 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [173], [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], [689], [697], [701], [703], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:53:04,429 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:53:04,429 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:53:07,143 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 12:53:07,143 INFO L272 AbstractInterpreter]: Visited 139 different actions 344 times. Merged at 7 different actions 14 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-07 12:53:07,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:53:07,149 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 12:53:08,098 INFO L227 lantSequenceWeakener]: Weakened 216 states. On average, predicates are now at 80.54% of their original sizes. [2018-11-07 12:53:08,098 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 12:53:08,191 INFO L415 sIntCurrentIteration]: We unified 218 AI predicates to 218 [2018-11-07 12:53:08,191 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 12:53:08,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:53:08,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-07 12:53:08,192 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:53:08,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 12:53:08,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 12:53:08,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 12:53:08,193 INFO L87 Difference]: Start difference. First operand 13228 states and 17365 transitions. Second operand 11 states. [2018-11-07 12:53:16,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:53:16,050 INFO L93 Difference]: Finished difference Result 26671 states and 35073 transitions. [2018-11-07 12:53:16,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 12:53:16,050 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 219 [2018-11-07 12:53:16,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:53:16,156 INFO L225 Difference]: With dead ends: 26671 [2018-11-07 12:53:16,156 INFO L226 Difference]: Without dead ends: 13786 [2018-11-07 12:53:16,207 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 227 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-11-07 12:53:16,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13786 states. [2018-11-07 12:53:16,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13786 to 13776. [2018-11-07 12:53:16,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13776 states. [2018-11-07 12:53:16,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13776 states to 13776 states and 17954 transitions. [2018-11-07 12:53:16,678 INFO L78 Accepts]: Start accepts. Automaton has 13776 states and 17954 transitions. Word has length 219 [2018-11-07 12:53:16,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:53:16,678 INFO L480 AbstractCegarLoop]: Abstraction has 13776 states and 17954 transitions. [2018-11-07 12:53:16,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 12:53:16,679 INFO L276 IsEmpty]: Start isEmpty. Operand 13776 states and 17954 transitions. [2018-11-07 12:53:16,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-11-07 12:53:16,726 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:53:16,727 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 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, 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] [2018-11-07 12:53:16,727 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:53:16,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:53:16,727 INFO L82 PathProgramCache]: Analyzing trace with hash -2063734971, now seen corresponding path program 1 times [2018-11-07 12:53:16,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:53:16,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:16,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:53:16,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:16,729 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:53:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:53:17,692 WARN L179 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-07 12:53:17,929 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 153 proven. 25 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-07 12:53:17,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:53:17,930 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:53:17,930 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 236 with the following transitions: [2018-11-07 12:53:17,930 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [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], [689], [697], [701], [703], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:53:17,936 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:53:17,937 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:53:26,436 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:53:26,436 INFO L272 AbstractInterpreter]: Visited 140 different actions 1057 times. Merged at 9 different actions 82 times. Widened at 1 different actions 4 times. Found 19 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-07 12:53:26,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:53:26,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:53:26,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:53:26,446 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 12:53:26,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:53:26,457 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:53:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:53:26,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:53:26,613 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-07 12:53:26,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:53:26,825 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-07 12:53:26,845 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:53:26,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-11-07 12:53:26,845 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:53:26,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:53:26,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:53:26,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-07 12:53:26,846 INFO L87 Difference]: Start difference. First operand 13776 states and 17954 transitions. Second operand 3 states. [2018-11-07 12:53:27,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:53:27,733 INFO L93 Difference]: Finished difference Result 26855 states and 35094 transitions. [2018-11-07 12:53:27,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:53:27,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2018-11-07 12:53:27,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:53:27,832 INFO L225 Difference]: With dead ends: 26855 [2018-11-07 12:53:27,832 INFO L226 Difference]: Without dead ends: 13422 [2018-11-07 12:53:27,880 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 468 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-07 12:53:27,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13422 states. [2018-11-07 12:53:28,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13422 to 13274. [2018-11-07 12:53:28,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13274 states. [2018-11-07 12:53:28,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13274 states to 13274 states and 16786 transitions. [2018-11-07 12:53:28,298 INFO L78 Accepts]: Start accepts. Automaton has 13274 states and 16786 transitions. Word has length 235 [2018-11-07 12:53:28,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:53:28,299 INFO L480 AbstractCegarLoop]: Abstraction has 13274 states and 16786 transitions. [2018-11-07 12:53:28,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:53:28,299 INFO L276 IsEmpty]: Start isEmpty. Operand 13274 states and 16786 transitions. [2018-11-07 12:53:28,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-11-07 12:53:28,346 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 12:53:28,346 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 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] [2018-11-07 12:53:28,347 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 12:53:28,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:53:28,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1539146498, now seen corresponding path program 1 times [2018-11-07 12:53:28,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 12:53:28,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:28,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:53:28,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 12:53:28,349 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 12:53:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:53:29,138 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 180 proven. 53 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-07 12:53:29,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:53:29,139 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 12:53:29,139 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 256 with the following transitions: [2018-11-07 12:53:29,139 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [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], [689], [697], [701], [703], [757], [761], [765], [771], [775], [777], [782], [783], [784], [786], [787] [2018-11-07 12:53:29,142 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 12:53:29,143 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 12:53:38,481 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 12:53:38,481 INFO L272 AbstractInterpreter]: Visited 141 different actions 1214 times. Merged at 10 different actions 102 times. Widened at 1 different actions 4 times. Found 28 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-07 12:53:38,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 12:53:38,490 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 12:53:38,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 12:53:38,490 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 12:53:38,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 12:53:38,500 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 12:53:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 12:53:38,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 12:53:38,668 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-11-07 12:53:38,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 12:53:38,972 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2018-11-07 12:53:38,993 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 12:53:38,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [9] total 10 [2018-11-07 12:53:38,993 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 12:53:38,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 12:53:38,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 12:53:38,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-07 12:53:38,994 INFO L87 Difference]: Start difference. First operand 13274 states and 16786 transitions. Second operand 3 states. [2018-11-07 12:53:39,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 12:53:39,945 INFO L93 Difference]: Finished difference Result 22186 states and 28114 transitions. [2018-11-07 12:53:39,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 12:53:39,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2018-11-07 12:53:39,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 12:53:39,946 INFO L225 Difference]: With dead ends: 22186 [2018-11-07 12:53:39,946 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 12:53:39,995 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 508 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-07 12:53:39,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 12:53:39,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 12:53:39,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 12:53:39,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 12:53:39,996 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 255 [2018-11-07 12:53:39,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 12:53:39,996 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 12:53:39,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 12:53:39,996 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 12:53:39,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 12:53:40,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 12:53:40,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,721 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:40,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,048 WARN L179 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 423 DAG size of output: 199 [2018-11-07 12:53:41,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 12:53:41,481 WARN L179 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 411 DAG size of output: 189 [2018-11-07 12:53:42,051 WARN L179 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2018-11-07 12:53:42,570 WARN L179 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 86 [2018-11-07 12:53:49,605 WARN L179 SmtUtils]: Spent 7.01 s on a formula simplification. DAG size of input: 408 DAG size of output: 187 [2018-11-07 12:53:50,818 WARN L179 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 228 DAG size of output: 112 [2018-11-07 12:53:51,580 WARN L179 SmtUtils]: Spent 758.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 115 [2018-11-07 12:53:51,583 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:53:51,584 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a7~0 |old(~a7~0)|) (= |old(~a8~0)| ~a8~0) (= |old(~a20~0)| ~a20~0) (= ~a17~0 |old(~a17~0)|)) [2018-11-07 12:53:51,584 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:53:51,584 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-07 12:53:51,584 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-07 12:53:51,584 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,584 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,584 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,585 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,585 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,585 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,585 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-07 12:53:51,585 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-07 12:53:51,585 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-07 12:53:51,585 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-07 12:53:51,585 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-07 12:53:51,585 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-07 12:53:51,585 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-07 12:53:51,585 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-07 12:53:51,586 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-07 12:53:51,586 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 554) no Hoare annotation was computed. [2018-11-07 12:53:51,586 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-07 12:53:51,586 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,586 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,586 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,586 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,586 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,587 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,587 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-07 12:53:51,587 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-07 12:53:51,587 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-07 12:53:51,587 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-07 12:53:51,587 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-07 12:53:51,587 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-07 12:53:51,587 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-07 12:53:51,587 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-07 12:53:51,588 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-07 12:53:51,588 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-07 12:53:51,588 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-07 12:53:51,588 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-07 12:53:51,588 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-07 12:53:51,588 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-07 12:53:51,588 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-11-07 12:53:51,588 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,589 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,589 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,589 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,589 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,589 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-07 12:53:51,589 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-07 12:53:51,589 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-07 12:53:51,589 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-07 12:53:51,589 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-07 12:53:51,590 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-07 12:53:51,590 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-07 12:53:51,590 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-07 12:53:51,590 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-07 12:53:51,590 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,590 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,590 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,590 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,590 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,591 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-07 12:53:51,591 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-07 12:53:51,591 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-07 12:53:51,591 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-07 12:53:51,591 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-07 12:53:51,591 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-07 12:53:51,591 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-07 12:53:51,591 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-07 12:53:51,592 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-07 12:53:51,592 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-07 12:53:51,592 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-07 12:53:51,592 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-07 12:53:51,592 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-07 12:53:51,592 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,592 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,592 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,592 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,593 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,593 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-07 12:53:51,593 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-07 12:53:51,593 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-07 12:53:51,593 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-07 12:53:51,593 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-07 12:53:51,593 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-07 12:53:51,593 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-07 12:53:51,593 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-07 12:53:51,594 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-07 12:53:51,594 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,594 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,594 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,594 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,594 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,594 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,594 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,594 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-07 12:53:51,594 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-07 12:53:51,595 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-07 12:53:51,595 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-07 12:53:51,595 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-07 12:53:51,595 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-07 12:53:51,595 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-07 12:53:51,595 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-07 12:53:51,595 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-07 12:53:51,595 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-07 12:53:51,595 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-07 12:53:51,596 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-07 12:53:51,596 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-07 12:53:51,596 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-07 12:53:51,596 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,596 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,596 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,596 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,596 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,597 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-07 12:53:51,597 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-07 12:53:51,597 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-07 12:53:51,597 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-07 12:53:51,597 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-07 12:53:51,597 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-07 12:53:51,597 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-07 12:53:51,597 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-07 12:53:51,597 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,597 INFO L425 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,598 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,598 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,598 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,598 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-07 12:53:51,598 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-07 12:53:51,598 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-07 12:53:51,598 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-07 12:53:51,598 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-07 12:53:51,598 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-07 12:53:51,598 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-07 12:53:51,599 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-07 12:53:51,599 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-07 12:53:51,599 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-07 12:53:51,599 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse15 (= ~a7~0 |old(~a7~0)|)) (.cse3 (= 1 |old(~a17~0)|)) (.cse28 (= 1 ~a7~0)) (.cse16 (= |old(~a8~0)| ~a8~0)) (.cse26 (= |old(~a20~0)| ~a20~0)) (.cse17 (= ~a17~0 |old(~a17~0)|))) (let ((.cse5 (< |old(~a20~0)| 1)) (.cse7 (and .cse28 .cse16 .cse26 .cse17)) (.cse20 (= ~a16~0 5)) (.cse23 (< 0 |old(~a20~0)|)) (.cse11 (< 6 |calculate_output_#in~input|)) (.cse6 (not .cse3)) (.cse18 (not (= 1 |old(~a20~0)|))) (.cse19 (< |calculate_output_#in~input| 1)) (.cse4 (and .cse15 .cse16 .cse26 .cse17)) (.cse2 (and .cse26 .cse17)) (.cse21 (not (= 0 |old(~a7~0)|))) (.cse12 (not (= 1 |old(~a21~0)|))) (.cse13 (not (= 8 ~a12~0))) (.cse24 (not (= 15 |old(~a8~0)|))) (.cse22 (not (= |old(~a20~0)| 1))) (.cse9 (< 0 |old(~a17~0)|)) (.cse14 (= ~a21~0 1)) (.cse8 (not (= 1 |old(~a7~0)|))) (.cse10 (< |old(~a8~0)| 15)) (.cse0 (= 6 |old(~a16~0)|)) (.cse1 (< 13 |old(~a8~0)|)) (.cse27 (not (= ~a16~0 6)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse1 .cse4 .cse5 .cse6) (or .cse7 .cse1 .cse5 .cse8 .cse9) (or .cse0 .cse2 .cse10) (or .cse11 .cse12 (< 15 |old(~a8~0)|) .cse13 (and (<= ~a16~0 5) .cse14 .cse15 .cse16 .cse17 (<= 4 ~a16~0) (= ~a20~0 1)) .cse6 .cse18 (< 5 |old(~a16~0)|) (< |old(~a16~0)| 4) (< 1 |old(~a7~0)|) (< |old(~a8~0)| 13) (< |old(~a7~0)| 0) .cse19) (or (not (= |old(~a21~0)| 1)) .cse20 (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= ~x~0 24)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) .cse19 .cse21 .cse11 (not (= 3 ~c~0)) .cse22 (not (= 23 ~w~0)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0))) (or .cse22 .cse7 .cse8 .cse9) (or .cse4 .cse10 .cse23) (or .cse11 (and .cse14 .cse20) (let ((.cse25 (not (= 5 |old(~a16~0)|)))) (and (or .cse21 .cse12 .cse24 (not (= 0 |old(~a17~0)|)) (not (= 0 |old(~a20~0)|)) .cse25 .cse13) (or .cse21 .cse12 .cse24 .cse25 .cse13 (< |old(~a20~0)| 0) .cse6))) .cse23 .cse19) (or .cse0 (and .cse15 .cse16 .cse26 .cse17 .cse27) .cse9) (or .cse0 .cse27 .cse10) (or .cse11 (or .cse12 (not (= 4 |old(~a16~0)|)) (not (= 13 |old(~a8~0)|))) .cse13 .cse6 .cse18 .cse8 .cse19 (= ~a16~0 4)) (or .cse3 .cse10 .cse4) (or .cse0 .cse1 .cse2 .cse8) (or (or (or .cse21 .cse12 .cse13 (< |old(~a16~0)| 5) (< 6 |old(~a16~0)|) .cse24 (< |old(~a17~0)| 0)) .cse22 .cse9) (and (<= 5 ~a16~0) .cse14 (<= ~a16~0 6))) (or .cse0 (and .cse15 .cse16) .cse10) (or .cse8 (and .cse28 .cse16) .cse10) (or .cse0 .cse1 (and .cse15 .cse16 .cse27))))) [2018-11-07 12:53:51,599 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-07 12:53:51,600 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,600 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,600 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,600 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,600 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,600 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-07 12:53:51,600 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,600 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-07 12:53:51,600 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-07 12:53:51,601 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-07 12:53:51,601 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-07 12:53:51,601 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-07 12:53:51,601 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-07 12:53:51,601 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-07 12:53:51,601 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-07 12:53:51,601 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-07 12:53:51,601 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-07 12:53:51,601 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-07 12:53:51,601 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-07 12:53:51,602 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,602 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,602 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,602 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,602 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,602 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,602 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-07 12:53:51,602 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-07 12:53:51,602 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-07 12:53:51,602 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-07 12:53:51,603 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-07 12:53:51,603 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-07 12:53:51,603 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-07 12:53:51,603 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-07 12:53:51,603 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-07 12:53:51,603 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-07 12:53:51,603 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-07 12:53:51,603 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-07 12:53:51,603 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-07 12:53:51,603 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-07 12:53:51,604 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-07 12:53:51,604 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,604 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,604 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,604 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,604 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,604 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-11-07 12:53:51,604 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-07 12:53:51,604 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-07 12:53:51,604 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-07 12:53:51,605 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-07 12:53:51,605 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-07 12:53:51,605 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-07 12:53:51,605 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-07 12:53:51,605 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-07 12:53:51,605 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-07 12:53:51,605 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-07 12:53:51,605 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 12:53:51,606 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~a8~0 15) (= ~z~0 26) (= ~a17~0 1) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~a7~0 0) (= ~y~0 25) (= ~e~0 5) (= ~x~0 24) (= ~b~0 2) (= ~a~0 1) (= ~a12~0 8) (= ~a20~0 1) (= ~a16~0 5)) [2018-11-07 12:53:51,606 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 12:53:51,606 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 12:53:51,606 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (and (= ~a21~0 1) (= |old(~a8~0)| ~a8~0) (= ~a7~0 |old(~a7~0)|) (= ~a17~0 |old(~a17~0)|) (= ~a20~0 1) (= ~a16~0 5)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= |old(~a16~0)| 5)) (not (= |old(~a21~0)| 1)) (not (= ~b~0 2)) (not (= ~y~0 25)) (not (= |old(~a7~0)| 0)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= ~x~0 24)) (not (= |old(~a17~0)| 1)) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= |old(~a8~0)| 15)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-11-07 12:53:51,606 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-11-07 12:53:51,607 INFO L421 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1))) (let ((.cse3 (not .cse7)) (.cse0 (<= 15 ~a8~0)) (.cse5 (<= ~a17~0 0)) (.cse6 (<= 1 ~a20~0)) (.cse1 (<= ~a8~0 13)) (.cse4 (= 1 ~a7~0)) (.cse2 (not (= ~a16~0 6)))) (or (and .cse0 (<= ~a20~0 0)) (not (= |old(~a21~0)| 1)) (and .cse1 .cse2 .cse3) (not (= ~b~0 2)) (not (= ~y~0 25)) (and .cse0 .cse3) (and .cse1 (= ~a7~0 |old(~a7~0)|) .cse2) (and .cse0 .cse2) (and .cse4 (= |old(~a20~0)| ~a20~0) .cse5) (not (= ~x~0 24)) (and .cse2 .cse5) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (and (<= ~a8~0 |old(~a8~0)|) .cse4 .cse0) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse1 (= ~a17~0 |old(~a17~0)|) .cse6) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (and .cse1 .cse4 .cse5 .cse6) (not (= 0 |old(~a7~0)|)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (not (= 23 ~w~0)) (not (= ~a~0 1)) (and .cse1 .cse4 .cse2) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0)) (and (<= ~a7~0 1) (<= 1 main_~input~0) (<= main_~input~0 6) (<= ~a16~0 5) .cse7 (= ~a21~0 1) (<= 0 ~a7~0) (<= 4 ~a16~0) (= ~a20~0 1))))) [2018-11-07 12:53:51,607 INFO L425 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-11-07 12:53:51,607 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-07 12:53:51,607 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-11-07 12:53:51,607 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse7 (= ~a17~0 1))) (let ((.cse3 (not .cse7)) (.cse0 (<= 15 ~a8~0)) (.cse5 (<= ~a17~0 0)) (.cse6 (<= 1 ~a20~0)) (.cse1 (<= ~a8~0 13)) (.cse4 (= 1 ~a7~0)) (.cse2 (not (= ~a16~0 6)))) (or (and .cse0 (<= ~a20~0 0)) (not (= |old(~a21~0)| 1)) (and .cse1 .cse2 .cse3) (not (= ~b~0 2)) (not (= ~y~0 25)) (and .cse0 .cse3) (and .cse1 (= ~a7~0 |old(~a7~0)|) .cse2) (and .cse0 .cse2) (and .cse4 (= |old(~a20~0)| ~a20~0) .cse5) (not (= ~x~0 24)) (and .cse2 .cse5) (not (= ~a12~0 8)) (not (= ~e~0 5)) (not (= ~d~0 4)) (and (<= ~a8~0 |old(~a8~0)|) .cse4 .cse0) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse1 (= ~a17~0 |old(~a17~0)|) .cse6) (not (= ~z~0 26)) (not (= |old(~a16~0)| 5)) (and .cse1 .cse4 .cse5 .cse6) (not (= 0 |old(~a7~0)|)) (not (= 3 ~c~0)) (not (= |old(~a20~0)| 1)) (and (<= ~a7~0 1) (<= ~a16~0 5) .cse7 (= ~a21~0 1) (<= 0 ~a7~0) (<= 4 ~a16~0) (= ~a20~0 1)) (not (= 23 ~w~0)) (not (= ~a~0 1)) (and .cse1 .cse4 .cse2) (not (= |old(~a17~0)| 1)) (not (= |old(~a8~0)| 15)) (not (= 6 ~f~0))))) [2018-11-07 12:53:51,607 INFO L425 ceAbstractionStarter]: For program point L583-4(lines 577 594) no Hoare annotation was computed. [2018-11-07 12:53:51,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:53:51 BoogieIcfgContainer [2018-11-07 12:53:51,625 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 12:53:51,629 INFO L168 Benchmark]: Toolchain (without parser) took 178652.79 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -589.6 MB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2018-11-07 12:53:51,630 INFO L168 Benchmark]: CDTParser took 0.20 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-11-07 12:53:51,630 INFO L168 Benchmark]: CACSL2BoogieTranslator took 770.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-07 12:53:51,634 INFO L168 Benchmark]: Boogie Procedure Inliner took 132.90 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -816.6 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. [2018-11-07 12:53:51,640 INFO L168 Benchmark]: Boogie Preprocessor took 101.00 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 12:53:51,641 INFO L168 Benchmark]: RCFGBuilder took 3132.66 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 116.1 MB). Peak memory consumption was 116.1 MB. Max. memory is 7.1 GB. [2018-11-07 12:53:51,642 INFO L168 Benchmark]: TraceAbstraction took 174509.61 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 79.2 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2018-11-07 12:53:51,648 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.20 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 770.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 132.90 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -816.6 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 101.00 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3132.66 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 116.1 MB). Peak memory consumption was 116.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 174509.61 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 79.2 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 554]: 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: ((((((((((((((((((((((((((((((15 <= a8 && a20 <= 0) || !(\old(a21) == 1)) || ((a8 <= 13 && !(a16 == 6)) && !(a17 == 1))) || !(b == 2)) || !(y == 25)) || (15 <= a8 && !(a17 == 1))) || ((a8 <= 13 && a7 == \old(a7)) && !(a16 == 6))) || (15 <= a8 && !(a16 == 6))) || ((1 == a7 && \old(a20) == a20) && a17 <= 0)) || !(x == 24)) || (!(a16 == 6) && a17 <= 0)) || !(a12 == 8)) || !(e == 5)) || !(d == 4)) || ((a8 <= \old(a8) && 1 == a7) && 15 <= a8)) || !(21 == u)) || !(22 == v)) || ((a8 <= 13 && a17 == \old(a17)) && 1 <= a20)) || !(z == 26)) || !(\old(a16) == 5)) || (((a8 <= 13 && 1 == a7) && a17 <= 0) && 1 <= a20)) || !(0 == \old(a7))) || !(3 == c)) || !(\old(a20) == 1)) || ((((((a7 <= 1 && a16 <= 5) && a17 == 1) && a21 == 1) && 0 <= a7) && 4 <= a16) && a20 == 1)) || !(23 == w)) || !(a == 1)) || ((a8 <= 13 && 1 == a7) && !(a16 == 6))) || !(\old(a17) == 1)) || !(\old(a8) == 15)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 208 locations, 1 error locations. SAFE Result, 174.4s OverallTime, 11 OverallIterations, 6 TraceHistogramMax, 96.4s AutomataDifference, 0.0s DeadEndRemovalTime, 11.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 1903 SDtfs, 11572 SDslu, 2235 SDs, 0 SdLazy, 14103 SolverSat, 3006 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 54.7s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 2848 GetRequests, 2610 SyntacticMatches, 14 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1651 ImplicationChecksByTransitivity, 8.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13776occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 43.9s AbstIntTime, 9 AbstIntIterations, 5 AbstIntStrong, 0.9974515889261018 AbsIntWeakeningRatio, 0.21129943502824858 AbsIntAvgWeakeningVarsNumRemoved, 21.510734463276837 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 11 MinimizatonAttempts, 1162 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 672 PreInvPairs, 1040 NumberOfFragments, 1181 HoareAnnotationTreeSize, 672 FomulaSimplifications, 24572 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 7 FomulaSimplificationsInter, 9397 FormulaSimplificationTreeSizeReductionInter, 10.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 2914 NumberOfCodeBlocks, 2914 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3769 ConstructedInterpolants, 0 QuantifiedInterpolants, 1571012 SizeOfPredicates, 6 NumberOfNonLiveVariables, 2435 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 19 InterpolantComputations, 6 PerfectInterpolantSequences, 2054/2249 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...