java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem02_label06_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 18:43:06,057 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 18:43:06,059 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 18:43:06,076 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 18:43:06,077 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 18:43:06,078 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 18:43:06,079 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 18:43:06,081 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 18:43:06,083 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 18:43:06,084 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 18:43:06,085 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 18:43:06,085 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 18:43:06,086 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 18:43:06,087 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 18:43:06,088 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 18:43:06,089 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 18:43:06,090 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 18:43:06,092 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 18:43:06,094 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 18:43:06,096 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 18:43:06,097 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 18:43:06,098 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 18:43:06,101 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 18:43:06,101 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 18:43:06,101 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 18:43:06,102 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 18:43:06,107 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 18:43:06,108 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 18:43:06,110 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 18:43:06,112 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 18:43:06,113 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 18:43:06,114 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 18:43:06,114 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 18:43:06,114 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 18:43:06,115 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 18:43:06,116 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 18:43:06,116 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-07 18:43:06,132 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 18:43:06,132 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 18:43:06,133 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 18:43:06,133 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 18:43:06,133 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 18:43:06,134 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 18:43:06,134 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-07 18:43:06,134 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 18:43:06,134 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 18:43:06,134 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 18:43:06,134 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 18:43:06,135 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 18:43:06,135 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 18:43:06,136 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 18:43:06,136 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 18:43:06,136 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 18:43:06,136 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 18:43:06,136 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 18:43:06,137 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 18:43:06,137 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 18:43:06,137 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 18:43:06,137 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 18:43:06,137 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 18:43:06,140 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 18:43:06,140 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 18:43:06,140 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 18:43:06,140 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 18:43:06,141 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 18:43:06,141 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 18:43:06,141 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 18:43:06,141 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 18:43:06,142 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 18:43:06,142 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 18:43:06,142 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 18:43:06,142 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 18:43:06,194 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 18:43:06,207 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 18:43:06,213 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 18:43:06,215 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 18:43:06,215 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 18:43:06,216 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label06_true-unreach-call_false-termination.c [2018-11-07 18:43:06,288 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46280468b/3709f52c455a4e3da9f499d0b2761a56/FLAG01004ba72 [2018-11-07 18:43:06,850 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 18:43:06,851 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label06_true-unreach-call_false-termination.c [2018-11-07 18:43:06,875 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46280468b/3709f52c455a4e3da9f499d0b2761a56/FLAG01004ba72 [2018-11-07 18:43:06,898 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46280468b/3709f52c455a4e3da9f499d0b2761a56 [2018-11-07 18:43:06,912 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 18:43:06,913 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 18:43:06,915 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 18:43:06,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 18:43:06,921 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 18:43:06,922 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:43:06" (1/1) ... [2018-11-07 18:43:06,925 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fc87f20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:43:06, skipping insertion in model container [2018-11-07 18:43:06,926 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:43:06" (1/1) ... [2018-11-07 18:43:06,936 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 18:43:07,001 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 18:43:07,466 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 18:43:07,471 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 18:43:07,610 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 18:43:07,630 INFO L193 MainTranslator]: Completed translation [2018-11-07 18:43:07,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:43:07 WrapperNode [2018-11-07 18:43:07,631 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 18:43:07,632 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 18:43:07,632 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 18:43:07,632 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 18:43:07,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:43:07" (1/1) ... [2018-11-07 18:43:07,752 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:43:07" (1/1) ... [2018-11-07 18:43:07,762 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 18:43:07,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 18:43:07,762 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 18:43:07,762 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 18:43:07,771 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:43:07" (1/1) ... [2018-11-07 18:43:07,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:43:07" (1/1) ... [2018-11-07 18:43:07,776 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:43:07" (1/1) ... [2018-11-07 18:43:07,777 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:43:07" (1/1) ... [2018-11-07 18:43:07,825 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:43:07" (1/1) ... [2018-11-07 18:43:07,850 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:43:07" (1/1) ... [2018-11-07 18:43:07,858 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:43:07" (1/1) ... [2018-11-07 18:43:07,862 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 18:43:07,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 18:43:07,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 18:43:07,863 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 18:43:07,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:43:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 18:43:07,934 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 18:43:07,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 18:43:07,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 18:43:07,934 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 18:43:07,935 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 18:43:07,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 18:43:07,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 18:43:07,935 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 18:43:07,935 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 18:43:11,015 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 18:43:11,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:43:11 BoogieIcfgContainer [2018-11-07 18:43:11,018 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 18:43:11,019 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 18:43:11,020 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 18:43:11,028 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 18:43:11,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:43:06" (1/3) ... [2018-11-07 18:43:11,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1647a4d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:43:11, skipping insertion in model container [2018-11-07 18:43:11,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:43:07" (2/3) ... [2018-11-07 18:43:11,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1647a4d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:43:11, skipping insertion in model container [2018-11-07 18:43:11,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:43:11" (3/3) ... [2018-11-07 18:43:11,034 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label06_true-unreach-call_false-termination.c [2018-11-07 18:43:11,045 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 18:43:11,055 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 18:43:11,073 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 18:43:11,122 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 18:43:11,122 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 18:43:11,122 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 18:43:11,122 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 18:43:11,123 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 18:43:11,123 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 18:43:11,123 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 18:43:11,124 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 18:43:11,151 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2018-11-07 18:43:11,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-07 18:43:11,169 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:43:11,170 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-11-07 18:43:11,173 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:43:11,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:43:11,180 INFO L82 PathProgramCache]: Analyzing trace with hash -247147345, now seen corresponding path program 1 times [2018-11-07 18:43:11,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:43:11,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:43:11,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:43:11,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:43:11,232 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:43:11,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:43:11,921 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 18:43:12,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:43:12,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:43:12,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-07 18:43:12,019 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:43:12,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 18:43:12,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 18:43:12,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 18:43:12,045 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 3 states. [2018-11-07 18:43:13,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:43:13,844 INFO L93 Difference]: Finished difference Result 621 states and 1059 transitions. [2018-11-07 18:43:13,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 18:43:13,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2018-11-07 18:43:13,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:43:13,868 INFO L225 Difference]: With dead ends: 621 [2018-11-07 18:43:13,869 INFO L226 Difference]: Without dead ends: 382 [2018-11-07 18:43:13,875 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-07 18:43:13,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-07 18:43:13,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-11-07 18:43:13,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-07 18:43:13,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2018-11-07 18:43:13,951 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 147 [2018-11-07 18:43:13,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:43:13,952 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2018-11-07 18:43:13,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 18:43:13,952 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2018-11-07 18:43:13,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-07 18:43:13,960 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:43:13,960 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-11-07 18:43:13,961 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:43:13,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:43:13,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1882359938, now seen corresponding path program 1 times [2018-11-07 18:43:13,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:43:13,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:43:13,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:43:13,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:43:13,963 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:43:14,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:43:14,467 WARN L179 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-07 18:43:14,695 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-07 18:43:14,787 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:43:14,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:43:14,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 18:43:14,788 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:43:14,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 18:43:14,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 18:43:14,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:43:14,791 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand 5 states. [2018-11-07 18:43:16,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:43:16,180 INFO L93 Difference]: Finished difference Result 903 states and 1497 transitions. [2018-11-07 18:43:16,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 18:43:16,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2018-11-07 18:43:16,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:43:16,186 INFO L225 Difference]: With dead ends: 903 [2018-11-07 18:43:16,187 INFO L226 Difference]: Without dead ends: 381 [2018-11-07 18:43:16,190 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:43:16,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-11-07 18:43:16,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-11-07 18:43:16,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-11-07 18:43:16,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 602 transitions. [2018-11-07 18:43:16,218 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 602 transitions. Word has length 156 [2018-11-07 18:43:16,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:43:16,219 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 602 transitions. [2018-11-07 18:43:16,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 18:43:16,219 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 602 transitions. [2018-11-07 18:43:16,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-07 18:43:16,223 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:43:16,223 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-11-07 18:43:16,223 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:43:16,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:43:16,224 INFO L82 PathProgramCache]: Analyzing trace with hash 337215758, now seen corresponding path program 1 times [2018-11-07 18:43:16,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:43:16,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:43:16,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:43:16,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:43:16,226 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:43:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:43:16,648 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2018-11-07 18:43:16,816 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:43:16,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:43:16,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 18:43:16,817 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:43:16,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 18:43:16,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 18:43:16,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:43:16,819 INFO L87 Difference]: Start difference. First operand 381 states and 602 transitions. Second operand 5 states. [2018-11-07 18:43:18,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:43:18,424 INFO L93 Difference]: Finished difference Result 901 states and 1482 transitions. [2018-11-07 18:43:18,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 18:43:18,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 162 [2018-11-07 18:43:18,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:43:18,435 INFO L225 Difference]: With dead ends: 901 [2018-11-07 18:43:18,435 INFO L226 Difference]: Without dead ends: 380 [2018-11-07 18:43:18,438 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:43:18,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-11-07 18:43:18,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-11-07 18:43:18,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-11-07 18:43:18,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 594 transitions. [2018-11-07 18:43:18,472 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 594 transitions. Word has length 162 [2018-11-07 18:43:18,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:43:18,473 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 594 transitions. [2018-11-07 18:43:18,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 18:43:18,473 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 594 transitions. [2018-11-07 18:43:18,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-07 18:43:18,476 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:43:18,476 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-11-07 18:43:18,476 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:43:18,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:43:18,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1461325531, now seen corresponding path program 1 times [2018-11-07 18:43:18,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:43:18,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:43:18,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:43:18,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:43:18,478 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:43:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:43:18,707 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 18:43:19,082 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:43:19,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:43:19,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 18:43:19,083 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:43:19,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 18:43:19,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 18:43:19,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 18:43:19,085 INFO L87 Difference]: Start difference. First operand 380 states and 594 transitions. Second operand 6 states. [2018-11-07 18:43:21,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:43:21,785 INFO L93 Difference]: Finished difference Result 1193 states and 1942 transitions. [2018-11-07 18:43:21,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 18:43:21,786 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 170 [2018-11-07 18:43:21,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:43:21,792 INFO L225 Difference]: With dead ends: 1193 [2018-11-07 18:43:21,792 INFO L226 Difference]: Without dead ends: 819 [2018-11-07 18:43:21,794 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 18:43:21,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-11-07 18:43:21,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 807. [2018-11-07 18:43:21,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2018-11-07 18:43:21,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2018-11-07 18:43:21,827 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 170 [2018-11-07 18:43:21,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:43:21,828 INFO L480 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2018-11-07 18:43:21,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 18:43:21,828 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2018-11-07 18:43:21,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-07 18:43:21,832 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:43:21,833 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-11-07 18:43:21,833 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:43:21,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:43:21,833 INFO L82 PathProgramCache]: Analyzing trace with hash -2126959959, now seen corresponding path program 1 times [2018-11-07 18:43:21,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:43:21,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:43:21,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:43:21,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:43:21,835 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:43:21,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:43:22,240 WARN L179 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-07 18:43:22,444 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:43:22,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:43:22,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 18:43:22,445 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:43:22,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 18:43:22,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 18:43:22,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:43:22,446 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 5 states. [2018-11-07 18:43:23,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:43:23,512 INFO L93 Difference]: Finished difference Result 1753 states and 2669 transitions. [2018-11-07 18:43:23,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 18:43:23,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 172 [2018-11-07 18:43:23,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:43:23,529 INFO L225 Difference]: With dead ends: 1753 [2018-11-07 18:43:23,529 INFO L226 Difference]: Without dead ends: 804 [2018-11-07 18:43:23,533 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:43:23,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-11-07 18:43:23,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 804. [2018-11-07 18:43:23,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2018-11-07 18:43:23,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1190 transitions. [2018-11-07 18:43:23,569 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1190 transitions. Word has length 172 [2018-11-07 18:43:23,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:43:23,570 INFO L480 AbstractCegarLoop]: Abstraction has 804 states and 1190 transitions. [2018-11-07 18:43:23,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 18:43:23,570 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1190 transitions. [2018-11-07 18:43:23,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-07 18:43:23,574 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:43:23,574 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-11-07 18:43:23,575 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:43:23,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:43:23,575 INFO L82 PathProgramCache]: Analyzing trace with hash 443683885, now seen corresponding path program 1 times [2018-11-07 18:43:23,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:43:23,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:43:23,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:43:23,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:43:23,580 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:43:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:43:23,931 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:43:23,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:43:23,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 18:43:23,932 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:43:23,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 18:43:23,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 18:43:23,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 18:43:23,933 INFO L87 Difference]: Start difference. First operand 804 states and 1190 transitions. Second operand 5 states. [2018-11-07 18:43:24,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:43:24,893 INFO L93 Difference]: Finished difference Result 1747 states and 2630 transitions. [2018-11-07 18:43:24,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 18:43:24,906 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 174 [2018-11-07 18:43:24,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:43:24,913 INFO L225 Difference]: With dead ends: 1747 [2018-11-07 18:43:24,913 INFO L226 Difference]: Without dead ends: 801 [2018-11-07 18:43:24,916 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-11-07 18:43:24,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-11-07 18:43:24,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-11-07 18:43:24,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-11-07 18:43:24,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1169 transitions. [2018-11-07 18:43:24,947 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1169 transitions. Word has length 174 [2018-11-07 18:43:24,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:43:24,947 INFO L480 AbstractCegarLoop]: Abstraction has 801 states and 1169 transitions. [2018-11-07 18:43:24,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 18:43:24,947 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1169 transitions. [2018-11-07 18:43:24,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-07 18:43:24,955 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:43:24,956 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-11-07 18:43:24,956 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:43:24,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:43:24,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1771723, now seen corresponding path program 1 times [2018-11-07 18:43:24,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:43:24,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:43:24,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:43:24,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:43:24,964 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:43:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:43:25,143 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:43:25,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 18:43:25,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 18:43:25,143 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:43:25,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 18:43:25,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 18:43:25,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 18:43:25,145 INFO L87 Difference]: Start difference. First operand 801 states and 1169 transitions. Second operand 6 states. [2018-11-07 18:43:27,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:43:27,107 INFO L93 Difference]: Finished difference Result 2381 states and 3621 transitions. [2018-11-07 18:43:27,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 18:43:27,119 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2018-11-07 18:43:27,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:43:27,130 INFO L225 Difference]: With dead ends: 2381 [2018-11-07 18:43:27,130 INFO L226 Difference]: Without dead ends: 1586 [2018-11-07 18:43:27,135 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-07 18:43:27,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-11-07 18:43:27,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1558. [2018-11-07 18:43:27,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2018-11-07 18:43:27,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2225 transitions. [2018-11-07 18:43:27,193 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2225 transitions. Word has length 178 [2018-11-07 18:43:27,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:43:27,194 INFO L480 AbstractCegarLoop]: Abstraction has 1558 states and 2225 transitions. [2018-11-07 18:43:27,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 18:43:27,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2225 transitions. [2018-11-07 18:43:27,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-07 18:43:27,201 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:43:27,202 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-11-07 18:43:27,202 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:43:27,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:43:27,202 INFO L82 PathProgramCache]: Analyzing trace with hash 161380030, now seen corresponding path program 1 times [2018-11-07 18:43:27,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:43:27,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:43:27,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:43:27,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:43:27,204 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:43:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:43:27,487 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:43:27,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:43:27,487 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:43:27,488 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 185 with the following transitions: [2018-11-07 18:43:27,491 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-11-07 18:43:27,547 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:43:27,548 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:43:29,645 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 18:43:29,647 INFO L272 AbstractInterpreter]: Visited 152 different actions 452 times. Merged at 7 different actions 20 times. Never widened. Found 3 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 18:43:29,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:43:29,701 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 18:43:29,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:43:29,701 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 18:43:29,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:43:29,724 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 18:43:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:43:29,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 18:43:29,978 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 18:43:29,979 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 18:43:30,355 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 18:43:30,384 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:43:30,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 8 [2018-11-07 18:43:30,384 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:43:30,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-07 18:43:30,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-07 18:43:30,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-07 18:43:30,386 INFO L87 Difference]: Start difference. First operand 1558 states and 2225 transitions. Second operand 3 states. [2018-11-07 18:43:32,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:43:32,816 INFO L93 Difference]: Finished difference Result 4565 states and 6657 transitions. [2018-11-07 18:43:32,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-07 18:43:32,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2018-11-07 18:43:32,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:43:32,834 INFO L225 Difference]: With dead ends: 4565 [2018-11-07 18:43:32,834 INFO L226 Difference]: Without dead ends: 3013 [2018-11-07 18:43:32,842 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 370 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-07 18:43:32,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3013 states. [2018-11-07 18:43:32,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3013 to 3008. [2018-11-07 18:43:32,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3008 states. [2018-11-07 18:43:32,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 3992 transitions. [2018-11-07 18:43:32,919 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 3992 transitions. Word has length 184 [2018-11-07 18:43:32,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:43:32,920 INFO L480 AbstractCegarLoop]: Abstraction has 3008 states and 3992 transitions. [2018-11-07 18:43:32,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-07 18:43:32,920 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 3992 transitions. [2018-11-07 18:43:32,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-07 18:43:32,932 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:43:32,932 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-11-07 18:43:32,932 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:43:32,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:43:32,933 INFO L82 PathProgramCache]: Analyzing trace with hash -2112487449, now seen corresponding path program 1 times [2018-11-07 18:43:32,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:43:32,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:43:32,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:43:32,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:43:32,934 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:43:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:43:33,380 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:43:33,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:43:33,381 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:43:33,381 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 214 with the following transitions: [2018-11-07 18:43:33,382 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-11-07 18:43:33,393 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:43:33,394 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:43:34,414 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:43:34,415 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-11-07 18:43:34,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:43:34,452 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:43:35,570 INFO L227 lantSequenceWeakener]: Weakened 74 states. On average, predicates are now at 82.7% of their original sizes. [2018-11-07 18:43:35,570 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:43:37,570 INFO L415 sIntCurrentIteration]: We unified 212 AI predicates to 212 [2018-11-07 18:43:37,570 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:43:37,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:43:37,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 19 [2018-11-07 18:43:37,572 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:43:37,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 18:43:37,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 18:43:37,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-11-07 18:43:37,573 INFO L87 Difference]: Start difference. First operand 3008 states and 3992 transitions. Second operand 15 states. [2018-11-07 18:43:59,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:43:59,126 INFO L93 Difference]: Finished difference Result 7056 states and 9465 transitions. [2018-11-07 18:43:59,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-07 18:43:59,126 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 213 [2018-11-07 18:43:59,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:43:59,146 INFO L225 Difference]: With dead ends: 7056 [2018-11-07 18:43:59,146 INFO L226 Difference]: Without dead ends: 4054 [2018-11-07 18:43:59,156 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 222 GetRequests, 171 SyntacticMatches, 28 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2018-11-07 18:43:59,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4054 states. [2018-11-07 18:43:59,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4054 to 4048. [2018-11-07 18:43:59,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4048 states. [2018-11-07 18:43:59,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4048 states to 4048 states and 5167 transitions. [2018-11-07 18:43:59,253 INFO L78 Accepts]: Start accepts. Automaton has 4048 states and 5167 transitions. Word has length 213 [2018-11-07 18:43:59,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:43:59,253 INFO L480 AbstractCegarLoop]: Abstraction has 4048 states and 5167 transitions. [2018-11-07 18:43:59,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 18:43:59,254 INFO L276 IsEmpty]: Start isEmpty. Operand 4048 states and 5167 transitions. [2018-11-07 18:43:59,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-11-07 18:43:59,267 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:43:59,268 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:43:59,268 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:43:59,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:43:59,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1678639269, now seen corresponding path program 1 times [2018-11-07 18:43:59,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:43:59,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:43:59,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:43:59,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:43:59,270 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:43:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:43:59,734 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 73 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:43:59,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:43:59,735 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:43:59,735 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 217 with the following transitions: [2018-11-07 18:43:59,735 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], [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-11-07 18:43:59,741 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:43:59,741 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:44:00,236 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:44:00,236 INFO L272 AbstractInterpreter]: Visited 151 different actions 299 times. Merged at 5 different actions 8 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 38 variables. [2018-11-07 18:44:00,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:44:00,262 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:44:01,076 INFO L227 lantSequenceWeakener]: Weakened 104 states. On average, predicates are now at 82.07% of their original sizes. [2018-11-07 18:44:01,077 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:44:03,332 INFO L415 sIntCurrentIteration]: We unified 215 AI predicates to 215 [2018-11-07 18:44:03,332 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:44:03,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:44:03,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [6] total 21 [2018-11-07 18:44:03,333 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:44:03,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-07 18:44:03,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-07 18:44:03,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-11-07 18:44:03,334 INFO L87 Difference]: Start difference. First operand 4048 states and 5167 transitions. Second operand 17 states. [2018-11-07 18:44:22,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:44:22,613 INFO L93 Difference]: Finished difference Result 8439 states and 10951 transitions. [2018-11-07 18:44:22,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-07 18:44:22,613 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 216 [2018-11-07 18:44:22,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:44:22,633 INFO L225 Difference]: With dead ends: 8439 [2018-11-07 18:44:22,633 INFO L226 Difference]: Without dead ends: 4843 [2018-11-07 18:44:22,644 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 231 GetRequests, 157 SyntacticMatches, 43 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=211, Invalid=845, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 18:44:22,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4843 states. [2018-11-07 18:44:22,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4843 to 4817. [2018-11-07 18:44:22,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4817 states. [2018-11-07 18:44:22,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4817 states to 4817 states and 6083 transitions. [2018-11-07 18:44:22,759 INFO L78 Accepts]: Start accepts. Automaton has 4817 states and 6083 transitions. Word has length 216 [2018-11-07 18:44:22,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:44:22,760 INFO L480 AbstractCegarLoop]: Abstraction has 4817 states and 6083 transitions. [2018-11-07 18:44:22,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-07 18:44:22,760 INFO L276 IsEmpty]: Start isEmpty. Operand 4817 states and 6083 transitions. [2018-11-07 18:44:22,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-11-07 18:44:22,776 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:44:22,776 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-11-07 18:44:22,776 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:44:22,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:44:22,777 INFO L82 PathProgramCache]: Analyzing trace with hash 666818281, now seen corresponding path program 1 times [2018-11-07 18:44:22,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:44:22,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:44:22,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:44:22,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:44:22,778 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:44:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:44:23,020 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 4 [2018-11-07 18:44:23,094 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 18:44:23,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:44:23,095 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:44:23,095 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 232 with the following transitions: [2018-11-07 18:44:23,095 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-11-07 18:44:23,099 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:44:23,099 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:44:23,760 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:44:23,760 INFO L272 AbstractInterpreter]: Visited 151 different actions 595 times. Merged at 7 different actions 24 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-07 18:44:23,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:44:23,766 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:44:24,075 INFO L227 lantSequenceWeakener]: Weakened 228 states. On average, predicates are now at 81.17% of their original sizes. [2018-11-07 18:44:24,075 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:44:24,169 INFO L415 sIntCurrentIteration]: We unified 230 AI predicates to 230 [2018-11-07 18:44:24,169 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:44:24,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:44:24,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 17 [2018-11-07 18:44:24,170 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:44:24,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 18:44:24,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 18:44:24,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-07 18:44:24,171 INFO L87 Difference]: Start difference. First operand 4817 states and 6083 transitions. Second operand 11 states. [2018-11-07 18:44:30,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:44:30,822 INFO L93 Difference]: Finished difference Result 10667 states and 13977 transitions. [2018-11-07 18:44:30,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 18:44:30,822 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 231 [2018-11-07 18:44:30,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:44:30,850 INFO L225 Difference]: With dead ends: 10667 [2018-11-07 18:44:30,850 INFO L226 Difference]: Without dead ends: 6471 [2018-11-07 18:44:30,863 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 243 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2018-11-07 18:44:30,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6471 states. [2018-11-07 18:44:31,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6471 to 6437. [2018-11-07 18:44:31,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6437 states. [2018-11-07 18:44:31,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6437 states to 6437 states and 7999 transitions. [2018-11-07 18:44:31,021 INFO L78 Accepts]: Start accepts. Automaton has 6437 states and 7999 transitions. Word has length 231 [2018-11-07 18:44:31,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:44:31,022 INFO L480 AbstractCegarLoop]: Abstraction has 6437 states and 7999 transitions. [2018-11-07 18:44:31,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 18:44:31,022 INFO L276 IsEmpty]: Start isEmpty. Operand 6437 states and 7999 transitions. [2018-11-07 18:44:31,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-11-07 18:44:31,041 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:44:31,042 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-11-07 18:44:31,042 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:44:31,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:44:31,042 INFO L82 PathProgramCache]: Analyzing trace with hash 915295681, now seen corresponding path program 1 times [2018-11-07 18:44:31,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:44:31,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:44:31,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:44:31,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:44:31,044 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:44:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:44:31,593 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 101 proven. 54 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 18:44:31,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:44:31,594 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:44:31,594 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 254 with the following transitions: [2018-11-07 18:44:31,595 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-11-07 18:44:31,598 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:44:31,598 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:44:32,869 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:44:32,869 INFO L272 AbstractInterpreter]: Visited 154 different actions 608 times. Merged at 8 different actions 29 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 18:44:32,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:44:32,905 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:44:33,291 INFO L227 lantSequenceWeakener]: Weakened 250 states. On average, predicates are now at 81.19% of their original sizes. [2018-11-07 18:44:33,291 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:44:33,442 INFO L415 sIntCurrentIteration]: We unified 252 AI predicates to 252 [2018-11-07 18:44:33,442 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:44:33,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:44:33,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [10] total 21 [2018-11-07 18:44:33,443 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:44:33,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 18:44:33,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 18:44:33,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-11-07 18:44:33,444 INFO L87 Difference]: Start difference. First operand 6437 states and 7999 transitions. Second operand 13 states. [2018-11-07 18:44:44,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:44:44,085 INFO L93 Difference]: Finished difference Result 17010 states and 22016 transitions. [2018-11-07 18:44:44,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 18:44:44,085 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 253 [2018-11-07 18:44:44,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:44:44,124 INFO L225 Difference]: With dead ends: 17010 [2018-11-07 18:44:44,124 INFO L226 Difference]: Without dead ends: 10856 [2018-11-07 18:44:44,145 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 272 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=233, Invalid=823, Unknown=0, NotChecked=0, Total=1056 [2018-11-07 18:44:44,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10856 states. [2018-11-07 18:44:44,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10856 to 10648. [2018-11-07 18:44:44,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10648 states. [2018-11-07 18:44:44,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10648 states to 10648 states and 13191 transitions. [2018-11-07 18:44:44,388 INFO L78 Accepts]: Start accepts. Automaton has 10648 states and 13191 transitions. Word has length 253 [2018-11-07 18:44:44,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:44:44,389 INFO L480 AbstractCegarLoop]: Abstraction has 10648 states and 13191 transitions. [2018-11-07 18:44:44,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 18:44:44,389 INFO L276 IsEmpty]: Start isEmpty. Operand 10648 states and 13191 transitions. [2018-11-07 18:44:44,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-11-07 18:44:44,415 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:44:44,416 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-11-07 18:44:44,416 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:44:44,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:44:44,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1111459177, now seen corresponding path program 1 times [2018-11-07 18:44:44,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:44:44,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:44:44,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:44:44,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:44:44,420 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:44:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:44:44,699 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 4 [2018-11-07 18:44:45,046 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-07 18:44:45,277 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-07 18:44:45,412 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 120 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:44:45,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:44:45,413 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:44:45,413 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 256 with the following transitions: [2018-11-07 18:44:45,413 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-11-07 18:44:45,415 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:44:45,416 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:44:46,005 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 18:44:46,005 INFO L272 AbstractInterpreter]: Visited 155 different actions 460 times. Merged at 8 different actions 23 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-07 18:44:46,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:44:46,009 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 18:44:46,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:44:46,009 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 18:44:46,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:44:46,021 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 18:44:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:44:46,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 18:44:46,228 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 135 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 18:44:46,228 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 18:44:46,344 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 135 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-07 18:44:46,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 18:44:46,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5] total 16 [2018-11-07 18:44:46,365 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 18:44:46,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-07 18:44:46,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-07 18:44:46,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-11-07 18:44:46,369 INFO L87 Difference]: Start difference. First operand 10648 states and 13191 transitions. Second operand 15 states. [2018-11-07 18:44:49,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:44:49,387 INFO L93 Difference]: Finished difference Result 16478 states and 20459 transitions. [2018-11-07 18:44:49,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-07 18:44:49,395 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 255 [2018-11-07 18:44:49,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:44:49,410 INFO L225 Difference]: With dead ends: 16478 [2018-11-07 18:44:49,410 INFO L226 Difference]: Without dead ends: 4905 [2018-11-07 18:44:49,432 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 517 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2018-11-07 18:44:49,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2018-11-07 18:44:49,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4706. [2018-11-07 18:44:49,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4706 states. [2018-11-07 18:44:49,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4706 states to 4706 states and 5495 transitions. [2018-11-07 18:44:49,556 INFO L78 Accepts]: Start accepts. Automaton has 4706 states and 5495 transitions. Word has length 255 [2018-11-07 18:44:49,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:44:49,556 INFO L480 AbstractCegarLoop]: Abstraction has 4706 states and 5495 transitions. [2018-11-07 18:44:49,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-07 18:44:49,557 INFO L276 IsEmpty]: Start isEmpty. Operand 4706 states and 5495 transitions. [2018-11-07 18:44:49,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-11-07 18:44:49,573 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:44:49,574 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-11-07 18:44:49,574 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:44:49,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:44:49,574 INFO L82 PathProgramCache]: Analyzing trace with hash 641913708, now seen corresponding path program 1 times [2018-11-07 18:44:49,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:44:49,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:44:49,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:44:49,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:44:49,576 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:44:49,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:44:50,092 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 253 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:44:50,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:44:50,093 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:44:50,093 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 314 with the following transitions: [2018-11-07 18:44:50,093 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-11-07 18:44:50,096 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:44:50,096 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:44:51,705 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 18:44:51,705 INFO L272 AbstractInterpreter]: Visited 155 different actions 1227 times. Merged at 8 different actions 71 times. Widened at 1 different actions 4 times. Found 14 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 18:44:51,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:44:51,713 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 18:44:51,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:44:51,713 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 18:44:51,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:44:51,723 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 18:44:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:44:51,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 18:44:52,037 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 251 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-07 18:44:52,037 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 18:44:52,141 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-11-07 18:44:52,511 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 251 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-07 18:44:52,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 18:44:52,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 15 [2018-11-07 18:44:52,532 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 18:44:52,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-07 18:44:52,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-07 18:44:52,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-11-07 18:44:52,534 INFO L87 Difference]: Start difference. First operand 4706 states and 5495 transitions. Second operand 13 states. [2018-11-07 18:44:57,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:44:57,188 INFO L93 Difference]: Finished difference Result 10678 states and 12599 transitions. [2018-11-07 18:44:57,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 18:44:57,189 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 313 [2018-11-07 18:44:57,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:44:57,216 INFO L225 Difference]: With dead ends: 10678 [2018-11-07 18:44:57,216 INFO L226 Difference]: Without dead ends: 6069 [2018-11-07 18:44:57,225 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 644 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=326, Invalid=1156, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 18:44:57,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6069 states. [2018-11-07 18:44:57,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6069 to 5632. [2018-11-07 18:44:57,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5632 states. [2018-11-07 18:44:57,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5632 states to 5632 states and 6230 transitions. [2018-11-07 18:44:57,372 INFO L78 Accepts]: Start accepts. Automaton has 5632 states and 6230 transitions. Word has length 313 [2018-11-07 18:44:57,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:44:57,373 INFO L480 AbstractCegarLoop]: Abstraction has 5632 states and 6230 transitions. [2018-11-07 18:44:57,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-07 18:44:57,373 INFO L276 IsEmpty]: Start isEmpty. Operand 5632 states and 6230 transitions. [2018-11-07 18:44:57,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-11-07 18:44:57,393 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:44:57,394 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2018-11-07 18:44:57,394 INFO L423 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:44:57,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:44:57,394 INFO L82 PathProgramCache]: Analyzing trace with hash 114830374, now seen corresponding path program 1 times [2018-11-07 18:44:57,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:44:57,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:44:57,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:44:57,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:44:57,396 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:44:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:44:57,937 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 303 proven. 2 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-07 18:44:57,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:44:57,938 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:44:57,938 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 340 with the following transitions: [2018-11-07 18:44:57,938 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [53], [64], [68], [72], [76], [80], [84], [87], [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-11-07 18:44:57,941 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:44:57,941 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:44:59,525 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 18:44:59,526 INFO L272 AbstractInterpreter]: Visited 156 different actions 1247 times. Merged at 9 different actions 83 times. Widened at 1 different actions 4 times. Found 20 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 18:44:59,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:44:59,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 18:44:59,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:44:59,534 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 18:44:59,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:44:59,544 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 18:44:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:44:59,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 18:44:59,718 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 303 proven. 2 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-07 18:44:59,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 18:44:59,924 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 303 proven. 2 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-11-07 18:44:59,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 18:44:59,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2018-11-07 18:44:59,946 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 18:44:59,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 18:44:59,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 18:44:59,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-07 18:44:59,947 INFO L87 Difference]: Start difference. First operand 5632 states and 6230 transitions. Second operand 6 states. [2018-11-07 18:45:00,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:45:00,598 INFO L93 Difference]: Finished difference Result 8837 states and 9887 transitions. [2018-11-07 18:45:00,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 18:45:00,598 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 339 [2018-11-07 18:45:00,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:45:00,612 INFO L225 Difference]: With dead ends: 8837 [2018-11-07 18:45:00,612 INFO L226 Difference]: Without dead ends: 5260 [2018-11-07 18:45:00,619 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 679 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-07 18:45:00,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5260 states. [2018-11-07 18:45:00,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5260 to 5220. [2018-11-07 18:45:00,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5220 states. [2018-11-07 18:45:00,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5220 states to 5220 states and 5676 transitions. [2018-11-07 18:45:00,881 INFO L78 Accepts]: Start accepts. Automaton has 5220 states and 5676 transitions. Word has length 339 [2018-11-07 18:45:00,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:45:00,881 INFO L480 AbstractCegarLoop]: Abstraction has 5220 states and 5676 transitions. [2018-11-07 18:45:00,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 18:45:00,882 INFO L276 IsEmpty]: Start isEmpty. Operand 5220 states and 5676 transitions. [2018-11-07 18:45:00,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-11-07 18:45:00,898 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:45:00,898 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-11-07 18:45:00,899 INFO L423 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:45:00,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:45:00,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1064430452, now seen corresponding path program 1 times [2018-11-07 18:45:00,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:45:00,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:45:00,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:45:00,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:45:00,900 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:45:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:45:01,300 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-07 18:45:01,493 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 18:45:01,682 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-07 18:45:01,932 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-07 18:45:02,506 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 297 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 18:45:02,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:45:02,506 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:45:02,506 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 349 with the following transitions: [2018-11-07 18:45:02,507 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-11-07 18:45:02,509 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:45:02,509 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:45:02,938 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 18:45:02,939 INFO L272 AbstractInterpreter]: Visited 152 different actions 453 times. Merged at 7 different actions 19 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 38 variables. [2018-11-07 18:45:02,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:45:02,946 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 18:45:03,326 INFO L227 lantSequenceWeakener]: Weakened 343 states. On average, predicates are now at 80.98% of their original sizes. [2018-11-07 18:45:03,326 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 18:45:03,408 INFO L415 sIntCurrentIteration]: We unified 347 AI predicates to 347 [2018-11-07 18:45:03,408 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 18:45:03,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 18:45:03,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2018-11-07 18:45:03,409 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 18:45:03,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-07 18:45:03,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-07 18:45:03,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 18:45:03,410 INFO L87 Difference]: Start difference. First operand 5220 states and 5676 transitions. Second operand 10 states. [2018-11-07 18:45:06,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:45:06,247 INFO L93 Difference]: Finished difference Result 8329 states and 9079 transitions. [2018-11-07 18:45:06,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-07 18:45:06,247 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 348 [2018-11-07 18:45:06,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:45:06,260 INFO L225 Difference]: With dead ends: 8329 [2018-11-07 18:45:06,260 INFO L226 Difference]: Without dead ends: 5375 [2018-11-07 18:45:06,265 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 354 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-11-07 18:45:06,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5375 states. [2018-11-07 18:45:06,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5375 to 5369. [2018-11-07 18:45:06,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5369 states. [2018-11-07 18:45:06,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5369 states to 5369 states and 5821 transitions. [2018-11-07 18:45:06,372 INFO L78 Accepts]: Start accepts. Automaton has 5369 states and 5821 transitions. Word has length 348 [2018-11-07 18:45:06,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:45:06,372 INFO L480 AbstractCegarLoop]: Abstraction has 5369 states and 5821 transitions. [2018-11-07 18:45:06,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-07 18:45:06,372 INFO L276 IsEmpty]: Start isEmpty. Operand 5369 states and 5821 transitions. [2018-11-07 18:45:06,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2018-11-07 18:45:06,387 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:45:06,388 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-11-07 18:45:06,388 INFO L423 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:45:06,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:45:06,388 INFO L82 PathProgramCache]: Analyzing trace with hash 543864376, now seen corresponding path program 1 times [2018-11-07 18:45:06,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:45:06,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:45:06,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:45:06,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:45:06,390 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:45:06,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:45:06,927 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 229 proven. 137 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-11-07 18:45:06,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:45:06,928 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:45:06,928 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 372 with the following transitions: [2018-11-07 18:45:06,928 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [10], [14], [18], [21], [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-11-07 18:45:06,931 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:45:06,931 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:45:08,102 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 18:45:08,102 INFO L272 AbstractInterpreter]: Visited 157 different actions 950 times. Merged at 10 different actions 76 times. Widened at 1 different actions 3 times. Found 19 fixpoints after 4 different actions. Largest state had 38 variables. [2018-11-07 18:45:08,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:45:08,111 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 18:45:08,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:45:08,111 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11-07 18:45:08,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:45:08,120 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 18:45:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:45:08,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 18:45:08,691 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 238 proven. 2 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2018-11-07 18:45:08,691 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 18:45:08,827 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 251 proven. 100 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-11-07 18:45:08,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 18:45:08,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-07 18:45:08,852 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 18:45:08,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 18:45:08,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 18:45:08,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-11-07 18:45:08,853 INFO L87 Difference]: Start difference. First operand 5369 states and 5821 transitions. Second operand 11 states. [2018-11-07 18:45:10,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:45:10,468 INFO L93 Difference]: Finished difference Result 9682 states and 10537 transitions. [2018-11-07 18:45:10,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 18:45:10,469 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 371 [2018-11-07 18:45:10,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:45:10,473 INFO L225 Difference]: With dead ends: 9682 [2018-11-07 18:45:10,473 INFO L226 Difference]: Without dead ends: 2289 [2018-11-07 18:45:10,480 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 766 GetRequests, 744 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2018-11-07 18:45:10,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2289 states. [2018-11-07 18:45:10,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2289 to 1499. [2018-11-07 18:45:10,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1499 states. [2018-11-07 18:45:10,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 1539 transitions. [2018-11-07 18:45:10,513 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 1539 transitions. Word has length 371 [2018-11-07 18:45:10,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:45:10,514 INFO L480 AbstractCegarLoop]: Abstraction has 1499 states and 1539 transitions. [2018-11-07 18:45:10,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 18:45:10,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 1539 transitions. [2018-11-07 18:45:10,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-11-07 18:45:10,522 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 18:45:10,523 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 18:45:10,523 INFO L423 AbstractCegarLoop]: === Iteration 18 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 18:45:10,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:45:10,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1209291713, now seen corresponding path program 1 times [2018-11-07 18:45:10,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 18:45:10,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:45:10,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:45:10,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 18:45:10,524 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 18:45:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:45:11,039 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 341 proven. 85 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2018-11-07 18:45:11,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:45:11,040 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 18:45:11,040 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 403 with the following transitions: [2018-11-07 18:45:11,040 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [25], [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], [199], [210], [214], [218], [222], [233], [237], [241], [245], [249], [253], [257], [268], [272], [283], [287], [298], [301], [306], [308], [309], [312], [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-11-07 18:45:11,042 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-07 18:45:11,043 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 18:45:12,734 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 18:45:12,734 INFO L272 AbstractInterpreter]: Visited 159 different actions 1428 times. Merged at 10 different actions 104 times. Widened at 1 different actions 5 times. Found 29 fixpoints after 3 different actions. Largest state had 38 variables. [2018-11-07 18:45:12,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 18:45:12,741 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 18:45:12,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 18:45:12,741 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11-07 18:45:12,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 18:45:12,750 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 18:45:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 18:45:12,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 18:45:12,979 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 442 proven. 2 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-07 18:45:12,979 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 18:45:13,145 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 341 proven. 85 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2018-11-07 18:45:13,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 18:45:13,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2018-11-07 18:45:13,166 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 18:45:13,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-07 18:45:13,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-07 18:45:13,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-07 18:45:13,167 INFO L87 Difference]: Start difference. First operand 1499 states and 1539 transitions. Second operand 7 states. [2018-11-07 18:45:14,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 18:45:14,077 INFO L93 Difference]: Finished difference Result 1792 states and 1842 transitions. [2018-11-07 18:45:14,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 18:45:14,077 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 402 [2018-11-07 18:45:14,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 18:45:14,078 INFO L225 Difference]: With dead ends: 1792 [2018-11-07 18:45:14,078 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 18:45:14,083 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 813 GetRequests, 803 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-07 18:45:14,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 18:45:14,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 18:45:14,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 18:45:14,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 18:45:14,084 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 402 [2018-11-07 18:45:14,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 18:45:14,084 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 18:45:14,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-07 18:45:14,084 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 18:45:14,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 18:45:14,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 18:45:14,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:45:14,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:45:14,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:45:14,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:45:14,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:45:14,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:45:14,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:45:14,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:45:14,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:45:14,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:45:14,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:45:14,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:45:14,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:45:14,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:45:15,162 WARN L179 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 265 DAG size of output: 246 [2018-11-07 18:45:15,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:45:15,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:45:15,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 18:45:15,734 WARN L179 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 300 DAG size of output: 271 [2018-11-07 18:45:16,567 WARN L179 SmtUtils]: Spent 832.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2018-11-07 18:45:16,941 WARN L179 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 77 [2018-11-07 18:45:21,420 WARN L179 SmtUtils]: Spent 4.46 s on a formula simplification. DAG size of input: 365 DAG size of output: 190 [2018-11-07 18:45:23,850 WARN L179 SmtUtils]: Spent 2.41 s on a formula simplification. DAG size of input: 270 DAG size of output: 127 [2018-11-07 18:45:26,208 WARN L179 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 294 DAG size of output: 142 [2018-11-07 18:45:26,212 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-07 18:45:26,212 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a28~0)| ~a28~0) (= ~a11~0 |old(~a11~0)|) (= ~a17~0 |old(~a17~0)|) (= ~a19~0 |old(~a19~0)|) (= ~a25~0 |old(~a25~0)|)) [2018-11-07 18:45:26,212 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 18:45:26,212 INFO L425 ceAbstractionStarter]: For program point L564(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,212 INFO L425 ceAbstractionStarter]: For program point L531(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,212 INFO L425 ceAbstractionStarter]: For program point L498(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,213 INFO L425 ceAbstractionStarter]: For program point L465(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,213 INFO L425 ceAbstractionStarter]: For program point L432(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,213 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2018-11-07 18:45:26,213 INFO L425 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2018-11-07 18:45:26,213 INFO L425 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2018-11-07 18:45:26,213 INFO L425 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2018-11-07 18:45:26,213 INFO L425 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2018-11-07 18:45:26,213 INFO L425 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2018-11-07 18:45:26,213 INFO L425 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2018-11-07 18:45:26,214 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2018-11-07 18:45:26,214 INFO L425 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2018-11-07 18:45:26,214 INFO L425 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2018-11-07 18:45:26,214 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2018-11-07 18:45:26,214 INFO L425 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2018-11-07 18:45:26,214 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2018-11-07 18:45:26,214 INFO L425 ceAbstractionStarter]: For program point L567(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,214 INFO L425 ceAbstractionStarter]: For program point L534(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,215 INFO L425 ceAbstractionStarter]: For program point L501(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,215 INFO L425 ceAbstractionStarter]: For program point L468(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,215 INFO L425 ceAbstractionStarter]: For program point L435(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,215 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2018-11-07 18:45:26,215 INFO L425 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2018-11-07 18:45:26,215 INFO L425 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-11-07 18:45:26,215 INFO L425 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2018-11-07 18:45:26,215 INFO L425 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2018-11-07 18:45:26,215 INFO L425 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2018-11-07 18:45:26,216 INFO L425 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2018-11-07 18:45:26,216 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2018-11-07 18:45:26,216 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2018-11-07 18:45:26,216 INFO L425 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2018-11-07 18:45:26,216 INFO L425 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2018-11-07 18:45:26,216 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2018-11-07 18:45:26,216 INFO L425 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2018-11-07 18:45:26,216 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2018-11-07 18:45:26,216 INFO L425 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2018-11-07 18:45:26,216 INFO L425 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2018-11-07 18:45:26,217 INFO L425 ceAbstractionStarter]: For program point L570(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,217 INFO L425 ceAbstractionStarter]: For program point L537(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,217 INFO L425 ceAbstractionStarter]: For program point L504(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,217 INFO L425 ceAbstractionStarter]: For program point L471(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,217 INFO L425 ceAbstractionStarter]: For program point L438(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,217 INFO L425 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2018-11-07 18:45:26,217 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2018-11-07 18:45:26,217 INFO L425 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2018-11-07 18:45:26,217 INFO L425 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-11-07 18:45:26,217 INFO L425 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2018-11-07 18:45:26,218 INFO L425 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2018-11-07 18:45:26,218 INFO L425 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2018-11-07 18:45:26,218 INFO L425 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2018-11-07 18:45:26,218 INFO L425 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2018-11-07 18:45:26,218 INFO L425 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2018-11-07 18:45:26,218 INFO L425 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2018-11-07 18:45:26,218 INFO L425 ceAbstractionStarter]: For program point L573(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,218 INFO L425 ceAbstractionStarter]: For program point L540(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,218 INFO L425 ceAbstractionStarter]: For program point L507(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,219 INFO L425 ceAbstractionStarter]: For program point L474(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,219 INFO L425 ceAbstractionStarter]: For program point L441(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,219 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2018-11-07 18:45:26,219 INFO L425 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2018-11-07 18:45:26,219 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2018-11-07 18:45:26,219 INFO L425 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-11-07 18:45:26,219 INFO L425 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-11-07 18:45:26,219 INFO L425 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2018-11-07 18:45:26,219 INFO L425 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2018-11-07 18:45:26,220 INFO L425 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2018-11-07 18:45:26,220 INFO L425 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2018-11-07 18:45:26,220 INFO L425 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2018-11-07 18:45:26,220 INFO L425 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2018-11-07 18:45:26,220 INFO L425 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2018-11-07 18:45:26,220 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2018-11-07 18:45:26,220 INFO L425 ceAbstractionStarter]: For program point L576(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,220 INFO L425 ceAbstractionStarter]: For program point L543(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,220 INFO L425 ceAbstractionStarter]: For program point L510(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,220 INFO L425 ceAbstractionStarter]: For program point L477(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,221 INFO L425 ceAbstractionStarter]: For program point L444(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,221 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2018-11-07 18:45:26,221 INFO L425 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2018-11-07 18:45:26,221 INFO L425 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-11-07 18:45:26,221 INFO L425 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2018-11-07 18:45:26,221 INFO L425 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2018-11-07 18:45:26,221 INFO L425 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2018-11-07 18:45:26,221 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2018-11-07 18:45:26,221 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2018-11-07 18:45:26,221 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2018-11-07 18:45:26,222 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2018-11-07 18:45:26,222 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2018-11-07 18:45:26,222 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2018-11-07 18:45:26,222 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2018-11-07 18:45:26,222 INFO L425 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2018-11-07 18:45:26,222 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2018-11-07 18:45:26,222 INFO L425 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2018-11-07 18:45:26,222 INFO L425 ceAbstractionStarter]: For program point L579(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,222 INFO L425 ceAbstractionStarter]: For program point L546(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,222 INFO L425 ceAbstractionStarter]: For program point L513(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,222 INFO L425 ceAbstractionStarter]: For program point L480(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,223 INFO L425 ceAbstractionStarter]: For program point L447(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,223 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-07 18:45:26,223 INFO L425 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2018-11-07 18:45:26,223 INFO L425 ceAbstractionStarter]: For program point L414-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,223 INFO L425 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2018-11-07 18:45:26,223 INFO L425 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2018-11-07 18:45:26,223 INFO L425 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2018-11-07 18:45:26,223 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,223 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,224 INFO L425 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2018-11-07 18:45:26,224 INFO L425 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-11-07 18:45:26,224 INFO L425 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2018-11-07 18:45:26,224 INFO L425 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2018-11-07 18:45:26,224 INFO L425 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2018-11-07 18:45:26,224 INFO L425 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2018-11-07 18:45:26,224 INFO L425 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2018-11-07 18:45:26,224 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2018-11-07 18:45:26,224 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2018-11-07 18:45:26,224 INFO L425 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2018-11-07 18:45:26,225 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2018-11-07 18:45:26,225 INFO L425 ceAbstractionStarter]: For program point L582(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,225 INFO L425 ceAbstractionStarter]: For program point L549(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,225 INFO L425 ceAbstractionStarter]: For program point L516(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,225 INFO L425 ceAbstractionStarter]: For program point L483(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,225 INFO L425 ceAbstractionStarter]: For program point L450(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,225 INFO L425 ceAbstractionStarter]: For program point L417(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,225 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2018-11-07 18:45:26,225 INFO L425 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2018-11-07 18:45:26,225 INFO L425 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-11-07 18:45:26,226 INFO L425 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2018-11-07 18:45:26,226 INFO L425 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2018-11-07 18:45:26,226 INFO L425 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2018-11-07 18:45:26,226 INFO L425 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2018-11-07 18:45:26,226 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2018-11-07 18:45:26,226 INFO L425 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2018-11-07 18:45:26,226 INFO L425 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2018-11-07 18:45:26,226 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2018-11-07 18:45:26,226 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 592) no Hoare annotation was computed. [2018-11-07 18:45:26,227 INFO L425 ceAbstractionStarter]: For program point L585(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,227 INFO L425 ceAbstractionStarter]: For program point L552(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,227 INFO L425 ceAbstractionStarter]: For program point L519(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,227 INFO L425 ceAbstractionStarter]: For program point L486(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,227 INFO L425 ceAbstractionStarter]: For program point L453(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,227 INFO L425 ceAbstractionStarter]: For program point L420(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,227 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2018-11-07 18:45:26,227 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2018-11-07 18:45:26,227 INFO L425 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2018-11-07 18:45:26,227 INFO L425 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2018-11-07 18:45:26,227 INFO L425 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2018-11-07 18:45:26,228 INFO L425 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2018-11-07 18:45:26,228 INFO L425 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2018-11-07 18:45:26,228 INFO L425 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2018-11-07 18:45:26,228 INFO L425 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2018-11-07 18:45:26,228 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2018-11-07 18:45:26,228 INFO L425 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2018-11-07 18:45:26,228 INFO L425 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2018-11-07 18:45:26,228 INFO L425 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2018-11-07 18:45:26,228 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2018-11-07 18:45:26,228 INFO L425 ceAbstractionStarter]: For program point L588(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,229 INFO L425 ceAbstractionStarter]: For program point L555(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,229 INFO L425 ceAbstractionStarter]: For program point L522(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,229 INFO L425 ceAbstractionStarter]: For program point L489(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,230 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse8 (= 1 |old(~a25~0)|)) (.cse20 (= 1 |old(~a19~0)|))) (let ((.cse37 (= ~a11~0 1)) (.cse38 (not (= 0 |old(~a11~0)|))) (.cse1 (= 1 |old(~a11~0)|)) (.cse39 (= 7 |old(~a28~0)|)) (.cse18 (not .cse20)) (.cse17 (< 1 |old(~a25~0)|)) (.cse19 (< |old(~a25~0)| 0)) (.cse0 (not (= 1 ~a21~0))) (.cse42 (< |old(~a11~0)| 0)) (.cse28 (not .cse8)) (.cse43 (< 1 |old(~a11~0)|)) (.cse44 (< 11 |old(~a28~0)|)) (.cse40 (< |old(~a28~0)| 7)) (.cse41 (< |old(~a19~0)| 0)) (.cse13 (= ~a25~0 |old(~a25~0)|)) (.cse16 (= ~a11~0 |old(~a11~0)|)) (.cse14 (= |old(~a28~0)| ~a28~0)) (.cse32 (= ~a17~0 8)) (.cse15 (= ~a19~0 |old(~a19~0)|))) (let ((.cse9 (and .cse13 .cse16 .cse14 .cse32 .cse15)) (.cse36 (not (= 10 |old(~a28~0)|))) (.cse29 (and (or .cse0 .cse42 .cse18 .cse17 .cse43 .cse44 .cse19 .cse40) (or (< 1 |old(~a19~0)|) .cse0 .cse42 .cse28 .cse43 .cse44 .cse40 .cse41))) (.cse26 (= 8 ~a17~0)) (.cse23 (= 7 ~a28~0)) (.cse25 (= 1 ~a11~0)) (.cse34 (= 7 ~a17~0)) (.cse27 (= 1 ~a19~0)) (.cse35 (= |old(~a25~0)| ~a25~0)) (.cse5 (not (= 7 |old(~a17~0)|))) (.cse21 (not .cse39)) (.cse7 (not .cse1)) (.cse24 (= ~a25~0 1)) (.cse10 (and (or .cse0 .cse42 .cse18 .cse17 (< |old(~a28~0)| 9) .cse43 .cse44 .cse19) (or .cse0 .cse18 .cse17 .cse38 .cse44 .cse19 .cse40))) (.cse3 (= |old(~a17~0)| |old(~a28~0)|)) (.cse11 (not (= |old(~a17~0)| 8))) (.cse2 (not .cse37)) (.cse30 (<= 0 ~a11~0)) (.cse31 (<= ~a11~0 1)) (.cse12 (< |calculate_output_#in~input| 1)) (.cse6 (< 6 |calculate_output_#in~input|)) (.cse33 (= 9 |old(~a28~0)|)) (.cse22 (not (= 8 |old(~a17~0)|))) (.cse4 (< 0 |old(~a19~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or (and (and .cse13 .cse14 (= ~a17~0 |old(~a17~0)|) .cse15) .cse16) (or (or (not (= |old(~a11~0)| 0)) (not (= ~v~0 22)) .cse17 (not (= ~u~0 21)) (not (= ~a21~0 1)) (not (= ~y~0 25)) (not (= 3 ~c~0)) (not (= ~a~0 1)) (not (= 26 ~z~0)) .cse18 (not (= ~x~0 24)) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 6 ~f~0)) (not (= ~w~0 23))) .cse12 .cse6 .cse19 (not (= |old(~a28~0)| 7)) .cse11)) (or .cse20 .cse0 .cse21 .cse22 (and .cse23 (not .cse24) .cse25 .cse26 (not .cse27)) .cse7 .cse8) (or .cse6 .cse28 .cse1 .cse29 .cse18 .cse22 (and .cse2 .cse13 .cse30 .cse14 .cse31 .cse32 .cse15) .cse12) (or .cse0 .cse1 .cse3 .cse33 (and .cse14 .cse34 .cse35 .cse2) .cse8 .cse5) (or (and .cse25 .cse26 .cse27 .cse35 (= 10 ~a28~0)) .cse0 .cse36 .cse28 .cse18 .cse22 .cse7) (or .cse0 .cse3 .cse4 (and .cse14 (<= ~a19~0 0) .cse34 .cse35) .cse5) (or .cse6 .cse9 .cse1 .cse36 .cse29 .cse11 .cse12) (or .cse0 .cse28 .cse18 .cse22 (and .cse25 (= 1 ~a25~0) (= 9 ~a28~0) .cse26 .cse27) (not .cse33) .cse7) (or .cse0 .cse21 .cse28 .cse18 .cse7 (and .cse23 .cse25 .cse34 .cse27 .cse35) .cse5) (or .cse6 .cse0 .cse21 .cse28 .cse7 .cse18 (and .cse24 .cse32 (= ~a19~0 1) (= ~a28~0 7) .cse37) .cse22 .cse12) (or (or (and (or (< 4 |calculate_output_#in~input|) .cse12) (or .cse6 (< |calculate_output_#in~input| 3))) .cse38 .cse10 .cse3 .cse11) (and (and .cse2 .cse30 .cse14 .cse31 .cse32) .cse15 .cse13) .cse39) (or .cse0 .cse38 (and (= ~a11~0 0) .cse13 .cse14 .cse32 .cse15) .cse40 (not (= 0 |old(~a25~0)|)) .cse12 .cse6 .cse33 .cse41 (< 9 |old(~a28~0)|) .cse22 .cse4))))) [2018-11-07 18:45:26,230 INFO L425 ceAbstractionStarter]: For program point L456(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,230 INFO L425 ceAbstractionStarter]: For program point L423(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,230 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2018-11-07 18:45:26,230 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2018-11-07 18:45:26,230 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2018-11-07 18:45:26,230 INFO L425 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2018-11-07 18:45:26,230 INFO L425 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-11-07 18:45:26,231 INFO L425 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2018-11-07 18:45:26,231 INFO L425 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2018-11-07 18:45:26,231 INFO L425 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2018-11-07 18:45:26,231 INFO L425 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2018-11-07 18:45:26,231 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2018-11-07 18:45:26,231 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2018-11-07 18:45:26,231 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2018-11-07 18:45:26,231 INFO L425 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2018-11-07 18:45:26,231 INFO L425 ceAbstractionStarter]: For program point L558(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,232 INFO L425 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,232 INFO L425 ceAbstractionStarter]: For program point L525(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,232 INFO L425 ceAbstractionStarter]: For program point L492(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,232 INFO L425 ceAbstractionStarter]: For program point L459(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,232 INFO L425 ceAbstractionStarter]: For program point L426(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,232 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2018-11-07 18:45:26,232 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2018-11-07 18:45:26,232 INFO L425 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2018-11-07 18:45:26,232 INFO L425 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2018-11-07 18:45:26,233 INFO L425 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2018-11-07 18:45:26,233 INFO L425 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2018-11-07 18:45:26,233 INFO L425 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2018-11-07 18:45:26,233 INFO L425 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2018-11-07 18:45:26,233 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2018-11-07 18:45:26,233 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2018-11-07 18:45:26,233 INFO L425 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2018-11-07 18:45:26,233 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2018-11-07 18:45:26,233 INFO L425 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2018-11-07 18:45:26,233 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2018-11-07 18:45:26,234 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2018-11-07 18:45:26,234 INFO L425 ceAbstractionStarter]: For program point L594(lines 594 596) no Hoare annotation was computed. [2018-11-07 18:45:26,234 INFO L425 ceAbstractionStarter]: For program point L561(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,234 INFO L425 ceAbstractionStarter]: For program point L528(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,234 INFO L425 ceAbstractionStarter]: For program point L495(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,234 INFO L425 ceAbstractionStarter]: For program point L462(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,234 INFO L425 ceAbstractionStarter]: For program point L429(lines 29 598) no Hoare annotation was computed. [2018-11-07 18:45:26,234 INFO L425 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2018-11-07 18:45:26,234 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2018-11-07 18:45:26,234 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2018-11-07 18:45:26,235 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2018-11-07 18:45:26,235 INFO L425 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-11-07 18:45:26,235 INFO L425 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-11-07 18:45:26,235 INFO L425 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2018-11-07 18:45:26,235 INFO L425 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2018-11-07 18:45:26,235 INFO L425 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2018-11-07 18:45:26,235 INFO L425 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2018-11-07 18:45:26,235 INFO L425 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2018-11-07 18:45:26,235 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2018-11-07 18:45:26,235 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2018-11-07 18:45:26,235 INFO L425 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2018-11-07 18:45:26,236 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2018-11-07 18:45:26,236 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2018-11-07 18:45:26,236 INFO L425 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2018-11-07 18:45:26,236 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2018-11-07 18:45:26,236 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2018-11-07 18:45:26,236 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 18:45:26,236 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) (= ~x~0 24) (= ~a11~0 0) (= ~a25~0 0) (= ~a17~0 8) (= ~a~0 1) (= ~a19~0 1) (= ~a28~0 7)) [2018-11-07 18:45:26,236 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 18:45:26,237 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 18:45:26,237 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)) (not (= ~y~0 25)) (not (= 3 ~c~0)) (not (= |old(~a25~0)| 0)) (not (= |old(~a28~0)| 7)) (and (= ~a25~0 |old(~a25~0)|) (= ~a11~0 |old(~a11~0)|) (= |old(~a28~0)| ~a28~0) (= ~a17~0 8) (= ~a19~0 |old(~a19~0)|)) (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-11-07 18:45:26,237 INFO L425 ceAbstractionStarter]: For program point L606-1(lines 606 616) no Hoare annotation was computed. [2018-11-07 18:45:26,237 INFO L421 ceAbstractionStarter]: At program point L606-3(lines 606 616) the Hoare annotation is: (let ((.cse24 (= ~a11~0 1)) (.cse14 (= ~a25~0 1))) (let ((.cse2 (<= ~a28~0 11)) (.cse3 (<= 0 ~a25~0)) (.cse6 (<= ~a25~0 1)) (.cse9 (= 1 ~a25~0)) (.cse11 (= 10 ~a28~0)) (.cse7 (= 7 ~a28~0)) (.cse0 (= 1 ~a11~0)) (.cse16 (= 8 ~a17~0)) (.cse10 (= 1 ~a19~0)) (.cse17 (not (= ~a28~0 ~a17~0))) (.cse1 (not .cse14)) (.cse8 (= 7 ~a17~0)) (.cse15 (not .cse24)) (.cse5 (= ~a19~0 1)) (.cse12 (<= ~a19~0 0)) (.cse23 (<= 1 main_~input~0)) (.cse22 (<= 7 ~a28~0)) (.cse18 (= ~a11~0 0)) (.cse25 (= ~a25~0 0)) (.cse19 (<= ~a28~0 9)) (.cse20 (not (= ~a28~0 9))) (.cse21 (<= main_~input~0 6)) (.cse13 (<= 0 ~a19~0)) (.cse4 (= ~a17~0 8))) (or (and .cse0 (and .cse1 (and .cse2 .cse3 .cse4 .cse5 (<= 9 ~a28~0) .cse6))) (and .cse7 .cse0 .cse8 .cse9 .cse10) (and .cse11 (and .cse12 (and (<= ~a11~0 1) .cse13 .cse4 .cse14 (<= 0 ~a11~0)) .cse15)) (and .cse0 .cse9 (= 9 ~a28~0) .cse16 .cse10) (not (= ~a21~0 1)) (and .cse12 .cse17 .cse8) (not (= ~y~0 25)) (and .cse14 (and (and .cse18 .cse4 .cse5 .cse19 (<= 8 ~a28~0)) .cse20)) (and .cse17 (or (and .cse2 .cse3 .cse18 (<= 3 main_~input~0) .cse21 .cse4 .cse5 .cse22 .cse6) (and .cse2 .cse3 .cse18 .cse23 .cse4 .cse5 (<= main_~input~0 4) .cse22 .cse6))) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (and .cse0 .cse9 .cse16 .cse10 .cse11) (not (= ~e~0 5)) (not (= ~d~0 4)) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse7 .cse1 .cse0 .cse16 (not .cse10)) (not (= |old(~a11~0)| 0)) (and .cse17 .cse1 .cse8 .cse15 .cse20) (not (= ~z~0 26)) (and .cse4 .cse5 (= ~a28~0 7) .cse14 .cse24) (and (<= 0 (+ main_~output~0 1)) .cse18 .cse25 .cse5 (<= main_~output~0 26) (not (= main_~output~0 0)) (= |old(~a28~0)| ~a28~0) (= ~a17~0 |old(~a17~0)|)) (not (= 0 |old(~a25~0)|)) (and .cse12 .cse23 .cse22 .cse18 .cse25 .cse19 .cse20 .cse21 .cse13 .cse4) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0))))) [2018-11-07 18:45:26,237 INFO L425 ceAbstractionStarter]: For program point L606-4(lines 600 617) no Hoare annotation was computed. [2018-11-07 18:45:26,238 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2018-11-07 18:45:26,238 INFO L421 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse24 (= ~a11~0 1)) (.cse17 (<= ~a28~0 11)) (.cse25 (= ~a11~0 0)) (.cse23 (= ~a19~0 1)) (.cse6 (= ~a21~0 1)) (.cse16 (<= 7 ~a28~0)) (.cse12 (= ~a25~0 1))) (let ((.cse3 (= 1 ~a25~0)) (.cse9 (= 10 ~a28~0)) (.cse0 (= 7 ~a28~0)) (.cse5 (= 8 ~a17~0)) (.cse4 (= 1 ~a19~0)) (.cse1 (= 1 ~a11~0)) (.cse20 (not .cse12)) (.cse2 (= 7 ~a17~0)) (.cse7 (<= ~a19~0 0)) (.cse22 (not (= ~a28~0 9))) (.cse13 (<= 0 ~a19~0)) (.cse10 (<= 1 main_~input~0)) (.cse11 (<= main_~input~0 6)) (.cse21 (let ((.cse26 (<= 0 ~a25~0)) (.cse27 (<= ~a25~0 1))) (or (and .cse17 .cse26 .cse23 (<= 9 ~a28~0) .cse6 .cse27) (and .cse17 .cse26 .cse25 .cse23 .cse6 .cse16 .cse27)))) (.cse15 (not .cse24)) (.cse18 (<= 0 ~a11~0)) (.cse8 (not (= ~a28~0 ~a17~0))) (.cse19 (<= ~a11~0 1)) (.cse14 (= ~a17~0 8))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse3 (= 9 ~a28~0) .cse5 .cse4) (not .cse6) (and .cse7 .cse8 .cse2) (not (= ~y~0 25)) (not (= 1 |old(~a19~0)|)) (not (= ~x~0 24)) (and .cse1 .cse3 .cse5 .cse4 .cse9) (not (= ~e~0 5)) (not (= ~d~0 4)) (and .cse10 .cse9 (<= ~a19~0 1) (= ~a11~0 |old(~a11~0)|) .cse11 .cse12 .cse13 .cse14) (and .cse10 .cse12 .cse15 .cse16 .cse17 .cse4 .cse11 .cse18 .cse19 .cse14) (not (= 21 ~u~0)) (not (= 22 ~v~0)) (and .cse0 .cse20 .cse1 .cse5 (not .cse4)) (not (= |old(~a11~0)| 0)) (and (and .cse10 .cse20 .cse11 .cse21 .cse14) .cse1) (and .cse8 .cse20 .cse2 .cse15 .cse22) (not (= ~z~0 26)) (not (= 0 |old(~a25~0)|)) (not (= 3 ~c~0)) (not (= 23 ~w~0)) (and .cse10 .cse11 .cse12 .cse14 .cse23 (= ~a28~0 7) .cse24) (and .cse7 .cse10 .cse16 .cse25 (= ~a25~0 0) (<= ~a28~0 9) .cse22 .cse11 .cse13 .cse14) (and .cse10 .cse11 .cse21 .cse15 .cse18 .cse8 .cse19 .cse14) (not (= |old(~a28~0)| 7)) (not (= ~a~0 1)) (not (= |old(~a17~0)| 8)) (not (= 6 ~f~0))))) [2018-11-07 18:45:26,238 INFO L425 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2018-11-07 18:45:26,238 INFO L425 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-11-07 18:45:26,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:45:26 BoogieIcfgContainer [2018-11-07 18:45:26,256 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 18:45:26,258 INFO L168 Benchmark]: Toolchain (without parser) took 139345.72 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.4 GB in the end (delta: -960.4 MB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2018-11-07 18:45:26,259 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 18:45:26,260 INFO L168 Benchmark]: CACSL2BoogieTranslator took 716.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-07 18:45:26,260 INFO L168 Benchmark]: Boogie Procedure Inliner took 130.14 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -813.1 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. [2018-11-07 18:45:26,261 INFO L168 Benchmark]: Boogie Preprocessor took 100.34 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2018-11-07 18:45:26,262 INFO L168 Benchmark]: RCFGBuilder took 3155.39 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: 119.2 MB). Peak memory consumption was 119.2 MB. Max. memory is 7.1 GB. [2018-11-07 18:45:26,263 INFO L168 Benchmark]: TraceAbstraction took 135236.80 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.4 GB in the end (delta: -301.5 MB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2018-11-07 18:45:26,273 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.23 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 716.68 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 130.14 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -813.1 MB). Peak memory consumption was 18.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 100.34 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3155.39 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: 119.2 MB). Peak memory consumption was 119.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 135236.80 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.4 GB in the end (delta: -301.5 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: (((((((((((((((((((((((((((((1 == a11 && !(a25 == 1) && ((((a28 <= 11 && 0 <= a25) && a17 == 8) && a19 == 1) && 9 <= a28) && a25 <= 1) || ((((7 == a28 && 1 == a11) && 7 == a17) && 1 == a25) && 1 == a19)) || (10 == a28 && (a19 <= 0 && (((a11 <= 1 && 0 <= a19) && a17 == 8) && a25 == 1) && 0 <= a11) && !(a11 == 1))) || ((((1 == a11 && 1 == a25) && 9 == a28) && 8 == a17) && 1 == a19)) || !(a21 == 1)) || ((a19 <= 0 && !(a28 == a17)) && 7 == a17)) || !(y == 25)) || (a25 == 1 && ((((a11 == 0 && a17 == 8) && a19 == 1) && a28 <= 9) && 8 <= a28) && !(a28 == 9))) || (!(a28 == a17) && (((((((((a28 <= 11 && 0 <= a25) && a11 == 0) && 3 <= input) && input <= 6) && a17 == 8) && a19 == 1) && 7 <= a28) && a25 <= 1) || ((((((((a28 <= 11 && 0 <= a25) && a11 == 0) && 1 <= input) && a17 == 8) && a19 == 1) && input <= 4) && 7 <= a28) && a25 <= 1)))) || !(1 == \old(a19))) || !(x == 24)) || ((((1 == a11 && 1 == a25) && 8 == a17) && 1 == a19) && 10 == a28)) || !(e == 5)) || !(d == 4)) || !(21 == u)) || !(22 == v)) || ((((7 == a28 && !(a25 == 1)) && 1 == a11) && 8 == a17) && !(1 == a19))) || !(\old(a11) == 0)) || ((((!(a28 == a17) && !(a25 == 1)) && 7 == a17) && !(a11 == 1)) && !(a28 == 9))) || !(z == 26)) || ((((a17 == 8 && a19 == 1) && a28 == 7) && a25 == 1) && a11 == 1)) || (((((((0 <= output + 1 && a11 == 0) && a25 == 0) && a19 == 1) && output <= 26) && !(output == 0)) && \old(a28) == a28) && a17 == \old(a17))) || !(0 == \old(a25))) || (((((((((a19 <= 0 && 1 <= input) && 7 <= a28) && a11 == 0) && a25 == 0) && a28 <= 9) && !(a28 == 9)) && input <= 6) && 0 <= a19) && a17 == 8)) || !(3 == c)) || !(23 == w)) || !(\old(a28) == 7)) || !(a == 1)) || !(\old(a17) == 8)) || !(6 == f) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 237 locations, 1 error locations. SAFE Result, 135.1s OverallTime, 18 OverallIterations, 6 TraceHistogramMax, 86.2s AutomataDifference, 0.0s DeadEndRemovalTime, 12.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 2415 SDtfs, 17345 SDslu, 3018 SDs, 0 SdLazy, 23847 SolverSat, 3331 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 39.9s Time, PredicateUnifierStatistics: 10 DeclaredPredicates, 5252 GetRequests, 4908 SyntacticMatches, 91 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2004 ImplicationChecksByTransitivity, 12.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10648occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 12.9s AbstIntTime, 11 AbstIntIterations, 5 AbstIntStrong, 0.9979365133612966 AbsIntWeakeningRatio, 0.14888535031847133 AbsIntAvgWeakeningVarsNumRemoved, 26.14012738853503 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 1791 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 331 PreInvPairs, 414 NumberOfFragments, 1841 HoareAnnotationTreeSize, 331 FomulaSimplifications, 20581 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 7 FomulaSimplificationsInter, 34027 FormulaSimplificationTreeSizeReductionInter, 10.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 11.3s InterpolantComputationTime, 6148 NumberOfCodeBlocks, 6148 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 7982 ConstructedInterpolants, 0 QuantifiedInterpolants, 8044107 SizeOfPredicates, 8 NumberOfNonLiveVariables, 3848 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 30 InterpolantComputations, 9 PerfectInterpolantSequences, 5837/6554 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...