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/Problem03_label54.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 00:52:31,212 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 00:52:31,214 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 00:52:31,227 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 00:52:31,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 00:52:31,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 00:52:31,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 00:52:31,231 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 00:52:31,233 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 00:52:31,234 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 00:52:31,235 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 00:52:31,236 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 00:52:31,237 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 00:52:31,238 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 00:52:31,239 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 00:52:31,240 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 00:52:31,240 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 00:52:31,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 00:52:31,243 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 00:52:31,245 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 00:52:31,247 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 00:52:31,248 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 00:52:31,249 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 00:52:31,250 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 00:52:31,253 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 00:52:31,253 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 00:52:31,254 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 00:52:31,255 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 00:52:31,255 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 00:52:31,256 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 00:52:31,256 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 00:52:31,257 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 00:52:31,258 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 00:52:31,259 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 00:52:31,260 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 00:52:31,260 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 00:52:31,261 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 00:52:31,261 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 00:52:31,261 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 00:52:31,263 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 00:52:31,263 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 00:52:31,264 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 00:52:31,279 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 00:52:31,279 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 00:52:31,281 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 00:52:31,281 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 00:52:31,281 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 00:52:31,281 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 00:52:31,282 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 00:52:31,282 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 00:52:31,282 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 00:52:31,282 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 00:52:31,282 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 00:52:31,283 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 00:52:31,283 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 00:52:31,283 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 00:52:31,283 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 00:52:31,283 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 00:52:31,283 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 00:52:31,284 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 00:52:31,284 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 00:52:31,284 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 00:52:31,284 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 00:52:31,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 00:52:31,285 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 00:52:31,285 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 00:52:31,285 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 00:52:31,285 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 00:52:31,286 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 00:52:31,286 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 00:52:31,286 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 00:52:31,314 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 00:52:31,326 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 00:52:31,329 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 00:52:31,331 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 00:52:31,331 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 00:52:31,332 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label54.c [2019-10-02 00:52:31,392 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a0a02008/5d1087ee8d57483fba6429e96d9e848f/FLAG800bafa8b [2019-10-02 00:52:32,065 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 00:52:32,066 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label54.c [2019-10-02 00:52:32,087 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a0a02008/5d1087ee8d57483fba6429e96d9e848f/FLAG800bafa8b [2019-10-02 00:52:32,227 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a0a02008/5d1087ee8d57483fba6429e96d9e848f [2019-10-02 00:52:32,237 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 00:52:32,239 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 00:52:32,240 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 00:52:32,240 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 00:52:32,244 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 00:52:32,245 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:52:32" (1/1) ... [2019-10-02 00:52:32,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bde006e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:52:32, skipping insertion in model container [2019-10-02 00:52:32,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:52:32" (1/1) ... [2019-10-02 00:52:32,256 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 00:52:32,336 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 00:52:33,147 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 00:52:33,160 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 00:52:33,521 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 00:52:33,548 INFO L192 MainTranslator]: Completed translation [2019-10-02 00:52:33,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:52:33 WrapperNode [2019-10-02 00:52:33,549 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 00:52:33,549 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 00:52:33,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 00:52:33,550 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 00:52:33,563 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:52:33" (1/1) ... [2019-10-02 00:52:33,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:52:33" (1/1) ... [2019-10-02 00:52:33,592 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:52:33" (1/1) ... [2019-10-02 00:52:33,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:52:33" (1/1) ... [2019-10-02 00:52:33,650 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:52:33" (1/1) ... [2019-10-02 00:52:33,666 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:52:33" (1/1) ... [2019-10-02 00:52:33,677 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:52:33" (1/1) ... [2019-10-02 00:52:33,691 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 00:52:33,692 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 00:52:33,692 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 00:52:33,692 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 00:52:33,693 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:52:33" (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 00:52:33,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 00:52:33,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 00:52:33,764 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 00:52:33,765 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 00:52:33,765 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 00:52:33,765 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 00:52:33,765 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 00:52:33,766 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 00:52:33,766 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 00:52:33,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 00:52:33,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 00:52:35,742 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 00:52:35,742 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 00:52:35,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:52:35 BoogieIcfgContainer [2019-10-02 00:52:35,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 00:52:35,746 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 00:52:35,748 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 00:52:35,752 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 00:52:35,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:52:32" (1/3) ... [2019-10-02 00:52:35,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5394cf0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:52:35, skipping insertion in model container [2019-10-02 00:52:35,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:52:33" (2/3) ... [2019-10-02 00:52:35,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5394cf0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:52:35, skipping insertion in model container [2019-10-02 00:52:35,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:52:35" (3/3) ... [2019-10-02 00:52:35,757 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label54.c [2019-10-02 00:52:35,769 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 00:52:35,780 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 00:52:35,802 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 00:52:35,854 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 00:52:35,855 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 00:52:35,855 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 00:52:35,855 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 00:52:35,856 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 00:52:35,856 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 00:52:35,856 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 00:52:35,856 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 00:52:35,856 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 00:52:35,890 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states. [2019-10-02 00:52:35,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-02 00:52:35,910 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:52:35,911 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:52:35,913 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:52:35,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:52:35,919 INFO L82 PathProgramCache]: Analyzing trace with hash -629671171, now seen corresponding path program 1 times [2019-10-02 00:52:35,921 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:52:35,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:52:35,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:52:35,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:52:35,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:52:36,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:52:36,787 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 00:52:36,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:52:36,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 00:52:36,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 00:52:36,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 00:52:36,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:52:36,813 INFO L87 Difference]: Start difference. First operand 311 states. Second operand 3 states. [2019-10-02 00:52:38,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:52:38,209 INFO L93 Difference]: Finished difference Result 845 states and 1488 transitions. [2019-10-02 00:52:38,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 00:52:38,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-10-02 00:52:38,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:52:38,250 INFO L225 Difference]: With dead ends: 845 [2019-10-02 00:52:38,250 INFO L226 Difference]: Without dead ends: 472 [2019-10-02 00:52:38,264 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:52:38,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-10-02 00:52:38,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 470. [2019-10-02 00:52:38,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-10-02 00:52:38,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 716 transitions. [2019-10-02 00:52:38,372 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 716 transitions. Word has length 172 [2019-10-02 00:52:38,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:52:38,374 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 716 transitions. [2019-10-02 00:52:38,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 00:52:38,374 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 716 transitions. [2019-10-02 00:52:38,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-02 00:52:38,381 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:52:38,381 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:52:38,381 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:52:38,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:52:38,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1631480425, now seen corresponding path program 1 times [2019-10-02 00:52:38,382 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:52:38,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:52:38,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:52:38,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:52:38,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:52:38,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:52:38,653 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:52:38,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:52:38,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 00:52:38,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 00:52:38,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 00:52:38,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:52:38,658 INFO L87 Difference]: Start difference. First operand 470 states and 716 transitions. Second operand 3 states. [2019-10-02 00:52:39,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:52:39,836 INFO L93 Difference]: Finished difference Result 1358 states and 2098 transitions. [2019-10-02 00:52:39,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 00:52:39,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-10-02 00:52:39,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:52:39,846 INFO L225 Difference]: With dead ends: 1358 [2019-10-02 00:52:39,846 INFO L226 Difference]: Without dead ends: 894 [2019-10-02 00:52:39,848 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:52:39,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-10-02 00:52:39,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 888. [2019-10-02 00:52:39,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2019-10-02 00:52:39,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1298 transitions. [2019-10-02 00:52:39,889 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1298 transitions. Word has length 184 [2019-10-02 00:52:39,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:52:39,890 INFO L475 AbstractCegarLoop]: Abstraction has 888 states and 1298 transitions. [2019-10-02 00:52:39,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 00:52:39,890 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1298 transitions. [2019-10-02 00:52:39,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-02 00:52:39,898 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:52:39,898 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:52:39,899 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:52:39,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:52:39,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1113294976, now seen corresponding path program 1 times [2019-10-02 00:52:39,899 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:52:39,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:52:39,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:52:39,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:52:39,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:52:39,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:52:40,052 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:52:40,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:52:40,053 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 00:52:40,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:52:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:52:40,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 1020 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 00:52:40,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:52:40,546 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:52:40,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:52:40,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-10-02 00:52:40,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 00:52:40,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 00:52:40,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-02 00:52:40,570 INFO L87 Difference]: Start difference. First operand 888 states and 1298 transitions. Second operand 8 states. [2019-10-02 00:52:43,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:52:43,604 INFO L93 Difference]: Finished difference Result 3530 states and 5559 transitions. [2019-10-02 00:52:43,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 00:52:43,605 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 194 [2019-10-02 00:52:43,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:52:43,633 INFO L225 Difference]: With dead ends: 3530 [2019-10-02 00:52:43,634 INFO L226 Difference]: Without dead ends: 2648 [2019-10-02 00:52:43,639 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-10-02 00:52:43,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2648 states. [2019-10-02 00:52:43,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 2592. [2019-10-02 00:52:43,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2592 states. [2019-10-02 00:52:43,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2592 states to 2592 states and 3450 transitions. [2019-10-02 00:52:43,795 INFO L78 Accepts]: Start accepts. Automaton has 2592 states and 3450 transitions. Word has length 194 [2019-10-02 00:52:43,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:52:43,797 INFO L475 AbstractCegarLoop]: Abstraction has 2592 states and 3450 transitions. [2019-10-02 00:52:43,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 00:52:43,798 INFO L276 IsEmpty]: Start isEmpty. Operand 2592 states and 3450 transitions. [2019-10-02 00:52:43,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-10-02 00:52:43,809 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:52:43,810 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:52:43,810 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:52:43,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:52:43,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1137241398, now seen corresponding path program 1 times [2019-10-02 00:52:43,811 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:52:43,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:52:43,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:52:43,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:52:43,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:52:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:52:44,127 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:52:44,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:52:44,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 00:52:44,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 00:52:44,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 00:52:44,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 00:52:44,131 INFO L87 Difference]: Start difference. First operand 2592 states and 3450 transitions. Second operand 6 states. [2019-10-02 00:52:45,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:52:45,832 INFO L93 Difference]: Finished difference Result 7824 states and 11052 transitions. [2019-10-02 00:52:45,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 00:52:45,833 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 206 [2019-10-02 00:52:45,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:52:45,869 INFO L225 Difference]: With dead ends: 7824 [2019-10-02 00:52:45,869 INFO L226 Difference]: Without dead ends: 5238 [2019-10-02 00:52:45,879 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 00:52:45,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5238 states. [2019-10-02 00:52:46,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5238 to 5178. [2019-10-02 00:52:46,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5178 states. [2019-10-02 00:52:46,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5178 states to 5178 states and 7065 transitions. [2019-10-02 00:52:46,105 INFO L78 Accepts]: Start accepts. Automaton has 5178 states and 7065 transitions. Word has length 206 [2019-10-02 00:52:46,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:52:46,106 INFO L475 AbstractCegarLoop]: Abstraction has 5178 states and 7065 transitions. [2019-10-02 00:52:46,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 00:52:46,106 INFO L276 IsEmpty]: Start isEmpty. Operand 5178 states and 7065 transitions. [2019-10-02 00:52:46,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-02 00:52:46,123 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:52:46,124 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:52:46,124 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:52:46,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:52:46,125 INFO L82 PathProgramCache]: Analyzing trace with hash 928057599, now seen corresponding path program 1 times [2019-10-02 00:52:46,125 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:52:46,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:52:46,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:52:46,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:52:46,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:52:46,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:52:46,260 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 38 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:52:46,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:52:46,261 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 00:52:46,294 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 00:52:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:52:46,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 00:52:46,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:52:46,568 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 00:52:46,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 00:52:46,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-02 00:52:46,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 00:52:46,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 00:52:46,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 00:52:46,576 INFO L87 Difference]: Start difference. First operand 5178 states and 7065 transitions. Second operand 7 states. [2019-10-02 00:52:48,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:52:48,207 INFO L93 Difference]: Finished difference Result 10301 states and 14141 transitions. [2019-10-02 00:52:48,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 00:52:48,208 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 208 [2019-10-02 00:52:48,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:52:48,230 INFO L225 Difference]: With dead ends: 10301 [2019-10-02 00:52:48,230 INFO L226 Difference]: Without dead ends: 5129 [2019-10-02 00:52:48,244 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-02 00:52:48,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5129 states. [2019-10-02 00:52:48,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5129 to 5129. [2019-10-02 00:52:48,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5129 states. [2019-10-02 00:52:48,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5129 states to 5129 states and 6546 transitions. [2019-10-02 00:52:48,373 INFO L78 Accepts]: Start accepts. Automaton has 5129 states and 6546 transitions. Word has length 208 [2019-10-02 00:52:48,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:52:48,374 INFO L475 AbstractCegarLoop]: Abstraction has 5129 states and 6546 transitions. [2019-10-02 00:52:48,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 00:52:48,374 INFO L276 IsEmpty]: Start isEmpty. Operand 5129 states and 6546 transitions. [2019-10-02 00:52:48,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-10-02 00:52:48,390 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:52:48,390 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:52:48,391 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:52:48,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:52:48,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1051688855, now seen corresponding path program 1 times [2019-10-02 00:52:48,391 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:52:48,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:52:48,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:52:48,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:52:48,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:52:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:52:48,730 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:52:48,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:52:48,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 00:52:48,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 00:52:48,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 00:52:48,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:52:48,733 INFO L87 Difference]: Start difference. First operand 5129 states and 6546 transitions. Second operand 3 states. [2019-10-02 00:52:49,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:52:49,785 INFO L93 Difference]: Finished difference Result 14859 states and 19165 transitions. [2019-10-02 00:52:49,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 00:52:49,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 250 [2019-10-02 00:52:49,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:52:49,830 INFO L225 Difference]: With dead ends: 14859 [2019-10-02 00:52:49,831 INFO L226 Difference]: Without dead ends: 9736 [2019-10-02 00:52:49,846 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:52:49,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9736 states. [2019-10-02 00:52:50,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9736 to 9729. [2019-10-02 00:52:50,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9729 states. [2019-10-02 00:52:50,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9729 states to 9729 states and 12396 transitions. [2019-10-02 00:52:50,086 INFO L78 Accepts]: Start accepts. Automaton has 9729 states and 12396 transitions. Word has length 250 [2019-10-02 00:52:50,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:52:50,087 INFO L475 AbstractCegarLoop]: Abstraction has 9729 states and 12396 transitions. [2019-10-02 00:52:50,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 00:52:50,087 INFO L276 IsEmpty]: Start isEmpty. Operand 9729 states and 12396 transitions. [2019-10-02 00:52:50,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-10-02 00:52:50,121 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:52:50,121 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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:52:50,122 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:52:50,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:52:50,122 INFO L82 PathProgramCache]: Analyzing trace with hash -542177067, now seen corresponding path program 1 times [2019-10-02 00:52:50,122 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:52:50,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:52:50,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:52:50,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:52:50,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:52:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:52:50,409 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 149 proven. 71 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 00:52:50,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:52:50,409 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) [2019-10-02 00:52:50,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:52:50,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:52:50,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 1147 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 00:52:50,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:52:50,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:52:50,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 00:52:50,894 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-02 00:52:50,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 00:52:50,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2019-10-02 00:52:50,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 00:52:50,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 00:52:50,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-10-02 00:52:50,907 INFO L87 Difference]: Start difference. First operand 9729 states and 12396 transitions. Second operand 11 states. [2019-10-02 00:52:54,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:52:54,799 INFO L93 Difference]: Finished difference Result 20773 states and 27767 transitions. [2019-10-02 00:52:54,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 00:52:54,799 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 329 [2019-10-02 00:52:54,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:52:54,857 INFO L225 Difference]: With dead ends: 20773 [2019-10-02 00:52:54,857 INFO L226 Difference]: Without dead ends: 11050 [2019-10-02 00:52:54,879 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 337 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2019-10-02 00:52:54,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11050 states. [2019-10-02 00:52:55,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11050 to 10837. [2019-10-02 00:52:55,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10837 states. [2019-10-02 00:52:55,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10837 states to 10837 states and 13856 transitions. [2019-10-02 00:52:55,206 INFO L78 Accepts]: Start accepts. Automaton has 10837 states and 13856 transitions. Word has length 329 [2019-10-02 00:52:55,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:52:55,206 INFO L475 AbstractCegarLoop]: Abstraction has 10837 states and 13856 transitions. [2019-10-02 00:52:55,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 00:52:55,207 INFO L276 IsEmpty]: Start isEmpty. Operand 10837 states and 13856 transitions. [2019-10-02 00:52:55,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-10-02 00:52:55,247 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:52:55,247 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:52:55,248 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:52:55,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:52:55,248 INFO L82 PathProgramCache]: Analyzing trace with hash -58127704, now seen corresponding path program 1 times [2019-10-02 00:52:55,248 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:52:55,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:52:55,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:52:55,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:52:55,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:52:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:52:55,735 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 153 proven. 75 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 00:52:55,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:52:55,735 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:52:55,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:52:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:52:56,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 1143 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 00:52:56,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:52:56,167 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-02 00:52:56,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 00:52:56,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 00:52:56,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 00:52:56,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 00:52:56,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 00:52:56,184 INFO L87 Difference]: Start difference. First operand 10837 states and 13856 transitions. Second operand 9 states. [2019-10-02 00:52:59,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:52:59,346 INFO L93 Difference]: Finished difference Result 26195 states and 34432 transitions. [2019-10-02 00:52:59,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 00:52:59,347 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 331 [2019-10-02 00:52:59,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:52:59,416 INFO L225 Difference]: With dead ends: 26195 [2019-10-02 00:52:59,416 INFO L226 Difference]: Without dead ends: 16451 [2019-10-02 00:52:59,444 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 338 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2019-10-02 00:52:59,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16451 states. [2019-10-02 00:52:59,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16451 to 15067. [2019-10-02 00:52:59,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15067 states. [2019-10-02 00:52:59,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15067 states to 15067 states and 18933 transitions. [2019-10-02 00:52:59,833 INFO L78 Accepts]: Start accepts. Automaton has 15067 states and 18933 transitions. Word has length 331 [2019-10-02 00:52:59,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:52:59,833 INFO L475 AbstractCegarLoop]: Abstraction has 15067 states and 18933 transitions. [2019-10-02 00:52:59,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 00:52:59,834 INFO L276 IsEmpty]: Start isEmpty. Operand 15067 states and 18933 transitions. [2019-10-02 00:52:59,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-10-02 00:52:59,888 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:52:59,888 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:52:59,889 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:52:59,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:52:59,889 INFO L82 PathProgramCache]: Analyzing trace with hash -781538971, now seen corresponding path program 1 times [2019-10-02 00:52:59,889 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:52:59,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:52:59,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:52:59,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:52:59,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:52:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:53:00,425 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-02 00:53:00,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:53:00,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 00:53:00,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 00:53:00,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 00:53:00,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:53:00,428 INFO L87 Difference]: Start difference. First operand 15067 states and 18933 transitions. Second operand 3 states. [2019-10-02 00:53:01,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:53:01,534 INFO L93 Difference]: Finished difference Result 35779 states and 45408 transitions. [2019-10-02 00:53:01,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 00:53:01,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 350 [2019-10-02 00:53:01,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:53:01,601 INFO L225 Difference]: With dead ends: 35779 [2019-10-02 00:53:01,602 INFO L226 Difference]: Without dead ends: 20718 [2019-10-02 00:53:01,640 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:53:01,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20718 states. [2019-10-02 00:53:02,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20718 to 20499. [2019-10-02 00:53:02,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20499 states. [2019-10-02 00:53:02,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20499 states to 20499 states and 25894 transitions. [2019-10-02 00:53:02,077 INFO L78 Accepts]: Start accepts. Automaton has 20499 states and 25894 transitions. Word has length 350 [2019-10-02 00:53:02,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:53:02,078 INFO L475 AbstractCegarLoop]: Abstraction has 20499 states and 25894 transitions. [2019-10-02 00:53:02,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 00:53:02,078 INFO L276 IsEmpty]: Start isEmpty. Operand 20499 states and 25894 transitions. [2019-10-02 00:53:02,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2019-10-02 00:53:02,127 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:53:02,127 INFO L411 BasicCegarLoop]: trace histogram [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, 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, 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] [2019-10-02 00:53:02,128 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:53:02,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:53:02,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1606415275, now seen corresponding path program 1 times [2019-10-02 00:53:02,128 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:53:02,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:53:02,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:53:02,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:53:02,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:53:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:53:02,606 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 221 proven. 11 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-02 00:53:02,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:53:02,607 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) [2019-10-02 00:53:02,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:53:02,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:53:02,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 1488 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 00:53:02,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:53:02,973 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 260 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-10-02 00:53:02,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:53:02,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-10-02 00:53:02,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 00:53:02,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 00:53:02,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-02 00:53:02,984 INFO L87 Difference]: Start difference. First operand 20499 states and 25894 transitions. Second operand 7 states. [2019-10-02 00:53:06,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:53:06,705 INFO L93 Difference]: Finished difference Result 51904 states and 69717 transitions. [2019-10-02 00:53:06,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 00:53:06,705 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 374 [2019-10-02 00:53:06,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:53:06,849 INFO L225 Difference]: With dead ends: 51904 [2019-10-02 00:53:06,849 INFO L226 Difference]: Without dead ends: 31850 [2019-10-02 00:53:06,895 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-10-02 00:53:06,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31850 states. [2019-10-02 00:53:07,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31850 to 30844. [2019-10-02 00:53:07,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30844 states. [2019-10-02 00:53:07,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30844 states to 30844 states and 38526 transitions. [2019-10-02 00:53:07,723 INFO L78 Accepts]: Start accepts. Automaton has 30844 states and 38526 transitions. Word has length 374 [2019-10-02 00:53:07,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:53:07,724 INFO L475 AbstractCegarLoop]: Abstraction has 30844 states and 38526 transitions. [2019-10-02 00:53:07,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 00:53:07,724 INFO L276 IsEmpty]: Start isEmpty. Operand 30844 states and 38526 transitions. [2019-10-02 00:53:07,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2019-10-02 00:53:07,822 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:53:07,823 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:07,824 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:53:07,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:53:07,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1542150461, now seen corresponding path program 1 times [2019-10-02 00:53:07,825 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:53:07,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:53:07,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:53:07,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:53:07,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:53:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:53:09,294 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 329 proven. 26 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2019-10-02 00:53:09,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:53:09,294 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 00:53:09,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:53:09,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:53:09,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 1915 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 00:53:09,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:53:09,879 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 517 proven. 14 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-10-02 00:53:09,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:53:09,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-10-02 00:53:09,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 00:53:09,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 00:53:09,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 00:53:09,895 INFO L87 Difference]: Start difference. First operand 30844 states and 38526 transitions. Second operand 8 states. [2019-10-02 00:53:15,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:53:15,475 INFO L93 Difference]: Finished difference Result 60115 states and 79399 transitions. [2019-10-02 00:53:15,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-02 00:53:15,476 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 499 [2019-10-02 00:53:15,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:53:15,478 INFO L225 Difference]: With dead ends: 60115 [2019-10-02 00:53:15,478 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 00:53:15,653 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 529 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=322, Invalid=1318, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 00:53:15,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 00:53:15,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 00:53:15,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 00:53:15,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 00:53:15,655 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 499 [2019-10-02 00:53:15,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:53:15,655 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 00:53:15,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 00:53:15,656 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 00:53:15,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 00:53:15,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 00:53:21,609 WARN L191 SmtUtils]: Spent 5.07 s on a formula simplification. DAG size of input: 884 DAG size of output: 525 [2019-10-02 00:53:24,267 WARN L191 SmtUtils]: Spent 2.65 s on a formula simplification. DAG size of input: 884 DAG size of output: 525 [2019-10-02 00:53:26,976 WARN L191 SmtUtils]: Spent 2.53 s on a formula simplification. DAG size of input: 354 DAG size of output: 85 [2019-10-02 00:53:32,335 WARN L191 SmtUtils]: Spent 5.32 s on a formula simplification. DAG size of input: 495 DAG size of output: 56 [2019-10-02 00:53:37,609 WARN L191 SmtUtils]: Spent 5.27 s on a formula simplification. DAG size of input: 495 DAG size of output: 56 [2019-10-02 00:53:37,612 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 00:53:37,612 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a12~0 |old(~a12~0)|) (= ~a11~0 |old(~a11~0)|) (= ~a27~0 |old(~a27~0)|) (= ~a5~0 |old(~a5~0)|) (= ~a0~0 |old(~a0~0)|) (= ~a26~0 |old(~a26~0)|) (= ~a3~0 |old(~a3~0)|)) [2019-10-02 00:53:37,612 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 00:53:37,612 INFO L443 ceAbstractionStarter]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-10-02 00:53:37,612 INFO L443 ceAbstractionStarter]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-10-02 00:53:37,612 INFO L443 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,613 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,613 INFO L443 ceAbstractionStarter]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,613 INFO L443 ceAbstractionStarter]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,613 INFO L443 ceAbstractionStarter]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,613 INFO L443 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,613 INFO L443 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,613 INFO L443 ceAbstractionStarter]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-10-02 00:53:37,613 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,613 INFO L443 ceAbstractionStarter]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-10-02 00:53:37,614 INFO L443 ceAbstractionStarter]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-10-02 00:53:37,614 INFO L443 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,614 INFO L443 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,614 INFO L443 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,614 INFO L443 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,614 INFO L443 ceAbstractionStarter]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-10-02 00:53:37,614 INFO L443 ceAbstractionStarter]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-10-02 00:53:37,615 INFO L443 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,615 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,615 INFO L443 ceAbstractionStarter]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,615 INFO L443 ceAbstractionStarter]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,615 INFO L443 ceAbstractionStarter]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,615 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,615 INFO L443 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,615 INFO L443 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,616 INFO L443 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,616 INFO L443 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,616 INFO L443 ceAbstractionStarter]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-10-02 00:53:37,616 INFO L443 ceAbstractionStarter]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-10-02 00:53:37,616 INFO L443 ceAbstractionStarter]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-10-02 00:53:37,616 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,616 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,616 INFO L443 ceAbstractionStarter]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,617 INFO L443 ceAbstractionStarter]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,617 INFO L443 ceAbstractionStarter]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,617 INFO L443 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,617 INFO L443 ceAbstractionStarter]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-10-02 00:53:37,617 INFO L443 ceAbstractionStarter]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-10-02 00:53:37,617 INFO L443 ceAbstractionStarter]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-10-02 00:53:37,617 INFO L443 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,617 INFO L443 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,617 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,618 INFO L443 ceAbstractionStarter]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,618 INFO L443 ceAbstractionStarter]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,618 INFO L443 ceAbstractionStarter]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,618 INFO L443 ceAbstractionStarter]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-10-02 00:53:37,618 INFO L443 ceAbstractionStarter]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-10-02 00:53:37,618 INFO L443 ceAbstractionStarter]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-10-02 00:53:37,618 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,618 INFO L443 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,619 INFO L443 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,619 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-10-02 00:53:37,619 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,619 INFO L443 ceAbstractionStarter]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-10-02 00:53:37,619 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,619 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,619 INFO L443 ceAbstractionStarter]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-10-02 00:53:37,619 INFO L443 ceAbstractionStarter]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-10-02 00:53:37,620 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,620 INFO L443 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,620 INFO L443 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,620 INFO L443 ceAbstractionStarter]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,620 INFO L443 ceAbstractionStarter]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,620 INFO L443 ceAbstractionStarter]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,620 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,620 INFO L443 ceAbstractionStarter]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-10-02 00:53:37,620 INFO L443 ceAbstractionStarter]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-10-02 00:53:37,621 INFO L443 ceAbstractionStarter]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-10-02 00:53:37,621 INFO L443 ceAbstractionStarter]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-10-02 00:53:37,621 INFO L443 ceAbstractionStarter]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-10-02 00:53:37,621 INFO L443 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,621 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,621 INFO L443 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,621 INFO L443 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,621 INFO L443 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,621 INFO L443 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,622 INFO L443 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,622 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,622 INFO L443 ceAbstractionStarter]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,622 INFO L443 ceAbstractionStarter]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,622 INFO L443 ceAbstractionStarter]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,622 INFO L443 ceAbstractionStarter]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-10-02 00:53:37,622 INFO L443 ceAbstractionStarter]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-10-02 00:53:37,622 INFO L443 ceAbstractionStarter]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-10-02 00:53:37,622 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,623 INFO L443 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,623 INFO L443 ceAbstractionStarter]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,623 INFO L443 ceAbstractionStarter]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,623 INFO L443 ceAbstractionStarter]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,623 INFO L443 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,623 INFO L443 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,623 INFO L443 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,623 INFO L443 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,624 INFO L443 ceAbstractionStarter]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-10-02 00:53:37,624 INFO L443 ceAbstractionStarter]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-10-02 00:53:37,624 INFO L443 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-10-02 00:53:37,624 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-10-02 00:53:37,624 INFO L443 ceAbstractionStarter]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-10-02 00:53:37,624 INFO L443 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,624 INFO L443 ceAbstractionStarter]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,624 INFO L443 ceAbstractionStarter]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,624 INFO L443 ceAbstractionStarter]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,625 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,625 INFO L443 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,625 INFO L443 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,625 INFO L443 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,625 INFO L443 ceAbstractionStarter]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-10-02 00:53:37,625 INFO L443 ceAbstractionStarter]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-10-02 00:53:37,625 INFO L443 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-10-02 00:53:37,625 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,625 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,626 INFO L443 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,626 INFO L443 ceAbstractionStarter]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-10-02 00:53:37,626 INFO L443 ceAbstractionStarter]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-10-02 00:53:37,626 INFO L443 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,626 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 54 1650) the Hoare annotation is: (let ((.cse2 (= ~a12~0 |old(~a12~0)|)) (.cse3 (= ~a26~0 |old(~a26~0)|)) (.cse21 (= ~a27~0 1)) (.cse5 (= ~a5~0 |old(~a5~0)|)) (.cse6 (= ~a11~0 1)) (.cse8 (= ~a0~0 |old(~a0~0)|)) (.cse9 (= ~a3~0 |old(~a3~0)|)) (.cse13 (not (= 1 |old(~a5~0)|))) (.cse20 (= 1 |old(~a6~0)|)) (.cse23 (not (<= 2 |old(~a3~0)|))) (.cse15 (not (<= |old(~a26~0)| 0)))) (let ((.cse10 (not (= 1 |old(~a12~0)|))) (.cse12 (= ~a12~0 1)) (.cse1 (or .cse13 .cse20 .cse23 .cse15)) (.cse11 (= ~a11~0 |old(~a11~0)|)) (.cse7 (not (= 1 ~a6~0))) (.cse22 (not (<= |old(~a3~0)| 1))) (.cse14 (not (<= |old(~a11~0)| 0))) (.cse18 (and .cse2 .cse3 .cse21 .cse5 .cse6 .cse8 .cse9)) (.cse17 (or .cse13 .cse23 .cse15)) (.cse19 (not (= 1 |old(~a27~0)|))) (.cse4 (= ~a27~0 |old(~a27~0)|)) (.cse16 (not (= 1 |old(~a26~0)|))) (.cse0 (not (= 1 |old(~a11~0)|)))) (and (or .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)) (or .cse10 (and .cse11 .cse3 .cse4 .cse5 .cse12 .cse8 .cse9) .cse13 .cse14 .cse15) (or (and .cse2 .cse11 .cse4 .cse5 (= ~a26~0 1) .cse8 .cse9) .cse13 .cse16 .cse14) (or .cse17 (and .cse2 .cse11 .cse3 .cse4 .cse5 .cse8 .cse9) .cse14) (or .cse13 .cse18 .cse0 .cse19 .cse15 (not (<= |old(~a3~0)| 0))) (or .cse13 .cse20 (and .cse2 .cse3 .cse21 .cse5 .cse7 .cse6 .cse8 .cse9) .cse0 .cse19 .cse15) (or .cse7 .cse13 .cse16 .cse22 .cse20 .cse0) (or .cse7 .cse13 .cse16 .cse20 .cse14 .cse19 (= |old(~a0~0)| |old(~a26~0)|)) (or .cse10 .cse7 .cse13 .cse16 .cse20 .cse0) (or .cse10 .cse13 .cse16 .cse20 .cse7 .cse14) (or .cse7 .cse13 .cse16 .cse20 .cse0 .cse19) (or .cse13 (and .cse2 .cse11 .cse3 .cse21 .cse5 .cse8 .cse9) .cse14 .cse19 .cse15) (or .cse10 (and .cse3 .cse4 .cse5 .cse12 .cse6 .cse8 .cse9) .cse13 .cse22 .cse0 .cse15) (or .cse7 .cse14 .cse1 .cse19) (or .cse7 .cse13 .cse16 .cse22 .cse20 .cse14) (or (and .cse2 .cse11 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9) .cse13 .cse22 .cse20 .cse14 .cse15) (or .cse18 .cse0 .cse17 .cse19) (or (and .cse2 .cse4 .cse5 .cse6 .cse8 .cse3 .cse9) .cse13 .cse16 .cse0)))) [2019-10-02 00:53:37,626 INFO L443 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,627 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,627 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-10-02 00:53:37,627 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,627 INFO L443 ceAbstractionStarter]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-10-02 00:53:37,627 INFO L443 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,627 INFO L443 ceAbstractionStarter]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-10-02 00:53:37,627 INFO L443 ceAbstractionStarter]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,627 INFO L443 ceAbstractionStarter]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,627 INFO L443 ceAbstractionStarter]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-10-02 00:53:37,628 INFO L443 ceAbstractionStarter]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-10-02 00:53:37,628 INFO L443 ceAbstractionStarter]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-10-02 00:53:37,628 INFO L443 ceAbstractionStarter]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-10-02 00:53:37,628 INFO L443 ceAbstractionStarter]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-10-02 00:53:37,628 INFO L443 ceAbstractionStarter]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-10-02 00:53:37,628 INFO L443 ceAbstractionStarter]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-10-02 00:53:37,628 INFO L443 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,628 INFO L443 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,628 INFO L443 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,629 INFO L443 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,629 INFO L443 ceAbstractionStarter]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,629 INFO L443 ceAbstractionStarter]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,629 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1533) no Hoare annotation was computed. [2019-10-02 00:53:37,629 INFO L443 ceAbstractionStarter]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-10-02 00:53:37,629 INFO L443 ceAbstractionStarter]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-10-02 00:53:37,629 INFO L443 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,630 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,630 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,630 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,630 INFO L443 ceAbstractionStarter]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,630 INFO L443 ceAbstractionStarter]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,630 INFO L443 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,630 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,630 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,631 INFO L443 ceAbstractionStarter]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-10-02 00:53:37,631 INFO L443 ceAbstractionStarter]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-10-02 00:53:37,631 INFO L443 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,631 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,631 INFO L443 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,631 INFO L443 ceAbstractionStarter]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,631 INFO L443 ceAbstractionStarter]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,631 INFO L443 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,632 INFO L443 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,632 INFO L443 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,632 INFO L443 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,632 INFO L443 ceAbstractionStarter]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-10-02 00:53:37,632 INFO L443 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-10-02 00:53:37,632 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,632 INFO L443 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,632 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-10-02 00:53:37,633 INFO L443 ceAbstractionStarter]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-10-02 00:53:37,633 INFO L443 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,633 INFO L443 ceAbstractionStarter]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,633 INFO L443 ceAbstractionStarter]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,633 INFO L443 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,633 INFO L443 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,633 INFO L443 ceAbstractionStarter]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-10-02 00:53:37,633 INFO L443 ceAbstractionStarter]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-10-02 00:53:37,634 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,634 INFO L443 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,634 INFO L443 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,634 INFO L443 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,634 INFO L443 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,634 INFO L443 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,634 INFO L443 ceAbstractionStarter]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,634 INFO L443 ceAbstractionStarter]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,635 INFO L443 ceAbstractionStarter]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-10-02 00:53:37,635 INFO L443 ceAbstractionStarter]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-10-02 00:53:37,635 INFO L443 ceAbstractionStarter]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-10-02 00:53:37,635 INFO L443 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,635 INFO L443 ceAbstractionStarter]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-10-02 00:53:37,635 INFO L443 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,635 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,635 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,636 INFO L443 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,636 INFO L443 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,636 INFO L443 ceAbstractionStarter]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,636 INFO L443 ceAbstractionStarter]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,636 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-10-02 00:53:37,636 INFO L443 ceAbstractionStarter]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,636 INFO L443 ceAbstractionStarter]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-10-02 00:53:37,636 INFO L443 ceAbstractionStarter]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-10-02 00:53:37,636 INFO L443 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-10-02 00:53:37,637 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,637 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,637 INFO L443 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,637 INFO L443 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,637 INFO L443 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,637 INFO L443 ceAbstractionStarter]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,637 INFO L443 ceAbstractionStarter]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,637 INFO L443 ceAbstractionStarter]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,637 INFO L443 ceAbstractionStarter]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-10-02 00:53:37,638 INFO L443 ceAbstractionStarter]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-10-02 00:53:37,638 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,638 INFO L443 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,638 INFO L443 ceAbstractionStarter]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-10-02 00:53:37,638 INFO L443 ceAbstractionStarter]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-10-02 00:53:37,638 INFO L443 ceAbstractionStarter]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-10-02 00:53:37,638 INFO L443 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,638 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,639 INFO L443 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,639 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,639 INFO L443 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,639 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,639 INFO L443 ceAbstractionStarter]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,639 INFO L443 ceAbstractionStarter]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,639 INFO L443 ceAbstractionStarter]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,639 INFO L443 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,639 INFO L443 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,640 INFO L443 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,640 INFO L443 ceAbstractionStarter]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-10-02 00:53:37,640 INFO L443 ceAbstractionStarter]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-10-02 00:53:37,640 INFO L443 ceAbstractionStarter]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-10-02 00:53:37,640 INFO L443 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,640 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,640 INFO L443 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,640 INFO L443 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,640 INFO L443 ceAbstractionStarter]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,641 INFO L443 ceAbstractionStarter]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,641 INFO L443 ceAbstractionStarter]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,641 INFO L443 ceAbstractionStarter]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-10-02 00:53:37,641 INFO L443 ceAbstractionStarter]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-10-02 00:53:37,641 INFO L443 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,641 INFO L443 ceAbstractionStarter]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-10-02 00:53:37,641 INFO L443 ceAbstractionStarter]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-10-02 00:53:37,641 INFO L443 ceAbstractionStarter]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-10-02 00:53:37,642 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,642 INFO L443 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,642 INFO L443 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,642 INFO L443 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,642 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,642 INFO L443 ceAbstractionStarter]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-10-02 00:53:37,642 INFO L443 ceAbstractionStarter]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-10-02 00:53:37,643 INFO L443 ceAbstractionStarter]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,643 INFO L443 ceAbstractionStarter]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,643 INFO L443 ceAbstractionStarter]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,643 INFO L443 ceAbstractionStarter]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-10-02 00:53:37,643 INFO L443 ceAbstractionStarter]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-10-02 00:53:37,643 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,643 INFO L443 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-10-02 00:53:37,643 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,644 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,644 INFO L443 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,644 INFO L443 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,644 INFO L443 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,644 INFO L443 ceAbstractionStarter]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,644 INFO L443 ceAbstractionStarter]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,644 INFO L443 ceAbstractionStarter]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,644 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,645 INFO L443 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,645 INFO L443 ceAbstractionStarter]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-10-02 00:53:37,645 INFO L443 ceAbstractionStarter]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-10-02 00:53:37,645 INFO L443 ceAbstractionStarter]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-10-02 00:53:37,645 INFO L443 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,645 INFO L443 ceAbstractionStarter]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-10-02 00:53:37,645 INFO L443 ceAbstractionStarter]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-10-02 00:53:37,645 INFO L443 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,646 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,646 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,646 INFO L443 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,646 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,646 INFO L443 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,646 INFO L443 ceAbstractionStarter]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,646 INFO L443 ceAbstractionStarter]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,646 INFO L443 ceAbstractionStarter]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,646 INFO L443 ceAbstractionStarter]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-10-02 00:53:37,647 INFO L443 ceAbstractionStarter]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-10-02 00:53:37,647 INFO L443 ceAbstractionStarter]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-10-02 00:53:37,647 INFO L443 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,647 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,647 INFO L443 ceAbstractionStarter]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,647 INFO L443 ceAbstractionStarter]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,647 INFO L443 ceAbstractionStarter]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-10-02 00:53:37,647 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,647 INFO L443 ceAbstractionStarter]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-10-02 00:53:37,647 INFO L443 ceAbstractionStarter]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-10-02 00:53:37,648 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,648 INFO L443 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-10-02 00:53:37,648 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-10-02 00:53:37,648 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 00:53:37,648 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~a0~0 ~a26~0)) (<= ~a3~0 1) (= 1 ~a5~0) (= ~a27~0 1) (<= ~a11~0 0) (<= ~a26~0 0) (not (= 1 ~a6~0))) [2019-10-02 00:53:37,648 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 00:53:37,648 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 00:53:37,649 INFO L443 ceAbstractionStarter]: For program point L1666-1(line 1666) no Hoare annotation was computed. [2019-10-02 00:53:37,649 INFO L443 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-10-02 00:53:37,649 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 1652 1669) the Hoare annotation is: (or (not (= 1 |old(~a5~0)|)) (and (= ~a12~0 |old(~a12~0)|) (= ~a11~0 |old(~a11~0)|) (= ~a26~0 |old(~a26~0)|) (= ~a27~0 1) (= ~a5~0 |old(~a5~0)|) (not (= 1 ~a6~0)) (= ~a0~0 |old(~a0~0)|) (= ~a3~0 |old(~a3~0)|)) (not (<= |old(~a3~0)| 1)) (= 1 |old(~a6~0)|) (not (<= |old(~a11~0)| 0)) (not (= 1 |old(~a27~0)|)) (= |old(~a0~0)| |old(~a26~0)|) (not (<= |old(~a26~0)| 0))) [2019-10-02 00:53:37,649 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 1652 1669) no Hoare annotation was computed. [2019-10-02 00:53:37,649 INFO L439 ceAbstractionStarter]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse1 (= ~a12~0 1)) (.cse7 (= ~a26~0 1)) (.cse6 (not (= 1 ~a6~0))) (.cse5 (= ~a27~0 1)) (.cse3 (= ~a11~0 1)) (.cse8 (<= 2 ~a3~0)) (.cse0 (= ~a5~0 |old(~a5~0)|)) (.cse4 (<= ~a11~0 0)) (.cse2 (<= ~a26~0 0))) (or (and (<= ~a3~0 1) .cse0 .cse1 .cse2 .cse3) (not (= 1 |old(~a27~0)|)) (and .cse4 (and .cse5 .cse0 .cse2)) (and (and .cse1 .cse0 .cse2) .cse4) (and .cse4 (and .cse6 .cse0 .cse2)) (and .cse0 .cse3 .cse7) (not (<= |old(~a11~0)| 0)) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 .cse4 .cse7) (not (<= |old(~a3~0)| 1)) (not (= 1 |old(~a5~0)|)) (not (<= |old(~a26~0)| 0)) (and .cse8 .cse0 .cse3 .cse2 .cse6) (and (<= ~a3~0 0) .cse5 .cse0 .cse2 .cse3) (and .cse8 .cse5 .cse0 .cse2 .cse3) (= |old(~a0~0)| |old(~a26~0)|) (= 1 |old(~a6~0)|) (and .cse8 .cse0 .cse4 .cse2))) [2019-10-02 00:53:37,649 INFO L443 ceAbstractionStarter]: For program point L1658-3(lines 1652 1669) no Hoare annotation was computed. [2019-10-02 00:53:37,650 INFO L439 ceAbstractionStarter]: At program point L1666(line 1666) the Hoare annotation is: (let ((.cse1 (= ~a12~0 1)) (.cse7 (= ~a26~0 1)) (.cse6 (not (= 1 ~a6~0))) (.cse5 (= ~a27~0 1)) (.cse3 (= ~a11~0 1)) (.cse8 (<= 2 ~a3~0)) (.cse0 (= ~a5~0 |old(~a5~0)|)) (.cse4 (<= ~a11~0 0)) (.cse2 (<= ~a26~0 0))) (or (and (<= ~a3~0 1) .cse0 .cse1 .cse2 .cse3) (not (= 1 |old(~a27~0)|)) (and .cse4 (and .cse5 .cse0 .cse2)) (and (and .cse1 .cse0 .cse2) .cse4) (and .cse4 (and .cse6 .cse0 .cse2)) (and .cse0 .cse3 .cse7) (not (<= |old(~a11~0)| 0)) (and .cse5 .cse0 .cse2 .cse3 .cse6) (and .cse0 .cse4 .cse7) (not (<= |old(~a3~0)| 1)) (not (= 1 |old(~a5~0)|)) (not (<= |old(~a26~0)| 0)) (and .cse8 .cse0 .cse3 .cse2 .cse6) (and (<= ~a3~0 0) .cse5 .cse0 .cse2 .cse3) (and .cse8 .cse5 .cse0 .cse2 .cse3) (= |old(~a0~0)| |old(~a26~0)|) (= 1 |old(~a6~0)|) (and .cse8 .cse0 .cse4 .cse2))) [2019-10-02 00:53:37,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 12:53:37 BoogieIcfgContainer [2019-10-02 00:53:37,670 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 00:53:37,672 INFO L168 Benchmark]: Toolchain (without parser) took 65433.27 ms. Allocated memory was 133.7 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 84.5 MB in the beginning and 282.3 MB in the end (delta: -197.8 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-10-02 00:53:37,673 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 133.7 MB. Free memory was 107.9 MB in the beginning and 107.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 00:53:37,674 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1309.12 ms. Allocated memory was 133.7 MB in the beginning and 203.9 MB in the end (delta: 70.3 MB). Free memory was 84.1 MB in the beginning and 119.1 MB in the end (delta: -35.0 MB). Peak memory consumption was 40.5 MB. Max. memory is 7.1 GB. [2019-10-02 00:53:37,675 INFO L168 Benchmark]: Boogie Preprocessor took 141.90 ms. Allocated memory is still 203.9 MB. Free memory was 119.1 MB in the beginning and 107.4 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 7.1 GB. [2019-10-02 00:53:37,676 INFO L168 Benchmark]: RCFGBuilder took 2053.21 ms. Allocated memory was 203.9 MB in the beginning and 272.1 MB in the end (delta: 68.2 MB). Free memory was 107.4 MB in the beginning and 128.6 MB in the end (delta: -21.2 MB). Peak memory consumption was 71.3 MB. Max. memory is 7.1 GB. [2019-10-02 00:53:37,677 INFO L168 Benchmark]: TraceAbstraction took 61923.67 ms. Allocated memory was 272.1 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 126.5 MB in the beginning and 282.3 MB in the end (delta: -155.8 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-10-02 00:53:37,681 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.24 ms. Allocated memory is still 133.7 MB. Free memory was 107.9 MB in the beginning and 107.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1309.12 ms. Allocated memory was 133.7 MB in the beginning and 203.9 MB in the end (delta: 70.3 MB). Free memory was 84.1 MB in the beginning and 119.1 MB in the end (delta: -35.0 MB). Peak memory consumption was 40.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 141.90 ms. Allocated memory is still 203.9 MB. Free memory was 119.1 MB in the beginning and 107.4 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2053.21 ms. Allocated memory was 203.9 MB in the beginning and 272.1 MB in the end (delta: 68.2 MB). Free memory was 107.4 MB in the beginning and 128.6 MB in the end (delta: -21.2 MB). Peak memory consumption was 71.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 61923.67 ms. Allocated memory was 272.1 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 126.5 MB in the beginning and 282.3 MB in the end (delta: -155.8 MB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1533]: 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: 1658]: Loop Invariant Derived loop invariant: ((((((((((((((((((((a3 <= 1 && a5 == \old(a5)) && a12 == 1) && a26 <= 0) && a11 == 1) || !(1 == \old(a27))) || (a11 <= 0 && (a27 == 1 && a5 == \old(a5)) && a26 <= 0)) || (((a12 == 1 && a5 == \old(a5)) && a26 <= 0) && a11 <= 0)) || (a11 <= 0 && (!(1 == a6) && a5 == \old(a5)) && a26 <= 0)) || ((a5 == \old(a5) && a11 == 1) && a26 == 1)) || !(\old(a11) <= 0)) || ((((a27 == 1 && a5 == \old(a5)) && a26 <= 0) && a11 == 1) && !(1 == a6))) || ((a5 == \old(a5) && a11 <= 0) && a26 == 1)) || !(\old(a3) <= 1)) || !(1 == \old(a5))) || !(\old(a26) <= 0)) || ((((2 <= a3 && a5 == \old(a5)) && a11 == 1) && a26 <= 0) && !(1 == a6))) || ((((a3 <= 0 && a27 == 1) && a5 == \old(a5)) && a26 <= 0) && a11 == 1)) || ((((2 <= a3 && a27 == 1) && a5 == \old(a5)) && a26 <= 0) && a11 == 1)) || \old(a0) == \old(a26)) || 1 == \old(a6)) || (((2 <= a3 && a5 == \old(a5)) && a11 <= 0) && a26 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 311 locations, 1 error locations. SAFE Result, 61.8s OverallTime, 11 OverallIterations, 7 TraceHistogramMax, 28.3s AutomataDifference, 0.0s DeadEndRemovalTime, 21.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 1459 SDtfs, 9091 SDslu, 1319 SDs, 0 SdLazy, 19319 SolverSat, 3083 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2121 GetRequests, 2005 SyntacticMatches, 2 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30844occurred in iteration=10, 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: 2.8s AutomataMinimizationTime, 11 MinimizatonAttempts, 2953 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 838 PreInvPairs, 1490 NumberOfFragments, 1104 HoareAnnotationTreeSize, 838 FomulaSimplifications, 159799 FormulaSimplificationTreeSizeReduction, 8.5s HoareSimplificationTime, 7 FomulaSimplificationsInter, 62179 FormulaSimplificationTreeSizeReductionInter, 13.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 5032 NumberOfCodeBlocks, 5032 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 5015 ConstructedInterpolants, 0 QuantifiedInterpolants, 3013055 SizeOfPredicates, 12 NumberOfNonLiveVariables, 7743 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 17 InterpolantComputations, 8 PerfectInterpolantSequences, 3208/3413 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...