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-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label36_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 20:37:05,041 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 20:37:05,043 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 20:37:05,056 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 20:37:05,056 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 20:37:05,058 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 20:37:05,059 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 20:37:05,061 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 20:37:05,063 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 20:37:05,064 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 20:37:05,065 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 20:37:05,065 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 20:37:05,066 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 20:37:05,068 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 20:37:05,069 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 20:37:05,070 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 20:37:05,071 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 20:37:05,073 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 20:37:05,075 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 20:37:05,077 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 20:37:05,079 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 20:37:05,080 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 20:37:05,083 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 20:37:05,084 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 20:37:05,084 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 20:37:05,085 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 20:37:05,086 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 20:37:05,087 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 20:37:05,088 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 20:37:05,089 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 20:37:05,089 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 20:37:05,090 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 20:37:05,090 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 20:37:05,091 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 20:37:05,092 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 20:37:05,093 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 20:37:05,093 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-LIM.epf [2018-11-07 20:37:05,118 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 20:37:05,118 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 20:37:05,119 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 20:37:05,119 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 20:37:05,119 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 20:37:05,120 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 20:37:05,124 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 20:37:05,124 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 20:37:05,124 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 20:37:05,124 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 20:37:05,125 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 20:37:05,125 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 20:37:05,125 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 20:37:05,126 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 20:37:05,127 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 20:37:05,127 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 20:37:05,127 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 20:37:05,127 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 20:37:05,128 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 20:37:05,128 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 20:37:05,128 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 20:37:05,128 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 20:37:05,128 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 20:37:05,129 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 20:37:05,130 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 20:37:05,130 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 20:37:05,130 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 20:37:05,130 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 20:37:05,130 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 20:37:05,131 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 20:37:05,131 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 20:37:05,131 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 20:37:05,131 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 20:37:05,132 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 20:37:05,132 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 20:37:05,202 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 20:37:05,218 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 20:37:05,221 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 20:37:05,223 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 20:37:05,223 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 20:37:05,223 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label36_true-unreach-call_false-termination.c [2018-11-07 20:37:05,290 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/926538b11/2eb6df066c0a4069a179c128f9a9f0e9/FLAGdb45d1712 [2018-11-07 20:37:05,874 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 20:37:05,875 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label36_true-unreach-call_false-termination.c [2018-11-07 20:37:05,902 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/926538b11/2eb6df066c0a4069a179c128f9a9f0e9/FLAGdb45d1712 [2018-11-07 20:37:05,916 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/926538b11/2eb6df066c0a4069a179c128f9a9f0e9 [2018-11-07 20:37:05,925 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 20:37:05,927 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 20:37:05,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 20:37:05,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 20:37:05,932 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 20:37:05,933 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:37:05" (1/1) ... [2018-11-07 20:37:05,936 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41600c68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:05, skipping insertion in model container [2018-11-07 20:37:05,937 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:37:05" (1/1) ... [2018-11-07 20:37:05,947 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 20:37:06,030 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 20:37:06,548 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:37:06,554 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 20:37:06,718 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:37:06,737 INFO L193 MainTranslator]: Completed translation [2018-11-07 20:37:06,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:06 WrapperNode [2018-11-07 20:37:06,738 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 20:37:06,739 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 20:37:06,739 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 20:37:06,739 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 20:37:06,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:06" (1/1) ... [2018-11-07 20:37:06,881 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:06" (1/1) ... [2018-11-07 20:37:06,891 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 20:37:06,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 20:37:06,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 20:37:06,891 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 20:37:06,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:06" (1/1) ... [2018-11-07 20:37:06,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:06" (1/1) ... [2018-11-07 20:37:06,908 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:06" (1/1) ... [2018-11-07 20:37:06,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:06" (1/1) ... [2018-11-07 20:37:06,951 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:06" (1/1) ... [2018-11-07 20:37:06,981 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:06" (1/1) ... [2018-11-07 20:37:06,992 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:06" (1/1) ... [2018-11-07 20:37:07,003 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 20:37:07,003 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 20:37:07,003 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 20:37:07,005 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 20:37:07,005 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:06" (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 20:37:07,078 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 20:37:07,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 20:37:07,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 20:37:07,079 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 20:37:07,079 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 20:37:07,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 20:37:07,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 20:37:07,079 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 20:37:07,079 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 20:37:10,511 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 20:37:10,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:37:10 BoogieIcfgContainer [2018-11-07 20:37:10,512 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 20:37:10,513 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 20:37:10,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 20:37:10,518 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 20:37:10,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:37:05" (1/3) ... [2018-11-07 20:37:10,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e44a705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:37:10, skipping insertion in model container [2018-11-07 20:37:10,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:37:06" (2/3) ... [2018-11-07 20:37:10,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e44a705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:37:10, skipping insertion in model container [2018-11-07 20:37:10,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:37:10" (3/3) ... [2018-11-07 20:37:10,522 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label36_true-unreach-call_false-termination.c [2018-11-07 20:37:10,531 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 20:37:10,540 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 20:37:10,555 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 20:37:10,599 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 20:37:10,599 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 20:37:10,599 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 20:37:10,600 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 20:37:10,600 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 20:37:10,600 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 20:37:10,600 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 20:37:10,601 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 20:37:10,637 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-11-07 20:37:10,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-07 20:37:10,648 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:37:10,651 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] [2018-11-07 20:37:10,653 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:37:10,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:37:10,660 INFO L82 PathProgramCache]: Analyzing trace with hash -601836047, now seen corresponding path program 1 times [2018-11-07 20:37:10,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:37:10,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:37:10,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:37:10,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:37:10,717 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:37:10,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:37:11,131 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 20:37:11,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:37:11,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 20:37:11,134 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:37:11,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 20:37:11,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 20:37:11,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 20:37:11,163 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 3 states. [2018-11-07 20:37:13,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:37:13,123 INFO L93 Difference]: Finished difference Result 691 states and 1226 transitions. [2018-11-07 20:37:13,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 20:37:13,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-11-07 20:37:13,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:37:13,146 INFO L225 Difference]: With dead ends: 691 [2018-11-07 20:37:13,146 INFO L226 Difference]: Without dead ends: 434 [2018-11-07 20:37:13,155 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 20:37:13,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-11-07 20:37:13,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2018-11-07 20:37:13,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-11-07 20:37:13,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 765 transitions. [2018-11-07 20:37:13,243 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 765 transitions. Word has length 55 [2018-11-07 20:37:13,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:37:13,244 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 765 transitions. [2018-11-07 20:37:13,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 20:37:13,244 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 765 transitions. [2018-11-07 20:37:13,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-07 20:37:13,254 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:37:13,255 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-11-07 20:37:13,256 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:37:13,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:37:13,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1606390417, now seen corresponding path program 1 times [2018-11-07 20:37:13,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:37:13,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:37:13,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:37:13,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:37:13,258 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:37:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:37:13,604 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:37:13,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:37:13,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 20:37:13,606 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:37:13,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:37:13,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:37:13,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:37:13,609 INFO L87 Difference]: Start difference. First operand 434 states and 765 transitions. Second operand 6 states. [2018-11-07 20:37:15,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:37:15,632 INFO L93 Difference]: Finished difference Result 1062 states and 1897 transitions. [2018-11-07 20:37:15,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:37:15,633 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2018-11-07 20:37:15,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:37:15,641 INFO L225 Difference]: With dead ends: 1062 [2018-11-07 20:37:15,642 INFO L226 Difference]: Without dead ends: 634 [2018-11-07 20:37:15,644 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 20:37:15,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2018-11-07 20:37:15,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 625. [2018-11-07 20:37:15,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2018-11-07 20:37:15,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 1019 transitions. [2018-11-07 20:37:15,692 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 1019 transitions. Word has length 130 [2018-11-07 20:37:15,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:37:15,692 INFO L480 AbstractCegarLoop]: Abstraction has 625 states and 1019 transitions. [2018-11-07 20:37:15,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:37:15,693 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 1019 transitions. [2018-11-07 20:37:15,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-07 20:37:15,696 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:37:15,697 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-11-07 20:37:15,697 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:37:15,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:37:15,698 INFO L82 PathProgramCache]: Analyzing trace with hash 946019240, now seen corresponding path program 1 times [2018-11-07 20:37:15,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:37:15,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:37:15,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:37:15,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:37:15,700 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:37:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:37:15,962 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:37:15,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:37:15,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 20:37:15,964 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:37:15,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 20:37:15,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 20:37:15,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:37:15,965 INFO L87 Difference]: Start difference. First operand 625 states and 1019 transitions. Second operand 4 states. [2018-11-07 20:37:21,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:37:21,683 INFO L93 Difference]: Finished difference Result 2350 states and 4005 transitions. [2018-11-07 20:37:21,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 20:37:21,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2018-11-07 20:37:21,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:37:21,704 INFO L225 Difference]: With dead ends: 2350 [2018-11-07 20:37:21,704 INFO L226 Difference]: Without dead ends: 1731 [2018-11-07 20:37:21,713 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:37:21,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2018-11-07 20:37:21,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 1731. [2018-11-07 20:37:21,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1731 states. [2018-11-07 20:37:21,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 2670 transitions. [2018-11-07 20:37:21,804 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 2670 transitions. Word has length 139 [2018-11-07 20:37:21,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:37:21,805 INFO L480 AbstractCegarLoop]: Abstraction has 1731 states and 2670 transitions. [2018-11-07 20:37:21,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 20:37:21,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 2670 transitions. [2018-11-07 20:37:21,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-11-07 20:37:21,823 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:37:21,823 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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] [2018-11-07 20:37:21,823 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:37:21,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:37:21,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1544356755, now seen corresponding path program 1 times [2018-11-07 20:37:21,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:37:21,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:37:21,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:37:21,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:37:21,826 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:37:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:37:22,824 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 189 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:37:22,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:37:22,824 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:37:22,825 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 264 with the following transitions: [2018-11-07 20:37:22,828 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:37:22,877 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:37:22,878 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:37:23,529 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:37:23,533 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:37:23,535 INFO L272 AbstractInterpreter]: Visited 118 different actions 118 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-11-07 20:37:23,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:37:23,564 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:37:24,221 INFO L227 lantSequenceWeakener]: Weakened 254 states. On average, predicates are now at 77.92% of their original sizes. [2018-11-07 20:37:24,222 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:37:24,606 INFO L415 sIntCurrentIteration]: We unified 262 AI predicates to 262 [2018-11-07 20:37:24,606 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:37:24,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:37:24,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2018-11-07 20:37:24,608 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:37:24,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 20:37:24,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 20:37:24,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-07 20:37:24,609 INFO L87 Difference]: Start difference. First operand 1731 states and 2670 transitions. Second operand 7 states. [2018-11-07 20:37:36,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:37:36,981 INFO L93 Difference]: Finished difference Result 3641 states and 5626 transitions. [2018-11-07 20:37:36,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:37:36,981 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 263 [2018-11-07 20:37:36,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:37:36,994 INFO L225 Difference]: With dead ends: 3641 [2018-11-07 20:37:36,994 INFO L226 Difference]: Without dead ends: 1916 [2018-11-07 20:37:37,003 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 263 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-07 20:37:37,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states. [2018-11-07 20:37:37,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1914. [2018-11-07 20:37:37,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1914 states. [2018-11-07 20:37:37,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2861 transitions. [2018-11-07 20:37:37,059 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2861 transitions. Word has length 263 [2018-11-07 20:37:37,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:37:37,060 INFO L480 AbstractCegarLoop]: Abstraction has 1914 states and 2861 transitions. [2018-11-07 20:37:37,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 20:37:37,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2861 transitions. [2018-11-07 20:37:37,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-11-07 20:37:37,072 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:37:37,072 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:37:37,073 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:37:37,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:37:37,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1780119455, now seen corresponding path program 1 times [2018-11-07 20:37:37,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:37:37,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:37:37,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:37:37,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:37:37,075 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:37:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:37:37,628 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 20:37:37,826 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-07 20:37:38,037 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 20:37:38,885 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 232 proven. 172 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:37:38,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:37:38,885 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:37:38,886 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 349 with the following transitions: [2018-11-07 20:37:38,886 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:37:38,892 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:37:38,892 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:37:39,025 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:37:39,133 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:37:39,133 INFO L272 AbstractInterpreter]: Visited 122 different actions 237 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:37:39,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:37:39,159 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:37:39,768 INFO L227 lantSequenceWeakener]: Weakened 99 states. On average, predicates are now at 78.05% of their original sizes. [2018-11-07 20:37:39,769 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:37:40,530 INFO L415 sIntCurrentIteration]: We unified 347 AI predicates to 347 [2018-11-07 20:37:40,531 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:37:40,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:37:40,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [12] total 30 [2018-11-07 20:37:40,531 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:37:40,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 20:37:40,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 20:37:40,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2018-11-07 20:37:40,533 INFO L87 Difference]: Start difference. First operand 1914 states and 2861 transitions. Second operand 20 states. [2018-11-07 20:38:02,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:38:02,992 INFO L93 Difference]: Finished difference Result 4850 states and 7321 transitions. [2018-11-07 20:38:02,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 20:38:02,992 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 348 [2018-11-07 20:38:02,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:38:03,008 INFO L225 Difference]: With dead ends: 4850 [2018-11-07 20:38:03,009 INFO L226 Difference]: Without dead ends: 3125 [2018-11-07 20:38:03,019 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 357 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=174, Invalid=696, Unknown=0, NotChecked=0, Total=870 [2018-11-07 20:38:03,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3125 states. [2018-11-07 20:38:03,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3125 to 2983. [2018-11-07 20:38:03,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2983 states. [2018-11-07 20:38:03,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2983 states to 2983 states and 3990 transitions. [2018-11-07 20:38:03,093 INFO L78 Accepts]: Start accepts. Automaton has 2983 states and 3990 transitions. Word has length 348 [2018-11-07 20:38:03,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:38:03,093 INFO L480 AbstractCegarLoop]: Abstraction has 2983 states and 3990 transitions. [2018-11-07 20:38:03,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 20:38:03,094 INFO L276 IsEmpty]: Start isEmpty. Operand 2983 states and 3990 transitions. [2018-11-07 20:38:03,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-11-07 20:38:03,108 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:38:03,108 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:38:03,108 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:38:03,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:38:03,109 INFO L82 PathProgramCache]: Analyzing trace with hash -490485645, now seen corresponding path program 1 times [2018-11-07 20:38:03,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:38:03,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:38:03,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:38:03,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:38:03,110 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:38:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:38:03,617 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 20:38:03,818 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-07 20:38:05,197 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 157 proven. 283 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:38:05,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:38:05,198 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:38:05,198 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 375 with the following transitions: [2018-11-07 20:38:05,199 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [659], [663], [666], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:38:05,203 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:38:05,203 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:38:05,311 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:38:05,385 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:38:05,385 INFO L272 AbstractInterpreter]: Visited 122 different actions 240 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:38:05,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:38:05,391 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:38:05,754 INFO L227 lantSequenceWeakener]: Weakened 149 states. On average, predicates are now at 78.73% of their original sizes. [2018-11-07 20:38:05,754 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:38:06,134 INFO L415 sIntCurrentIteration]: We unified 373 AI predicates to 373 [2018-11-07 20:38:06,134 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:38:06,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:38:06,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [15] total 34 [2018-11-07 20:38:06,134 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:38:06,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 20:38:06,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 20:38:06,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-11-07 20:38:06,136 INFO L87 Difference]: Start difference. First operand 2983 states and 3990 transitions. Second operand 21 states. [2018-11-07 20:38:27,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:38:27,491 INFO L93 Difference]: Finished difference Result 5079 states and 7110 transitions. [2018-11-07 20:38:27,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 20:38:27,491 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 374 [2018-11-07 20:38:27,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:38:27,506 INFO L225 Difference]: With dead ends: 5079 [2018-11-07 20:38:27,506 INFO L226 Difference]: Without dead ends: 3354 [2018-11-07 20:38:27,514 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 390 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=268, Invalid=1138, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 20:38:27,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3354 states. [2018-11-07 20:38:27,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3354 to 3168. [2018-11-07 20:38:27,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3168 states. [2018-11-07 20:38:27,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3168 states to 3168 states and 4181 transitions. [2018-11-07 20:38:27,591 INFO L78 Accepts]: Start accepts. Automaton has 3168 states and 4181 transitions. Word has length 374 [2018-11-07 20:38:27,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:38:27,592 INFO L480 AbstractCegarLoop]: Abstraction has 3168 states and 4181 transitions. [2018-11-07 20:38:27,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 20:38:27,592 INFO L276 IsEmpty]: Start isEmpty. Operand 3168 states and 4181 transitions. [2018-11-07 20:38:27,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2018-11-07 20:38:27,606 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:38:27,607 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 20:38:27,607 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:38:27,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:38:27,607 INFO L82 PathProgramCache]: Analyzing trace with hash 938240039, now seen corresponding path program 1 times [2018-11-07 20:38:27,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:38:27,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:38:27,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:38:27,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:38:27,609 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:38:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:38:28,622 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 260 proven. 182 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:38:28,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:38:28,622 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:38:28,623 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 385 with the following transitions: [2018-11-07 20:38:28,623 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [698], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:38:28,626 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:38:28,627 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:38:28,712 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:38:28,864 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:38:28,864 INFO L272 AbstractInterpreter]: Visited 130 different actions 256 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:38:28,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:38:28,899 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:38:29,352 INFO L227 lantSequenceWeakener]: Weakened 95 states. On average, predicates are now at 78.09% of their original sizes. [2018-11-07 20:38:29,353 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:38:29,745 INFO L415 sIntCurrentIteration]: We unified 383 AI predicates to 383 [2018-11-07 20:38:29,746 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:38:29,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:38:29,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [12] total 29 [2018-11-07 20:38:29,746 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:38:29,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 20:38:29,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 20:38:29,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2018-11-07 20:38:29,748 INFO L87 Difference]: Start difference. First operand 3168 states and 4181 transitions. Second operand 19 states. [2018-11-07 20:38:47,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:38:47,667 INFO L93 Difference]: Finished difference Result 5929 states and 8455 transitions. [2018-11-07 20:38:47,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 20:38:47,667 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 384 [2018-11-07 20:38:47,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:38:47,685 INFO L225 Difference]: With dead ends: 5929 [2018-11-07 20:38:47,685 INFO L226 Difference]: Without dead ends: 4204 [2018-11-07 20:38:47,695 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 392 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2018-11-07 20:38:47,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4204 states. [2018-11-07 20:38:47,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4204 to 3691. [2018-11-07 20:38:47,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3691 states. [2018-11-07 20:38:47,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3691 states to 3691 states and 4729 transitions. [2018-11-07 20:38:47,791 INFO L78 Accepts]: Start accepts. Automaton has 3691 states and 4729 transitions. Word has length 384 [2018-11-07 20:38:47,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:38:47,792 INFO L480 AbstractCegarLoop]: Abstraction has 3691 states and 4729 transitions. [2018-11-07 20:38:47,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 20:38:47,792 INFO L276 IsEmpty]: Start isEmpty. Operand 3691 states and 4729 transitions. [2018-11-07 20:38:47,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-11-07 20:38:47,809 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:38:47,809 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 20:38:47,810 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:38:47,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:38:47,810 INFO L82 PathProgramCache]: Analyzing trace with hash -718601408, now seen corresponding path program 1 times [2018-11-07 20:38:47,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:38:47,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:38:47,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:38:47,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:38:47,811 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:38:47,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:38:48,281 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 20:38:48,896 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 244 proven. 198 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:38:48,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:38:48,897 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:38:48,897 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 410 with the following transitions: [2018-11-07 20:38:48,897 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [798], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:38:48,901 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:38:48,901 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:38:49,025 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:38:49,331 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:38:49,332 INFO L272 AbstractInterpreter]: Visited 155 different actions 306 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:38:49,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:38:49,369 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:38:50,418 INFO L227 lantSequenceWeakener]: Weakened 95 states. On average, predicates are now at 78.09% of their original sizes. [2018-11-07 20:38:50,419 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:38:50,822 INFO L415 sIntCurrentIteration]: We unified 408 AI predicates to 408 [2018-11-07 20:38:50,822 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:38:50,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:38:50,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [13] total 30 [2018-11-07 20:38:50,823 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:38:50,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 20:38:50,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 20:38:50,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2018-11-07 20:38:50,824 INFO L87 Difference]: Start difference. First operand 3691 states and 4729 transitions. Second operand 19 states. [2018-11-07 20:39:13,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:39:13,465 INFO L93 Difference]: Finished difference Result 6449 states and 9002 transitions. [2018-11-07 20:39:13,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 20:39:13,465 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 409 [2018-11-07 20:39:13,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:39:13,484 INFO L225 Difference]: With dead ends: 6449 [2018-11-07 20:39:13,484 INFO L226 Difference]: Without dead ends: 4724 [2018-11-07 20:39:13,493 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 417 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2018-11-07 20:39:13,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4724 states. [2018-11-07 20:39:13,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4724 to 4210. [2018-11-07 20:39:13,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4210 states. [2018-11-07 20:39:13,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4210 states to 4210 states and 5275 transitions. [2018-11-07 20:39:13,595 INFO L78 Accepts]: Start accepts. Automaton has 4210 states and 5275 transitions. Word has length 409 [2018-11-07 20:39:13,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:39:13,596 INFO L480 AbstractCegarLoop]: Abstraction has 4210 states and 5275 transitions. [2018-11-07 20:39:13,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 20:39:13,596 INFO L276 IsEmpty]: Start isEmpty. Operand 4210 states and 5275 transitions. [2018-11-07 20:39:13,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-11-07 20:39:13,610 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:39:13,611 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 20:39:13,611 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:39:13,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:39:13,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1148210221, now seen corresponding path program 1 times [2018-11-07 20:39:13,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:39:13,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:39:13,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:39:13,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:39:13,613 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:39:13,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:39:14,075 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 20:39:14,695 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 231 proven. 211 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:39:14,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:39:14,695 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:39:14,695 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 423 with the following transitions: [2018-11-07 20:39:14,696 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [850], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:39:14,699 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:39:14,699 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:39:14,759 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:39:14,934 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:39:14,935 INFO L272 AbstractInterpreter]: Visited 168 different actions 329 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:39:14,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:39:14,941 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:39:15,545 INFO L227 lantSequenceWeakener]: Weakened 95 states. On average, predicates are now at 78.09% of their original sizes. [2018-11-07 20:39:15,545 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:39:16,682 INFO L415 sIntCurrentIteration]: We unified 421 AI predicates to 421 [2018-11-07 20:39:16,682 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:39:16,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:39:16,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [12] total 29 [2018-11-07 20:39:16,683 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:39:16,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-07 20:39:16,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-07 20:39:16,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2018-11-07 20:39:16,685 INFO L87 Difference]: Start difference. First operand 4210 states and 5275 transitions. Second operand 19 states. [2018-11-07 20:39:36,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:39:36,920 INFO L93 Difference]: Finished difference Result 6969 states and 9549 transitions. [2018-11-07 20:39:36,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 20:39:36,920 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 422 [2018-11-07 20:39:36,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:39:36,938 INFO L225 Difference]: With dead ends: 6969 [2018-11-07 20:39:36,938 INFO L226 Difference]: Without dead ends: 5244 [2018-11-07 20:39:36,946 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 430 GetRequests, 398 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2018-11-07 20:39:36,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5244 states. [2018-11-07 20:39:37,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5244 to 4729. [2018-11-07 20:39:37,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4729 states. [2018-11-07 20:39:37,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4729 states to 4729 states and 5821 transitions. [2018-11-07 20:39:37,060 INFO L78 Accepts]: Start accepts. Automaton has 4729 states and 5821 transitions. Word has length 422 [2018-11-07 20:39:37,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:39:37,060 INFO L480 AbstractCegarLoop]: Abstraction has 4729 states and 5821 transitions. [2018-11-07 20:39:37,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-07 20:39:37,061 INFO L276 IsEmpty]: Start isEmpty. Operand 4729 states and 5821 transitions. [2018-11-07 20:39:37,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2018-11-07 20:39:37,077 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:39:37,077 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 20:39:37,077 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:39:37,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:39:37,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1299578539, now seen corresponding path program 1 times [2018-11-07 20:39:37,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:39:37,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:39:37,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:39:37,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:39:37,079 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:39:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:39:37,523 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 20:39:37,716 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-07 20:39:38,776 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 219 proven. 223 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:39:38,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:39:38,776 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:39:38,776 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 435 with the following transitions: [2018-11-07 20:39:38,777 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [666], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [855], [859], [863], [867], [871], [875], [879], [883], [887], [891], [895], [898], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:39:38,779 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:39:38,779 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:39:38,882 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:39:39,044 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:39:39,044 INFO L272 AbstractInterpreter]: Visited 180 different actions 356 times. Merged at 5 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 20:39:39,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:39:39,053 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:39:39,480 INFO L227 lantSequenceWeakener]: Weakened 99 states. On average, predicates are now at 78.05% of their original sizes. [2018-11-07 20:39:39,480 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:39:39,932 INFO L415 sIntCurrentIteration]: We unified 433 AI predicates to 433 [2018-11-07 20:39:39,933 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:39:39,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:39:39,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [14] total 32 [2018-11-07 20:39:39,933 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:39:39,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-07 20:39:39,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-07 20:39:39,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2018-11-07 20:39:39,934 INFO L87 Difference]: Start difference. First operand 4729 states and 5821 transitions. Second operand 20 states. [2018-11-07 20:40:02,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:40:02,344 INFO L93 Difference]: Finished difference Result 7487 states and 10094 transitions. [2018-11-07 20:40:02,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 20:40:02,344 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 434 [2018-11-07 20:40:02,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:40:02,358 INFO L225 Difference]: With dead ends: 7487 [2018-11-07 20:40:02,358 INFO L226 Difference]: Without dead ends: 5762 [2018-11-07 20:40:02,367 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 443 GetRequests, 415 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=174, Invalid=696, Unknown=0, NotChecked=0, Total=870 [2018-11-07 20:40:02,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5762 states. [2018-11-07 20:40:02,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5762 to 5246. [2018-11-07 20:40:02,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5246 states. [2018-11-07 20:40:02,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5246 states to 5246 states and 6365 transitions. [2018-11-07 20:40:02,467 INFO L78 Accepts]: Start accepts. Automaton has 5246 states and 6365 transitions. Word has length 434 [2018-11-07 20:40:02,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:40:02,468 INFO L480 AbstractCegarLoop]: Abstraction has 5246 states and 6365 transitions. [2018-11-07 20:40:02,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-07 20:40:02,468 INFO L276 IsEmpty]: Start isEmpty. Operand 5246 states and 6365 transitions. [2018-11-07 20:40:02,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-11-07 20:40:02,485 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:40:02,486 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:40:02,486 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:40:02,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:40:02,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1413159681, now seen corresponding path program 1 times [2018-11-07 20:40:02,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:40:02,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:40:02,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:40:02,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:40:02,488 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:40:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:40:03,172 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 285 proven. 202 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2018-11-07 20:40:03,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:40:03,172 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:40:03,173 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 460 with the following transitions: [2018-11-07 20:40:03,173 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [341], [343], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [659], [663], [666], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:40:03,175 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:40:03,175 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:40:03,263 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:40:03,490 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:40:03,490 INFO L272 AbstractInterpreter]: Visited 123 different actions 367 times. Merged at 7 different actions 20 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-07 20:40:03,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:40:03,499 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:40:04,192 INFO L227 lantSequenceWeakener]: Weakened 104 states. On average, predicates are now at 77.62% of their original sizes. [2018-11-07 20:40:04,192 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:40:05,059 INFO L415 sIntCurrentIteration]: We unified 458 AI predicates to 458 [2018-11-07 20:40:05,060 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:40:05,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:40:05,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [6] total 21 [2018-11-07 20:40:05,060 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:40:05,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 20:40:05,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 20:40:05,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-11-07 20:40:05,062 INFO L87 Difference]: Start difference. First operand 5246 states and 6365 transitions. Second operand 17 states. [2018-11-07 20:40:30,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:40:30,081 INFO L93 Difference]: Finished difference Result 10174 states and 12778 transitions. [2018-11-07 20:40:30,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 20:40:30,081 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 459 [2018-11-07 20:40:30,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:40:30,093 INFO L225 Difference]: With dead ends: 10174 [2018-11-07 20:40:30,093 INFO L226 Difference]: Without dead ends: 5494 [2018-11-07 20:40:30,105 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 470 GetRequests, 440 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=166, Invalid=646, Unknown=0, NotChecked=0, Total=812 [2018-11-07 20:40:30,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5494 states. [2018-11-07 20:40:30,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5494 to 5461. [2018-11-07 20:40:30,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5461 states. [2018-11-07 20:40:30,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5461 states to 5461 states and 6619 transitions. [2018-11-07 20:40:30,204 INFO L78 Accepts]: Start accepts. Automaton has 5461 states and 6619 transitions. Word has length 459 [2018-11-07 20:40:30,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:40:30,204 INFO L480 AbstractCegarLoop]: Abstraction has 5461 states and 6619 transitions. [2018-11-07 20:40:30,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 20:40:30,205 INFO L276 IsEmpty]: Start isEmpty. Operand 5461 states and 6619 transitions. [2018-11-07 20:40:30,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2018-11-07 20:40:30,220 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:40:30,220 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:40:30,220 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:40:30,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:40:30,221 INFO L82 PathProgramCache]: Analyzing trace with hash 2044324798, now seen corresponding path program 1 times [2018-11-07 20:40:30,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:40:30,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:40:30,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:40:30,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:40:30,222 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:40:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:40:30,556 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2018-11-07 20:40:30,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:40:30,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 20:40:30,557 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:40:30,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 20:40:30,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 20:40:30,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 20:40:30,558 INFO L87 Difference]: Start difference. First operand 5461 states and 6619 transitions. Second operand 3 states. [2018-11-07 20:40:32,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:40:32,251 INFO L93 Difference]: Finished difference Result 8473 states and 11382 transitions. [2018-11-07 20:40:32,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 20:40:32,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 484 [2018-11-07 20:40:32,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:40:32,252 INFO L225 Difference]: With dead ends: 8473 [2018-11-07 20:40:32,252 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 20:40:32,276 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 20:40:32,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 20:40:32,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 20:40:32,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 20:40:32,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 20:40:32,277 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 484 [2018-11-07 20:40:32,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:40:32,277 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 20:40:32,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 20:40:32,278 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 20:40:32,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 20:40:32,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 20:40:33,213 WARN L179 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2018-11-07 20:40:33,808 WARN L179 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 52 [2018-11-07 20:40:35,885 WARN L179 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 220 DAG size of output: 107 [2018-11-07 20:40:36,938 WARN L179 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 84 DAG size of output: 51 [2018-11-07 20:40:37,267 WARN L179 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 51 [2018-11-07 20:40:37,270 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 20:40:37,271 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |old(~a15~0)| ~a15~0) [2018-11-07 20:40:37,271 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 20:40:37,271 INFO L425 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2018-11-07 20:40:37,271 INFO L425 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2018-11-07 20:40:37,271 INFO L425 ceAbstractionStarter]: For program point L168(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,271 INFO L425 ceAbstractionStarter]: For program point L102(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,271 INFO L425 ceAbstractionStarter]: For program point L36(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,271 INFO L425 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2018-11-07 20:40:37,271 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-07 20:40:37,272 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-07 20:40:37,272 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-07 20:40:37,272 INFO L425 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2018-11-07 20:40:37,272 INFO L425 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2018-11-07 20:40:37,272 INFO L425 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2018-11-07 20:40:37,272 INFO L425 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2018-11-07 20:40:37,272 INFO L425 ceAbstractionStarter]: For program point L171(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,272 INFO L425 ceAbstractionStarter]: For program point L105(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,272 INFO L425 ceAbstractionStarter]: For program point L39(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,272 INFO L425 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2018-11-07 20:40:37,272 INFO L425 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2018-11-07 20:40:37,272 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-07 20:40:37,272 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-07 20:40:37,272 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-07 20:40:37,273 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2018-11-07 20:40:37,273 INFO L425 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2018-11-07 20:40:37,273 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2018-11-07 20:40:37,273 INFO L425 ceAbstractionStarter]: For program point L174(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,273 INFO L425 ceAbstractionStarter]: For program point L108(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,273 INFO L425 ceAbstractionStarter]: For program point L42(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,273 INFO L425 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2018-11-07 20:40:37,273 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-07 20:40:37,274 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-07 20:40:37,274 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-07 20:40:37,274 INFO L425 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2018-11-07 20:40:37,274 INFO L425 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2018-11-07 20:40:37,274 INFO L425 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2018-11-07 20:40:37,274 INFO L425 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2018-11-07 20:40:37,274 INFO L425 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2018-11-07 20:40:37,274 INFO L425 ceAbstractionStarter]: For program point L177(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,275 INFO L425 ceAbstractionStarter]: For program point L111(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,275 INFO L425 ceAbstractionStarter]: For program point L45(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,275 INFO L425 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2018-11-07 20:40:37,275 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-11-07 20:40:37,275 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-07 20:40:37,275 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-07 20:40:37,275 INFO L425 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2018-11-07 20:40:37,275 INFO L425 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2018-11-07 20:40:37,275 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2018-11-07 20:40:37,276 INFO L425 ceAbstractionStarter]: For program point L180(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,276 INFO L425 ceAbstractionStarter]: For program point L114(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,276 INFO L425 ceAbstractionStarter]: For program point L48(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,276 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2018-11-07 20:40:37,276 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-07 20:40:37,276 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-07 20:40:37,276 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-11-07 20:40:37,276 INFO L425 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2018-11-07 20:40:37,277 INFO L425 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2018-11-07 20:40:37,277 INFO L425 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2018-11-07 20:40:37,277 INFO L425 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2018-11-07 20:40:37,277 INFO L425 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2018-11-07 20:40:37,277 INFO L425 ceAbstractionStarter]: For program point L183(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,277 INFO L425 ceAbstractionStarter]: For program point L117(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,277 INFO L425 ceAbstractionStarter]: For program point L51(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,277 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,277 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2018-11-07 20:40:37,278 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-07 20:40:37,278 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-07 20:40:37,278 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-07 20:40:37,278 INFO L425 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2018-11-07 20:40:37,278 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2018-11-07 20:40:37,278 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2018-11-07 20:40:37,278 INFO L425 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2018-11-07 20:40:37,278 INFO L425 ceAbstractionStarter]: For program point L186(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,278 INFO L425 ceAbstractionStarter]: For program point L120(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,279 INFO L425 ceAbstractionStarter]: For program point L54(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,279 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-11-07 20:40:37,279 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-07 20:40:37,279 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-07 20:40:37,279 INFO L425 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2018-11-07 20:40:37,279 INFO L425 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2018-11-07 20:40:37,279 INFO L425 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2018-11-07 20:40:37,279 INFO L425 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2018-11-07 20:40:37,280 INFO L425 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2018-11-07 20:40:37,280 INFO L425 ceAbstractionStarter]: For program point L189(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,280 INFO L425 ceAbstractionStarter]: For program point L123(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,280 INFO L425 ceAbstractionStarter]: For program point L57(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,280 INFO L425 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2018-11-07 20:40:37,280 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2018-11-07 20:40:37,280 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-07 20:40:37,280 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-07 20:40:37,280 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-07 20:40:37,280 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2018-11-07 20:40:37,281 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 872) the Hoare annotation is: (let ((.cse0 (= |old(~a15~0)| ~a15~0)) (.cse3 (< 7 |old(~a21~0)|)) (.cse5 (<= ~a21~0 7)) (.cse4 (let ((.cse9 (< |old(~a15~0)| 5)) (.cse10 (< 10 |old(~a21~0)|)) (.cse11 (not (= 1 |old(~a24~0)|))) (.cse12 (not (= 0 (+ |old(~a12~0)| 49))))) (and (or .cse9 .cse10 .cse11 .cse12 (< |old(~a21~0)| 7) (< 8 |old(~a15~0)|)) (or (< |old(~a21~0)| 6) .cse9 .cse10 .cse11 .cse12 (< 7 |old(~a15~0)|))))) (.cse1 (= 6 |old(~a15~0)|)) (.cse2 (= 8 |old(~a21~0)|))) (and (or .cse0 .cse1) (or .cse2 (not (= 8 ~a21~0))) (or (< 80 |old(~a12~0)|) (and (<= ~a12~0 80) .cse0)) (or .cse2 .cse0) (or (and (or .cse3 (< |old(~a15~0)| 6)) (not (= 7 |old(~a21~0)|))) .cse4 .cse1 (or (= ~a21~0 7) (and .cse5 (<= 6 ~a15~0)))) (or (not (= 4 ~inputD~0)) .cse3 (< |calculate_output_#in~input| 1) (< 6 |calculate_output_#in~input|) (not (= ~inputE~0 5)) .cse4 .cse5 .cse1 (not (= ~inputA~0 1)) (not (= 3 ~inputC~0)) (not (= 2 ~inputB~0)) (not (= ~inputF~0 6))) (or (let ((.cse6 (= (+ ~a12~0 49) 0)) (.cse7 (= ~a24~0 1)) (.cse8 (<= ~a21~0 10))) (or (and (<= 7 ~a21~0) .cse6 .cse7 .cse8) (and (<= ~a15~0 7) (<= 6 ~a21~0) .cse6 .cse7 .cse8))) .cse4 .cse1 .cse2) (or (not (= 10 |old(~a21~0)|)) (= 10 ~a21~0)))) [2018-11-07 20:40:37,281 INFO L425 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2018-11-07 20:40:37,281 INFO L425 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2018-11-07 20:40:37,281 INFO L425 ceAbstractionStarter]: For program point L192(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,282 INFO L425 ceAbstractionStarter]: For program point L126(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,282 INFO L425 ceAbstractionStarter]: For program point L60(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,282 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-11-07 20:40:37,282 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-07 20:40:37,282 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-07 20:40:37,282 INFO L425 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2018-11-07 20:40:37,282 INFO L425 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2018-11-07 20:40:37,282 INFO L425 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2018-11-07 20:40:37,283 INFO L425 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2018-11-07 20:40:37,283 INFO L425 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2018-11-07 20:40:37,283 INFO L425 ceAbstractionStarter]: For program point L195(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,283 INFO L425 ceAbstractionStarter]: For program point L129(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,283 INFO L425 ceAbstractionStarter]: For program point L63(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,283 INFO L425 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2018-11-07 20:40:37,283 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2018-11-07 20:40:37,283 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-07 20:40:37,283 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-07 20:40:37,284 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-07 20:40:37,284 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2018-11-07 20:40:37,284 INFO L425 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2018-11-07 20:40:37,284 INFO L425 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2018-11-07 20:40:37,284 INFO L425 ceAbstractionStarter]: For program point L198(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,284 INFO L425 ceAbstractionStarter]: For program point L132(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,284 INFO L425 ceAbstractionStarter]: For program point L66(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,284 INFO L425 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2018-11-07 20:40:37,285 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-07 20:40:37,285 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-07 20:40:37,285 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-07 20:40:37,285 INFO L425 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2018-11-07 20:40:37,285 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2018-11-07 20:40:37,285 INFO L425 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2018-11-07 20:40:37,285 INFO L425 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2018-11-07 20:40:37,285 INFO L425 ceAbstractionStarter]: For program point L201(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,285 INFO L425 ceAbstractionStarter]: For program point L135(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,286 INFO L425 ceAbstractionStarter]: For program point L69(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,286 INFO L425 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2018-11-07 20:40:37,286 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-07 20:40:37,286 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-07 20:40:37,287 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 148) no Hoare annotation was computed. [2018-11-07 20:40:37,287 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-11-07 20:40:37,287 INFO L425 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2018-11-07 20:40:37,287 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2018-11-07 20:40:37,287 INFO L425 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2018-11-07 20:40:37,287 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2018-11-07 20:40:37,287 INFO L425 ceAbstractionStarter]: For program point L138(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,287 INFO L425 ceAbstractionStarter]: For program point L72(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,288 INFO L425 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2018-11-07 20:40:37,288 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-07 20:40:37,288 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-07 20:40:37,288 INFO L425 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2018-11-07 20:40:37,288 INFO L425 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2018-11-07 20:40:37,288 INFO L425 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2018-11-07 20:40:37,288 INFO L425 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2018-11-07 20:40:37,288 INFO L425 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2018-11-07 20:40:37,288 INFO L425 ceAbstractionStarter]: For program point L141(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,288 INFO L425 ceAbstractionStarter]: For program point L75(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,289 INFO L425 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2018-11-07 20:40:37,289 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-07 20:40:37,289 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-11-07 20:40:37,289 INFO L425 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2018-11-07 20:40:37,289 INFO L425 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2018-11-07 20:40:37,289 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2018-11-07 20:40:37,289 INFO L425 ceAbstractionStarter]: For program point L144(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,289 INFO L425 ceAbstractionStarter]: For program point L78(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,289 INFO L425 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2018-11-07 20:40:37,290 INFO L425 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2018-11-07 20:40:37,290 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-07 20:40:37,290 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-07 20:40:37,290 INFO L425 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2018-11-07 20:40:37,290 INFO L425 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2018-11-07 20:40:37,290 INFO L425 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2018-11-07 20:40:37,290 INFO L425 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2018-11-07 20:40:37,290 INFO L425 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,291 INFO L425 ceAbstractionStarter]: For program point L81(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,291 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2018-11-07 20:40:37,291 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2018-11-07 20:40:37,291 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-07 20:40:37,291 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-07 20:40:37,291 INFO L425 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2018-11-07 20:40:37,291 INFO L425 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2018-11-07 20:40:37,291 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2018-11-07 20:40:37,292 INFO L425 ceAbstractionStarter]: For program point L150(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,292 INFO L425 ceAbstractionStarter]: For program point L84(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,292 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,292 INFO L425 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2018-11-07 20:40:37,292 INFO L425 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2018-11-07 20:40:37,292 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-07 20:40:37,292 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-07 20:40:37,292 INFO L425 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2018-11-07 20:40:37,292 INFO L425 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2018-11-07 20:40:37,293 INFO L425 ceAbstractionStarter]: For program point L153(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,293 INFO L425 ceAbstractionStarter]: For program point L87(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,293 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-11-07 20:40:37,293 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,293 INFO L425 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2018-11-07 20:40:37,293 INFO L425 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2018-11-07 20:40:37,293 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2018-11-07 20:40:37,293 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-07 20:40:37,294 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-07 20:40:37,294 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-07 20:40:37,294 INFO L425 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2018-11-07 20:40:37,294 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2018-11-07 20:40:37,294 INFO L425 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2018-11-07 20:40:37,294 INFO L425 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2018-11-07 20:40:37,294 INFO L425 ceAbstractionStarter]: For program point L156(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,294 INFO L425 ceAbstractionStarter]: For program point L90(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,294 INFO L425 ceAbstractionStarter]: For program point L24(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,294 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2018-11-07 20:40:37,295 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-07 20:40:37,295 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-07 20:40:37,295 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-07 20:40:37,295 INFO L425 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2018-11-07 20:40:37,295 INFO L425 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2018-11-07 20:40:37,295 INFO L425 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2018-11-07 20:40:37,295 INFO L425 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2018-11-07 20:40:37,295 INFO L425 ceAbstractionStarter]: For program point L159(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,295 INFO L425 ceAbstractionStarter]: For program point L93(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,295 INFO L425 ceAbstractionStarter]: For program point L27(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,296 INFO L425 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2018-11-07 20:40:37,296 INFO L425 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2018-11-07 20:40:37,296 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-07 20:40:37,296 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-11-07 20:40:37,296 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-07 20:40:37,296 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2018-11-07 20:40:37,296 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2018-11-07 20:40:37,296 INFO L425 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2018-11-07 20:40:37,296 INFO L425 ceAbstractionStarter]: For program point L162(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,296 INFO L425 ceAbstractionStarter]: For program point L96(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,297 INFO L425 ceAbstractionStarter]: For program point L30(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,297 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2018-11-07 20:40:37,297 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-07 20:40:37,297 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-07 20:40:37,297 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-07 20:40:37,297 INFO L425 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2018-11-07 20:40:37,297 INFO L425 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2018-11-07 20:40:37,297 INFO L425 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2018-11-07 20:40:37,297 INFO L425 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2018-11-07 20:40:37,297 INFO L425 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2018-11-07 20:40:37,298 INFO L425 ceAbstractionStarter]: For program point L165(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,298 INFO L425 ceAbstractionStarter]: For program point L99(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,298 INFO L425 ceAbstractionStarter]: For program point L33(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:40:37,298 INFO L425 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2018-11-07 20:40:37,298 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-07 20:40:37,298 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-07 20:40:37,298 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-07 20:40:37,298 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2018-11-07 20:40:37,299 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 20:40:37,299 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~inputF~0 6) (= ~inputA~0 1) (= ~inputC~0 3) (= ~a15~0 8) (= (+ ~a12~0 49) 0) (= ~inputB~0 2) (= ~a24~0 1) (= ~inputE~0 5) (= ~a21~0 7) (= ~inputD~0 4)) [2018-11-07 20:40:37,299 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 20:40:37,299 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 20:40:37,299 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 874 890) the Hoare annotation is: (or (not (= |old(~a15~0)| 8)) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (not (= ~inputA~0 1)) (not (= 3 ~inputC~0)) (not (= 2 ~inputB~0)) (and (= (+ ~a12~0 49) 0) (= ~a21~0 7) (= |old(~a15~0)| ~a15~0) (= ~a24~0 1)) (not (= 1 |old(~a24~0)|)) (not (= |old(~a21~0)| 7)) (not (= 0 (+ |old(~a12~0)| 49))) (not (= ~inputF~0 6))) [2018-11-07 20:40:37,299 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 874 890) no Hoare annotation was computed. [2018-11-07 20:40:37,300 INFO L421 ceAbstractionStarter]: At program point L888(line 888) the Hoare annotation is: (or (not (= |old(~a15~0)| 8)) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (not (= ~inputA~0 1)) (not (= 3 ~inputC~0)) (not (= 8 ~a21~0)) (<= ~a12~0 80) (not (= 2 ~inputB~0)) (not (= 1 |old(~a24~0)|)) (not (= |old(~a21~0)| 7)) (not (= 0 (+ |old(~a12~0)| 49))) (not (= ~inputF~0 6)) (not (= ~a15~0 6))) [2018-11-07 20:40:37,300 INFO L425 ceAbstractionStarter]: For program point L888-1(line 888) no Hoare annotation was computed. [2018-11-07 20:40:37,300 INFO L425 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2018-11-07 20:40:37,300 INFO L425 ceAbstractionStarter]: For program point L880-1(lines 880 889) no Hoare annotation was computed. [2018-11-07 20:40:37,300 INFO L421 ceAbstractionStarter]: At program point L880-3(lines 880 889) the Hoare annotation is: (or (not (= |old(~a15~0)| 8)) (not (= 4 ~inputD~0)) (not (= ~inputE~0 5)) (not (= ~inputA~0 1)) (not (= 3 ~inputC~0)) (not (= 8 ~a21~0)) (<= ~a12~0 80) (not (= 2 ~inputB~0)) (not (= 1 |old(~a24~0)|)) (not (= |old(~a21~0)| 7)) (not (= 0 (+ |old(~a12~0)| 49))) (not (= ~inputF~0 6)) (not (= ~a15~0 6))) [2018-11-07 20:40:37,300 INFO L425 ceAbstractionStarter]: For program point L880-4(lines 874 890) no Hoare annotation was computed. [2018-11-07 20:40:37,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:40:37 BoogieIcfgContainer [2018-11-07 20:40:37,314 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 20:40:37,315 INFO L168 Benchmark]: Toolchain (without parser) took 211388.75 ms. Allocated memory was 1.5 GB in the beginning and 4.6 GB in the end (delta: 3.0 GB). Free memory was 1.4 GB in the beginning and 2.8 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-11-07 20:40:37,316 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 20:40:37,316 INFO L168 Benchmark]: CACSL2BoogieTranslator took 809.91 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-11-07 20:40:37,317 INFO L168 Benchmark]: Boogie Procedure Inliner took 151.71 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -833.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 7.1 GB. [2018-11-07 20:40:37,318 INFO L168 Benchmark]: Boogie Preprocessor took 111.81 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 20:40:37,319 INFO L168 Benchmark]: RCFGBuilder took 3508.51 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: 144.5 MB). Peak memory consumption was 144.5 MB. Max. memory is 7.1 GB. [2018-11-07 20:40:37,319 INFO L168 Benchmark]: TraceAbstraction took 206801.17 ms. Allocated memory was 2.3 GB in the beginning and 4.6 GB in the end (delta: 2.3 GB). Free memory was 2.1 GB in the beginning and 2.8 GB in the end (delta: -746.8 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-11-07 20:40:37,324 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.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 809.91 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 151.71 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 747.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -833.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 111.81 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 3508.51 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: 144.5 MB). Peak memory consumption was 144.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 206801.17 ms. Allocated memory was 2.3 GB in the beginning and 4.6 GB in the end (delta: 2.3 GB). Free memory was 2.1 GB in the beginning and 2.8 GB in the end (delta: -746.8 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 148]: 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: 880]: Loop Invariant Derived loop invariant: (((((((((((!(\old(a15) == 8) || !(4 == inputD)) || !(inputE == 5)) || !(inputA == 1)) || !(3 == inputC)) || !(8 == a21)) || a12 <= 80) || !(2 == inputB)) || !(1 == \old(a24))) || !(\old(a21) == 7)) || !(0 == \old(a12) + 49)) || !(inputF == 6)) || !(a15 == 6) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 255 locations, 1 error locations. SAFE Result, 206.7s OverallTime, 12 OverallIterations, 5 TraceHistogramMax, 176.1s AutomataDifference, 0.0s DeadEndRemovalTime, 4.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 2416 SDtfs, 24679 SDslu, 1976 SDs, 0 SdLazy, 30035 SolverSat, 4512 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 58.7s Time, PredicateUnifierStatistics: 16 DeclaredPredicates, 3187 GetRequests, 2961 SyntacticMatches, 12 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1355 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5461occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.8s AbstIntTime, 8 AbstIntIterations, 8 AbstIntStrong, 0.9974575862208875 AbsIntWeakeningRatio, 0.08298217179902755 AbsIntAvgWeakeningVarsNumRemoved, 12.371150729335495 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 2430 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 130 PreInvPairs, 184 NumberOfFragments, 524 HoareAnnotationTreeSize, 130 FomulaSimplifications, 12491 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 7 FomulaSimplificationsInter, 3727 FormulaSimplificationTreeSizeReductionInter, 4.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 3901 NumberOfCodeBlocks, 3901 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 3889 ConstructedInterpolants, 0 QuantifiedInterpolants, 13108573 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 3012/4485 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...