java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label09.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 01:20:46,182 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 01:20:46,183 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 01:20:46,195 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 01:20:46,196 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 01:20:46,197 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 01:20:46,198 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 01:20:46,200 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 01:20:46,201 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 01:20:46,202 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 01:20:46,204 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 01:20:46,206 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 01:20:46,206 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 01:20:46,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 01:20:46,214 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 01:20:46,218 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 01:20:46,219 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 01:20:46,220 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 01:20:46,223 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 01:20:46,227 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 01:20:46,231 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 01:20:46,232 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 01:20:46,233 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 01:20:46,235 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 01:20:46,237 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 01:20:46,237 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 01:20:46,238 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 01:20:46,238 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 01:20:46,239 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 01:20:46,242 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 01:20:46,243 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 01:20:46,244 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 01:20:46,245 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 01:20:46,246 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 01:20:46,249 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 01:20:46,249 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 01:20:46,250 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 01:20:46,251 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 01:20:46,251 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 01:20:46,253 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 01:20:46,256 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 01:20:46,256 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 01:20:46,271 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 01:20:46,272 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 01:20:46,273 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 01:20:46,273 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 01:20:46,273 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 01:20:46,274 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 01:20:46,274 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 01:20:46,274 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 01:20:46,274 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 01:20:46,274 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 01:20:46,275 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 01:20:46,275 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 01:20:46,275 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 01:20:46,275 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 01:20:46,275 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 01:20:46,276 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 01:20:46,276 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 01:20:46,276 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 01:20:46,276 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 01:20:46,277 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 01:20:46,277 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 01:20:46,277 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 01:20:46,277 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 01:20:46,278 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 01:20:46,278 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 01:20:46,278 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 01:20:46,278 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 01:20:46,278 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 01:20:46,279 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 01:20:46,309 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 01:20:46,321 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 01:20:46,331 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 01:20:46,334 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 01:20:46,335 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 01:20:46,335 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label09.c [2019-10-02 01:20:46,403 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe7c47813/30e2400060574af4a110464883eb0c55/FLAG809a39515 [2019-10-02 01:20:46,991 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 01:20:46,992 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label09.c [2019-10-02 01:20:47,010 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe7c47813/30e2400060574af4a110464883eb0c55/FLAG809a39515 [2019-10-02 01:20:47,223 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe7c47813/30e2400060574af4a110464883eb0c55 [2019-10-02 01:20:47,236 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 01:20:47,238 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 01:20:47,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 01:20:47,239 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 01:20:47,244 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 01:20:47,245 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:20:47" (1/1) ... [2019-10-02 01:20:47,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@377a6792 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:20:47, skipping insertion in model container [2019-10-02 01:20:47,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:20:47" (1/1) ... [2019-10-02 01:20:47,255 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 01:20:47,309 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 01:20:47,839 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:20:47,844 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 01:20:47,967 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:20:47,986 INFO L192 MainTranslator]: Completed translation [2019-10-02 01:20:47,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:20:47 WrapperNode [2019-10-02 01:20:47,987 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 01:20:47,987 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 01:20:47,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 01:20:47,988 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 01:20:47,998 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:20:47" (1/1) ... [2019-10-02 01:20:47,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:20:47" (1/1) ... [2019-10-02 01:20:48,027 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:20:47" (1/1) ... [2019-10-02 01:20:48,028 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:20:47" (1/1) ... [2019-10-02 01:20:48,072 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:20:47" (1/1) ... [2019-10-02 01:20:48,091 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:20:47" (1/1) ... [2019-10-02 01:20:48,110 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:20:47" (1/1) ... [2019-10-02 01:20:48,122 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 01:20:48,122 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 01:20:48,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 01:20:48,123 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 01:20:48,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:20:47" (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 [2019-10-02 01:20:48,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 01:20:48,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 01:20:48,186 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 01:20:48,186 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 01:20:48,186 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 01:20:48,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 01:20:48,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 01:20:48,187 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 01:20:48,187 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 01:20:48,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 01:20:48,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 01:20:49,566 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 01:20:49,567 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 01:20:49,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:20:49 BoogieIcfgContainer [2019-10-02 01:20:49,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 01:20:49,570 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 01:20:49,573 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 01:20:49,577 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 01:20:49,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:20:47" (1/3) ... [2019-10-02 01:20:49,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33a75d60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:20:49, skipping insertion in model container [2019-10-02 01:20:49,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:20:47" (2/3) ... [2019-10-02 01:20:49,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33a75d60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:20:49, skipping insertion in model container [2019-10-02 01:20:49,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:20:49" (3/3) ... [2019-10-02 01:20:49,581 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label09.c [2019-10-02 01:20:49,591 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 01:20:49,602 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 01:20:49,618 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 01:20:49,661 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 01:20:49,661 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 01:20:49,662 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 01:20:49,662 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 01:20:49,662 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 01:20:49,662 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 01:20:49,663 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 01:20:49,663 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 01:20:49,663 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 01:20:49,696 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states. [2019-10-02 01:20:49,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-02 01:20:49,703 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:20:49,704 INFO L411 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] [2019-10-02 01:20:49,706 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:20:49,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:20:49,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1524899170, now seen corresponding path program 1 times [2019-10-02 01:20:49,713 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:20:49,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:20:49,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:20:49,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:20:49,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:20:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:20:50,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:20:50,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:20:50,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 01:20:50,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 01:20:50,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 01:20:50,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 01:20:50,111 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 4 states. [2019-10-02 01:20:51,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:20:51,923 INFO L93 Difference]: Finished difference Result 890 states and 1607 transitions. [2019-10-02 01:20:51,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 01:20:51,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-10-02 01:20:51,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:20:51,945 INFO L225 Difference]: With dead ends: 890 [2019-10-02 01:20:51,945 INFO L226 Difference]: Without dead ends: 554 [2019-10-02 01:20:51,954 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 01:20:51,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-10-02 01:20:52,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2019-10-02 01:20:52,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-10-02 01:20:52,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 776 transitions. [2019-10-02 01:20:52,053 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 776 transitions. Word has length 51 [2019-10-02 01:20:52,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:20:52,055 INFO L475 AbstractCegarLoop]: Abstraction has 554 states and 776 transitions. [2019-10-02 01:20:52,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 01:20:52,055 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 776 transitions. [2019-10-02 01:20:52,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-02 01:20:52,069 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:20:52,070 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:20:52,070 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:20:52,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:20:52,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1193901298, now seen corresponding path program 1 times [2019-10-02 01:20:52,071 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:20:52,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:20:52,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:20:52,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:20:52,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:20:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:20:52,342 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:20:52,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:20:52,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 01:20:52,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 01:20:52,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 01:20:52,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 01:20:52,345 INFO L87 Difference]: Start difference. First operand 554 states and 776 transitions. Second operand 4 states. [2019-10-02 01:20:53,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:20:53,791 INFO L93 Difference]: Finished difference Result 2194 states and 3130 transitions. [2019-10-02 01:20:53,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 01:20:53,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-10-02 01:20:53,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:20:53,806 INFO L225 Difference]: With dead ends: 2194 [2019-10-02 01:20:53,806 INFO L226 Difference]: Without dead ends: 1646 [2019-10-02 01:20:53,809 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 01:20:53,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2019-10-02 01:20:53,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1646. [2019-10-02 01:20:53,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1646 states. [2019-10-02 01:20:53,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 2217 transitions. [2019-10-02 01:20:53,886 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 2217 transitions. Word has length 163 [2019-10-02 01:20:53,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:20:53,888 INFO L475 AbstractCegarLoop]: Abstraction has 1646 states and 2217 transitions. [2019-10-02 01:20:53,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 01:20:53,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 2217 transitions. [2019-10-02 01:20:53,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-02 01:20:53,896 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:20:53,897 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:20:53,897 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:20:53,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:20:53,898 INFO L82 PathProgramCache]: Analyzing trace with hash -825927574, now seen corresponding path program 1 times [2019-10-02 01:20:53,898 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:20:53,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:20:53,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:20:53,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:20:53,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:20:53,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:20:54,197 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 169 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:20:54,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:20:54,198 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 01:20:54,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:20:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:20:54,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:20:54,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:20:54,466 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 169 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:20:54,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:20:54,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-02 01:20:54,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:20:54,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:20:54,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:20:54,488 INFO L87 Difference]: Start difference. First operand 1646 states and 2217 transitions. Second operand 9 states. [2019-10-02 01:20:58,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:20:58,041 INFO L93 Difference]: Finished difference Result 6438 states and 9913 transitions. [2019-10-02 01:20:58,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 01:20:58,045 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 237 [2019-10-02 01:20:58,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:20:58,081 INFO L225 Difference]: With dead ends: 6438 [2019-10-02 01:20:58,082 INFO L226 Difference]: Without dead ends: 3474 [2019-10-02 01:20:58,094 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-10-02 01:20:58,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3474 states. [2019-10-02 01:20:58,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3474 to 3024. [2019-10-02 01:20:58,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3024 states. [2019-10-02 01:20:58,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3024 states to 3024 states and 4095 transitions. [2019-10-02 01:20:58,305 INFO L78 Accepts]: Start accepts. Automaton has 3024 states and 4095 transitions. Word has length 237 [2019-10-02 01:20:58,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:20:58,307 INFO L475 AbstractCegarLoop]: Abstraction has 3024 states and 4095 transitions. [2019-10-02 01:20:58,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:20:58,307 INFO L276 IsEmpty]: Start isEmpty. Operand 3024 states and 4095 transitions. [2019-10-02 01:20:58,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-10-02 01:20:58,316 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:20:58,316 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:20:58,316 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:20:58,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:20:58,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1188848018, now seen corresponding path program 1 times [2019-10-02 01:20:58,317 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:20:58,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:20:58,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:20:58,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:20:58,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:20:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:20:58,652 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 181 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:20:58,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:20:58,653 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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) [2019-10-02 01:20:58,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:20:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:20:58,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:20:58,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:20:58,894 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 181 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:20:58,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:20:58,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-02 01:20:58,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 01:20:58,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 01:20:58,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 01:20:58,910 INFO L87 Difference]: Start difference. First operand 3024 states and 4095 transitions. Second operand 9 states. [2019-10-02 01:21:01,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:21:01,901 INFO L93 Difference]: Finished difference Result 6642 states and 9328 transitions. [2019-10-02 01:21:01,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 01:21:01,902 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 249 [2019-10-02 01:21:01,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:21:01,922 INFO L225 Difference]: With dead ends: 6642 [2019-10-02 01:21:01,922 INFO L226 Difference]: Without dead ends: 2682 [2019-10-02 01:21:01,944 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-10-02 01:21:01,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states. [2019-10-02 01:21:02,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 2630. [2019-10-02 01:21:02,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2630 states. [2019-10-02 01:21:02,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 3390 transitions. [2019-10-02 01:21:02,053 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 3390 transitions. Word has length 249 [2019-10-02 01:21:02,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:21:02,053 INFO L475 AbstractCegarLoop]: Abstraction has 2630 states and 3390 transitions. [2019-10-02 01:21:02,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 01:21:02,054 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 3390 transitions. [2019-10-02 01:21:02,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-10-02 01:21:02,064 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:21:02,065 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2019-10-02 01:21:02,065 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:21:02,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:21:02,065 INFO L82 PathProgramCache]: Analyzing trace with hash -137313843, now seen corresponding path program 1 times [2019-10-02 01:21:02,066 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:21:02,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:21:02,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:21:02,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:21:02,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:21:02,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:21:02,535 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 120 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:21:02,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:21:02,536 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 01:21:02,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:21:02,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:21:02,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 01:21:02,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:21:02,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:02,793 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 01:21:02,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:21:02,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2019-10-02 01:21:02,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 01:21:02,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 01:21:02,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-02 01:21:02,799 INFO L87 Difference]: Start difference. First operand 2630 states and 3390 transitions. Second operand 12 states. [2019-10-02 01:21:07,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:21:07,737 INFO L93 Difference]: Finished difference Result 6302 states and 8347 transitions. [2019-10-02 01:21:07,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-02 01:21:07,737 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 254 [2019-10-02 01:21:07,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:21:07,756 INFO L225 Difference]: With dead ends: 6302 [2019-10-02 01:21:07,756 INFO L226 Difference]: Without dead ends: 3424 [2019-10-02 01:21:07,769 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 262 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=194, Invalid=996, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 01:21:07,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3424 states. [2019-10-02 01:21:07,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3424 to 3054. [2019-10-02 01:21:07,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3054 states. [2019-10-02 01:21:07,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3054 states to 3054 states and 3567 transitions. [2019-10-02 01:21:07,852 INFO L78 Accepts]: Start accepts. Automaton has 3054 states and 3567 transitions. Word has length 254 [2019-10-02 01:21:07,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:21:07,852 INFO L475 AbstractCegarLoop]: Abstraction has 3054 states and 3567 transitions. [2019-10-02 01:21:07,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 01:21:07,853 INFO L276 IsEmpty]: Start isEmpty. Operand 3054 states and 3567 transitions. [2019-10-02 01:21:07,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-10-02 01:21:07,861 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:21:07,862 INFO L411 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:21:07,862 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:21:07,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:21:07,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1172651703, now seen corresponding path program 1 times [2019-10-02 01:21:07,863 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:21:07,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:21:07,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:21:07,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:21:07,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:21:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:21:08,480 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 204 proven. 176 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-10-02 01:21:08,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:21:08,481 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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) [2019-10-02 01:21:08,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:21:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:21:08,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:21:08,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:21:08,779 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 401 proven. 2 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 01:21:08,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:21:08,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-10-02 01:21:08,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 01:21:08,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 01:21:08,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-10-02 01:21:08,789 INFO L87 Difference]: Start difference. First operand 3054 states and 3567 transitions. Second operand 10 states. [2019-10-02 01:21:10,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:21:10,267 INFO L93 Difference]: Finished difference Result 5496 states and 6415 transitions. [2019-10-02 01:21:10,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 01:21:10,268 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 404 [2019-10-02 01:21:10,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:21:10,283 INFO L225 Difference]: With dead ends: 5496 [2019-10-02 01:21:10,284 INFO L226 Difference]: Without dead ends: 2838 [2019-10-02 01:21:10,295 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-10-02 01:21:10,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2838 states. [2019-10-02 01:21:10,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2838 to 2802. [2019-10-02 01:21:10,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2802 states. [2019-10-02 01:21:10,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2802 states to 2802 states and 3113 transitions. [2019-10-02 01:21:10,369 INFO L78 Accepts]: Start accepts. Automaton has 2802 states and 3113 transitions. Word has length 404 [2019-10-02 01:21:10,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:21:10,369 INFO L475 AbstractCegarLoop]: Abstraction has 2802 states and 3113 transitions. [2019-10-02 01:21:10,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 01:21:10,369 INFO L276 IsEmpty]: Start isEmpty. Operand 2802 states and 3113 transitions. [2019-10-02 01:21:10,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2019-10-02 01:21:10,384 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:21:10,385 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:21:10,385 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:21:10,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:21:10,386 INFO L82 PathProgramCache]: Analyzing trace with hash 469991441, now seen corresponding path program 1 times [2019-10-02 01:21:10,386 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:21:10,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:21:10,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:21:10,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:21:10,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:21:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:21:12,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1169 backedges. 569 proven. 422 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2019-10-02 01:21:12,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:21:12,342 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 01:21:12,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:21:12,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:21:12,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 878 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 01:21:12,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:21:12,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:13,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1169 backedges. 800 proven. 2 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-10-02 01:21:13,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:21:13,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5] total 17 [2019-10-02 01:21:13,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 01:21:13,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 01:21:13,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-10-02 01:21:13,099 INFO L87 Difference]: Start difference. First operand 2802 states and 3113 transitions. Second operand 17 states. [2019-10-02 01:21:15,396 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2019-10-02 01:21:16,437 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-10-02 01:21:16,691 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-10-02 01:21:17,099 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-10-02 01:21:18,006 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2019-10-02 01:21:18,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:21:18,407 INFO L93 Difference]: Finished difference Result 5810 states and 6561 transitions. [2019-10-02 01:21:18,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 01:21:18,408 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 586 [2019-10-02 01:21:18,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:21:18,420 INFO L225 Difference]: With dead ends: 5810 [2019-10-02 01:21:18,420 INFO L226 Difference]: Without dead ends: 3196 [2019-10-02 01:21:18,425 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 640 GetRequests, 601 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=344, Invalid=1296, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 01:21:18,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3196 states. [2019-10-02 01:21:18,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3196 to 2804. [2019-10-02 01:21:18,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2804 states. [2019-10-02 01:21:18,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2804 states to 2804 states and 3076 transitions. [2019-10-02 01:21:18,487 INFO L78 Accepts]: Start accepts. Automaton has 2804 states and 3076 transitions. Word has length 586 [2019-10-02 01:21:18,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:21:18,488 INFO L475 AbstractCegarLoop]: Abstraction has 2804 states and 3076 transitions. [2019-10-02 01:21:18,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 01:21:18,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2804 states and 3076 transitions. [2019-10-02 01:21:18,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2019-10-02 01:21:18,506 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:21:18,506 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-10-02 01:21:18,507 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:21:18,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:21:18,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1240943570, now seen corresponding path program 1 times [2019-10-02 01:21:18,507 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:21:18,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:21:18,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:21:18,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:21:18,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:21:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:21:19,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 348 proven. 389 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2019-10-02 01:21:19,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:21:19,489 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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 [2019-10-02 01:21:19,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:21:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:21:19,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 914 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 01:21:19,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:21:19,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 519 proven. 2 refuted. 0 times theorem prover too weak. 655 trivial. 0 not checked. [2019-10-02 01:21:19,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:21:19,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5] total 17 [2019-10-02 01:21:19,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 01:21:19,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 01:21:19,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-10-02 01:21:19,932 INFO L87 Difference]: Start difference. First operand 2804 states and 3076 transitions. Second operand 17 states. [2019-10-02 01:21:29,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:21:29,235 INFO L93 Difference]: Finished difference Result 7846 states and 8805 transitions. [2019-10-02 01:21:29,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-02 01:21:29,236 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 619 [2019-10-02 01:21:29,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:21:29,253 INFO L225 Difference]: With dead ends: 7846 [2019-10-02 01:21:29,254 INFO L226 Difference]: Without dead ends: 5232 [2019-10-02 01:21:29,260 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 725 GetRequests, 658 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=859, Invalid=3697, Unknown=0, NotChecked=0, Total=4556 [2019-10-02 01:21:29,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5232 states. [2019-10-02 01:21:29,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5232 to 4846. [2019-10-02 01:21:29,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4846 states. [2019-10-02 01:21:29,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4846 states to 4846 states and 5353 transitions. [2019-10-02 01:21:29,372 INFO L78 Accepts]: Start accepts. Automaton has 4846 states and 5353 transitions. Word has length 619 [2019-10-02 01:21:29,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:21:29,373 INFO L475 AbstractCegarLoop]: Abstraction has 4846 states and 5353 transitions. [2019-10-02 01:21:29,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 01:21:29,374 INFO L276 IsEmpty]: Start isEmpty. Operand 4846 states and 5353 transitions. [2019-10-02 01:21:29,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 675 [2019-10-02 01:21:29,385 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:21:29,386 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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] [2019-10-02 01:21:29,386 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:21:29,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:21:29,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1848262589, now seen corresponding path program 1 times [2019-10-02 01:21:29,387 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:21:29,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:21:29,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:21:29,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:21:29,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:21:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:21:30,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 726 proven. 710 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-10-02 01:21:30,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:21:30,431 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:21:30,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:21:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:21:30,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 1004 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 01:21:30,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:21:30,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:31,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 1008 proven. 2 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2019-10-02 01:21:31,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:21:31,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2019-10-02 01:21:31,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 01:21:31,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 01:21:31,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-10-02 01:21:31,057 INFO L87 Difference]: Start difference. First operand 4846 states and 5353 transitions. Second operand 14 states. [2019-10-02 01:21:35,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:21:35,794 INFO L93 Difference]: Finished difference Result 9936 states and 11081 transitions. [2019-10-02 01:21:35,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-02 01:21:35,795 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 674 [2019-10-02 01:21:35,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:21:35,835 INFO L225 Difference]: With dead ends: 9936 [2019-10-02 01:21:35,836 INFO L226 Difference]: Without dead ends: 5280 [2019-10-02 01:21:35,848 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 697 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=333, Invalid=1307, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 01:21:35,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5280 states. [2019-10-02 01:21:35,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5280 to 5030. [2019-10-02 01:21:35,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5030 states. [2019-10-02 01:21:36,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5030 states to 5030 states and 5526 transitions. [2019-10-02 01:21:36,003 INFO L78 Accepts]: Start accepts. Automaton has 5030 states and 5526 transitions. Word has length 674 [2019-10-02 01:21:36,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:21:36,004 INFO L475 AbstractCegarLoop]: Abstraction has 5030 states and 5526 transitions. [2019-10-02 01:21:36,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 01:21:36,004 INFO L276 IsEmpty]: Start isEmpty. Operand 5030 states and 5526 transitions. [2019-10-02 01:21:36,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 834 [2019-10-02 01:21:36,024 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:21:36,025 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 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] [2019-10-02 01:21:36,025 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:21:36,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:21:36,026 INFO L82 PathProgramCache]: Analyzing trace with hash -655372082, now seen corresponding path program 1 times [2019-10-02 01:21:36,026 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:21:36,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:21:36,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:21:36,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:21:36,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:21:36,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:21:38,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 824 proven. 946 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2019-10-02 01:21:38,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:21:38,718 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:21:38,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:21:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:21:38,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 1170 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:21:38,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:21:39,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:39,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 835 proven. 2 refuted. 0 times theorem prover too weak. 1147 trivial. 0 not checked. [2019-10-02 01:21:39,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:21:39,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 5] total 21 [2019-10-02 01:21:39,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 01:21:39,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 01:21:39,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2019-10-02 01:21:39,392 INFO L87 Difference]: Start difference. First operand 5030 states and 5526 transitions. Second operand 21 states. [2019-10-02 01:21:47,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:21:47,548 INFO L93 Difference]: Finished difference Result 10666 states and 11882 transitions. [2019-10-02 01:21:47,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-02 01:21:47,548 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 833 [2019-10-02 01:21:47,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:21:47,566 INFO L225 Difference]: With dead ends: 10666 [2019-10-02 01:21:47,566 INFO L226 Difference]: Without dead ends: 5826 [2019-10-02 01:21:47,579 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 940 GetRequests, 866 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1615 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=883, Invalid=4373, Unknown=0, NotChecked=0, Total=5256 [2019-10-02 01:21:47,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5826 states. [2019-10-02 01:21:47,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5826 to 5592. [2019-10-02 01:21:47,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5592 states. [2019-10-02 01:21:47,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5592 states to 5592 states and 6068 transitions. [2019-10-02 01:21:47,683 INFO L78 Accepts]: Start accepts. Automaton has 5592 states and 6068 transitions. Word has length 833 [2019-10-02 01:21:47,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:21:47,684 INFO L475 AbstractCegarLoop]: Abstraction has 5592 states and 6068 transitions. [2019-10-02 01:21:47,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 01:21:47,685 INFO L276 IsEmpty]: Start isEmpty. Operand 5592 states and 6068 transitions. [2019-10-02 01:21:47,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 836 [2019-10-02 01:21:47,694 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:21:47,695 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 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] [2019-10-02 01:21:47,695 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:21:47,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:21:47,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1267620710, now seen corresponding path program 1 times [2019-10-02 01:21:47,696 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:21:47,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:21:47,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:21:47,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:21:47,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:21:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:21:48,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 1142 proven. 92 refuted. 0 times theorem prover too weak. 1046 trivial. 0 not checked. [2019-10-02 01:21:48,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:21:48,916 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:21:48,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:21:49,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:21:49,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 1208 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 01:21:49,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:21:49,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:49,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:49,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:49,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:50,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 884 proven. 43 refuted. 0 times theorem prover too weak. 1353 trivial. 0 not checked. [2019-10-02 01:21:50,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:21:50,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2019-10-02 01:21:50,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 01:21:50,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 01:21:50,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-10-02 01:21:50,285 INFO L87 Difference]: Start difference. First operand 5592 states and 6068 transitions. Second operand 12 states. [2019-10-02 01:21:54,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:21:54,923 INFO L93 Difference]: Finished difference Result 12876 states and 14115 transitions. [2019-10-02 01:21:54,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 01:21:54,924 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 835 [2019-10-02 01:21:54,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:21:54,947 INFO L225 Difference]: With dead ends: 12876 [2019-10-02 01:21:54,947 INFO L226 Difference]: Without dead ends: 7474 [2019-10-02 01:21:54,960 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 871 GetRequests, 847 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2019-10-02 01:21:54,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7474 states. [2019-10-02 01:21:55,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7474 to 5976. [2019-10-02 01:21:55,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5976 states. [2019-10-02 01:21:55,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5976 states to 5976 states and 6545 transitions. [2019-10-02 01:21:55,097 INFO L78 Accepts]: Start accepts. Automaton has 5976 states and 6545 transitions. Word has length 835 [2019-10-02 01:21:55,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:21:55,099 INFO L475 AbstractCegarLoop]: Abstraction has 5976 states and 6545 transitions. [2019-10-02 01:21:55,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 01:21:55,099 INFO L276 IsEmpty]: Start isEmpty. Operand 5976 states and 6545 transitions. [2019-10-02 01:21:55,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 955 [2019-10-02 01:21:55,112 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:21:55,113 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 01:21:55,113 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:21:55,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:21:55,114 INFO L82 PathProgramCache]: Analyzing trace with hash -402334059, now seen corresponding path program 1 times [2019-10-02 01:21:55,114 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:21:55,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:21:55,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:21:55,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:21:55,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:21:55,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:21:57,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2562 backedges. 484 proven. 819 refuted. 0 times theorem prover too weak. 1259 trivial. 0 not checked. [2019-10-02 01:21:57,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:21:57,371 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:21:57,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:21:57,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:21:57,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 1325 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-02 01:21:57,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:21:57,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:57,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:57,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:57,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:21:57,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:57,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:57,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:57,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:57,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:57,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:57,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:57,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:57,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:57,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:21:57,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:57,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:57,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:57,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:57,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:21:57,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:57,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:57,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:57,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:57,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:57,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:57,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:57,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:57,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:57,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:21:57,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:57,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:57,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:57,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:57,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:57,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:21:57,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:57,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:57,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:57,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:21:57,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:57,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:57,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:57,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:21:57,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:57,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:21:57,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,700 WARN L191 SmtUtils]: Spent 4.47 s on a formula simplification. DAG size of input: 223 DAG size of output: 28 [2019-10-02 01:22:02,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:22:02,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:24:03,223 WARN L191 SmtUtils]: Spent 1.99 m on a formula simplification. DAG size of input: 1017 DAG size of output: 223 [2019-10-02 01:24:03,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 10 terms [2019-10-02 01:24:03,542 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 32 [2019-10-02 01:24:05,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2562 backedges. 1248 proven. 167 refuted. 0 times theorem prover too weak. 1147 trivial. 0 not checked. [2019-10-02 01:24:05,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:24:05,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 20 [2019-10-02 01:24:05,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 01:24:05,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 01:24:05,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-10-02 01:24:05,029 INFO L87 Difference]: Start difference. First operand 5976 states and 6545 transitions. Second operand 20 states. [2019-10-02 01:24:06,052 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 44 [2019-10-02 01:24:06,785 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-10-02 01:24:08,005 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-10-02 01:24:08,762 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-10-02 01:25:59,397 WARN L191 SmtUtils]: Spent 1.82 m on a formula simplification. DAG size of input: 259 DAG size of output: 229 [2019-10-02 01:26:01,096 WARN L191 SmtUtils]: Spent 714.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-10-02 01:26:02,364 WARN L191 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-10-02 01:26:03,096 WARN L191 SmtUtils]: Spent 654.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2019-10-02 01:28:49,285 WARN L191 SmtUtils]: Spent 2.76 m on a formula simplification. DAG size of input: 261 DAG size of output: 235 [2019-10-02 01:29:55,454 WARN L191 SmtUtils]: Spent 1.01 m on a formula simplification. DAG size of input: 262 DAG size of output: 228 [2019-10-02 01:29:57,549 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-10-02 01:29:58,872 WARN L191 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 66 DAG size of output: 36 [2019-10-02 01:29:59,948 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-10-02 01:30:01,041 WARN L191 SmtUtils]: Spent 765.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-10-02 01:30:02,085 WARN L191 SmtUtils]: Spent 790.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-10-02 01:31:01,582 WARN L191 SmtUtils]: Spent 58.69 s on a formula simplification that was a NOOP. DAG size: 254 [2019-10-02 01:31:04,084 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-10-02 01:31:07,719 WARN L191 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-10-02 01:31:09,218 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-10-02 01:31:15,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:31:15,525 INFO L93 Difference]: Finished difference Result 13359 states and 14654 transitions. [2019-10-02 01:31:15,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-10-02 01:31:15,525 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 954 [2019-10-02 01:31:15,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:31:15,546 INFO L225 Difference]: With dead ends: 13359 [2019-10-02 01:31:15,546 INFO L226 Difference]: Without dead ends: 7381 [2019-10-02 01:31:15,561 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1103 GetRequests, 1001 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3658 ImplicationChecksByTransitivity, 537.0s TimeCoverageRelationStatistics Valid=1537, Invalid=8967, Unknown=2, NotChecked=0, Total=10506 [2019-10-02 01:31:15,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7381 states. [2019-10-02 01:31:15,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7381 to 6346. [2019-10-02 01:31:15,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6346 states. [2019-10-02 01:31:15,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6346 states to 6346 states and 6914 transitions. [2019-10-02 01:31:15,683 INFO L78 Accepts]: Start accepts. Automaton has 6346 states and 6914 transitions. Word has length 954 [2019-10-02 01:31:15,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:31:15,684 INFO L475 AbstractCegarLoop]: Abstraction has 6346 states and 6914 transitions. [2019-10-02 01:31:15,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 01:31:15,685 INFO L276 IsEmpty]: Start isEmpty. Operand 6346 states and 6914 transitions. [2019-10-02 01:31:15,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1051 [2019-10-02 01:31:15,707 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:31:15,708 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 4, 4, 3, 3, 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] [2019-10-02 01:31:15,709 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:31:15,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:31:15,710 INFO L82 PathProgramCache]: Analyzing trace with hash 445945781, now seen corresponding path program 1 times [2019-10-02 01:31:15,710 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:31:15,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:31:15,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:31:15,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:31:15,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:31:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:31:17,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3855 backedges. 1162 proven. 1226 refuted. 0 times theorem prover too weak. 1467 trivial. 0 not checked. [2019-10-02 01:31:17,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:31:17,706 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:31:17,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:31:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:31:18,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 1501 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 01:31:18,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:31:18,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3855 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 3435 trivial. 0 not checked. [2019-10-02 01:31:18,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:31:18,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [14] total 15 [2019-10-02 01:31:18,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 01:31:18,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 01:31:18,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2019-10-02 01:31:18,526 INFO L87 Difference]: Start difference. First operand 6346 states and 6914 transitions. Second operand 15 states. [2019-10-02 01:31:21,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:31:21,901 INFO L93 Difference]: Finished difference Result 12763 states and 14333 transitions. [2019-10-02 01:31:21,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-02 01:31:21,902 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 1050 [2019-10-02 01:31:21,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:31:21,924 INFO L225 Difference]: With dead ends: 12763 [2019-10-02 01:31:21,924 INFO L226 Difference]: Without dead ends: 6484 [2019-10-02 01:31:21,936 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1103 GetRequests, 1068 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=310, Invalid=1022, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 01:31:21,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6484 states. [2019-10-02 01:31:22,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6484 to 6195. [2019-10-02 01:31:22,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6195 states. [2019-10-02 01:31:22,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6195 states to 6195 states and 6701 transitions. [2019-10-02 01:31:22,116 INFO L78 Accepts]: Start accepts. Automaton has 6195 states and 6701 transitions. Word has length 1050 [2019-10-02 01:31:22,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:31:22,118 INFO L475 AbstractCegarLoop]: Abstraction has 6195 states and 6701 transitions. [2019-10-02 01:31:22,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 01:31:22,118 INFO L276 IsEmpty]: Start isEmpty. Operand 6195 states and 6701 transitions. [2019-10-02 01:31:22,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1088 [2019-10-02 01:31:22,147 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:31:22,150 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 01:31:22,151 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:31:22,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:31:22,151 INFO L82 PathProgramCache]: Analyzing trace with hash -283677738, now seen corresponding path program 1 times [2019-10-02 01:31:22,151 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:31:22,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:31:22,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:31:22,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:31:22,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:31:22,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:31:23,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3414 backedges. 834 proven. 47 refuted. 0 times theorem prover too weak. 2533 trivial. 0 not checked. [2019-10-02 01:31:23,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:31:23,890 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:31:23,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:31:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:31:24,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 1495 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 01:31:24,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:31:24,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:31:24,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:32:25,788 WARN L191 SmtUtils]: Spent 1.02 m on a formula simplification. DAG size of input: 133 DAG size of output: 83 [2019-10-02 01:32:25,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-10-02 01:32:26,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3414 backedges. 1519 proven. 94 refuted. 0 times theorem prover too weak. 1801 trivial. 0 not checked. [2019-10-02 01:32:26,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:32:26,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2019-10-02 01:32:26,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 01:32:26,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 01:32:26,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-10-02 01:32:26,644 INFO L87 Difference]: Start difference. First operand 6195 states and 6701 transitions. Second operand 16 states. [2019-10-02 01:33:21,646 WARN L191 SmtUtils]: Spent 47.27 s on a formula simplification. DAG size of input: 93 DAG size of output: 87 [2019-10-02 01:33:25,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:33:25,290 INFO L93 Difference]: Finished difference Result 12271 states and 13289 transitions. [2019-10-02 01:33:25,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-02 01:33:25,291 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 1087 [2019-10-02 01:33:25,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:33:25,310 INFO L225 Difference]: With dead ends: 12271 [2019-10-02 01:33:25,310 INFO L226 Difference]: Without dead ends: 6219 [2019-10-02 01:33:25,319 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1147 GetRequests, 1104 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 109.9s TimeCoverageRelationStatistics Valid=324, Invalid=1398, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 01:33:25,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6219 states. [2019-10-02 01:33:25,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6219 to 6205. [2019-10-02 01:33:25,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6205 states. [2019-10-02 01:33:25,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6205 states to 6205 states and 6662 transitions. [2019-10-02 01:33:25,422 INFO L78 Accepts]: Start accepts. Automaton has 6205 states and 6662 transitions. Word has length 1087 [2019-10-02 01:33:25,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:33:25,423 INFO L475 AbstractCegarLoop]: Abstraction has 6205 states and 6662 transitions. [2019-10-02 01:33:25,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 01:33:25,424 INFO L276 IsEmpty]: Start isEmpty. Operand 6205 states and 6662 transitions. [2019-10-02 01:33:25,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1127 [2019-10-02 01:33:25,442 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:33:25,444 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:33:25,444 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:33:25,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:33:25,445 INFO L82 PathProgramCache]: Analyzing trace with hash -569851947, now seen corresponding path program 1 times [2019-10-02 01:33:25,445 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:33:25,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:33:25,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:33:25,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:33:25,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:33:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:33:29,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3976 backedges. 1154 proven. 1840 refuted. 0 times theorem prover too weak. 982 trivial. 0 not checked. [2019-10-02 01:33:29,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:33:29,819 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:33:29,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:33:30,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:33:30,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 1576 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:33:30,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:33:30,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3976 backedges. 1245 proven. 2 refuted. 0 times theorem prover too weak. 2729 trivial. 0 not checked. [2019-10-02 01:33:30,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:33:30,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 5] total 20 [2019-10-02 01:33:30,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 01:33:30,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 01:33:30,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2019-10-02 01:33:30,846 INFO L87 Difference]: Start difference. First operand 6205 states and 6662 transitions. Second operand 20 states. [2019-10-02 01:33:37,182 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-10-02 01:33:37,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:33:37,821 INFO L93 Difference]: Finished difference Result 12212 states and 13145 transitions. [2019-10-02 01:33:37,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-02 01:33:37,821 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1126 [2019-10-02 01:33:37,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:33:37,836 INFO L225 Difference]: With dead ends: 12212 [2019-10-02 01:33:37,837 INFO L226 Difference]: Without dead ends: 6007 [2019-10-02 01:33:37,846 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1210 GetRequests, 1152 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 869 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=565, Invalid=2741, Unknown=0, NotChecked=0, Total=3306 [2019-10-02 01:33:37,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6007 states. [2019-10-02 01:33:37,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6007 to 3943. [2019-10-02 01:33:37,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3943 states. [2019-10-02 01:33:37,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3943 states to 3943 states and 4058 transitions. [2019-10-02 01:33:37,932 INFO L78 Accepts]: Start accepts. Automaton has 3943 states and 4058 transitions. Word has length 1126 [2019-10-02 01:33:37,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:33:37,933 INFO L475 AbstractCegarLoop]: Abstraction has 3943 states and 4058 transitions. [2019-10-02 01:33:37,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 01:33:37,934 INFO L276 IsEmpty]: Start isEmpty. Operand 3943 states and 4058 transitions. [2019-10-02 01:33:37,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1532 [2019-10-02 01:33:37,962 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:33:37,963 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:33:37,963 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:33:37,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:33:37,964 INFO L82 PathProgramCache]: Analyzing trace with hash -628232518, now seen corresponding path program 1 times [2019-10-02 01:33:37,964 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:33:37,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:33:37,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:33:37,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:33:37,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:33:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:33:41,943 INFO L134 CoverageAnalysis]: Checked inductivity of 7178 backedges. 1231 proven. 3634 refuted. 0 times theorem prover too weak. 2313 trivial. 0 not checked. [2019-10-02 01:33:41,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:33:41,944 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:33:41,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:33:42,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:33:42,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 2090 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:33:42,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:33:42,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:33:43,455 INFO L134 CoverageAnalysis]: Checked inductivity of 7178 backedges. 3980 proven. 2 refuted. 0 times theorem prover too weak. 3196 trivial. 0 not checked. [2019-10-02 01:33:43,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:33:43,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 5] total 19 [2019-10-02 01:33:43,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 01:33:43,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 01:33:43,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-10-02 01:33:43,465 INFO L87 Difference]: Start difference. First operand 3943 states and 4058 transitions. Second operand 19 states. [2019-10-02 01:33:44,298 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-10-02 01:33:45,759 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-10-02 01:33:45,920 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-10-02 01:33:46,079 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 36 [2019-10-02 01:33:46,895 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-10-02 01:33:47,487 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-10-02 01:33:47,626 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-10-02 01:33:48,265 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 38 [2019-10-02 01:33:48,979 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-10-02 01:33:49,835 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-10-02 01:33:49,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:33:49,960 INFO L93 Difference]: Finished difference Result 7800 states and 8157 transitions. [2019-10-02 01:33:49,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-02 01:33:49,961 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 1531 [2019-10-02 01:33:49,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:33:49,971 INFO L225 Difference]: With dead ends: 7800 [2019-10-02 01:33:49,971 INFO L226 Difference]: Without dead ends: 4047 [2019-10-02 01:33:49,978 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1613 GetRequests, 1557 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=676, Invalid=2294, Unknown=0, NotChecked=0, Total=2970 [2019-10-02 01:33:49,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4047 states. [2019-10-02 01:33:50,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4047 to 3935. [2019-10-02 01:33:50,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3935 states. [2019-10-02 01:33:50,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3935 states to 3935 states and 4024 transitions. [2019-10-02 01:33:50,047 INFO L78 Accepts]: Start accepts. Automaton has 3935 states and 4024 transitions. Word has length 1531 [2019-10-02 01:33:50,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:33:50,048 INFO L475 AbstractCegarLoop]: Abstraction has 3935 states and 4024 transitions. [2019-10-02 01:33:50,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 01:33:50,048 INFO L276 IsEmpty]: Start isEmpty. Operand 3935 states and 4024 transitions. [2019-10-02 01:33:50,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1959 [2019-10-02 01:33:50,086 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:33:50,087 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-10-02 01:33:50,087 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:33:50,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:33:50,088 INFO L82 PathProgramCache]: Analyzing trace with hash -183242675, now seen corresponding path program 1 times [2019-10-02 01:33:50,088 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:33:50,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:33:50,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:33:50,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:33:50,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:33:50,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:33:54,589 INFO L134 CoverageAnalysis]: Checked inductivity of 11734 backedges. 6120 proven. 1595 refuted. 0 times theorem prover too weak. 4019 trivial. 0 not checked. [2019-10-02 01:33:54,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:33:54,589 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:33:54,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:33:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:33:55,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 2630 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 01:33:55,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:33:55,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:33:56,707 INFO L134 CoverageAnalysis]: Checked inductivity of 11734 backedges. 1719 proven. 2 refuted. 0 times theorem prover too weak. 10013 trivial. 0 not checked. [2019-10-02 01:33:56,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:33:56,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 5] total 21 [2019-10-02 01:33:56,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 01:33:56,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 01:33:56,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2019-10-02 01:33:56,718 INFO L87 Difference]: Start difference. First operand 3935 states and 4024 transitions. Second operand 21 states. [2019-10-02 01:33:58,976 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-10-02 01:33:59,516 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-10-02 01:33:59,943 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-10-02 01:34:00,351 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2019-10-02 01:34:00,565 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-10-02 01:34:06,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:34:06,043 INFO L93 Difference]: Finished difference Result 7780 states and 8018 transitions. [2019-10-02 01:34:06,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-02 01:34:06,044 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1958 [2019-10-02 01:34:06,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:34:06,046 INFO L225 Difference]: With dead ends: 7780 [2019-10-02 01:34:06,046 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 01:34:06,055 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2040 GetRequests, 1984 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=577, Invalid=2615, Unknown=0, NotChecked=0, Total=3192 [2019-10-02 01:34:06,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 01:34:06,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 01:34:06,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 01:34:06,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 01:34:06,057 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1958 [2019-10-02 01:34:06,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:34:06,057 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 01:34:06,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 01:34:06,057 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 01:34:06,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 01:34:06,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 01:34:08,622 WARN L191 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 837 DAG size of output: 663 [2019-10-02 01:34:09,724 WARN L191 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 837 DAG size of output: 663 [2019-10-02 01:34:09,866 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 29 [2019-10-02 01:34:14,352 WARN L191 SmtUtils]: Spent 4.46 s on a formula simplification. DAG size of input: 490 DAG size of output: 177 [2019-10-02 01:34:21,121 WARN L191 SmtUtils]: Spent 6.74 s on a formula simplification. DAG size of input: 653 DAG size of output: 138 [2019-10-02 01:34:28,754 WARN L191 SmtUtils]: Spent 7.63 s on a formula simplification. DAG size of input: 653 DAG size of output: 138 [2019-10-02 01:34:28,757 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 01:34:28,757 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= ~a12~0 |old(~a12~0)|) (<= |old(~a12~0)| ~a12~0) (= ~a24~0 |old(~a24~0)|) (= ~a21~0 |old(~a21~0)|) (= ~a15~0 |old(~a15~0)|)) [2019-10-02 01:34:28,758 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 01:34:28,758 INFO L443 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-10-02 01:34:28,758 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-10-02 01:34:28,758 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,758 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,758 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,758 INFO L443 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-10-02 01:34:28,759 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-10-02 01:34:28,759 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-10-02 01:34:28,759 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-10-02 01:34:28,759 INFO L443 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-10-02 01:34:28,759 INFO L443 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-10-02 01:34:28,759 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-10-02 01:34:28,759 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-10-02 01:34:28,759 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,760 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,760 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,760 INFO L443 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-10-02 01:34:28,760 INFO L443 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-10-02 01:34:28,760 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-10-02 01:34:28,760 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-10-02 01:34:28,760 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-10-02 01:34:28,760 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-10-02 01:34:28,761 INFO L443 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-10-02 01:34:28,761 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-10-02 01:34:28,761 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,761 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,761 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,761 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-10-02 01:34:28,761 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-10-02 01:34:28,761 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-10-02 01:34:28,762 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-10-02 01:34:28,762 INFO L443 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-10-02 01:34:28,762 INFO L443 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-10-02 01:34:28,762 INFO L443 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-10-02 01:34:28,762 INFO L443 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-10-02 01:34:28,762 INFO L443 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-10-02 01:34:28,762 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,762 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,763 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,763 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-10-02 01:34:28,763 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-10-02 01:34:28,763 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-10-02 01:34:28,763 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 139) no Hoare annotation was computed. [2019-10-02 01:34:28,763 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-10-02 01:34:28,763 INFO L443 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-10-02 01:34:28,763 INFO L443 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-10-02 01:34:28,764 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-10-02 01:34:28,764 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,764 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,764 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,764 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-10-02 01:34:28,764 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-10-02 01:34:28,764 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-10-02 01:34:28,764 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-10-02 01:34:28,764 INFO L443 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-10-02 01:34:28,765 INFO L443 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-10-02 01:34:28,765 INFO L443 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-10-02 01:34:28,765 INFO L443 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-10-02 01:34:28,765 INFO L443 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-10-02 01:34:28,765 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,765 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,765 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,765 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,766 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-10-02 01:34:28,766 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-10-02 01:34:28,766 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-10-02 01:34:28,766 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-10-02 01:34:28,766 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-10-02 01:34:28,766 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-10-02 01:34:28,766 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-10-02 01:34:28,766 INFO L443 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-10-02 01:34:28,766 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,766 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,767 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,767 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-10-02 01:34:28,767 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-10-02 01:34:28,767 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-10-02 01:34:28,767 INFO L443 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-10-02 01:34:28,767 INFO L443 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-10-02 01:34:28,767 INFO L443 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-10-02 01:34:28,767 INFO L443 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-10-02 01:34:28,767 INFO L443 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-10-02 01:34:28,768 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,768 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,768 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,768 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-10-02 01:34:28,768 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-10-02 01:34:28,768 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-10-02 01:34:28,768 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-10-02 01:34:28,768 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-10-02 01:34:28,768 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-10-02 01:34:28,769 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 872) the Hoare annotation is: (let ((.cse34 (= ~a21~0 6)) (.cse12 (= 6 |old(~a21~0)|))) (let ((.cse21 (<= ~a12~0 |old(~a12~0)|)) (.cse22 (<= |old(~a12~0)| ~a12~0)) (.cse23 (= ~a24~0 1)) (.cse24 (= ~a15~0 9)) (.cse27 (not .cse12)) (.cse25 (= ~a24~0 |old(~a24~0)|)) (.cse26 (= ~a21~0 |old(~a21~0)|)) (.cse6 (= ~a15~0 |old(~a15~0)|)) (.cse0 (= ~a12~0 |old(~a12~0)|)) (.cse13 (not .cse34)) (.cse35 (<= ~a12~0 11)) (.cse20 (not (<= |old(~a12~0)| 11))) (.cse7 (not (<= |old(~a15~0)| 6)))) (let ((.cse10 (not (<= |old(~a12~0)| 75))) (.cse5 (= ~a21~0 9)) (.cse31 (or (not (<= |old(~a12~0)| 73281)) (and (or .cse7 .cse20) (or .cse12 .cse7)))) (.cse32 (and .cse0 (let ((.cse36 (<= ~a15~0 6))) (or (and .cse36 .cse13) (and .cse36 .cse35))))) (.cse17 (not (= 8 |old(~a21~0)|))) (.cse33 (and .cse25 .cse0 .cse26 .cse6)) (.cse3 (or .cse27 .cse7 .cse20)) (.cse18 (not (= 7 |old(~a15~0)|))) (.cse8 (and .cse0 .cse25 .cse26 .cse6)) (.cse28 (not (= 7 |old(~a21~0)|))) (.cse4 (not (= 9 |old(~a21~0)|))) (.cse30 (not (<= (+ |old(~a12~0)| 49) 0))) (.cse29 (<= (+ ~a12~0 49) 0)) (.cse14 (not (= 9 |old(~a15~0)|))) (.cse19 (not (<= 10 |old(~a21~0)|))) (.cse15 (and .cse21 .cse22 .cse26 .cse23 .cse24)) (.cse16 (not (< 80 |old(~a12~0)|))) (.cse9 (not (= 8 |old(~a15~0)|))) (.cse11 (not (= 6 |old(~a15~0)|))) (.cse1 (not (= 1 |old(~a24~0)|))) (.cse2 (not (= 5 |old(~a15~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 (and .cse5 .cse6) .cse7) (or .cse8 (or (not (< 22 |old(~a12~0)|)) .cse9 .cse4 .cse10 .cse1)) (or .cse11 .cse12 .cse13) (or .cse14 .cse15 .cse1 .cse16 .cse17) (or .cse14 .cse10 .cse1 .cse17 .cse15) (or .cse12 .cse13 .cse18) (or .cse11 .cse6) (or .cse14 .cse15 .cse19 .cse1 .cse20) (or .cse4 .cse14 (and .cse21 .cse22 .cse5 .cse23 .cse24) .cse1 .cse16) (or .cse4 .cse18 .cse5) (or (and .cse25 .cse26 .cse6) .cse1 .cse2 .cse20) (or .cse15 .cse27 .cse14 .cse1 .cse16) (or .cse16 .cse14 .cse28 (and .cse21 .cse22 .cse23 (= ~a21~0 7) .cse24) .cse1) (or .cse29 .cse30 .cse18) (or (and (and .cse0 .cse5 .cse23) .cse6) (or .cse4 .cse1 .cse20 .cse9)) (or .cse31 .cse12 (and .cse32 .cse25 .cse26 .cse6) .cse1) (or (or (not (<= |old(~a12~0)| 599997)) .cse27 .cse9) .cse1 .cse33) (or .cse31 (and (and .cse25 .cse32) .cse26 .cse6) .cse19) (or (or (forall ((v_~a12~0_445 Int)) (or (not (<= v_~a12~0_445 80)) (not (< 11 v_~a12~0_445)) (not (= (mod (+ v_~a12~0_445 3) 5) 0)) (not (<= |old(~a12~0)| (div (+ v_~a12~0_445 366333) 5))))) .cse9 .cse17) .cse33 .cse1) (or (not (<= (+ |old(~a12~0)| 45156) 0)) .cse3 (and .cse25 (and .cse34 .cse0) .cse6)) (or .cse6 .cse18) (or .cse35 .cse20 .cse18) (or .cse8 (or .cse28 .cse1 .cse20 .cse9)) (or .cse4 .cse7 .cse30 .cse29) (or .cse14 .cse19 .cse15 .cse1 .cse16) (or (not (= 10 |old(~a21~0)|)) (forall ((v_prenex_65 Int)) (or (not (< 80 v_prenex_65)) (not (<= 0 v_prenex_65)) (not (<= |old(~a12~0)| (+ (mod v_prenex_65 299959) 300039))))) .cse1 .cse9 (and .cse21 .cse22 .cse26 .cse6 .cse23)) (or .cse11 .cse12 .cse20 .cse35) (or .cse27 (not (<= 526013 |old(~a12~0)|)) (and .cse0 .cse26 .cse6 .cse23) .cse1 .cse2))))) [2019-10-02 01:34:28,769 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-10-02 01:34:28,769 INFO L443 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-10-02 01:34:28,769 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,770 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,770 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,770 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-10-02 01:34:28,770 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-10-02 01:34:28,770 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-10-02 01:34:28,770 INFO L443 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-10-02 01:34:28,770 INFO L443 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-10-02 01:34:28,770 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-10-02 01:34:28,770 INFO L443 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-10-02 01:34:28,770 INFO L443 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-10-02 01:34:28,771 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,771 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,771 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,771 INFO L443 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-10-02 01:34:28,771 INFO L443 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-10-02 01:34:28,771 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-10-02 01:34:28,771 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-10-02 01:34:28,771 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-10-02 01:34:28,771 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-10-02 01:34:28,772 INFO L443 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-10-02 01:34:28,772 INFO L443 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-10-02 01:34:28,772 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,772 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,772 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,772 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-10-02 01:34:28,772 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-10-02 01:34:28,772 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-10-02 01:34:28,772 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-10-02 01:34:28,772 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-10-02 01:34:28,773 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-10-02 01:34:28,773 INFO L443 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-10-02 01:34:28,773 INFO L443 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-10-02 01:34:28,773 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,773 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,773 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,773 INFO L443 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-10-02 01:34:28,773 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-10-02 01:34:28,773 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-10-02 01:34:28,773 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-10-02 01:34:28,774 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-10-02 01:34:28,774 INFO L443 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-10-02 01:34:28,774 INFO L443 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-10-02 01:34:28,774 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-10-02 01:34:28,774 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,774 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,774 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-10-02 01:34:28,774 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-10-02 01:34:28,774 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-10-02 01:34:28,774 INFO L443 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-10-02 01:34:28,775 INFO L443 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-10-02 01:34:28,775 INFO L443 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-10-02 01:34:28,775 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-10-02 01:34:28,775 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-10-02 01:34:28,775 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,775 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,775 INFO L443 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-10-02 01:34:28,775 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-10-02 01:34:28,775 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-10-02 01:34:28,775 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-10-02 01:34:28,776 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-10-02 01:34:28,776 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-10-02 01:34:28,776 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,776 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,776 INFO L443 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-10-02 01:34:28,776 INFO L443 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-10-02 01:34:28,776 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-10-02 01:34:28,776 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-10-02 01:34:28,777 INFO L443 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-10-02 01:34:28,777 INFO L443 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-10-02 01:34:28,777 INFO L443 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-10-02 01:34:28,777 INFO L443 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-10-02 01:34:28,777 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,777 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,777 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-10-02 01:34:28,777 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-10-02 01:34:28,777 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-10-02 01:34:28,778 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-10-02 01:34:28,778 INFO L443 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-10-02 01:34:28,778 INFO L443 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-10-02 01:34:28,778 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-10-02 01:34:28,778 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,778 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,778 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,778 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-10-02 01:34:28,778 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-10-02 01:34:28,778 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-10-02 01:34:28,779 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-10-02 01:34:28,779 INFO L443 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-10-02 01:34:28,779 INFO L443 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-10-02 01:34:28,779 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,779 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,779 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-10-02 01:34:28,779 INFO L443 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,779 INFO L443 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-10-02 01:34:28,779 INFO L443 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-10-02 01:34:28,779 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-10-02 01:34:28,780 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-10-02 01:34:28,780 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-10-02 01:34:28,780 INFO L443 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-10-02 01:34:28,780 INFO L443 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-10-02 01:34:28,780 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-10-02 01:34:28,780 INFO L443 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-10-02 01:34:28,780 INFO L443 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-10-02 01:34:28,780 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,780 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,780 INFO L443 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,781 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-10-02 01:34:28,781 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-10-02 01:34:28,781 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-10-02 01:34:28,781 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-10-02 01:34:28,781 INFO L443 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-10-02 01:34:28,781 INFO L443 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-10-02 01:34:28,781 INFO L443 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-10-02 01:34:28,781 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-10-02 01:34:28,781 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,782 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,782 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,782 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-10-02 01:34:28,782 INFO L443 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-10-02 01:34:28,782 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-10-02 01:34:28,782 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-10-02 01:34:28,782 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-10-02 01:34:28,782 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-10-02 01:34:28,782 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-10-02 01:34:28,782 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-10-02 01:34:28,782 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,783 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,783 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,783 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-10-02 01:34:28,783 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-10-02 01:34:28,783 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-10-02 01:34:28,783 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-10-02 01:34:28,783 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-10-02 01:34:28,783 INFO L443 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-10-02 01:34:28,783 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-10-02 01:34:28,784 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-10-02 01:34:28,784 INFO L443 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-10-02 01:34:28,784 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,784 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,784 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:34:28,784 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-10-02 01:34:28,784 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-10-02 01:34:28,784 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-02 01:34:28,784 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-10-02 01:34:28,785 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-10-02 01:34:28,785 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 01:34:28,785 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a15~0 8) (= ~a24~0 1) (= ~a21~0 7) (<= (+ ~a12~0 49) 0)) [2019-10-02 01:34:28,785 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 01:34:28,785 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 01:34:28,785 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 874 890) the Hoare annotation is: (or (not (<= (+ |old(~a12~0)| 49) 0)) (not (= 8 |old(~a15~0)|)) (not (= 7 |old(~a21~0)|)) (not (= 1 |old(~a24~0)|)) (and (<= ~a12~0 |old(~a12~0)|) (<= |old(~a12~0)| ~a12~0) (= ~a15~0 |old(~a15~0)|) (= ~a24~0 1) (= ~a21~0 7))) [2019-10-02 01:34:28,785 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 874 890) no Hoare annotation was computed. [2019-10-02 01:34:28,786 INFO L439 ceAbstractionStarter]: At program point L888(line 888) the Hoare annotation is: (let ((.cse6 (not (= 8 |old(~a15~0)|))) (.cse11 (= ~a21~0 6))) (let ((.cse13 (not .cse11)) (.cse0 (<= ~a15~0 6)) (.cse9 (<= ~a12~0 11)) (.cse20 (or (not (= 10 |old(~a21~0)|)) (<= 0 (+ |old(~a12~0)| 42)) .cse6))) (let ((.cse16 (= ~a15~0 8)) (.cse21 (and (or (and .cse0 .cse13) (and .cse0 .cse9)) .cse20 (or (< 80 |old(~a12~0)|) (<= (+ |old(~a12~0)| 43) 0))))) (let ((.cse1 (= ~a21~0 9)) (.cse10 (= ~a15~0 |old(~a15~0)|)) (.cse14 (and .cse21 (<= ~a12~0 73281))) (.cse15 (<= 10 ~a21~0)) (.cse12 (<= ~a12~0 75)) (.cse17 (= ~a21~0 7)) (.cse18 (and .cse11 .cse21)) (.cse8 (= ~a24~0 |old(~a24~0)|)) (.cse2 (= ~a21~0 8)) (.cse7 (and .cse16 .cse20)) (.cse19 (= ~a15~0 5)) (.cse3 (= ~a24~0 1)) (.cse4 (= ~a15~0 9)) (.cse5 (< 80 ~a12~0))) (or (and .cse0 .cse1) (and (and .cse2 .cse3) .cse4 .cse5) .cse6 (and (and .cse7 (exists ((v_prenex_65 Int)) (and (<= ~a12~0 (+ (mod v_prenex_65 299959) 300039)) (< 80 v_prenex_65) (<= 0 v_prenex_65)))) .cse3 (= ~a21~0 10)) (and (and .cse3 .cse1) .cse4 .cse5) (and (and .cse8 .cse9 .cse1) .cse10) (and (and (and (<= ~a12~0 599997) .cse11) .cse3) .cse10) (= ~a15~0 7) (and (and (and .cse12 (< 22 ~a12~0) .cse1) .cse8) .cse10) (not (= 7 |old(~a21~0)|)) (and .cse13 (and .cse14 .cse8)) (and .cse15 .cse14) (not (<= (+ |old(~a12~0)| 49) 0)) (and (and .cse15 .cse3) .cse4 .cse5) (and (and (and .cse16 .cse17) .cse9) .cse3) (and (and .cse3 (and .cse15 .cse9)) .cse4) (and .cse12 .cse3 .cse2 .cse4) (and (<= (+ ~a12~0 45156) 0) .cse18) (and (and .cse3 .cse17) .cse4 .cse5) (and .cse18 .cse8 .cse19) (and (and .cse2 (and .cse7 (exists ((v_~a12~0_445 Int)) (and (< 11 v_~a12~0_445) (= (mod (+ v_~a12~0_445 3) 5) 0) (<= v_~a12~0_445 80) (<= ~a12~0 (div (+ v_~a12~0_445 366333) 5)))))) .cse3) (and .cse11 (<= 526013 ~a12~0) .cse19 .cse3) (not (= 1 |old(~a24~0)|)) (and (and .cse11 .cse3) .cse4 .cse5) (= ~a15~0 6)))))) [2019-10-02 01:34:28,786 INFO L443 ceAbstractionStarter]: For program point L888-1(line 888) no Hoare annotation was computed. [2019-10-02 01:34:28,786 INFO L443 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2019-10-02 01:34:28,787 INFO L439 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse6 (not (= 8 |old(~a15~0)|))) (.cse11 (= ~a21~0 6))) (let ((.cse13 (not .cse11)) (.cse0 (<= ~a15~0 6)) (.cse9 (<= ~a12~0 11)) (.cse20 (or (not (= 10 |old(~a21~0)|)) (<= 0 (+ |old(~a12~0)| 42)) .cse6))) (let ((.cse16 (= ~a15~0 8)) (.cse21 (and (or (and .cse0 .cse13) (and .cse0 .cse9)) .cse20 (or (< 80 |old(~a12~0)|) (<= (+ |old(~a12~0)| 43) 0))))) (let ((.cse1 (= ~a21~0 9)) (.cse10 (= ~a15~0 |old(~a15~0)|)) (.cse14 (and .cse21 (<= ~a12~0 73281))) (.cse15 (<= 10 ~a21~0)) (.cse12 (<= ~a12~0 75)) (.cse17 (= ~a21~0 7)) (.cse18 (and .cse11 .cse21)) (.cse8 (= ~a24~0 |old(~a24~0)|)) (.cse2 (= ~a21~0 8)) (.cse7 (and .cse16 .cse20)) (.cse19 (= ~a15~0 5)) (.cse3 (= ~a24~0 1)) (.cse4 (= ~a15~0 9)) (.cse5 (< 80 ~a12~0))) (or (and .cse0 .cse1) (and (and .cse2 .cse3) .cse4 .cse5) .cse6 (and (and .cse7 (exists ((v_prenex_65 Int)) (and (<= ~a12~0 (+ (mod v_prenex_65 299959) 300039)) (< 80 v_prenex_65) (<= 0 v_prenex_65)))) .cse3 (= ~a21~0 10)) (and (and .cse3 .cse1) .cse4 .cse5) (and (and .cse8 .cse9 .cse1) .cse10) (and (and (and (<= ~a12~0 599997) .cse11) .cse3) .cse10) (= ~a15~0 7) (and (and (and .cse12 (< 22 ~a12~0) .cse1) .cse8) .cse10) (not (= 7 |old(~a21~0)|)) (and .cse13 (and .cse14 .cse8)) (and .cse15 .cse14) (not (<= (+ |old(~a12~0)| 49) 0)) (and (and .cse15 .cse3) .cse4 .cse5) (and (and (and .cse16 .cse17) .cse9) .cse3) (and (and .cse3 (and .cse15 .cse9)) .cse4) (and .cse12 .cse3 .cse2 .cse4) (and (<= (+ ~a12~0 45156) 0) .cse18) (and (and .cse3 .cse17) .cse4 .cse5) (and .cse18 .cse8 .cse19) (and (and .cse2 (and .cse7 (exists ((v_~a12~0_445 Int)) (and (< 11 v_~a12~0_445) (= (mod (+ v_~a12~0_445 3) 5) 0) (<= v_~a12~0_445 80) (<= ~a12~0 (div (+ v_~a12~0_445 366333) 5)))))) .cse3) (and .cse11 (<= 526013 ~a12~0) .cse19 .cse3) (not (= 1 |old(~a24~0)|)) (and (and .cse11 .cse3) .cse4 .cse5) (= ~a15~0 6)))))) [2019-10-02 01:34:28,787 INFO L443 ceAbstractionStarter]: For program point L880-3(lines 874 890) no Hoare annotation was computed. [2019-10-02 01:34:28,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-10-02 01:34:28,799 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-10-02 01:34:28,799 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-10-02 01:34:28,801 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_445,QUANTIFIED] [2019-10-02 01:34:28,801 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_445,QUANTIFIED] [2019-10-02 01:34:28,801 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_445,QUANTIFIED] [2019-10-02 01:34:28,802 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_445,QUANTIFIED] [2019-10-02 01:34:28,813 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-10-02 01:34:28,813 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-10-02 01:34:28,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-10-02 01:34:28,815 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_445,QUANTIFIED] [2019-10-02 01:34:28,815 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_445,QUANTIFIED] [2019-10-02 01:34:28,815 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_445,QUANTIFIED] [2019-10-02 01:34:28,815 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_445,QUANTIFIED] [2019-10-02 01:34:28,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 01:34:28 BoogieIcfgContainer [2019-10-02 01:34:28,820 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 01:34:28,822 INFO L168 Benchmark]: Toolchain (without parser) took 821583.93 ms. Allocated memory was 140.0 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 85.6 MB in the beginning and 1.0 GB in the end (delta: -945.3 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-10-02 01:34:28,823 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 140.0 MB. Free memory was 106.0 MB in the beginning and 105.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 01:34:28,823 INFO L168 Benchmark]: CACSL2BoogieTranslator took 748.00 ms. Allocated memory was 140.0 MB in the beginning and 202.4 MB in the end (delta: 62.4 MB). Free memory was 85.4 MB in the beginning and 159.0 MB in the end (delta: -73.6 MB). Peak memory consumption was 29.2 MB. Max. memory is 7.1 GB. [2019-10-02 01:34:28,824 INFO L168 Benchmark]: Boogie Preprocessor took 134.61 ms. Allocated memory is still 202.4 MB. Free memory was 159.0 MB in the beginning and 153.7 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 7.1 GB. [2019-10-02 01:34:28,825 INFO L168 Benchmark]: RCFGBuilder took 1446.06 ms. Allocated memory was 202.4 MB in the beginning and 227.0 MB in the end (delta: 24.6 MB). Free memory was 153.7 MB in the beginning and 148.5 MB in the end (delta: 5.2 MB). Peak memory consumption was 83.3 MB. Max. memory is 7.1 GB. [2019-10-02 01:34:28,825 INFO L168 Benchmark]: TraceAbstraction took 819249.93 ms. Allocated memory was 227.0 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 147.1 MB in the beginning and 1.0 GB in the end (delta: -883.8 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-10-02 01:34:28,829 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 140.0 MB. Free memory was 106.0 MB in the beginning and 105.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 748.00 ms. Allocated memory was 140.0 MB in the beginning and 202.4 MB in the end (delta: 62.4 MB). Free memory was 85.4 MB in the beginning and 159.0 MB in the end (delta: -73.6 MB). Peak memory consumption was 29.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 134.61 ms. Allocated memory is still 202.4 MB. Free memory was 159.0 MB in the beginning and 153.7 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1446.06 ms. Allocated memory was 202.4 MB in the beginning and 227.0 MB in the end (delta: 24.6 MB). Free memory was 153.7 MB in the beginning and 148.5 MB in the end (delta: 5.2 MB). Peak memory consumption was 83.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 819249.93 ms. Allocated memory was 227.0 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 147.1 MB in the beginning and 1.0 GB in the end (delta: -883.8 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_445,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_445,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_445,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_445,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_445,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_445,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_445,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_445,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 139]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 880]: Loop Invariant [2019-10-02 01:34:28,837 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-10-02 01:34:28,838 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-10-02 01:34:28,838 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-10-02 01:34:28,839 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_445,QUANTIFIED] [2019-10-02 01:34:28,839 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_445,QUANTIFIED] [2019-10-02 01:34:28,839 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_445,QUANTIFIED] [2019-10-02 01:34:28,840 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_445,QUANTIFIED] [2019-10-02 01:34:28,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-10-02 01:34:28,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-10-02 01:34:28,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_65,QUANTIFIED] [2019-10-02 01:34:28,843 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_445,QUANTIFIED] [2019-10-02 01:34:28,843 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_445,QUANTIFIED] [2019-10-02 01:34:28,843 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_445,QUANTIFIED] [2019-10-02 01:34:28,843 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_445,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((a15 <= 6 && a21 == 9) || (((a21 == 8 && a24 == 1) && a15 == 9) && 80 < a12)) || !(8 == \old(a15))) || ((((a15 == 8 && ((!(10 == \old(a21)) || 0 <= \old(a12) + 42) || !(8 == \old(a15)))) && (\exists v_prenex_65 : int :: (a12 <= v_prenex_65 % 299959 + 300039 && 80 < v_prenex_65) && 0 <= v_prenex_65)) && a24 == 1) && a21 == 10)) || (((a24 == 1 && a21 == 9) && a15 == 9) && 80 < a12)) || (((a24 == \old(a24) && a12 <= 11) && a21 == 9) && a15 == \old(a15))) || (((a12 <= 599997 && a21 == 6) && a24 == 1) && a15 == \old(a15))) || a15 == 7) || ((((a12 <= 75 && 22 < a12) && a21 == 9) && a24 == \old(a24)) && a15 == \old(a15))) || !(7 == \old(a21))) || (!(a21 == 6) && (((((a15 <= 6 && !(a21 == 6)) || (a15 <= 6 && a12 <= 11)) && ((!(10 == \old(a21)) || 0 <= \old(a12) + 42) || !(8 == \old(a15)))) && (80 < \old(a12) || \old(a12) + 43 <= 0)) && a12 <= 73281) && a24 == \old(a24))) || (10 <= a21 && ((((a15 <= 6 && !(a21 == 6)) || (a15 <= 6 && a12 <= 11)) && ((!(10 == \old(a21)) || 0 <= \old(a12) + 42) || !(8 == \old(a15)))) && (80 < \old(a12) || \old(a12) + 43 <= 0)) && a12 <= 73281)) || !(\old(a12) + 49 <= 0)) || (((10 <= a21 && a24 == 1) && a15 == 9) && 80 < a12)) || (((a15 == 8 && a21 == 7) && a12 <= 11) && a24 == 1)) || ((a24 == 1 && 10 <= a21 && a12 <= 11) && a15 == 9)) || (((a12 <= 75 && a24 == 1) && a21 == 8) && a15 == 9)) || (a12 + 45156 <= 0 && a21 == 6 && (((a15 <= 6 && !(a21 == 6)) || (a15 <= 6 && a12 <= 11)) && ((!(10 == \old(a21)) || 0 <= \old(a12) + 42) || !(8 == \old(a15)))) && (80 < \old(a12) || \old(a12) + 43 <= 0))) || (((a24 == 1 && a21 == 7) && a15 == 9) && 80 < a12)) || (((a21 == 6 && (((a15 <= 6 && !(a21 == 6)) || (a15 <= 6 && a12 <= 11)) && ((!(10 == \old(a21)) || 0 <= \old(a12) + 42) || !(8 == \old(a15)))) && (80 < \old(a12) || \old(a12) + 43 <= 0)) && a24 == \old(a24)) && a15 == 5)) || ((a21 == 8 && (a15 == 8 && ((!(10 == \old(a21)) || 0 <= \old(a12) + 42) || !(8 == \old(a15)))) && (\exists v_~a12~0_445 : int :: ((11 < v_~a12~0_445 && (v_~a12~0_445 + 3) % 5 == 0) && v_~a12~0_445 <= 80) && a12 <= (v_~a12~0_445 + 366333) / 5)) && a24 == 1)) || (((a21 == 6 && 526013 <= a12) && a15 == 5) && a24 == 1)) || !(1 == \old(a24))) || (((a21 == 6 && a24 == 1) && a15 == 9) && 80 < a12)) || a15 == 6 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 254 locations, 1 error locations. SAFE Result, 819.1s OverallTime, 17 OverallIterations, 16 TraceHistogramMax, 564.2s AutomataDifference, 0.0s DeadEndRemovalTime, 22.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 791 SDtfs, 51076 SDslu, 2962 SDs, 0 SdLazy, 56731 SolverSat, 7443 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 69.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13385 GetRequests, 12709 SyntacticMatches, 18 SemanticMatches, 658 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11107 ImplicationChecksByTransitivity, 669.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6346occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 17 MinimizatonAttempts, 7182 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 545 PreInvPairs, 719 NumberOfFragments, 1885 HoareAnnotationTreeSize, 545 FomulaSimplifications, 12045341 FormulaSimplificationTreeSizeReduction, 3.6s HoareSimplificationTime, 7 FomulaSimplificationsInter, 837673 FormulaSimplificationTreeSizeReductionInter, 18.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.9s SsaConstructionTime, 4.0s SatisfiabilityAnalysisTime, 204.7s InterpolantComputationTime, 25008 NumberOfCodeBlocks, 25008 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 24976 ConstructedInterpolants, 24 QuantifiedInterpolants, 102138840 SizeOfPredicates, 15 NumberOfNonLiveVariables, 17704 ConjunctsInSsa, 120 ConjunctsInUnsatCore, 32 InterpolantComputations, 4 PerfectInterpolantSequences, 71595/83860 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...