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_label19_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 20:35:03,317 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 20:35:03,319 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 20:35:03,334 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 20:35:03,334 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 20:35:03,335 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 20:35:03,337 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 20:35:03,339 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 20:35:03,340 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 20:35:03,341 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 20:35:03,342 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 20:35:03,342 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 20:35:03,343 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 20:35:03,344 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 20:35:03,346 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 20:35:03,346 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 20:35:03,347 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 20:35:03,349 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 20:35:03,351 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 20:35:03,353 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 20:35:03,354 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 20:35:03,356 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 20:35:03,358 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 20:35:03,359 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 20:35:03,359 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 20:35:03,360 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 20:35:03,361 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 20:35:03,362 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 20:35:03,362 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 20:35:03,364 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 20:35:03,364 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 20:35:03,365 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 20:35:03,365 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 20:35:03,365 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 20:35:03,366 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 20:35:03,367 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 20:35:03,368 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:35:03,385 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 20:35:03,386 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 20:35:03,387 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 20:35:03,387 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 20:35:03,387 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 20:35:03,388 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 20:35:03,388 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 20:35:03,388 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 20:35:03,389 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 20:35:03,389 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 20:35:03,389 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 20:35:03,389 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 20:35:03,389 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 20:35:03,390 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 20:35:03,390 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 20:35:03,390 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 20:35:03,392 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 20:35:03,392 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 20:35:03,392 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 20:35:03,393 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 20:35:03,393 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 20:35:03,393 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 20:35:03,393 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 20:35:03,393 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 20:35:03,394 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 20:35:03,394 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 20:35:03,394 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 20:35:03,394 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 20:35:03,395 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 20:35:03,396 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 20:35:03,396 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 20:35:03,398 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 20:35:03,399 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 20:35:03,399 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 20:35:03,399 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 20:35:03,445 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 20:35:03,458 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 20:35:03,462 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 20:35:03,464 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 20:35:03,464 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 20:35:03,465 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label19_true-unreach-call_false-termination.c [2018-11-07 20:35:03,533 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dae3e8875/540453c1d110420693e73a980e942e60/FLAGa8817e914 [2018-11-07 20:35:04,095 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 20:35:04,095 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label19_true-unreach-call_false-termination.c [2018-11-07 20:35:04,115 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dae3e8875/540453c1d110420693e73a980e942e60/FLAGa8817e914 [2018-11-07 20:35:04,133 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dae3e8875/540453c1d110420693e73a980e942e60 [2018-11-07 20:35:04,144 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 20:35:04,145 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 20:35:04,147 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 20:35:04,147 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 20:35:04,151 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 20:35:04,152 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:35:04" (1/1) ... [2018-11-07 20:35:04,156 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b66f157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:04, skipping insertion in model container [2018-11-07 20:35:04,157 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:35:04" (1/1) ... [2018-11-07 20:35:04,167 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 20:35:04,239 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 20:35:04,818 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:35:04,823 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 20:35:05,012 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 20:35:05,026 INFO L193 MainTranslator]: Completed translation [2018-11-07 20:35:05,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:05 WrapperNode [2018-11-07 20:35:05,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 20:35:05,028 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 20:35:05,028 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 20:35:05,028 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 20:35:05,035 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:35:05" (1/1) ... [2018-11-07 20:35:05,147 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:35:05" (1/1) ... [2018-11-07 20:35:05,157 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 20:35:05,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 20:35:05,158 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 20:35:05,158 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 20:35:05,172 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:05" (1/1) ... [2018-11-07 20:35:05,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:05" (1/1) ... [2018-11-07 20:35:05,179 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:05" (1/1) ... [2018-11-07 20:35:05,179 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:05" (1/1) ... [2018-11-07 20:35:05,238 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:05" (1/1) ... [2018-11-07 20:35:05,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:05" (1/1) ... [2018-11-07 20:35:05,273 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:05" (1/1) ... [2018-11-07 20:35:05,281 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 20:35:05,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 20:35:05,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 20:35:05,282 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 20:35:05,283 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:05" (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:35:05,360 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 20:35:05,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 20:35:05,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 20:35:05,360 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 20:35:05,361 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 20:35:05,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 20:35:05,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 20:35:05,361 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 20:35:05,361 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 20:35:08,831 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 20:35:08,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:35:08 BoogieIcfgContainer [2018-11-07 20:35:08,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 20:35:08,833 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 20:35:08,834 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 20:35:08,837 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 20:35:08,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:35:04" (1/3) ... [2018-11-07 20:35:08,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d207282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:35:08, skipping insertion in model container [2018-11-07 20:35:08,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:35:05" (2/3) ... [2018-11-07 20:35:08,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d207282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:35:08, skipping insertion in model container [2018-11-07 20:35:08,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:35:08" (3/3) ... [2018-11-07 20:35:08,841 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label19_true-unreach-call_false-termination.c [2018-11-07 20:35:08,852 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 20:35:08,862 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 20:35:08,878 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 20:35:08,918 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 20:35:08,918 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 20:35:08,918 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 20:35:08,918 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 20:35:08,919 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 20:35:08,919 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 20:35:08,919 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 20:35:08,919 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 20:35:08,948 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-11-07 20:35:08,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-07 20:35:08,960 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:35:08,961 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:35:08,964 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:35:08,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:35:08,971 INFO L82 PathProgramCache]: Analyzing trace with hash -949219895, now seen corresponding path program 1 times [2018-11-07 20:35:08,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:35:09,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:09,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:35:09,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:09,030 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:35:09,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:35:09,399 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:35:09,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:35:09,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 20:35:09,403 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:35:09,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 20:35:09,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 20:35:09,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 20:35:09,431 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 3 states. [2018-11-07 20:35:11,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:35:11,416 INFO L93 Difference]: Finished difference Result 691 states and 1226 transitions. [2018-11-07 20:35:11,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 20:35:11,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-11-07 20:35:11,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:35:11,438 INFO L225 Difference]: With dead ends: 691 [2018-11-07 20:35:11,438 INFO L226 Difference]: Without dead ends: 434 [2018-11-07 20:35:11,447 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:35:11,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-11-07 20:35:11,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2018-11-07 20:35:11,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-11-07 20:35:11,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 772 transitions. [2018-11-07 20:35:11,534 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 772 transitions. Word has length 69 [2018-11-07 20:35:11,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:35:11,535 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 772 transitions. [2018-11-07 20:35:11,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 20:35:11,536 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 772 transitions. [2018-11-07 20:35:11,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-07 20:35:11,544 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:35:11,544 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, 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] [2018-11-07 20:35:11,545 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:35:11,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:35:11,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1252535900, now seen corresponding path program 1 times [2018-11-07 20:35:11,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:35:11,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:11,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:35:11,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:11,549 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:35:11,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:35:11,878 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:35:11,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:35:11,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 20:35:11,879 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:35:11,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 20:35:11,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 20:35:11,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:35:11,882 INFO L87 Difference]: Start difference. First operand 434 states and 772 transitions. Second operand 6 states. [2018-11-07 20:35:15,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:35:15,513 INFO L93 Difference]: Finished difference Result 1234 states and 2250 transitions. [2018-11-07 20:35:15,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:35:15,514 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2018-11-07 20:35:15,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:35:15,524 INFO L225 Difference]: With dead ends: 1234 [2018-11-07 20:35:15,525 INFO L226 Difference]: Without dead ends: 806 [2018-11-07 20:35:15,529 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:35:15,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2018-11-07 20:35:15,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 797. [2018-11-07 20:35:15,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2018-11-07 20:35:15,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1300 transitions. [2018-11-07 20:35:15,591 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1300 transitions. Word has length 139 [2018-11-07 20:35:15,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:35:15,591 INFO L480 AbstractCegarLoop]: Abstraction has 797 states and 1300 transitions. [2018-11-07 20:35:15,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 20:35:15,592 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1300 transitions. [2018-11-07 20:35:15,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-07 20:35:15,595 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:35:15,596 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, 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] [2018-11-07 20:35:15,596 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:35:15,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:35:15,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1412263263, now seen corresponding path program 1 times [2018-11-07 20:35:15,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:35:15,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:15,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:35:15,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:15,598 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:35:15,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:35:15,861 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:35:15,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:35:15,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 20:35:15,861 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:35:15,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 20:35:15,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 20:35:15,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 20:35:15,863 INFO L87 Difference]: Start difference. First operand 797 states and 1300 transitions. Second operand 5 states. [2018-11-07 20:35:18,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:35:18,643 INFO L93 Difference]: Finished difference Result 2186 states and 3741 transitions. [2018-11-07 20:35:18,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:35:18,652 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 140 [2018-11-07 20:35:18,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:35:18,671 INFO L225 Difference]: With dead ends: 2186 [2018-11-07 20:35:18,672 INFO L226 Difference]: Without dead ends: 1395 [2018-11-07 20:35:18,678 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 20:35:18,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2018-11-07 20:35:18,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1369. [2018-11-07 20:35:18,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1369 states. [2018-11-07 20:35:18,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2191 transitions. [2018-11-07 20:35:18,754 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 2191 transitions. Word has length 140 [2018-11-07 20:35:18,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:35:18,756 INFO L480 AbstractCegarLoop]: Abstraction has 1369 states and 2191 transitions. [2018-11-07 20:35:18,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 20:35:18,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 2191 transitions. [2018-11-07 20:35:18,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-07 20:35:18,760 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:35:18,760 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, 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] [2018-11-07 20:35:18,760 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:35:18,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:35:18,763 INFO L82 PathProgramCache]: Analyzing trace with hash 531411331, now seen corresponding path program 1 times [2018-11-07 20:35:18,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:35:18,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:18,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:35:18,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:18,765 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:35:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:35:18,931 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:35:18,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:35:18,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 20:35:18,932 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:35:18,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 20:35:18,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 20:35:18,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 20:35:18,934 INFO L87 Difference]: Start difference. First operand 1369 states and 2191 transitions. Second operand 5 states. [2018-11-07 20:35:22,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:35:22,243 INFO L93 Difference]: Finished difference Result 3697 states and 5933 transitions. [2018-11-07 20:35:22,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 20:35:22,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2018-11-07 20:35:22,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:35:22,263 INFO L225 Difference]: With dead ends: 3697 [2018-11-07 20:35:22,263 INFO L226 Difference]: Without dead ends: 2334 [2018-11-07 20:35:22,273 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 20:35:22,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2334 states. [2018-11-07 20:35:22,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2334 to 2254. [2018-11-07 20:35:22,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2254 states. [2018-11-07 20:35:22,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 3323 transitions. [2018-11-07 20:35:22,362 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 3323 transitions. Word has length 142 [2018-11-07 20:35:22,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:35:22,363 INFO L480 AbstractCegarLoop]: Abstraction has 2254 states and 3323 transitions. [2018-11-07 20:35:22,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 20:35:22,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 3323 transitions. [2018-11-07 20:35:22,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-07 20:35:22,367 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:35:22,367 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, 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] [2018-11-07 20:35:22,367 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:35:22,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:35:22,368 INFO L82 PathProgramCache]: Analyzing trace with hash -2121902484, now seen corresponding path program 1 times [2018-11-07 20:35:22,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:35:22,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:22,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:35:22,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:22,369 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:35:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:35:22,668 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:35:22,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:35:22,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 20:35:22,669 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:35:22,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 20:35:22,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 20:35:22,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 20:35:22,670 INFO L87 Difference]: Start difference. First operand 2254 states and 3323 transitions. Second operand 5 states. [2018-11-07 20:35:25,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:35:25,471 INFO L93 Difference]: Finished difference Result 6104 states and 9334 transitions. [2018-11-07 20:35:25,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 20:35:25,472 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2018-11-07 20:35:25,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:35:25,489 INFO L225 Difference]: With dead ends: 6104 [2018-11-07 20:35:25,489 INFO L226 Difference]: Without dead ends: 2950 [2018-11-07 20:35:25,511 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-07 20:35:25,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2018-11-07 20:35:25,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 2927. [2018-11-07 20:35:25,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2927 states. [2018-11-07 20:35:25,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2927 states to 2927 states and 3799 transitions. [2018-11-07 20:35:25,587 INFO L78 Accepts]: Start accepts. Automaton has 2927 states and 3799 transitions. Word has length 143 [2018-11-07 20:35:25,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:35:25,588 INFO L480 AbstractCegarLoop]: Abstraction has 2927 states and 3799 transitions. [2018-11-07 20:35:25,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 20:35:25,588 INFO L276 IsEmpty]: Start isEmpty. Operand 2927 states and 3799 transitions. [2018-11-07 20:35:25,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-11-07 20:35:25,598 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:35:25,598 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:35:25,598 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:35:25,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:35:25,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1248172171, now seen corresponding path program 1 times [2018-11-07 20:35:25,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:35:25,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:25,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:35:25,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:25,600 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:35:25,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:35:25,882 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:35:25,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 20:35:25,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 20:35:25,883 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:35:25,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 20:35:25,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 20:35:25,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:35:25,885 INFO L87 Difference]: Start difference. First operand 2927 states and 3799 transitions. Second operand 4 states. [2018-11-07 20:35:27,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:35:27,718 INFO L93 Difference]: Finished difference Result 5839 states and 7641 transitions. [2018-11-07 20:35:27,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 20:35:27,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 242 [2018-11-07 20:35:27,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:35:27,734 INFO L225 Difference]: With dead ends: 5839 [2018-11-07 20:35:27,735 INFO L226 Difference]: Without dead ends: 3110 [2018-11-07 20:35:27,746 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 20:35:27,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3110 states. [2018-11-07 20:35:27,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3110 to 3110. [2018-11-07 20:35:27,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3110 states. [2018-11-07 20:35:27,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3110 states to 3110 states and 3994 transitions. [2018-11-07 20:35:27,819 INFO L78 Accepts]: Start accepts. Automaton has 3110 states and 3994 transitions. Word has length 242 [2018-11-07 20:35:27,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:35:27,820 INFO L480 AbstractCegarLoop]: Abstraction has 3110 states and 3994 transitions. [2018-11-07 20:35:27,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 20:35:27,820 INFO L276 IsEmpty]: Start isEmpty. Operand 3110 states and 3994 transitions. [2018-11-07 20:35:27,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-11-07 20:35:27,833 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:35:27,833 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, 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, 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:35:27,833 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:35:27,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:35:27,834 INFO L82 PathProgramCache]: Analyzing trace with hash -2039548178, now seen corresponding path program 1 times [2018-11-07 20:35:27,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:35:27,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:27,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:35:27,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:27,835 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:35:27,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:35:28,813 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 224 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 20:35:28,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:35:28,813 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:35:28,814 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 285 with the following transitions: [2018-11-07 20:35:28,816 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], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [453], [455], [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], [595], [599], [603], [607], [611], [615], [619], [622], [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:35:28,869 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:35:28,869 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:35:29,516 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:35:29,519 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:35:29,520 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:35:29,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:35:29,565 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:35:30,343 INFO L227 lantSequenceWeakener]: Weakened 275 states. On average, predicates are now at 78.1% of their original sizes. [2018-11-07 20:35:30,344 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:35:30,623 INFO L415 sIntCurrentIteration]: We unified 283 AI predicates to 283 [2018-11-07 20:35:30,623 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:35:30,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:35:30,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2018-11-07 20:35:30,624 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:35:30,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 20:35:30,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 20:35:30,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-07 20:35:30,625 INFO L87 Difference]: Start difference. First operand 3110 states and 3994 transitions. Second operand 7 states. [2018-11-07 20:35:43,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:35:43,866 INFO L93 Difference]: Finished difference Result 6399 states and 8193 transitions. [2018-11-07 20:35:43,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 20:35:43,866 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 284 [2018-11-07 20:35:43,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:35:43,880 INFO L225 Difference]: With dead ends: 6399 [2018-11-07 20:35:43,880 INFO L226 Difference]: Without dead ends: 3295 [2018-11-07 20:35:43,892 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 284 GetRequests, 278 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:35:43,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3295 states. [2018-11-07 20:35:43,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3295 to 3293. [2018-11-07 20:35:43,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3293 states. [2018-11-07 20:35:43,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3293 states to 3293 states and 4179 transitions. [2018-11-07 20:35:43,974 INFO L78 Accepts]: Start accepts. Automaton has 3293 states and 4179 transitions. Word has length 284 [2018-11-07 20:35:43,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:35:43,974 INFO L480 AbstractCegarLoop]: Abstraction has 3293 states and 4179 transitions. [2018-11-07 20:35:43,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 20:35:43,975 INFO L276 IsEmpty]: Start isEmpty. Operand 3293 states and 4179 transitions. [2018-11-07 20:35:43,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2018-11-07 20:35:43,993 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:35:43,993 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, 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, 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:35:43,994 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:35:43,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:35:43,994 INFO L82 PathProgramCache]: Analyzing trace with hash -806219320, now seen corresponding path program 1 times [2018-11-07 20:35:43,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:35:43,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:43,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:35:43,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:35:43,996 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:35:44,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:35:45,359 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 199 proven. 297 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 20:35:45,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:35:45,359 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:35:45,360 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 396 with the following transitions: [2018-11-07 20:35:45,360 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], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [453], [455], [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], [595], [599], [603], [607], [611], [615], [619], [622], [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:35:45,365 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:35:45,365 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:35:45,559 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:35:45,687 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:35:45,687 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:35:45,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:35:45,704 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:35:46,263 INFO L227 lantSequenceWeakener]: Weakened 170 states. On average, predicates are now at 78.93% of their original sizes. [2018-11-07 20:35:46,264 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:35:47,361 INFO L415 sIntCurrentIteration]: We unified 394 AI predicates to 394 [2018-11-07 20:35:47,362 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:35:47,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:35:47,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [15] total 34 [2018-11-07 20:35:47,362 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:35:47,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-07 20:35:47,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-07 20:35:47,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-11-07 20:35:47,364 INFO L87 Difference]: Start difference. First operand 3293 states and 4179 transitions. Second operand 21 states. [2018-11-07 20:36:07,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:36:07,249 INFO L93 Difference]: Finished difference Result 6582 states and 8382 transitions. [2018-11-07 20:36:07,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-07 20:36:07,249 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 395 [2018-11-07 20:36:07,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:36:07,265 INFO L225 Difference]: With dead ends: 6582 [2018-11-07 20:36:07,266 INFO L226 Difference]: Without dead ends: 3478 [2018-11-07 20:36:07,277 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 412 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=280, Invalid=1202, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 20:36:07,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3478 states. [2018-11-07 20:36:07,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3478 to 3473. [2018-11-07 20:36:07,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3473 states. [2018-11-07 20:36:07,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3473 states to 3473 states and 4343 transitions. [2018-11-07 20:36:07,362 INFO L78 Accepts]: Start accepts. Automaton has 3473 states and 4343 transitions. Word has length 395 [2018-11-07 20:36:07,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:36:07,363 INFO L480 AbstractCegarLoop]: Abstraction has 3473 states and 4343 transitions. [2018-11-07 20:36:07,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-07 20:36:07,363 INFO L276 IsEmpty]: Start isEmpty. Operand 3473 states and 4343 transitions. [2018-11-07 20:36:07,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2018-11-07 20:36:07,386 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:36:07,387 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, 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, 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:36:07,387 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:36:07,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:36:07,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1783785411, now seen corresponding path program 1 times [2018-11-07 20:36:07,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:36:07,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:36:07,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:36:07,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:36:07,389 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:36:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:36:08,350 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 14 [2018-11-07 20:36:09,476 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 558 proven. 2 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-11-07 20:36:09,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:36:09,476 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:36:09,477 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 506 with the following transitions: [2018-11-07 20:36:09,477 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], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [453], [455], [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], [595], [599], [603], [607], [611], [615], [619], [622], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [663], [666], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:36:09,481 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:36:09,481 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:36:09,547 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:36:09,748 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 20:36:09,748 INFO L272 AbstractInterpreter]: Visited 123 different actions 366 times. Merged at 7 different actions 19 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-07 20:36:09,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:36:09,753 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 20:36:10,309 INFO L227 lantSequenceWeakener]: Weakened 502 states. On average, predicates are now at 80.53% of their original sizes. [2018-11-07 20:36:10,310 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 20:36:10,496 INFO L415 sIntCurrentIteration]: We unified 504 AI predicates to 504 [2018-11-07 20:36:10,496 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 20:36:10,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:36:10,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2018-11-07 20:36:10,497 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:36:10,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 20:36:10,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 20:36:10,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 20:36:10,499 INFO L87 Difference]: Start difference. First operand 3473 states and 4343 transitions. Second operand 10 states. [2018-11-07 20:36:15,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:36:15,074 INFO L93 Difference]: Finished difference Result 6969 states and 8921 transitions. [2018-11-07 20:36:15,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 20:36:15,074 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 505 [2018-11-07 20:36:15,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:36:15,093 INFO L225 Difference]: With dead ends: 6969 [2018-11-07 20:36:15,093 INFO L226 Difference]: Without dead ends: 4057 [2018-11-07 20:36:15,107 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 512 GetRequests, 496 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-11-07 20:36:15,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4057 states. [2018-11-07 20:36:15,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4057 to 4036. [2018-11-07 20:36:15,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4036 states. [2018-11-07 20:36:15,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4036 states to 4036 states and 4954 transitions. [2018-11-07 20:36:15,238 INFO L78 Accepts]: Start accepts. Automaton has 4036 states and 4954 transitions. Word has length 505 [2018-11-07 20:36:15,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:36:15,239 INFO L480 AbstractCegarLoop]: Abstraction has 4036 states and 4954 transitions. [2018-11-07 20:36:15,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 20:36:15,240 INFO L276 IsEmpty]: Start isEmpty. Operand 4036 states and 4954 transitions. [2018-11-07 20:36:15,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2018-11-07 20:36:15,266 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 20:36:15,267 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 20:36:15,267 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 20:36:15,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:36:15,268 INFO L82 PathProgramCache]: Analyzing trace with hash -164380084, now seen corresponding path program 1 times [2018-11-07 20:36:15,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 20:36:15,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:36:15,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:36:15,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 20:36:15,270 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 20:36:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:36:17,657 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 482 proven. 303 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-07 20:36:17,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:36:17,658 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 20:36:17,658 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 573 with the following transitions: [2018-11-07 20:36:17,658 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], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [453], [455], [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], [595], [599], [603], [607], [611], [615], [619], [622], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [663], [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], [899], [903], [907], [911], [915], [919], [923], [927], [931], [934], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-07 20:36:17,667 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 20:36:17,667 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 20:36:17,908 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 20:36:18,654 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 20:36:18,655 INFO L272 AbstractInterpreter]: Visited 191 different actions 953 times. Merged at 9 different actions 46 times. Widened at 1 different actions 1 times. Found 10 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-07 20:36:18,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 20:36:18,666 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 20:36:18,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 20:36:18,666 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 20:36:18,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 20:36:18,677 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 20:36:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 20:36:18,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 20:36:19,277 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2018-11-07 20:36:19,278 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 20:36:20,456 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2018-11-07 20:36:20,477 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 20:36:20,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [13] total 14 [2018-11-07 20:36:20,477 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 20:36:20,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 20:36:20,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 20:36:20,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-11-07 20:36:20,479 INFO L87 Difference]: Start difference. First operand 4036 states and 4954 transitions. Second operand 3 states. [2018-11-07 20:36:22,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 20:36:22,774 INFO L93 Difference]: Finished difference Result 9146 states and 11668 transitions. [2018-11-07 20:36:22,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 20:36:22,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 572 [2018-11-07 20:36:22,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 20:36:22,776 INFO L225 Difference]: With dead ends: 9146 [2018-11-07 20:36:22,776 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 20:36:22,826 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1156 GetRequests, 1142 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-11-07 20:36:22,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 20:36:22,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 20:36:22,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 20:36:22,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 20:36:22,827 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 572 [2018-11-07 20:36:22,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 20:36:22,827 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 20:36:22,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 20:36:22,828 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 20:36:22,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 20:36:22,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 20:36:23,120 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 127 [2018-11-07 20:36:23,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 20:36:23,298 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 132 [2018-11-07 20:36:23,902 WARN L179 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2018-11-07 20:36:25,086 WARN L179 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 91 DAG size of output: 52 [2018-11-07 20:36:26,318 WARN L179 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 188 DAG size of output: 62 [2018-11-07 20:36:26,651 WARN L179 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 65 [2018-11-07 20:36:26,959 WARN L179 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 65 [2018-11-07 20:36:26,962 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 20:36:26,963 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a12~0 |old(~a12~0)|) (= |old(~a21~0)| ~a21~0) (= |old(~a15~0)| ~a15~0)) [2018-11-07 20:36:26,963 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 20:36:26,963 INFO L425 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2018-11-07 20:36:26,963 INFO L425 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2018-11-07 20:36:26,963 INFO L425 ceAbstractionStarter]: For program point L168(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,963 INFO L425 ceAbstractionStarter]: For program point L102(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,964 INFO L425 ceAbstractionStarter]: For program point L36(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,964 INFO L425 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2018-11-07 20:36:26,964 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-07 20:36:26,964 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-07 20:36:26,964 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-07 20:36:26,964 INFO L425 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2018-11-07 20:36:26,964 INFO L425 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2018-11-07 20:36:26,964 INFO L425 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2018-11-07 20:36:26,964 INFO L425 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2018-11-07 20:36:26,964 INFO L425 ceAbstractionStarter]: For program point L171(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,965 INFO L425 ceAbstractionStarter]: For program point L105(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,965 INFO L425 ceAbstractionStarter]: For program point L39(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,965 INFO L425 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2018-11-07 20:36:26,965 INFO L425 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2018-11-07 20:36:26,965 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-07 20:36:26,965 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-07 20:36:26,965 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-07 20:36:26,965 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2018-11-07 20:36:26,965 INFO L425 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2018-11-07 20:36:26,965 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2018-11-07 20:36:26,965 INFO L425 ceAbstractionStarter]: For program point L174(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,965 INFO L425 ceAbstractionStarter]: For program point L108(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,966 INFO L425 ceAbstractionStarter]: For program point L42(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,966 INFO L425 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2018-11-07 20:36:26,966 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-07 20:36:26,966 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-07 20:36:26,966 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-07 20:36:26,966 INFO L425 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2018-11-07 20:36:26,966 INFO L425 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2018-11-07 20:36:26,966 INFO L425 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2018-11-07 20:36:26,967 INFO L425 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2018-11-07 20:36:26,967 INFO L425 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2018-11-07 20:36:26,967 INFO L425 ceAbstractionStarter]: For program point L177(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,967 INFO L425 ceAbstractionStarter]: For program point L111(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,967 INFO L425 ceAbstractionStarter]: For program point L45(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,967 INFO L425 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2018-11-07 20:36:26,967 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-11-07 20:36:26,967 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-07 20:36:26,968 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-07 20:36:26,968 INFO L425 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2018-11-07 20:36:26,968 INFO L425 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2018-11-07 20:36:26,968 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2018-11-07 20:36:26,968 INFO L425 ceAbstractionStarter]: For program point L180(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,968 INFO L425 ceAbstractionStarter]: For program point L114(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,968 INFO L425 ceAbstractionStarter]: For program point L48(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,968 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2018-11-07 20:36:26,968 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-07 20:36:26,969 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-07 20:36:26,969 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-11-07 20:36:26,969 INFO L425 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2018-11-07 20:36:26,969 INFO L425 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2018-11-07 20:36:26,969 INFO L425 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2018-11-07 20:36:26,969 INFO L425 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2018-11-07 20:36:26,969 INFO L425 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2018-11-07 20:36:26,970 INFO L425 ceAbstractionStarter]: For program point L183(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,970 INFO L425 ceAbstractionStarter]: For program point L117(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,970 INFO L425 ceAbstractionStarter]: For program point L51(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,970 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,970 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2018-11-07 20:36:26,970 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-07 20:36:26,970 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-07 20:36:26,970 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-07 20:36:26,971 INFO L425 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2018-11-07 20:36:26,971 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2018-11-07 20:36:26,971 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2018-11-07 20:36:26,971 INFO L425 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2018-11-07 20:36:26,971 INFO L425 ceAbstractionStarter]: For program point L186(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,971 INFO L425 ceAbstractionStarter]: For program point L120(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,971 INFO L425 ceAbstractionStarter]: For program point L54(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,972 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 190) no Hoare annotation was computed. [2018-11-07 20:36:26,972 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-11-07 20:36:26,972 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-07 20:36:26,972 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-07 20:36:26,972 INFO L425 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2018-11-07 20:36:26,972 INFO L425 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2018-11-07 20:36:26,972 INFO L425 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2018-11-07 20:36:26,972 INFO L425 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2018-11-07 20:36:26,972 INFO L425 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2018-11-07 20:36:26,973 INFO L425 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,973 INFO L425 ceAbstractionStarter]: For program point L123(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,973 INFO L425 ceAbstractionStarter]: For program point L57(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,973 INFO L425 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2018-11-07 20:36:26,973 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2018-11-07 20:36:26,973 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-07 20:36:26,973 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-07 20:36:26,973 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-07 20:36:26,973 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2018-11-07 20:36:26,974 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 872) the Hoare annotation is: (let ((.cse0 (= ~a12~0 |old(~a12~0)|)) (.cse1 (= |old(~a21~0)| ~a21~0)) (.cse2 (= |old(~a15~0)| ~a15~0))) (let ((.cse7 (<= (+ |old(~a12~0)| 43) 0)) (.cse9 (< 6 |calculate_output_#in~input|)) (.cse5 (= 9 |old(~a21~0)|)) (.cse10 (not (= 8 |old(~a15~0)|))) (.cse11 (< |old(~a21~0)| 7)) (.cse12 (= ~a24~0 1)) (.cse13 (< 10 |old(~a21~0)|)) (.cse4 (not (= 1 |old(~a24~0)|))) (.cse14 (< |calculate_output_#in~input| 1)) (.cse8 (and .cse0 .cse1 .cse2)) (.cse3 (= 6 |old(~a21~0)|)) (.cse6 (= 9 |old(~a15~0)|))) (and (or (and .cse0 .cse1 (= 1 ~a24~0) .cse2) (not .cse3) .cse4 (not (= 5 |old(~a15~0)|))) (or (and .cse0 .cse1 (= 2 ~a24~0) .cse2) .cse5 (not (= 2 |old(~a24~0)|)) .cse6) (or .cse7 .cse8) (or (< |old(~a15~0)| 7) .cse8 .cse6) (or .cse3 .cse5 .cse8) (or .cse9 .cse10 .cse11 .cse12 .cse13 .cse7 .cse4 .cse14) (or .cse9 .cse5 .cse10 .cse11 .cse12 .cse13 .cse4 .cse14) (or .cse8 .cse3 .cse6)))) [2018-11-07 20:36:26,974 INFO L425 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2018-11-07 20:36:26,974 INFO L425 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2018-11-07 20:36:26,974 INFO L425 ceAbstractionStarter]: For program point L192(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,974 INFO L425 ceAbstractionStarter]: For program point L126(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,975 INFO L425 ceAbstractionStarter]: For program point L60(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,975 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-11-07 20:36:26,975 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-07 20:36:26,975 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-07 20:36:26,975 INFO L425 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2018-11-07 20:36:26,975 INFO L425 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2018-11-07 20:36:26,975 INFO L425 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2018-11-07 20:36:26,975 INFO L425 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2018-11-07 20:36:26,976 INFO L425 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2018-11-07 20:36:26,976 INFO L425 ceAbstractionStarter]: For program point L195(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,976 INFO L425 ceAbstractionStarter]: For program point L129(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,976 INFO L425 ceAbstractionStarter]: For program point L63(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,976 INFO L425 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2018-11-07 20:36:26,976 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2018-11-07 20:36:26,976 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-07 20:36:26,976 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-07 20:36:26,976 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-07 20:36:26,977 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2018-11-07 20:36:26,977 INFO L425 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2018-11-07 20:36:26,977 INFO L425 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2018-11-07 20:36:26,977 INFO L425 ceAbstractionStarter]: For program point L198(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,977 INFO L425 ceAbstractionStarter]: For program point L132(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,977 INFO L425 ceAbstractionStarter]: For program point L66(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,977 INFO L425 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2018-11-07 20:36:26,977 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-07 20:36:26,977 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-07 20:36:26,978 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-07 20:36:26,978 INFO L425 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2018-11-07 20:36:26,978 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2018-11-07 20:36:26,978 INFO L425 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2018-11-07 20:36:26,978 INFO L425 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2018-11-07 20:36:26,978 INFO L425 ceAbstractionStarter]: For program point L201(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,978 INFO L425 ceAbstractionStarter]: For program point L135(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,978 INFO L425 ceAbstractionStarter]: For program point L69(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,979 INFO L425 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2018-11-07 20:36:26,979 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-07 20:36:26,979 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-07 20:36:26,979 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-11-07 20:36:26,979 INFO L425 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2018-11-07 20:36:26,979 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2018-11-07 20:36:26,979 INFO L425 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2018-11-07 20:36:26,979 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2018-11-07 20:36:26,979 INFO L425 ceAbstractionStarter]: For program point L138(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,980 INFO L425 ceAbstractionStarter]: For program point L72(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,980 INFO L425 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2018-11-07 20:36:26,980 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-07 20:36:26,980 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-07 20:36:26,980 INFO L425 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2018-11-07 20:36:26,980 INFO L425 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2018-11-07 20:36:26,980 INFO L425 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2018-11-07 20:36:26,980 INFO L425 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2018-11-07 20:36:26,980 INFO L425 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2018-11-07 20:36:26,980 INFO L425 ceAbstractionStarter]: For program point L141(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,981 INFO L425 ceAbstractionStarter]: For program point L75(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,981 INFO L425 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2018-11-07 20:36:26,981 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-07 20:36:26,981 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-11-07 20:36:26,981 INFO L425 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2018-11-07 20:36:26,981 INFO L425 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2018-11-07 20:36:26,981 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2018-11-07 20:36:26,981 INFO L425 ceAbstractionStarter]: For program point L144(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,981 INFO L425 ceAbstractionStarter]: For program point L78(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,982 INFO L425 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2018-11-07 20:36:26,982 INFO L425 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2018-11-07 20:36:26,982 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-07 20:36:26,982 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-07 20:36:26,982 INFO L425 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2018-11-07 20:36:26,982 INFO L425 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2018-11-07 20:36:26,982 INFO L425 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2018-11-07 20:36:26,982 INFO L425 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2018-11-07 20:36:26,982 INFO L425 ceAbstractionStarter]: For program point L147(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,983 INFO L425 ceAbstractionStarter]: For program point L81(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,983 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2018-11-07 20:36:26,983 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2018-11-07 20:36:26,983 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-07 20:36:26,983 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-07 20:36:26,983 INFO L425 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2018-11-07 20:36:26,983 INFO L425 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2018-11-07 20:36:26,984 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2018-11-07 20:36:26,984 INFO L425 ceAbstractionStarter]: For program point L150(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,984 INFO L425 ceAbstractionStarter]: For program point L84(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,984 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,984 INFO L425 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2018-11-07 20:36:26,984 INFO L425 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2018-11-07 20:36:26,984 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-07 20:36:26,984 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-07 20:36:26,984 INFO L425 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2018-11-07 20:36:26,984 INFO L425 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2018-11-07 20:36:26,985 INFO L425 ceAbstractionStarter]: For program point L153(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,985 INFO L425 ceAbstractionStarter]: For program point L87(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,985 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-11-07 20:36:26,985 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,985 INFO L425 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2018-11-07 20:36:26,985 INFO L425 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2018-11-07 20:36:26,985 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2018-11-07 20:36:26,985 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-07 20:36:26,985 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-07 20:36:26,985 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-07 20:36:26,985 INFO L425 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2018-11-07 20:36:26,985 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2018-11-07 20:36:26,986 INFO L425 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2018-11-07 20:36:26,986 INFO L425 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2018-11-07 20:36:26,986 INFO L425 ceAbstractionStarter]: For program point L156(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,986 INFO L425 ceAbstractionStarter]: For program point L90(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,986 INFO L425 ceAbstractionStarter]: For program point L24(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,986 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2018-11-07 20:36:26,986 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-07 20:36:26,986 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-07 20:36:26,986 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-07 20:36:26,986 INFO L425 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2018-11-07 20:36:26,987 INFO L425 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2018-11-07 20:36:26,987 INFO L425 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2018-11-07 20:36:26,987 INFO L425 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2018-11-07 20:36:26,987 INFO L425 ceAbstractionStarter]: For program point L159(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,987 INFO L425 ceAbstractionStarter]: For program point L93(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,987 INFO L425 ceAbstractionStarter]: For program point L27(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,987 INFO L425 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2018-11-07 20:36:26,987 INFO L425 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2018-11-07 20:36:26,988 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-07 20:36:26,988 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-11-07 20:36:26,988 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-07 20:36:26,988 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2018-11-07 20:36:26,988 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2018-11-07 20:36:26,988 INFO L425 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2018-11-07 20:36:26,988 INFO L425 ceAbstractionStarter]: For program point L162(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,988 INFO L425 ceAbstractionStarter]: For program point L96(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,988 INFO L425 ceAbstractionStarter]: For program point L30(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,989 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2018-11-07 20:36:26,989 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-07 20:36:26,989 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-07 20:36:26,989 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-07 20:36:26,989 INFO L425 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2018-11-07 20:36:26,989 INFO L425 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2018-11-07 20:36:26,989 INFO L425 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2018-11-07 20:36:26,989 INFO L425 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2018-11-07 20:36:26,990 INFO L425 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2018-11-07 20:36:26,990 INFO L425 ceAbstractionStarter]: For program point L165(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,990 INFO L425 ceAbstractionStarter]: For program point L99(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,990 INFO L425 ceAbstractionStarter]: For program point L33(lines 20 872) no Hoare annotation was computed. [2018-11-07 20:36:26,990 INFO L425 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2018-11-07 20:36:26,990 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-07 20:36:26,990 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-07 20:36:26,990 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-07 20:36:26,990 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2018-11-07 20:36:26,991 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 20:36:26,991 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:36:26,991 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 20:36:26,991 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 20:36:26,991 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 874 890) the Hoare annotation is: (or (not (= |old(~a15~0)| 8)) (not (= 4 ~inputD~0)) (and (= (+ ~a12~0 49) 0) (= |old(~a21~0)| ~a21~0) (= |old(~a15~0)| ~a15~0) (= ~a24~0 1)) (not (= ~inputE~0 5)) (not (= ~inputA~0 1)) (not (= 3 ~inputC~0)) (not (= 2 ~inputB~0)) (not (= 1 |old(~a24~0)|)) (not (= |old(~a21~0)| 7)) (not (= 0 (+ |old(~a12~0)| 49))) (not (= ~inputF~0 6))) [2018-11-07 20:36:26,991 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 874 890) no Hoare annotation was computed. [2018-11-07 20:36:26,992 INFO L421 ceAbstractionStarter]: At program point L888(line 888) the Hoare annotation is: (let ((.cse0 (not (= ~a15~0 9))) (.cse1 (not (= ~a21~0 6)))) (or (not (= |old(~a15~0)| 8)) (not (= 4 ~inputD~0)) (and .cse0 .cse1) (and .cse0 (<= 7 ~a15~0)) (not (= ~inputE~0 5)) (< 0 (+ ~a12~0 43)) (and .cse0 (= 2 ~a24~0)) (not (= ~inputA~0 1)) (not (= 3 ~inputC~0)) (not (= 2 ~inputB~0)) (and (not (= ~a21~0 9)) .cse1) (not (= 1 |old(~a24~0)|)) (not (= |old(~a21~0)| 7)) (not (= 0 (+ |old(~a12~0)| 49))) (and (= 1 ~a24~0) (= 5 ~a15~0)) (not (= ~inputF~0 6)))) [2018-11-07 20:36:26,992 INFO L425 ceAbstractionStarter]: For program point L888-1(line 888) no Hoare annotation was computed. [2018-11-07 20:36:26,992 INFO L425 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2018-11-07 20:36:26,992 INFO L425 ceAbstractionStarter]: For program point L880-1(lines 880 889) no Hoare annotation was computed. [2018-11-07 20:36:26,992 INFO L421 ceAbstractionStarter]: At program point L880-3(lines 880 889) the Hoare annotation is: (let ((.cse0 (not (= ~a15~0 9))) (.cse1 (not (= ~a21~0 6)))) (or (not (= |old(~a15~0)| 8)) (not (= 4 ~inputD~0)) (and .cse0 .cse1) (and .cse0 (<= 7 ~a15~0)) (not (= ~inputE~0 5)) (< 0 (+ ~a12~0 43)) (and .cse0 (= 2 ~a24~0)) (not (= ~inputA~0 1)) (not (= 3 ~inputC~0)) (not (= 2 ~inputB~0)) (and (not (= ~a21~0 9)) .cse1) (not (= 1 |old(~a24~0)|)) (not (= |old(~a21~0)| 7)) (not (= 0 (+ |old(~a12~0)| 49))) (and (= 1 ~a24~0) (= 5 ~a15~0)) (not (= ~inputF~0 6)))) [2018-11-07 20:36:26,992 INFO L425 ceAbstractionStarter]: For program point L880-4(lines 874 890) no Hoare annotation was computed. [2018-11-07 20:36:27,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:36:27 BoogieIcfgContainer [2018-11-07 20:36:27,007 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 20:36:27,008 INFO L168 Benchmark]: Toolchain (without parser) took 82863.66 ms. Allocated memory was 1.5 GB in the beginning and 4.0 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 2.6 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-11-07 20:36:27,009 INFO L168 Benchmark]: CDTParser took 0.30 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:36:27,010 INFO L168 Benchmark]: CACSL2BoogieTranslator took 880.54 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:36:27,011 INFO L168 Benchmark]: Boogie Procedure Inliner took 129.30 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -834.4 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. [2018-11-07 20:36:27,012 INFO L168 Benchmark]: Boogie Preprocessor took 124.20 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2018-11-07 20:36:27,012 INFO L168 Benchmark]: RCFGBuilder took 3550.57 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: 132.3 MB). Peak memory consumption was 132.3 MB. Max. memory is 7.1 GB. [2018-11-07 20:36:27,013 INFO L168 Benchmark]: TraceAbstraction took 78173.92 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 2.1 GB in the beginning and 2.6 GB in the end (delta: -575.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-11-07 20:36:27,018 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.30 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 880.54 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 129.30 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -834.4 MB). Peak memory consumption was 19.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 124.20 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3550.57 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: 132.3 MB). Peak memory consumption was 132.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 78173.92 ms. Allocated memory was 2.3 GB in the beginning and 4.0 GB in the end (delta: 1.7 GB). Free memory was 2.1 GB in the beginning and 2.6 GB in the end (delta: -575.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 190]: 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)) || (!(a15 == 9) && !(a21 == 6))) || (!(a15 == 9) && 7 <= a15)) || !(inputE == 5)) || 0 < a12 + 43) || (!(a15 == 9) && 2 == a24)) || !(inputA == 1)) || !(3 == inputC)) || !(2 == inputB)) || (!(a21 == 9) && !(a21 == 6))) || !(1 == \old(a24))) || !(\old(a21) == 7)) || !(0 == \old(a12) + 49)) || (1 == a24 && 5 == a15)) || !(inputF == 6) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 255 locations, 1 error locations. SAFE Result, 78.0s OverallTime, 10 OverallIterations, 5 TraceHistogramMax, 56.6s AutomataDifference, 0.0s DeadEndRemovalTime, 4.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 1666 SDtfs, 7533 SDslu, 1561 SDs, 0 SdLazy, 11135 SolverSat, 2040 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.4s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 2411 GetRequests, 2308 SyntacticMatches, 6 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4036occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.3s AbstIntTime, 4 AbstIntIterations, 3 AbstIntStrong, 0.9975197101903912 AbsIntWeakeningRatio, 0.08128704487722269 AbsIntAvgWeakeningVarsNumRemoved, 19.768839966130397 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 10 MinimizatonAttempts, 166 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 112 PreInvPairs, 166 NumberOfFragments, 465 HoareAnnotationTreeSize, 112 FomulaSimplifications, 3052 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 7 FomulaSimplificationsInter, 4200 FormulaSimplificationTreeSizeReductionInter, 3.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 3203 NumberOfCodeBlocks, 3203 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 3763 ConstructedInterpolants, 0 QuantifiedInterpolants, 9560333 SizeOfPredicates, 2 NumberOfNonLiveVariables, 833 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 3973/4577 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...