java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label06_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-25 00:04:30,418 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-25 00:04:30,420 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-25 00:04:30,432 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-25 00:04:30,433 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-25 00:04:30,434 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-25 00:04:30,435 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-25 00:04:30,437 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-25 00:04:30,439 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-25 00:04:30,439 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-25 00:04:30,440 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-25 00:04:30,441 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-25 00:04:30,442 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-25 00:04:30,443 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-25 00:04:30,444 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-25 00:04:30,445 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-25 00:04:30,446 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-25 00:04:30,447 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-25 00:04:30,449 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-25 00:04:30,451 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-25 00:04:30,452 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-25 00:04:30,454 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-25 00:04:30,456 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-25 00:04:30,457 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-25 00:04:30,457 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-25 00:04:30,458 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-25 00:04:30,459 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-25 00:04:30,460 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-25 00:04:30,461 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-25 00:04:30,462 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-25 00:04:30,462 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-25 00:04:30,463 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-25 00:04:30,463 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-25 00:04:30,463 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-25 00:04:30,464 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-25 00:04:30,465 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-25 00:04:30,465 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-25 00:04:30,490 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-25 00:04:30,490 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-25 00:04:30,494 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-25 00:04:30,494 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-25 00:04:30,495 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-25 00:04:30,495 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-25 00:04:30,495 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-25 00:04:30,495 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-25 00:04:30,495 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-25 00:04:30,495 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-25 00:04:30,496 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-25 00:04:30,496 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-25 00:04:30,496 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-25 00:04:30,496 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-25 00:04:30,498 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-25 00:04:30,498 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-25 00:04:30,498 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-25 00:04:30,499 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-25 00:04:30,499 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-25 00:04:30,499 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-25 00:04:30,499 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-25 00:04:30,499 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-25 00:04:30,499 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-25 00:04:30,501 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-25 00:04:30,502 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-25 00:04:30,502 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-25 00:04:30,502 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:04:30,502 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-25 00:04:30,502 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-25 00:04:30,503 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-25 00:04:30,503 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-25 00:04:30,503 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-25 00:04:30,503 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-25 00:04:30,504 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-25 00:04:30,504 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-25 00:04:30,504 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-25 00:04:30,552 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-25 00:04:30,569 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-25 00:04:30,574 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-25 00:04:30,575 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-25 00:04:30,576 INFO L276 PluginConnector]: CDTParser initialized [2018-10-25 00:04:30,577 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label06_true-unreach-call_false-termination.c [2018-10-25 00:04:30,641 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0ef8cb6d0/cf1af5576fa04ea1b59b6dc2ff81c240/FLAG73b1a7fca [2018-10-25 00:04:31,156 INFO L298 CDTParser]: Found 1 translation units. [2018-10-25 00:04:31,157 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label06_true-unreach-call_false-termination.c [2018-10-25 00:04:31,179 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0ef8cb6d0/cf1af5576fa04ea1b59b6dc2ff81c240/FLAG73b1a7fca [2018-10-25 00:04:31,211 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0ef8cb6d0/cf1af5576fa04ea1b59b6dc2ff81c240 [2018-10-25 00:04:31,225 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-25 00:04:31,227 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-25 00:04:31,229 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-25 00:04:31,229 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-25 00:04:31,236 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-25 00:04:31,237 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:04:31" (1/1) ... [2018-10-25 00:04:31,241 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@497fe8da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:04:31, skipping insertion in model container [2018-10-25 00:04:31,242 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:04:31" (1/1) ... [2018-10-25 00:04:31,254 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-25 00:04:31,334 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-25 00:04:31,851 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:04:31,860 INFO L189 MainTranslator]: Completed pre-run [2018-10-25 00:04:31,993 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-25 00:04:32,012 INFO L193 MainTranslator]: Completed translation [2018-10-25 00:04:32,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:04:32 WrapperNode [2018-10-25 00:04:32,013 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-25 00:04:32,014 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-25 00:04:32,014 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-25 00:04:32,014 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-25 00:04:32,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:04:32" (1/1) ... [2018-10-25 00:04:32,044 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:04:32" (1/1) ... [2018-10-25 00:04:32,206 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-25 00:04:32,207 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-25 00:04:32,207 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-25 00:04:32,207 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-25 00:04:32,216 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:04:32" (1/1) ... [2018-10-25 00:04:32,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:04:32" (1/1) ... [2018-10-25 00:04:32,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:04:32" (1/1) ... [2018-10-25 00:04:32,222 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:04:32" (1/1) ... [2018-10-25 00:04:32,243 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:04:32" (1/1) ... [2018-10-25 00:04:32,261 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:04:32" (1/1) ... [2018-10-25 00:04:32,272 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:04:32" (1/1) ... [2018-10-25 00:04:32,289 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-25 00:04:32,292 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-25 00:04:32,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-25 00:04:32,292 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-25 00:04:32,293 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:04:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-25 00:04:32,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-25 00:04:32,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-25 00:04:32,377 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-10-25 00:04:32,377 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-10-25 00:04:32,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-25 00:04:32,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-25 00:04:32,378 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-25 00:04:32,378 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-25 00:04:35,951 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-25 00:04:35,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:04:35 BoogieIcfgContainer [2018-10-25 00:04:35,952 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-25 00:04:35,954 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-25 00:04:35,954 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-25 00:04:35,957 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-25 00:04:35,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 12:04:31" (1/3) ... [2018-10-25 00:04:35,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6969dcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:04:35, skipping insertion in model container [2018-10-25 00:04:35,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:04:32" (2/3) ... [2018-10-25 00:04:35,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6969dcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 12:04:35, skipping insertion in model container [2018-10-25 00:04:35,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:04:35" (3/3) ... [2018-10-25 00:04:35,961 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label06_true-unreach-call_false-termination.c [2018-10-25 00:04:35,972 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-25 00:04:35,981 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-25 00:04:35,998 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-25 00:04:36,037 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-25 00:04:36,037 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-25 00:04:36,037 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-25 00:04:36,037 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-25 00:04:36,037 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-25 00:04:36,038 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-25 00:04:36,038 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-25 00:04:36,038 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-25 00:04:36,073 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-10-25 00:04:36,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-25 00:04:36,091 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:36,092 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:04:36,095 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:36,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:36,100 INFO L82 PathProgramCache]: Analyzing trace with hash -247147345, now seen corresponding path program 1 times [2018-10-25 00:04:36,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:36,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:36,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:36,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:36,159 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:36,708 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:04:36,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:04:36,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:04:36,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-25 00:04:36,879 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:04:36,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:04:36,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:04:36,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:04:36,908 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-10-25 00:04:38,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:38,418 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-10-25 00:04:38,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:04:38,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2018-10-25 00:04:38,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:38,455 INFO L225 Difference]: With dead ends: 621 [2018-10-25 00:04:38,455 INFO L226 Difference]: Without dead ends: 382 [2018-10-25 00:04:38,463 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-25 00:04:38,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-10-25 00:04:38,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-10-25 00:04:38,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-10-25 00:04:38,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-10-25 00:04:38,537 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 147 [2018-10-25 00:04:38,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:38,538 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-10-25 00:04:38,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:04:38,539 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-10-25 00:04:38,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-25 00:04:38,547 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:38,547 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:04:38,548 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:38,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:38,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1882359938, now seen corresponding path program 1 times [2018-10-25 00:04:38,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:38,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:38,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:38,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:38,552 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:38,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:39,111 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:04:39,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:04:39,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:04:39,112 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:04:39,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:04:39,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:04:39,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:04:39,115 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-10-25 00:04:41,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:41,004 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-10-25 00:04:41,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:04:41,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2018-10-25 00:04:41,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:41,009 INFO L225 Difference]: With dead ends: 903 [2018-10-25 00:04:41,010 INFO L226 Difference]: Without dead ends: 381 [2018-10-25 00:04:41,016 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:04:41,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-10-25 00:04:41,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-10-25 00:04:41,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-25 00:04:41,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-10-25 00:04:41,040 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 156 [2018-10-25 00:04:41,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:41,041 INFO L481 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-10-25 00:04:41,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:04:41,041 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-10-25 00:04:41,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-25 00:04:41,045 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:41,046 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:04:41,046 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:41,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:41,046 INFO L82 PathProgramCache]: Analyzing trace with hash 337215758, now seen corresponding path program 1 times [2018-10-25 00:04:41,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:41,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:41,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:41,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:41,048 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:41,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:41,529 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:04:41,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:04:41,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:04:41,530 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:04:41,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:04:41,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:04:41,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:04:41,531 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-10-25 00:04:43,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:43,242 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-10-25 00:04:43,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:04:43,243 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 162 [2018-10-25 00:04:43,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:43,248 INFO L225 Difference]: With dead ends: 901 [2018-10-25 00:04:43,248 INFO L226 Difference]: Without dead ends: 380 [2018-10-25 00:04:43,252 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:04:43,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-10-25 00:04:43,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-10-25 00:04:43,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-10-25 00:04:43,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-10-25 00:04:43,291 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 162 [2018-10-25 00:04:43,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:43,291 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-10-25 00:04:43,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:04:43,292 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-10-25 00:04:43,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-25 00:04:43,295 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:43,296 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:04:43,296 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:43,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:43,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1461325531, now seen corresponding path program 1 times [2018-10-25 00:04:43,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:43,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:43,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:43,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:43,298 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:43,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:43,524 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-25 00:04:43,591 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:04:43,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:04:43,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:04:43,591 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:04:43,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:04:43,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:04:43,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:04:43,593 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-10-25 00:04:46,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:46,419 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-10-25 00:04:46,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:04:46,420 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 170 [2018-10-25 00:04:46,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:46,425 INFO L225 Difference]: With dead ends: 1193 [2018-10-25 00:04:46,425 INFO L226 Difference]: Without dead ends: 819 [2018-10-25 00:04:46,427 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-25 00:04:46,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-10-25 00:04:46,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-10-25 00:04:46,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-10-25 00:04:46,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-10-25 00:04:46,458 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 170 [2018-10-25 00:04:46,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:46,458 INFO L481 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-10-25 00:04:46,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:04:46,459 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-10-25 00:04:46,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-25 00:04:46,463 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:46,463 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:04:46,463 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:46,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:46,464 INFO L82 PathProgramCache]: Analyzing trace with hash -2126959959, now seen corresponding path program 1 times [2018-10-25 00:04:46,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:46,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:46,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:46,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:46,465 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:46,711 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:04:46,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:04:46,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:04:46,712 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:04:46,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:04:46,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:04:46,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:04:46,713 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-10-25 00:04:47,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:47,848 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-10-25 00:04:47,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:04:47,856 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 172 [2018-10-25 00:04:47,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:47,866 INFO L225 Difference]: With dead ends: 1753 [2018-10-25 00:04:47,866 INFO L226 Difference]: Without dead ends: 804 [2018-10-25 00:04:47,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:04:47,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-10-25 00:04:47,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-10-25 00:04:47,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-10-25 00:04:47,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-10-25 00:04:47,908 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 172 [2018-10-25 00:04:47,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:47,909 INFO L481 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-10-25 00:04:47,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:04:47,909 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-10-25 00:04:47,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-25 00:04:47,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:47,914 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:04:47,914 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:47,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:47,914 INFO L82 PathProgramCache]: Analyzing trace with hash 443683885, now seen corresponding path program 1 times [2018-10-25 00:04:47,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:47,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:47,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:47,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:47,919 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:48,238 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:04:48,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:04:48,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-25 00:04:48,239 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:04:48,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-25 00:04:48,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-25 00:04:48,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:04:48,240 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-10-25 00:04:49,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:49,267 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-10-25 00:04:49,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-25 00:04:49,267 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 174 [2018-10-25 00:04:49,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:49,272 INFO L225 Difference]: With dead ends: 1747 [2018-10-25 00:04:49,272 INFO L226 Difference]: Without dead ends: 801 [2018-10-25 00:04:49,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-25 00:04:49,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-10-25 00:04:49,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-10-25 00:04:49,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-10-25 00:04:49,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-10-25 00:04:49,298 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 174 [2018-10-25 00:04:49,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:49,298 INFO L481 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-10-25 00:04:49,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-25 00:04:49,299 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-10-25 00:04:49,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-25 00:04:49,303 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:49,303 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:04:49,303 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:49,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:49,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1771723, now seen corresponding path program 1 times [2018-10-25 00:04:49,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:49,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:49,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:49,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:49,305 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:49,463 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:04:49,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-25 00:04:49,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-25 00:04:49,463 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:04:49,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-25 00:04:49,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-25 00:04:49,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-25 00:04:49,465 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-10-25 00:04:51,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:51,348 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-10-25 00:04:51,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:04:51,351 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2018-10-25 00:04:51,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:51,361 INFO L225 Difference]: With dead ends: 2381 [2018-10-25 00:04:51,361 INFO L226 Difference]: Without dead ends: 1586 [2018-10-25 00:04:51,366 INFO L605 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-10-25 00:04:51,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-10-25 00:04:51,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-10-25 00:04:51,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-10-25 00:04:51,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-10-25 00:04:51,414 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 178 [2018-10-25 00:04:51,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:51,414 INFO L481 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-10-25 00:04:51,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-25 00:04:51,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-10-25 00:04:51,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-25 00:04:51,421 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:51,422 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:04:51,422 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:51,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:51,422 INFO L82 PathProgramCache]: Analyzing trace with hash 161380030, now seen corresponding path program 1 times [2018-10-25 00:04:51,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:51,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:51,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:51,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:51,425 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:51,727 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:04:51,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:04:51,727 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:04:51,728 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 185 with the following transitions: [2018-10-25 00:04:51,730 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [835], [843], [847], [849], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:04:51,793 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:04:51,794 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:04:53,642 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:04:53,644 INFO L272 AbstractInterpreter]: Visited 152 different actions 451 times. Merged at 7 different actions 19 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-25 00:04:53,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:53,690 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:04:53,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:04:53,690 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:04:53,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:53,702 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:04:53,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:53,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:04:53,957 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:04:53,958 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:04:54,509 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:04:54,548 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:04:54,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 8 [2018-10-25 00:04:54,549 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:04:54,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-25 00:04:54,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-25 00:04:54,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-10-25 00:04:54,554 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 3 states. [2018-10-25 00:04:57,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:04:57,477 INFO L93 Difference]: Finished difference Result 4565 states and 6657 transitions. [2018-10-25 00:04:57,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-25 00:04:57,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2018-10-25 00:04:57,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:04:57,495 INFO L225 Difference]: With dead ends: 4565 [2018-10-25 00:04:57,496 INFO L226 Difference]: Without dead ends: 3013 [2018-10-25 00:04:57,504 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 370 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-10-25 00:04:57,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3013 states. [2018-10-25 00:04:57,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3013 to 3008. [2018-10-25 00:04:57,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3008 states. [2018-10-25 00:04:57,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 3992 transitions. [2018-10-25 00:04:57,596 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 3992 transitions. Word has length 184 [2018-10-25 00:04:57,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:04:57,597 INFO L481 AbstractCegarLoop]: Abstraction has 3008 states and 3992 transitions. [2018-10-25 00:04:57,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-25 00:04:57,597 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 3992 transitions. [2018-10-25 00:04:57,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-10-25 00:04:57,609 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:04:57,609 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, 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] [2018-10-25 00:04:57,610 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:04:57,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:57,610 INFO L82 PathProgramCache]: Analyzing trace with hash -2112487449, now seen corresponding path program 1 times [2018-10-25 00:04:57,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:04:57,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:57,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:04:57,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:04:57,612 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:04:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:04:57,795 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:04:57,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:04:57,796 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:04:57,796 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 214 with the following transitions: [2018-10-25 00:04:57,797 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [107], [108], [112], [116], [120], [123], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [835], [843], [847], [849], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:04:57,805 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:04:57,805 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:04:58,470 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:04:58,470 INFO L272 AbstractInterpreter]: Visited 151 different actions 296 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-10-25 00:04:58,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:04:58,509 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:04:59,864 INFO L232 lantSequenceWeakener]: Weakened 156 states. On average, predicates are now at 81.62% of their original sizes. [2018-10-25 00:04:59,864 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:05:04,177 INFO L413 sIntCurrentIteration]: We have 212 unified AI predicates [2018-10-25 00:05:04,178 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:05:04,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:05:04,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 17 [2018-10-25 00:05:04,179 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:05:04,180 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-25 00:05:04,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-25 00:05:04,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-10-25 00:05:04,180 INFO L87 Difference]: Start difference. First operand 3008 states and 3992 transitions. Second operand 13 states. [2018-10-25 00:05:23,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:05:23,155 INFO L93 Difference]: Finished difference Result 7191 states and 9606 transitions. [2018-10-25 00:05:23,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-25 00:05:23,155 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 213 [2018-10-25 00:05:23,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:05:23,173 INFO L225 Difference]: With dead ends: 7191 [2018-10-25 00:05:23,174 INFO L226 Difference]: Without dead ends: 4189 [2018-10-25 00:05:23,183 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 217 GetRequests, 82 SyntacticMatches, 119 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2018-10-25 00:05:23,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4189 states. [2018-10-25 00:05:23,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4189 to 4180. [2018-10-25 00:05:23,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4180 states. [2018-10-25 00:05:23,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4180 states to 4180 states and 5347 transitions. [2018-10-25 00:05:23,281 INFO L78 Accepts]: Start accepts. Automaton has 4180 states and 5347 transitions. Word has length 213 [2018-10-25 00:05:23,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:05:23,282 INFO L481 AbstractCegarLoop]: Abstraction has 4180 states and 5347 transitions. [2018-10-25 00:05:23,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-25 00:05:23,282 INFO L276 IsEmpty]: Start isEmpty. Operand 4180 states and 5347 transitions. [2018-10-25 00:05:23,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-10-25 00:05:23,296 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:05:23,296 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-25 00:05:23,296 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:05:23,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:23,297 INFO L82 PathProgramCache]: Analyzing trace with hash 666818281, now seen corresponding path program 1 times [2018-10-25 00:05:23,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:05:23,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:23,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:23,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:23,298 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:05:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:23,615 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 00:05:23,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:05:23,616 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:05:23,616 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 232 with the following transitions: [2018-10-25 00:05:23,616 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [312], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [835], [843], [847], [849], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:05:23,621 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:05:23,622 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:05:24,069 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:05:24,070 INFO L272 AbstractInterpreter]: Visited 151 different actions 450 times. Merged at 7 different actions 19 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-25 00:05:24,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:24,076 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:05:25,679 INFO L232 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 83.33% of their original sizes. [2018-10-25 00:05:25,679 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:05:31,500 INFO L413 sIntCurrentIteration]: We have 230 unified AI predicates [2018-10-25 00:05:31,500 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:05:31,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:05:31,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 17 [2018-10-25 00:05:31,501 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:05:31,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-25 00:05:31,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-25 00:05:31,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-10-25 00:05:31,502 INFO L87 Difference]: Start difference. First operand 4180 states and 5347 transitions. Second operand 11 states. [2018-10-25 00:05:42,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:05:42,253 INFO L93 Difference]: Finished difference Result 9746 states and 12899 transitions. [2018-10-25 00:05:42,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-25 00:05:42,253 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 231 [2018-10-25 00:05:42,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:05:42,279 INFO L225 Difference]: With dead ends: 9746 [2018-10-25 00:05:42,279 INFO L226 Difference]: Without dead ends: 6084 [2018-10-25 00:05:42,292 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 234 GetRequests, 22 SyntacticMatches, 199 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-10-25 00:05:42,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6084 states. [2018-10-25 00:05:42,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6084 to 5933. [2018-10-25 00:05:42,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5933 states. [2018-10-25 00:05:42,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5933 states to 5933 states and 7465 transitions. [2018-10-25 00:05:42,432 INFO L78 Accepts]: Start accepts. Automaton has 5933 states and 7465 transitions. Word has length 231 [2018-10-25 00:05:42,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:05:42,432 INFO L481 AbstractCegarLoop]: Abstraction has 5933 states and 7465 transitions. [2018-10-25 00:05:42,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-25 00:05:42,432 INFO L276 IsEmpty]: Start isEmpty. Operand 5933 states and 7465 transitions. [2018-10-25 00:05:42,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-10-25 00:05:42,449 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:05:42,450 INFO L375 BasicCegarLoop]: trace histogram [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, 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] [2018-10-25 00:05:42,450 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:05:42,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:42,451 INFO L82 PathProgramCache]: Analyzing trace with hash 915295681, now seen corresponding path program 1 times [2018-10-25 00:05:42,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:05:42,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:42,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:05:42,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:05:42,452 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:05:42,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:05:43,240 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 101 proven. 54 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-25 00:05:43,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:05:43,240 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:05:43,241 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 254 with the following transitions: [2018-10-25 00:05:43,241 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [202], [205], [209], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [835], [843], [847], [849], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:05:43,245 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:05:43,245 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:05:43,909 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-25 00:05:43,909 INFO L272 AbstractInterpreter]: Visited 154 different actions 613 times. Merged at 8 different actions 34 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-25 00:05:43,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:05:43,914 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-25 00:05:46,088 INFO L232 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 83.33% of their original sizes. [2018-10-25 00:05:46,088 INFO L411 sIntCurrentIteration]: Unifying AI predicates [2018-10-25 00:05:51,744 INFO L413 sIntCurrentIteration]: We have 252 unified AI predicates [2018-10-25 00:05:51,744 INFO L422 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-25 00:05:51,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-25 00:05:51,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [10] total 22 [2018-10-25 00:05:51,745 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-25 00:05:51,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-25 00:05:51,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-25 00:05:51,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-10-25 00:05:51,746 INFO L87 Difference]: Start difference. First operand 5933 states and 7465 transitions. Second operand 14 states. [2018-10-25 00:06:09,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:06:09,014 INFO L93 Difference]: Finished difference Result 13013 states and 16485 transitions. [2018-10-25 00:06:09,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-25 00:06:09,014 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 253 [2018-10-25 00:06:09,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:06:09,045 INFO L225 Difference]: With dead ends: 13013 [2018-10-25 00:06:09,046 INFO L226 Difference]: Without dead ends: 8180 [2018-10-25 00:06:09,060 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 258 GetRequests, 31 SyntacticMatches, 209 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1362 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2018-10-25 00:06:09,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8180 states. [2018-10-25 00:06:09,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8180 to 8095. [2018-10-25 00:06:09,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8095 states. [2018-10-25 00:06:09,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8095 states to 8095 states and 9773 transitions. [2018-10-25 00:06:09,275 INFO L78 Accepts]: Start accepts. Automaton has 8095 states and 9773 transitions. Word has length 253 [2018-10-25 00:06:09,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:06:09,276 INFO L481 AbstractCegarLoop]: Abstraction has 8095 states and 9773 transitions. [2018-10-25 00:06:09,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-25 00:06:09,276 INFO L276 IsEmpty]: Start isEmpty. Operand 8095 states and 9773 transitions. [2018-10-25 00:06:09,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-10-25 00:06:09,300 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:06:09,301 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:06:09,301 INFO L424 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:06:09,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:09,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1111459177, now seen corresponding path program 1 times [2018-10-25 00:06:09,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:06:09,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:09,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:09,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:09,303 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:06:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:09,580 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-10-25 00:06:09,940 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-25 00:06:10,193 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 120 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:06:10,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:06:10,194 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:06:10,194 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 256 with the following transitions: [2018-10-25 00:06:10,195 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [26], [30], [34], [38], [42], [53], [64], [68], [72], [75], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [301], [306], [308], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [835], [843], [847], [849], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:06:10,198 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:06:10,198 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:06:10,701 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:06:10,702 INFO L272 AbstractInterpreter]: Visited 155 different actions 458 times. Merged at 8 different actions 21 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-25 00:06:10,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:10,709 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:06:10,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:06:10,709 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:06:10,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:10,718 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:06:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:10,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:06:11,011 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 135 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:06:11,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:06:11,763 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 135 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-25 00:06:11,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:06:11,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5] total 16 [2018-10-25 00:06:11,784 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:06:11,785 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-25 00:06:11,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-25 00:06:11,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-10-25 00:06:11,787 INFO L87 Difference]: Start difference. First operand 8095 states and 9773 transitions. Second operand 15 states. [2018-10-25 00:06:14,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:06:14,795 INFO L93 Difference]: Finished difference Result 16202 states and 19958 transitions. [2018-10-25 00:06:14,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-25 00:06:14,796 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 255 [2018-10-25 00:06:14,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:06:14,821 INFO L225 Difference]: With dead ends: 16202 [2018-10-25 00:06:14,821 INFO L226 Difference]: Without dead ends: 7620 [2018-10-25 00:06:14,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 517 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-10-25 00:06:14,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7620 states. [2018-10-25 00:06:15,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7620 to 7536. [2018-10-25 00:06:15,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7536 states. [2018-10-25 00:06:15,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7536 states to 7536 states and 8798 transitions. [2018-10-25 00:06:15,025 INFO L78 Accepts]: Start accepts. Automaton has 7536 states and 8798 transitions. Word has length 255 [2018-10-25 00:06:15,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:06:15,026 INFO L481 AbstractCegarLoop]: Abstraction has 7536 states and 8798 transitions. [2018-10-25 00:06:15,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-25 00:06:15,026 INFO L276 IsEmpty]: Start isEmpty. Operand 7536 states and 8798 transitions. [2018-10-25 00:06:15,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-10-25 00:06:15,052 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:06:15,052 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:06:15,053 INFO L424 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:06:15,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:15,053 INFO L82 PathProgramCache]: Analyzing trace with hash 641913708, now seen corresponding path program 1 times [2018-10-25 00:06:15,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:06:15,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:15,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:15,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:15,055 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:06:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:15,529 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 253 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:06:15,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:06:15,529 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:06:15,529 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 314 with the following transitions: [2018-10-25 00:06:15,530 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [236], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [301], [306], [308], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [835], [843], [847], [849], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:06:15,532 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:06:15,532 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:06:16,560 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:06:16,560 INFO L272 AbstractInterpreter]: Visited 155 different actions 617 times. Merged at 8 different actions 37 times. Widened at 1 different actions 3 times. Found 6 fixpoints after 4 different actions. Largest state had 38 variables. [2018-10-25 00:06:16,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:16,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:06:16,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:06:16,568 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:06:16,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:16,579 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:06:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:16,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:06:16,923 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 251 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-25 00:06:16,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:06:17,415 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 251 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-25 00:06:17,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:06:17,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 15 [2018-10-25 00:06:17,437 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:06:17,437 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-25 00:06:17,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-25 00:06:17,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-10-25 00:06:17,438 INFO L87 Difference]: Start difference. First operand 7536 states and 8798 transitions. Second operand 13 states. [2018-10-25 00:06:21,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:06:21,509 INFO L93 Difference]: Finished difference Result 14790 states and 17295 transitions. [2018-10-25 00:06:21,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-25 00:06:21,511 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 313 [2018-10-25 00:06:21,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:06:21,528 INFO L225 Difference]: With dead ends: 14790 [2018-10-25 00:06:21,529 INFO L226 Difference]: Without dead ends: 6829 [2018-10-25 00:06:21,543 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 644 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=326, Invalid=1156, Unknown=0, NotChecked=0, Total=1482 [2018-10-25 00:06:21,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6829 states. [2018-10-25 00:06:21,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6829 to 6392. [2018-10-25 00:06:21,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6392 states. [2018-10-25 00:06:21,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6392 states to 6392 states and 7020 transitions. [2018-10-25 00:06:21,695 INFO L78 Accepts]: Start accepts. Automaton has 6392 states and 7020 transitions. Word has length 313 [2018-10-25 00:06:21,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:06:21,696 INFO L481 AbstractCegarLoop]: Abstraction has 6392 states and 7020 transitions. [2018-10-25 00:06:21,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-25 00:06:21,696 INFO L276 IsEmpty]: Start isEmpty. Operand 6392 states and 7020 transitions. [2018-10-25 00:06:21,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-10-25 00:06:21,717 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:06:21,717 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:06:21,718 INFO L424 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:06:21,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:21,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1064430452, now seen corresponding path program 1 times [2018-10-25 00:06:21,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:06:21,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:21,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:21,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:21,719 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:06:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:22,137 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-25 00:06:22,837 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 297 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-25 00:06:22,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:06:22,837 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:06:22,837 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 349 with the following transitions: [2018-10-25 00:06:22,838 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [198], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [301], [306], [308], [309], [313], [317], [321], [325], [329], [333], [344], [348], [351], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [835], [843], [847], [849], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:06:22,840 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:06:22,841 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:06:23,395 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:06:23,396 INFO L272 AbstractInterpreter]: Visited 155 different actions 611 times. Merged at 8 different actions 31 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-25 00:06:23,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:23,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:06:23,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:06:23,402 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:06:23,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:23,410 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:06:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:23,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:06:24,162 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 312 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-10-25 00:06:24,163 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:06:24,708 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 312 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-10-25 00:06:24,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:06:24,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7, 8] total 23 [2018-10-25 00:06:24,740 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:06:24,741 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-25 00:06:24,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-25 00:06:24,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2018-10-25 00:06:24,742 INFO L87 Difference]: Start difference. First operand 6392 states and 7020 transitions. Second operand 19 states. [2018-10-25 00:06:24,959 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 26 [2018-10-25 00:06:25,422 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2018-10-25 00:06:27,350 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 44 [2018-10-25 00:06:27,812 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-25 00:06:29,697 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 43 [2018-10-25 00:06:29,864 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2018-10-25 00:06:31,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:06:31,046 INFO L93 Difference]: Finished difference Result 10976 states and 12219 transitions. [2018-10-25 00:06:31,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-25 00:06:31,047 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 348 [2018-10-25 00:06:31,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:06:31,061 INFO L225 Difference]: With dead ends: 10976 [2018-10-25 00:06:31,061 INFO L226 Difference]: Without dead ends: 6839 [2018-10-25 00:06:31,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 751 GetRequests, 696 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=697, Invalid=2495, Unknown=0, NotChecked=0, Total=3192 [2018-10-25 00:06:31,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6839 states. [2018-10-25 00:06:31,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6839 to 6541. [2018-10-25 00:06:31,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6541 states. [2018-10-25 00:06:31,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6541 states to 6541 states and 7146 transitions. [2018-10-25 00:06:31,230 INFO L78 Accepts]: Start accepts. Automaton has 6541 states and 7146 transitions. Word has length 348 [2018-10-25 00:06:31,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:06:31,230 INFO L481 AbstractCegarLoop]: Abstraction has 6541 states and 7146 transitions. [2018-10-25 00:06:31,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-25 00:06:31,230 INFO L276 IsEmpty]: Start isEmpty. Operand 6541 states and 7146 transitions. [2018-10-25 00:06:31,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-10-25 00:06:31,252 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:06:31,252 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 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] [2018-10-25 00:06:31,252 INFO L424 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:06:31,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:31,253 INFO L82 PathProgramCache]: Analyzing trace with hash -526388730, now seen corresponding path program 1 times [2018-10-25 00:06:31,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:06:31,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:31,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:31,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:31,254 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:06:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:31,800 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 266 proven. 19 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-10-25 00:06:31,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:06:31,801 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:06:31,801 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 357 with the following transitions: [2018-10-25 00:06:31,801 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [45], [50], [52], [53], [56], [61], [63], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [131], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [199], [210], [214], [218], [222], [233], [236], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [301], [306], [308], [309], [313], [317], [321], [325], [329], [333], [344], [348], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [835], [843], [847], [849], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:06:31,804 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:06:31,805 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:06:32,890 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:06:32,891 INFO L272 AbstractInterpreter]: Visited 161 different actions 653 times. Merged at 10 different actions 57 times. Widened at 1 different actions 7 times. Found 10 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-25 00:06:32,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:32,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:06:32,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:06:32,899 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:06:32,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:32,908 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:06:33,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:33,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:06:33,331 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 318 proven. 2 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-10-25 00:06:33,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:06:33,528 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-25 00:06:34,325 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 266 proven. 19 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-10-25 00:06:34,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:06:34,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2018-10-25 00:06:34,365 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:06:34,366 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-25 00:06:34,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-25 00:06:34,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-10-25 00:06:34,368 INFO L87 Difference]: Start difference. First operand 6541 states and 7146 transitions. Second operand 7 states. [2018-10-25 00:06:35,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:06:35,427 INFO L93 Difference]: Finished difference Result 9141 states and 10064 transitions. [2018-10-25 00:06:35,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-25 00:06:35,427 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 356 [2018-10-25 00:06:35,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:06:35,438 INFO L225 Difference]: With dead ends: 9141 [2018-10-25 00:06:35,438 INFO L226 Difference]: Without dead ends: 5946 [2018-10-25 00:06:35,443 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 721 GetRequests, 711 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-25 00:06:35,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5946 states. [2018-10-25 00:06:35,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5946 to 5748. [2018-10-25 00:06:35,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5748 states. [2018-10-25 00:06:35,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5748 states to 5748 states and 6230 transitions. [2018-10-25 00:06:35,570 INFO L78 Accepts]: Start accepts. Automaton has 5748 states and 6230 transitions. Word has length 356 [2018-10-25 00:06:35,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:06:35,571 INFO L481 AbstractCegarLoop]: Abstraction has 5748 states and 6230 transitions. [2018-10-25 00:06:35,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-25 00:06:35,571 INFO L276 IsEmpty]: Start isEmpty. Operand 5748 states and 6230 transitions. [2018-10-25 00:06:35,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-10-25 00:06:35,587 INFO L367 BasicCegarLoop]: Found error trace [2018-10-25 00:06:35,588 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-25 00:06:35,588 INFO L424 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-25 00:06:35,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:35,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1961643071, now seen corresponding path program 1 times [2018-10-25 00:06:35,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-25 00:06:35,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:35,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:35,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-25 00:06:35,590 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-25 00:06:35,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:36,095 WARN L179 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 8 [2018-10-25 00:06:37,011 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2018-10-25 00:06:37,138 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2018-10-25 00:06:37,962 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 92 proven. 330 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-25 00:06:37,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:06:37,962 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-25 00:06:37,963 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 371 with the following transitions: [2018-10-25 00:06:37,963 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [56], [61], [63], [64], [68], [72], [76], [80], [84], [88], [92], [96], [100], [104], [108], [112], [116], [120], [124], [128], [132], [136], [140], [144], [148], [152], [156], [160], [171], [175], [179], [183], [187], [191], [195], [198], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [301], [306], [308], [309], [313], [317], [321], [325], [329], [333], [344], [348], [351], [352], [356], [360], [364], [368], [372], [379], [387], [395], [403], [411], [419], [427], [435], [443], [451], [459], [467], [475], [483], [491], [499], [507], [515], [523], [531], [539], [547], [555], [563], [571], [579], [587], [595], [603], [611], [619], [627], [635], [643], [651], [659], [667], [675], [683], [691], [699], [707], [715], [723], [731], [739], [747], [755], [763], [771], [779], [787], [795], [803], [811], [819], [827], [835], [843], [847], [849], [863], [867], [871], [877], [881], [883], [888], [889], [890], [892], [893] [2018-10-25 00:06:37,966 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-25 00:06:37,966 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-25 00:06:38,513 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-25 00:06:38,513 INFO L272 AbstractInterpreter]: Visited 158 different actions 631 times. Merged at 9 different actions 43 times. Widened at 1 different actions 4 times. Found 8 fixpoints after 5 different actions. Largest state had 38 variables. [2018-10-25 00:06:38,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-25 00:06:38,522 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-25 00:06:38,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-25 00:06:38,522 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-25 00:06:38,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-25 00:06:38,531 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-25 00:06:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-25 00:06:38,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-25 00:06:38,778 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 352 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-10-25 00:06:38,778 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-25 00:06:39,068 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 352 proven. 2 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-10-25 00:06:39,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-25 00:06:39,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 5, 5] total 29 [2018-10-25 00:06:39,090 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-25 00:06:39,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-25 00:06:39,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-25 00:06:39,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2018-10-25 00:06:39,093 INFO L87 Difference]: Start difference. First operand 5748 states and 6230 transitions. Second operand 27 states. [2018-10-25 00:06:39,287 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 35 [2018-10-25 00:06:40,339 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 33 [2018-10-25 00:06:40,976 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2018-10-25 00:06:41,243 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2018-10-25 00:06:41,874 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 24 [2018-10-25 00:06:42,693 WARN L179 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2018-10-25 00:06:45,095 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 42 [2018-10-25 00:06:51,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-25 00:06:51,406 INFO L93 Difference]: Finished difference Result 9601 states and 10520 transitions. [2018-10-25 00:06:51,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-25 00:06:51,408 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 370 [2018-10-25 00:06:51,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-25 00:06:51,408 INFO L225 Difference]: With dead ends: 9601 [2018-10-25 00:06:51,408 INFO L226 Difference]: Without dead ends: 0 [2018-10-25 00:06:51,427 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 850 GetRequests, 767 SyntacticMatches, 4 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1792 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1262, Invalid=5218, Unknown=0, NotChecked=0, Total=6480 [2018-10-25 00:06:51,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-25 00:06:51,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-25 00:06:51,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-25 00:06:51,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-25 00:06:51,428 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 370 [2018-10-25 00:06:51,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-25 00:06:51,429 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-25 00:06:51,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-25 00:06:51,429 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-25 00:06:51,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-25 00:06:51,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-25 00:06:51,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:51,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:51,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:51,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:51,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:51,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:51,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:51,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:51,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:51,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:51,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:52,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:52,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:52,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:52,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:52,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:52,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:52,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:52,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:52,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:52,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:52,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:52,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:52,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:52,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:53,235 WARN L179 SmtUtils]: Spent 876.00 ms on a formula simplification. DAG size of input: 344 DAG size of output: 303 [2018-10-25 00:06:53,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-25 00:06:54,066 WARN L179 SmtUtils]: Spent 828.00 ms on a formula simplification. DAG size of input: 351 DAG size of output: 301 [2018-10-25 00:06:54,645 WARN L179 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2018-10-25 00:06:55,137 WARN L179 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 77 [2018-10-25 00:06:59,142 WARN L179 SmtUtils]: Spent 3.98 s on a formula simplification. DAG size of input: 361 DAG size of output: 89 [2018-10-25 00:07:01,241 WARN L179 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 319 DAG size of output: 109 [2018-10-25 00:07:03,226 WARN L179 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 316 DAG size of output: 109 [2018-10-25 00:07:03,230 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:07:03,231 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a11~0)| ~a11~0) (= ~a17~0 |old(~a17~0)|) (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) [2018-10-25 00:07:03,231 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:07:03,231 INFO L425 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,231 INFO L425 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,231 INFO L425 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,231 INFO L425 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,231 INFO L425 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,231 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-10-25 00:07:03,231 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-10-25 00:07:03,232 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-10-25 00:07:03,232 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-10-25 00:07:03,232 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-10-25 00:07:03,232 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-10-25 00:07:03,232 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-10-25 00:07:03,232 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-10-25 00:07:03,232 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-10-25 00:07:03,232 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-10-25 00:07:03,232 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-10-25 00:07:03,232 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-10-25 00:07:03,232 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-10-25 00:07:03,233 INFO L425 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,233 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,233 INFO L425 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,233 INFO L425 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,233 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-10-25 00:07:03,233 INFO L425 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,233 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-10-25 00:07:03,233 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-10-25 00:07:03,233 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-10-25 00:07:03,233 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-10-25 00:07:03,233 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-10-25 00:07:03,233 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-10-25 00:07:03,233 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-10-25 00:07:03,234 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-10-25 00:07:03,234 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-10-25 00:07:03,234 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-10-25 00:07:03,234 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-10-25 00:07:03,234 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-10-25 00:07:03,234 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-10-25 00:07:03,234 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-10-25 00:07:03,234 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-10-25 00:07:03,234 INFO L425 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,234 INFO L425 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,234 INFO L425 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,235 INFO L425 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,235 INFO L425 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,235 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-10-25 00:07:03,235 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-10-25 00:07:03,235 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-10-25 00:07:03,235 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-10-25 00:07:03,235 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-10-25 00:07:03,235 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-10-25 00:07:03,235 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-10-25 00:07:03,235 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-10-25 00:07:03,236 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-10-25 00:07:03,236 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-10-25 00:07:03,236 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-10-25 00:07:03,236 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,236 INFO L425 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,236 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,236 INFO L425 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,236 INFO L425 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,236 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-10-25 00:07:03,236 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-10-25 00:07:03,237 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-10-25 00:07:03,237 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-10-25 00:07:03,237 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-10-25 00:07:03,237 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-10-25 00:07:03,237 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-10-25 00:07:03,237 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-10-25 00:07:03,237 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-10-25 00:07:03,237 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-10-25 00:07:03,237 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-10-25 00:07:03,237 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-10-25 00:07:03,238 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-10-25 00:07:03,238 INFO L425 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,238 INFO L425 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,238 INFO L425 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,238 INFO L425 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,238 INFO L425 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,238 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-10-25 00:07:03,238 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-10-25 00:07:03,238 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-10-25 00:07:03,238 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-10-25 00:07:03,239 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-10-25 00:07:03,239 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-10-25 00:07:03,239 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-10-25 00:07:03,239 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-10-25 00:07:03,239 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-10-25 00:07:03,239 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-10-25 00:07:03,239 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-10-25 00:07:03,239 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-10-25 00:07:03,239 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-10-25 00:07:03,239 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-10-25 00:07:03,239 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-10-25 00:07:03,240 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-10-25 00:07:03,240 INFO L425 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,240 INFO L425 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,240 INFO L425 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,240 INFO L425 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,240 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-10-25 00:07:03,240 INFO L425 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,240 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-10-25 00:07:03,240 INFO L425 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,240 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-10-25 00:07:03,240 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-10-25 00:07:03,241 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-10-25 00:07:03,241 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,241 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,241 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-10-25 00:07:03,241 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-10-25 00:07:03,241 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-10-25 00:07:03,241 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-10-25 00:07:03,241 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-10-25 00:07:03,241 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-10-25 00:07:03,241 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-10-25 00:07:03,241 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-10-25 00:07:03,242 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-10-25 00:07:03,242 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-10-25 00:07:03,242 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-10-25 00:07:03,242 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,242 INFO L425 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,242 INFO L425 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,242 INFO L425 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,242 INFO L425 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,242 INFO L425 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,242 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-10-25 00:07:03,242 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-10-25 00:07:03,243 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-10-25 00:07:03,243 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-10-25 00:07:03,243 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-10-25 00:07:03,243 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-10-25 00:07:03,243 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-10-25 00:07:03,243 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-10-25 00:07:03,243 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-10-25 00:07:03,243 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-10-25 00:07:03,243 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-10-25 00:07:03,244 INFO L425 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,244 INFO L425 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,244 INFO L425 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,244 INFO L425 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,244 INFO L425 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,244 INFO L425 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,244 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-10-25 00:07:03,244 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-10-25 00:07:03,244 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-10-25 00:07:03,244 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-10-25 00:07:03,245 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-10-25 00:07:03,245 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-10-25 00:07:03,245 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-10-25 00:07:03,245 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-10-25 00:07:03,245 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-10-25 00:07:03,245 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-10-25 00:07:03,245 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-10-25 00:07:03,245 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-10-25 00:07:03,245 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-10-25 00:07:03,245 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-10-25 00:07:03,246 INFO L425 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,246 INFO L425 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,246 INFO L425 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,247 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse28 (= 1 |old(~a19~0)|))) (let ((.cse2 (= 1 |old(~a11~0)|)) (.cse22 (= |old(~a11~0)| ~a11~0)) (.cse8 (= 8 ~a17~0)) (.cse24 (= ~a19~0 |old(~a19~0)|)) (.cse25 (= ~a28~0 |old(~a28~0)|)) (.cse26 (= ~a25~0 |old(~a25~0)|)) (.cse4 (not (= 1 ~a21~0))) (.cse5 (not .cse28)) (.cse30 (= 0 |old(~a28~0)|)) (.cse6 (not (= 8 |old(~a17~0)|))) (.cse27 (= 1 |old(~a25~0)|))) (let ((.cse0 (not .cse27)) (.cse1 (or .cse4 .cse5 .cse30 .cse6)) (.cse13 (= 7 ~a28~0)) (.cse10 (= 9 |old(~a28~0)|)) (.cse17 (not (= ~a11~0 1))) (.cse3 (and .cse22 .cse8 .cse24 .cse25 .cse26)) (.cse23 (= ~a17~0 |old(~a17~0)|)) (.cse12 (not (= 7 |old(~a28~0)|))) (.cse21 (or .cse4 .cse30 .cse6)) (.cse7 (= 1 ~a11~0)) (.cse9 (= 1 ~a19~0)) (.cse20 (not (= 10 |old(~a28~0)|))) (.cse11 (not .cse2)) (.cse18 (= |old(~a17~0)| |old(~a28~0)|)) (.cse19 (< 0 |old(~a19~0)|)) (.cse29 (= |old(~a28~0)| ~a28~0)) (.cse14 (= 7 ~a17~0)) (.cse15 (= |old(~a25~0)| ~a25~0)) (.cse16 (not (= 7 |old(~a17~0)|)))) (and (or (or .cse0 .cse1) .cse2 .cse3) (or .cse4 .cse0 .cse5 .cse6 (and .cse7 (= 1 ~a25~0) (= 9 ~a28~0) .cse8 .cse9) (not .cse10) .cse11) (or .cse4 .cse12 .cse0 .cse5 .cse11 (and .cse13 .cse7 .cse14 .cse9 .cse15) .cse16) (or .cse4 .cse2 .cse17 .cse18 .cse19 .cse16) (or .cse2 .cse20 .cse0 .cse21 .cse19 .cse3) (or .cse18 (and .cse22 .cse23 .cse24 .cse25 .cse26) .cse27 .cse1) (or .cse28 .cse4 .cse12 .cse6 (and .cse13 (not (= ~a25~0 1)) .cse7 .cse8 (not .cse9)) .cse11 .cse27) (or .cse4 .cse2 .cse18 .cse10 (and .cse29 .cse14 .cse15 .cse17) .cse27 .cse16) (or .cse2 .cse21 (not (= 8 |old(~a28~0)|)) .cse19 .cse3 .cse27) (or (and (and .cse22 .cse23 .cse26) .cse24 .cse25) (or .cse12 .cse2 .cse21 .cse19 .cse27)) (or (and .cse7 .cse8 .cse9 .cse15 (= 10 ~a28~0)) .cse4 .cse20 .cse5 .cse6 .cse11) (or .cse4 .cse18 .cse19 (and .cse29 (<= ~a19~0 0) .cse14 .cse15) .cse16))))) [2018-10-25 00:07:03,247 INFO L425 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,247 INFO L425 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,247 INFO L425 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,247 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-10-25 00:07:03,247 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-10-25 00:07:03,247 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-10-25 00:07:03,247 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-10-25 00:07:03,247 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-10-25 00:07:03,248 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-10-25 00:07:03,248 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-10-25 00:07:03,248 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-10-25 00:07:03,248 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-10-25 00:07:03,248 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-10-25 00:07:03,248 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-10-25 00:07:03,248 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-10-25 00:07:03,248 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-10-25 00:07:03,248 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,248 INFO L425 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,249 INFO L425 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,249 INFO L425 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,249 INFO L425 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,249 INFO L425 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,249 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-10-25 00:07:03,249 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-10-25 00:07:03,249 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-10-25 00:07:03,249 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-10-25 00:07:03,249 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-10-25 00:07:03,250 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-10-25 00:07:03,250 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-10-25 00:07:03,250 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-10-25 00:07:03,250 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-10-25 00:07:03,250 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-10-25 00:07:03,250 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-10-25 00:07:03,250 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-10-25 00:07:03,250 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-10-25 00:07:03,250 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-10-25 00:07:03,250 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-10-25 00:07:03,251 INFO L425 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2018-10-25 00:07:03,251 INFO L425 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,251 INFO L425 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,251 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 592) no Hoare annotation was computed. [2018-10-25 00:07:03,251 INFO L425 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,251 INFO L425 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,251 INFO L425 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2018-10-25 00:07:03,251 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-10-25 00:07:03,252 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-10-25 00:07:03,252 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-10-25 00:07:03,252 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-10-25 00:07:03,252 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-10-25 00:07:03,252 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-10-25 00:07:03,252 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-10-25 00:07:03,252 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-10-25 00:07:03,252 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-10-25 00:07:03,252 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-10-25 00:07:03,252 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-10-25 00:07:03,252 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-10-25 00:07:03,253 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-10-25 00:07:03,253 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-10-25 00:07:03,253 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-10-25 00:07:03,253 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-10-25 00:07:03,253 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-10-25 00:07:03,253 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-10-25 00:07:03,253 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-10-25 00:07:03,253 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-25 00:07:03,253 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~d~0 4) (= ~z~0 26) (= ~c~0 3) (= ~a21~0 1) (= ~f~0 6) (= ~w~0 23) (= ~u~0 21) (= ~v~0 22) (= ~y~0 25) (= ~e~0 5) (= ~a11~0 0) (= ~x~0 24) (= ~a25~0 0) (= ~a~0 1) (= ~a19~0 1) (= ~a17~0 8) (= ~a28~0 7)) [2018-10-25 00:07:03,254 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-25 00:07:03,254 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-25 00:07:03,254 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (= |old(~a11~0)| 0)) (not (= ~v~0 22)) (not (= ~u~0 21)) (not (= ~a21~0 1)) (and (= ~a11~0 0) (= ~a25~0 0) (= ~a19~0 1) (= |old(~a28~0)| ~a28~0) (= 8 ~a17~0)) (not (= ~y~0 25)) (not (= 3 ~c~0)) (not (= |old(~a25~0)| 0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= 26 ~z~0)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (not (= 8 |old(~a17~0)|)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) [2018-10-25 00:07:03,254 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-10-25 00:07:03,254 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse4 (= 1 ~a25~0)) (.cse12 (= ~a25~0 1))) (let ((.cse0 (not (= ~a28~0 ~a17~0))) (.cse8 (= 7 ~a17~0)) (.cse11 (= 1 ~a19~0)) (.cse5 (= 10 ~a28~0)) (.cse2 (and (not (= ~a28~0 0)) (= ~a17~0 8) (= ~a21~0 1))) (.cse9 (= 7 ~a28~0)) (.cse1 (not .cse12)) (.cse10 (= 1 ~a11~0)) (.cse3 (<= ~a19~0 0)) (.cse6 (not (= ~a11~0 1))) (.cse13 (not .cse4)) (.cse7 (= 8 ~a17~0))) (or (and .cse0 .cse1 (= ~a19~0 |old(~a19~0)|) .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 .cse0 .cse8) (not (= |old(~a11~0)| 0)) (and .cse0 .cse1 .cse8 .cse6 (not (= ~a28~0 9))) (not (= 3 ~c~0)) (not (= 1 ~a21~0)) (not (= 4 ~d~0)) (not (= |old(~a19~0)| 1)) (and .cse9 .cse10 .cse8 .cse4 .cse11) (and (= 9 ~a28~0) .cse7 .cse11) (not (= ~y~0 25)) (not (= |old(~a25~0)| 0)) (not (= ~x~0 24)) (and .cse11 .cse12 .cse6 .cse2) (and .cse7 .cse11 .cse5) (not (= 8 |old(~a17~0)|)) (not (= ~e~0 5)) (not (= 7 |old(~a28~0)|)) (and .cse3 .cse2 .cse9 .cse13) (not (= 21 ~u~0)) (and .cse9 .cse1 .cse10 .cse7) (not (= 22 ~v~0)) (not (= ~z~0 26)) (not (= 23 ~w~0)) (and .cse3 .cse6 (= 8 ~a28~0) .cse13 .cse7) (not (= ~a~0 1)) (not (= 6 ~f~0))))) [2018-10-25 00:07:03,254 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-10-25 00:07:03,255 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-10-25 00:07:03,255 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse4 (= 1 ~a25~0)) (.cse12 (= ~a25~0 1))) (let ((.cse0 (not (= ~a28~0 ~a17~0))) (.cse8 (= 7 ~a17~0)) (.cse11 (= 1 ~a19~0)) (.cse5 (= 10 ~a28~0)) (.cse2 (and (not (= ~a28~0 0)) (= ~a17~0 8) (= ~a21~0 1))) (.cse9 (= 7 ~a28~0)) (.cse1 (not .cse12)) (.cse10 (= 1 ~a11~0)) (.cse3 (<= ~a19~0 0)) (.cse6 (not (= ~a11~0 1))) (.cse13 (not .cse4)) (.cse7 (= 8 ~a17~0))) (or (and .cse0 .cse1 (= ~a19~0 |old(~a19~0)|) .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse3 .cse0 .cse8) (not (= |old(~a11~0)| 0)) (and .cse0 .cse1 .cse8 .cse6 (not (= ~a28~0 9))) (not (= 3 ~c~0)) (not (= 1 ~a21~0)) (not (= 4 ~d~0)) (not (= |old(~a19~0)| 1)) (and .cse9 .cse10 .cse8 .cse4 .cse11) (and (= 9 ~a28~0) .cse7 .cse11) (not (= ~y~0 25)) (not (= |old(~a25~0)| 0)) (not (= ~x~0 24)) (and .cse11 .cse12 .cse6 .cse2) (and .cse7 .cse11 .cse5) (not (= 8 |old(~a17~0)|)) (not (= ~e~0 5)) (not (= 7 |old(~a28~0)|)) (and .cse3 .cse2 .cse9 .cse13) (not (= 21 ~u~0)) (and .cse9 .cse1 .cse10 .cse7) (not (= 22 ~v~0)) (not (= ~z~0 26)) (not (= 23 ~w~0)) (and .cse3 .cse6 (= 8 ~a28~0) .cse13 .cse7) (not (= ~a~0 1)) (not (= 6 ~f~0))))) [2018-10-25 00:07:03,255 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-10-25 00:07:03,255 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-10-25 00:07:03,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 12:07:03 BoogieIcfgContainer [2018-10-25 00:07:03,273 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-25 00:07:03,274 INFO L168 Benchmark]: Toolchain (without parser) took 152048.67 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -916.1 MB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2018-10-25 00:07:03,275 INFO L168 Benchmark]: CDTParser took 0.22 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-10-25 00:07:03,276 INFO L168 Benchmark]: CACSL2BoogieTranslator took 784.98 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-25 00:07:03,276 INFO L168 Benchmark]: Boogie Procedure Inliner took 192.50 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 739.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -815.9 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. [2018-10-25 00:07:03,277 INFO L168 Benchmark]: Boogie Preprocessor took 82.64 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-25 00:07:03,277 INFO L168 Benchmark]: RCFGBuilder took 3660.74 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 104.7 MB). Peak memory consumption was 104.7 MB. Max. memory is 7.1 GB. [2018-10-25 00:07:03,278 INFO L168 Benchmark]: TraceAbstraction took 147319.52 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -236.6 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2018-10-25 00:07:03,282 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 784.98 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 192.50 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 739.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -815.9 MB). Peak memory consumption was 18.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 82.64 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3660.74 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 104.7 MB). Peak memory consumption was 104.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 147319.52 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -236.6 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 592]: 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: 606]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((!(a28 == a17) && !(a25 == 1)) && a19 == \old(a19)) && (!(a28 == 0) && a17 == 8) && a21 == 1) || ((((a19 <= 0 && 1 == a25) && 10 == a28) && !(a11 == 1)) && 8 == a17)) || ((a19 <= 0 && !(a28 == a17)) && 7 == a17)) || !(\old(a11) == 0)) || ((((!(a28 == a17) && !(a25 == 1)) && 7 == a17) && !(a11 == 1)) && !(a28 == 9))) || !(3 == c)) || !(1 == a21)) || !(4 == d)) || !(\old(a19) == 1)) || ((((7 == a28 && 1 == a11) && 7 == a17) && 1 == a25) && 1 == a19)) || ((9 == a28 && 8 == a17) && 1 == a19)) || !(y == 25)) || !(\old(a25) == 0)) || !(x == 24)) || (((1 == a19 && a25 == 1) && !(a11 == 1)) && (!(a28 == 0) && a17 == 8) && a21 == 1)) || ((8 == a17 && 1 == a19) && 10 == a28)) || !(8 == \old(a17))) || !(e == 5)) || !(7 == \old(a28))) || (((a19 <= 0 && (!(a28 == 0) && a17 == 8) && a21 == 1) && 7 == a28) && !(1 == a25))) || !(21 == u)) || (((7 == a28 && !(a25 == 1)) && 1 == a11) && 8 == a17)) || !(22 == v)) || !(z == 26)) || !(23 == w)) || ((((a19 <= 0 && !(a11 == 1)) && 8 == a28) && !(1 == a25)) && 8 == a17)) || !(a == 1)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 147.2s OverallTime, 16 OverallIterations, 6 TraceHistogramMax, 89.0s AutomataDifference, 0.0s DeadEndRemovalTime, 11.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 2145 SDtfs, 21641 SDslu, 2876 SDs, 0 SdLazy, 31688 SolverSat, 3642 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 44.4s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 4693 GetRequests, 3862 SyntacticMatches, 546 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5964 ImplicationChecksByTransitivity, 30.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8095occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 7.5s AbstIntTime, 9 AbstIntIterations, 3 AbstIntStrong, 0.9976609974739958 AbsIntWeakeningRatio, 0.15561959654178675 AbsIntAvgWeakeningVarsNumRemoved, 0.2896253602305475 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 1307 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 316 PreInvPairs, 462 NumberOfFragments, 1118 HoareAnnotationTreeSize, 316 FomulaSimplifications, 59789 FormulaSimplificationTreeSizeReduction, 2.6s HoareSimplificationTime, 7 FomulaSimplificationsInter, 56189 FormulaSimplificationTreeSizeReductionInter, 9.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 5508 NumberOfCodeBlocks, 5508 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 7306 ConstructedInterpolants, 0 QuantifiedInterpolants, 11555736 SizeOfPredicates, 20 NumberOfNonLiveVariables, 3713 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 28 InterpolantComputations, 9 PerfectInterpolantSequences, 4996/5672 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...