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/Problem02_label39.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 00:47:31,506 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 00:47:31,509 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 00:47:31,527 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 00:47:31,528 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 00:47:31,529 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 00:47:31,532 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 00:47:31,537 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 00:47:31,539 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 00:47:31,540 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 00:47:31,541 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 00:47:31,543 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 00:47:31,543 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 00:47:31,544 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 00:47:31,545 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 00:47:31,546 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 00:47:31,547 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 00:47:31,548 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 00:47:31,550 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 00:47:31,551 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 00:47:31,553 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 00:47:31,554 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 00:47:31,555 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 00:47:31,556 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 00:47:31,558 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 00:47:31,558 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 00:47:31,559 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 00:47:31,560 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 00:47:31,560 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 00:47:31,561 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 00:47:31,561 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 00:47:31,562 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 00:47:31,563 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 00:47:31,563 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 00:47:31,564 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 00:47:31,564 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 00:47:31,565 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 00:47:31,565 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 00:47:31,566 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 00:47:31,567 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 00:47:31,567 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 00:47:31,568 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:47:31,586 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 00:47:31,587 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 00:47:31,588 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 00:47:31,588 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 00:47:31,588 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 00:47:31,589 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 00:47:31,589 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 00:47:31,589 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 00:47:31,589 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 00:47:31,589 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 00:47:31,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 00:47:31,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 00:47:31,590 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 00:47:31,590 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 00:47:31,590 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 00:47:31,591 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 00:47:31,591 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 00:47:31,591 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 00:47:31,591 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 00:47:31,591 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 00:47:31,592 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 00:47:31,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 00:47:31,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 00:47:31,592 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 00:47:31,593 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 00:47:31,593 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 00:47:31,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 00:47:31,593 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 00:47:31,593 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 00:47:31,622 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 00:47:31,634 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 00:47:31,638 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 00:47:31,639 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 00:47:31,640 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 00:47:31,640 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label39.c [2019-10-02 00:47:31,704 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25affe1e2/04ada89ec9db482abc76582966fba819/FLAGa4d374dd1 [2019-10-02 00:47:32,264 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 00:47:32,265 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label39.c [2019-10-02 00:47:32,277 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25affe1e2/04ada89ec9db482abc76582966fba819/FLAGa4d374dd1 [2019-10-02 00:47:32,533 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25affe1e2/04ada89ec9db482abc76582966fba819 [2019-10-02 00:47:32,544 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 00:47:32,546 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 00:47:32,547 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 00:47:32,547 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 00:47:32,553 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 00:47:32,554 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:47:32" (1/1) ... [2019-10-02 00:47:32,557 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11a7240e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:47:32, skipping insertion in model container [2019-10-02 00:47:32,557 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:47:32" (1/1) ... [2019-10-02 00:47:32,565 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 00:47:32,623 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 00:47:33,133 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 00:47:33,138 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 00:47:33,277 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 00:47:33,307 INFO L192 MainTranslator]: Completed translation [2019-10-02 00:47:33,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:47:33 WrapperNode [2019-10-02 00:47:33,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 00:47:33,310 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 00:47:33,310 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 00:47:33,310 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 00:47:33,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:47:33" (1/1) ... [2019-10-02 00:47:33,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:47:33" (1/1) ... [2019-10-02 00:47:33,362 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:47:33" (1/1) ... [2019-10-02 00:47:33,363 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:47:33" (1/1) ... [2019-10-02 00:47:33,399 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:47:33" (1/1) ... [2019-10-02 00:47:33,422 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:47:33" (1/1) ... [2019-10-02 00:47:33,430 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:47:33" (1/1) ... [2019-10-02 00:47:33,437 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 00:47:33,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 00:47:33,437 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 00:47:33,438 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 00:47:33,439 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:47: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:47:33,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 00:47:33,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 00:47:33,504 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 00:47:33,504 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 00:47:33,504 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 00:47:33,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 00:47:33,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 00:47:33,505 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 00:47:33,505 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 00:47:33,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 00:47:33,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 00:47:34,843 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 00:47:34,844 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 00:47:34,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:47:34 BoogieIcfgContainer [2019-10-02 00:47:34,849 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 00:47:34,850 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 00:47:34,851 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 00:47:34,854 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 00:47:34,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:47:32" (1/3) ... [2019-10-02 00:47:34,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@510de488 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:47:34, skipping insertion in model container [2019-10-02 00:47:34,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:47:33" (2/3) ... [2019-10-02 00:47:34,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@510de488 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:47:34, skipping insertion in model container [2019-10-02 00:47:34,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:47:34" (3/3) ... [2019-10-02 00:47:34,858 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label39.c [2019-10-02 00:47:34,871 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 00:47:34,883 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 00:47:34,903 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 00:47:34,959 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 00:47:34,960 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 00:47:34,961 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 00:47:34,962 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 00:47:34,962 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 00:47:34,962 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 00:47:34,962 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 00:47:34,962 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 00:47:34,963 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 00:47:34,986 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-10-02 00:47:34,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-02 00:47:34,998 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:47:35,000 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] [2019-10-02 00:47:35,002 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:47:35,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:47:35,008 INFO L82 PathProgramCache]: Analyzing trace with hash 640678305, now seen corresponding path program 1 times [2019-10-02 00:47:35,009 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:47:35,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:47:35,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:47:35,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:47:35,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:47:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:47:35,548 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:47:35,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:47:35,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 00:47:35,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 00:47:35,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 00:47:35,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:47:35,577 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2019-10-02 00:47:36,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:47:36,487 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2019-10-02 00:47:36,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 00:47:36,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-10-02 00:47:36,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:47:36,513 INFO L225 Difference]: With dead ends: 618 [2019-10-02 00:47:36,513 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 00:47:36,525 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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:47:36,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 00:47:36,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 00:47:36,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 00:47:36,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 465 transitions. [2019-10-02 00:47:36,597 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 465 transitions. Word has length 117 [2019-10-02 00:47:36,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:47:36,598 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 465 transitions. [2019-10-02 00:47:36,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 00:47:36,598 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 465 transitions. [2019-10-02 00:47:36,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-02 00:47:36,604 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:47:36,604 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 00:47:36,604 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:47:36,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:47:36,605 INFO L82 PathProgramCache]: Analyzing trace with hash -758657178, now seen corresponding path program 1 times [2019-10-02 00:47:36,605 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:47:36,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:47:36,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:47:36,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:47:36,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:47:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:47:36,901 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:47:36,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:47:36,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 00:47:36,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 00:47:36,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 00:47:36,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:47:36,906 INFO L87 Difference]: Start difference. First operand 320 states and 465 transitions. Second operand 5 states. [2019-10-02 00:47:37,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:47:37,616 INFO L93 Difference]: Finished difference Result 721 states and 1089 transitions. [2019-10-02 00:47:37,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:47:37,622 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 125 [2019-10-02 00:47:37,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:47:37,625 INFO L225 Difference]: With dead ends: 721 [2019-10-02 00:47:37,625 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 00:47:37,627 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:47:37,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 00:47:37,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 00:47:37,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 00:47:37,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 461 transitions. [2019-10-02 00:47:37,654 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 461 transitions. Word has length 125 [2019-10-02 00:47:37,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:47:37,654 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 461 transitions. [2019-10-02 00:47:37,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 00:47:37,655 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 461 transitions. [2019-10-02 00:47:37,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-02 00:47:37,658 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:47:37,658 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 00:47:37,659 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:47:37,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:47:37,659 INFO L82 PathProgramCache]: Analyzing trace with hash 79547442, now seen corresponding path program 1 times [2019-10-02 00:47:37,659 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:47:37,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:47:37,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:47:37,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:47:37,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:47:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:47:37,975 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:47:37,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:47:37,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 00:47:37,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 00:47:37,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 00:47:37,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:47:37,977 INFO L87 Difference]: Start difference. First operand 320 states and 461 transitions. Second operand 5 states. [2019-10-02 00:47:38,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:47:38,690 INFO L93 Difference]: Finished difference Result 717 states and 1075 transitions. [2019-10-02 00:47:38,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:47:38,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 131 [2019-10-02 00:47:38,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:47:38,699 INFO L225 Difference]: With dead ends: 717 [2019-10-02 00:47:38,699 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 00:47:38,701 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:47:38,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 00:47:38,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 00:47:38,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 00:47:38,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 455 transitions. [2019-10-02 00:47:38,721 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 455 transitions. Word has length 131 [2019-10-02 00:47:38,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:47:38,721 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 455 transitions. [2019-10-02 00:47:38,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 00:47:38,722 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 455 transitions. [2019-10-02 00:47:38,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-02 00:47:38,724 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:47:38,725 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 00:47:38,725 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:47:38,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:47:38,725 INFO L82 PathProgramCache]: Analyzing trace with hash 505867657, now seen corresponding path program 1 times [2019-10-02 00:47:38,726 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:47:38,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:47:38,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:47:38,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:47:38,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:47:38,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:47:38,832 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:47:38,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:47:38,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 00:47:38,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 00:47:38,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 00:47:38,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 00:47:38,834 INFO L87 Difference]: Start difference. First operand 320 states and 455 transitions. Second operand 6 states. [2019-10-02 00:47:39,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:47:39,743 INFO L93 Difference]: Finished difference Result 951 states and 1383 transitions. [2019-10-02 00:47:39,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 00:47:39,743 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2019-10-02 00:47:39,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:47:39,747 INFO L225 Difference]: With dead ends: 951 [2019-10-02 00:47:39,748 INFO L226 Difference]: Without dead ends: 637 [2019-10-02 00:47:39,749 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:47:39,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-02 00:47:39,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 626. [2019-10-02 00:47:39,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 00:47:39,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 870 transitions. [2019-10-02 00:47:39,784 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 870 transitions. Word has length 139 [2019-10-02 00:47:39,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:47:39,785 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 870 transitions. [2019-10-02 00:47:39,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 00:47:39,785 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 870 transitions. [2019-10-02 00:47:39,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-02 00:47:39,789 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:47:39,789 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:39,789 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:47:39,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:47:39,790 INFO L82 PathProgramCache]: Analyzing trace with hash -571744819, now seen corresponding path program 1 times [2019-10-02 00:47:39,790 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:47:39,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:47:39,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:47:39,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:47:39,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:47:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:47:39,974 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:47:39,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:47:39,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 00:47:39,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 00:47:39,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 00:47:39,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:47:39,976 INFO L87 Difference]: Start difference. First operand 626 states and 870 transitions. Second operand 5 states. [2019-10-02 00:47:40,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:47:40,721 INFO L93 Difference]: Finished difference Result 1330 states and 1901 transitions. [2019-10-02 00:47:40,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:47:40,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2019-10-02 00:47:40,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:47:40,727 INFO L225 Difference]: With dead ends: 1330 [2019-10-02 00:47:40,727 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 00:47:40,730 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:47:40,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 00:47:40,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 00:47:40,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 00:47:40,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 858 transitions. [2019-10-02 00:47:40,756 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 858 transitions. Word has length 141 [2019-10-02 00:47:40,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:47:40,757 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 858 transitions. [2019-10-02 00:47:40,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 00:47:40,757 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 858 transitions. [2019-10-02 00:47:40,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 00:47:40,762 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:47:40,762 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:40,762 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:47:40,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:47:40,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1019973137, now seen corresponding path program 1 times [2019-10-02 00:47:40,763 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:47:40,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:47:40,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:47:40,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:47:40,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:47:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:47:41,031 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:47:41,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:47:41,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 00:47:41,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 00:47:41,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 00:47:41,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:47:41,034 INFO L87 Difference]: Start difference. First operand 626 states and 858 transitions. Second operand 5 states. [2019-10-02 00:47:41,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:47:41,647 INFO L93 Difference]: Finished difference Result 1332 states and 1876 transitions. [2019-10-02 00:47:41,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:47:41,648 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2019-10-02 00:47:41,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:47:41,652 INFO L225 Difference]: With dead ends: 1332 [2019-10-02 00:47:41,652 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 00:47:41,655 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:47:41,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 00:47:41,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 00:47:41,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 00:47:41,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 842 transitions. [2019-10-02 00:47:41,676 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 842 transitions. Word has length 143 [2019-10-02 00:47:41,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:47:41,677 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 842 transitions. [2019-10-02 00:47:41,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 00:47:41,677 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 842 transitions. [2019-10-02 00:47:41,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-02 00:47:41,680 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:47:41,680 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:41,680 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:47:41,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:47:41,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1793380711, now seen corresponding path program 1 times [2019-10-02 00:47:41,681 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:47:41,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:47:41,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:47:41,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:47:41,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:47:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:47:41,768 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:47:41,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:47:41,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 00:47:41,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 00:47:41,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 00:47:41,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 00:47:41,770 INFO L87 Difference]: Start difference. First operand 626 states and 842 transitions. Second operand 6 states. [2019-10-02 00:47:42,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:47:42,534 INFO L93 Difference]: Finished difference Result 1858 states and 2598 transitions. [2019-10-02 00:47:42,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 00:47:42,534 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 147 [2019-10-02 00:47:42,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:47:42,542 INFO L225 Difference]: With dead ends: 1858 [2019-10-02 00:47:42,543 INFO L226 Difference]: Without dead ends: 1238 [2019-10-02 00:47:42,545 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:47:42,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2019-10-02 00:47:42,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1218. [2019-10-02 00:47:42,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-10-02 00:47:42,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1635 transitions. [2019-10-02 00:47:42,590 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1635 transitions. Word has length 147 [2019-10-02 00:47:42,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:47:42,590 INFO L475 AbstractCegarLoop]: Abstraction has 1218 states and 1635 transitions. [2019-10-02 00:47:42,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 00:47:42,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1635 transitions. [2019-10-02 00:47:42,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-02 00:47:42,595 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:47:42,595 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, 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] [2019-10-02 00:47:42,596 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:47:42,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:47:42,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1396546535, now seen corresponding path program 1 times [2019-10-02 00:47:42,596 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:47:42,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:47:42,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:47:42,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:47:42,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:47:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:47:42,716 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 86 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:47:42,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:47:42,716 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:47:42,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:47:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:47:42,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 00:47:42,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:47:42,968 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 00:47:42,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 00:47:42,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-02 00:47:42,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 00:47:42,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 00:47:42,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 00:47:42,976 INFO L87 Difference]: Start difference. First operand 1218 states and 1635 transitions. Second operand 7 states. [2019-10-02 00:47:44,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:47:44,466 INFO L93 Difference]: Finished difference Result 3651 states and 5065 transitions. [2019-10-02 00:47:44,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 00:47:44,467 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 181 [2019-10-02 00:47:44,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:47:44,477 INFO L225 Difference]: With dead ends: 3651 [2019-10-02 00:47:44,478 INFO L226 Difference]: Without dead ends: 1542 [2019-10-02 00:47:44,484 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-10-02 00:47:44,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2019-10-02 00:47:44,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1518. [2019-10-02 00:47:44,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1518 states. [2019-10-02 00:47:44,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 1899 transitions. [2019-10-02 00:47:44,548 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 1899 transitions. Word has length 181 [2019-10-02 00:47:44,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:47:44,549 INFO L475 AbstractCegarLoop]: Abstraction has 1518 states and 1899 transitions. [2019-10-02 00:47:44,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 00:47:44,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1899 transitions. [2019-10-02 00:47:44,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-02 00:47:44,557 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:47:44,557 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:44,557 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:47:44,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:47:44,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1823529334, now seen corresponding path program 1 times [2019-10-02 00:47:44,559 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:47:44,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:47:44,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:47:44,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:47:44,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:47:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:47:44,717 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 85 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 00:47:44,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:47:44,717 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:47:44,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:47:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:47:44,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 00:47:44,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:47:44,901 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 104 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-02 00:47:44,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:47:44,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-10-02 00:47:44,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 00:47:44,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 00:47:44,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-02 00:47:44,941 INFO L87 Difference]: Start difference. First operand 1518 states and 1899 transitions. Second operand 8 states. [2019-10-02 00:47:45,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:47:45,437 INFO L93 Difference]: Finished difference Result 2719 states and 3368 transitions. [2019-10-02 00:47:45,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 00:47:45,441 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 209 [2019-10-02 00:47:45,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:47:45,447 INFO L225 Difference]: With dead ends: 2719 [2019-10-02 00:47:45,447 INFO L226 Difference]: Without dead ends: 1207 [2019-10-02 00:47:45,451 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-02 00:47:45,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2019-10-02 00:47:45,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1061. [2019-10-02 00:47:45,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1061 states. [2019-10-02 00:47:45,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1275 transitions. [2019-10-02 00:47:45,478 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1275 transitions. Word has length 209 [2019-10-02 00:47:45,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:47:45,479 INFO L475 AbstractCegarLoop]: Abstraction has 1061 states and 1275 transitions. [2019-10-02 00:47:45,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 00:47:45,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1275 transitions. [2019-10-02 00:47:45,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-10-02 00:47:45,484 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:47:45,484 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:47:45,484 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:47:45,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:47:45,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1634940395, now seen corresponding path program 1 times [2019-10-02 00:47:45,485 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:47:45,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:47:45,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:47:45,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:47:45,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:47:45,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:47:45,625 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 97 proven. 53 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 00:47:45,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:47:45,626 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:47:45,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:47:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:47:45,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 00:47:45,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:47:45,864 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 102 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-02 00:47:45,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:47:45,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 13 [2019-10-02 00:47:45,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 00:47:45,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 00:47:45,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 00:47:45,882 INFO L87 Difference]: Start difference. First operand 1061 states and 1275 transitions. Second operand 13 states. [2019-10-02 00:47:47,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:47:47,880 INFO L93 Difference]: Finished difference Result 2827 states and 3866 transitions. [2019-10-02 00:47:47,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 00:47:47,881 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 220 [2019-10-02 00:47:47,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:47:47,893 INFO L225 Difference]: With dead ends: 2827 [2019-10-02 00:47:47,893 INFO L226 Difference]: Without dead ends: 1772 [2019-10-02 00:47:47,898 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=303, Invalid=753, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 00:47:47,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1772 states. [2019-10-02 00:47:47,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1772 to 1656. [2019-10-02 00:47:47,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1656 states. [2019-10-02 00:47:47,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 1962 transitions. [2019-10-02 00:47:47,970 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 1962 transitions. Word has length 220 [2019-10-02 00:47:47,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:47:47,970 INFO L475 AbstractCegarLoop]: Abstraction has 1656 states and 1962 transitions. [2019-10-02 00:47:47,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 00:47:47,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 1962 transitions. [2019-10-02 00:47:47,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-10-02 00:47:47,978 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:47:47,978 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 00:47:47,979 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:47:47,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:47:47,979 INFO L82 PathProgramCache]: Analyzing trace with hash -2061597238, now seen corresponding path program 1 times [2019-10-02 00:47:47,979 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:47:47,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:47:47,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:47:47,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:47:47,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:47:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:47:49,035 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 226 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:47:49,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:47:49,036 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 00:47:49,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:47:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:47:49,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 00:47:49,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:47:49,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 00:47:49,327 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 225 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 00:47:49,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:47:49,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6] total 20 [2019-10-02 00:47:49,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 00:47:49,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 00:47:49,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2019-10-02 00:47:49,343 INFO L87 Difference]: Start difference. First operand 1656 states and 1962 transitions. Second operand 20 states. [2019-10-02 00:47:49,494 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-10-02 00:47:50,306 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-10-02 00:47:56,622 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 37 [2019-10-02 00:47:57,183 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-10-02 00:47:57,443 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2019-10-02 00:47:57,676 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-10-02 00:47:57,860 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-10-02 00:47:58,063 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-10-02 00:47:58,298 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 38 [2019-10-02 00:48:01,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:48:01,491 INFO L93 Difference]: Finished difference Result 3850 states and 5554 transitions. [2019-10-02 00:48:01,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-10-02 00:48:01,491 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 264 [2019-10-02 00:48:01,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:48:01,492 INFO L225 Difference]: With dead ends: 3850 [2019-10-02 00:48:01,492 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 00:48:01,518 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2766 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1448, Invalid=6562, Unknown=0, NotChecked=0, Total=8010 [2019-10-02 00:48:01,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 00:48:01,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 00:48:01,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 00:48:01,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 00:48:01,520 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 264 [2019-10-02 00:48:01,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:48:01,520 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 00:48:01,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 00:48:01,521 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 00:48:01,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 00:48:01,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 00:48:02,051 WARN L191 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 124 [2019-10-02 00:48:02,337 WARN L191 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 124 [2019-10-02 00:48:03,772 WARN L191 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 128 DAG size of output: 81 [2019-10-02 00:48:04,319 WARN L191 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 57 [2019-10-02 00:48:04,916 WARN L191 SmtUtils]: Spent 594.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 57 [2019-10-02 00:48:04,919 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 00:48:04,919 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a11~0 |old(~a11~0)|) (= ~a17~0 |old(~a17~0)|) (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) [2019-10-02 00:48:04,919 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 00:48:04,919 INFO L443 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,919 INFO L443 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,919 INFO L443 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,919 INFO L443 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,920 INFO L443 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,920 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-10-02 00:48:04,920 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-10-02 00:48:04,920 INFO L443 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-10-02 00:48:04,920 INFO L443 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-10-02 00:48:04,920 INFO L443 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-10-02 00:48:04,920 INFO L443 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-10-02 00:48:04,921 INFO L443 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-10-02 00:48:04,921 INFO L443 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-10-02 00:48:04,921 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-10-02 00:48:04,921 INFO L443 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-10-02 00:48:04,921 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-10-02 00:48:04,921 INFO L443 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-10-02 00:48:04,921 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-10-02 00:48:04,921 INFO L443 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,921 INFO L443 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,922 INFO L443 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,922 INFO L443 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,922 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-10-02 00:48:04,922 INFO L443 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,922 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-10-02 00:48:04,922 INFO L443 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-10-02 00:48:04,922 INFO L443 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-10-02 00:48:04,922 INFO L443 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-10-02 00:48:04,923 INFO L443 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-10-02 00:48:04,923 INFO L443 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-10-02 00:48:04,923 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-10-02 00:48:04,923 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-10-02 00:48:04,923 INFO L443 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-10-02 00:48:04,923 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-10-02 00:48:04,923 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-10-02 00:48:04,923 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-10-02 00:48:04,924 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-10-02 00:48:04,924 INFO L443 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-10-02 00:48:04,924 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-10-02 00:48:04,924 INFO L443 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,924 INFO L443 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,924 INFO L443 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,924 INFO L443 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,924 INFO L443 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,925 INFO L443 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-10-02 00:48:04,925 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-10-02 00:48:04,925 INFO L443 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-10-02 00:48:04,925 INFO L443 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-10-02 00:48:04,925 INFO L443 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-10-02 00:48:04,925 INFO L443 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-10-02 00:48:04,925 INFO L443 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-10-02 00:48:04,925 INFO L443 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-10-02 00:48:04,926 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-10-02 00:48:04,926 INFO L443 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-10-02 00:48:04,926 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-10-02 00:48:04,926 INFO L443 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,926 INFO L443 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,926 INFO L443 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,926 INFO L443 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,927 INFO L443 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,927 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-10-02 00:48:04,927 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-10-02 00:48:04,927 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-10-02 00:48:04,927 INFO L443 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-10-02 00:48:04,927 INFO L443 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-10-02 00:48:04,927 INFO L443 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-10-02 00:48:04,927 INFO L443 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-10-02 00:48:04,928 INFO L443 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-10-02 00:48:04,928 INFO L443 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-10-02 00:48:04,928 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-10-02 00:48:04,928 INFO L443 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-10-02 00:48:04,928 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-10-02 00:48:04,928 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-10-02 00:48:04,928 INFO L443 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,928 INFO L443 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,928 INFO L443 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,928 INFO L443 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,929 INFO L443 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,929 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-10-02 00:48:04,929 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 505) no Hoare annotation was computed. [2019-10-02 00:48:04,929 INFO L443 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-10-02 00:48:04,929 INFO L443 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-10-02 00:48:04,929 INFO L443 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-10-02 00:48:04,929 INFO L443 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-10-02 00:48:04,929 INFO L443 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-10-02 00:48:04,929 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-10-02 00:48:04,929 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-10-02 00:48:04,929 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-10-02 00:48:04,929 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-10-02 00:48:04,930 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-10-02 00:48:04,930 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-10-02 00:48:04,930 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-10-02 00:48:04,930 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-10-02 00:48:04,930 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-10-02 00:48:04,930 INFO L443 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-10-02 00:48:04,930 INFO L443 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,930 INFO L443 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,930 INFO L443 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,930 INFO L443 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,931 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-10-02 00:48:04,931 INFO L443 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,931 INFO L443 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-10-02 00:48:04,931 INFO L443 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,931 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-10-02 00:48:04,931 INFO L443 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-10-02 00:48:04,931 INFO L443 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-10-02 00:48:04,931 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,932 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,932 INFO L443 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-10-02 00:48:04,932 INFO L443 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-10-02 00:48:04,932 INFO L443 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-10-02 00:48:04,932 INFO L443 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-10-02 00:48:04,932 INFO L443 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-10-02 00:48:04,932 INFO L443 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-10-02 00:48:04,932 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-10-02 00:48:04,932 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-10-02 00:48:04,933 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-10-02 00:48:04,933 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-10-02 00:48:04,933 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-10-02 00:48:04,933 INFO L443 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,933 INFO L443 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,933 INFO L443 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,933 INFO L443 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,933 INFO L443 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,933 INFO L443 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,933 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-10-02 00:48:04,934 INFO L443 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-10-02 00:48:04,934 INFO L443 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-10-02 00:48:04,934 INFO L443 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-10-02 00:48:04,934 INFO L443 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-10-02 00:48:04,934 INFO L443 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-10-02 00:48:04,934 INFO L443 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-10-02 00:48:04,934 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-10-02 00:48:04,934 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-10-02 00:48:04,934 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-10-02 00:48:04,935 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-10-02 00:48:04,935 INFO L443 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,935 INFO L443 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,935 INFO L443 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,935 INFO L443 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,935 INFO L443 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,935 INFO L443 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,935 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-10-02 00:48:04,935 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-10-02 00:48:04,935 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-10-02 00:48:04,936 INFO L443 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-10-02 00:48:04,936 INFO L443 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-10-02 00:48:04,936 INFO L443 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-10-02 00:48:04,936 INFO L443 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-10-02 00:48:04,936 INFO L443 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-10-02 00:48:04,936 INFO L443 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-10-02 00:48:04,936 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-10-02 00:48:04,936 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-10-02 00:48:04,936 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-10-02 00:48:04,936 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-10-02 00:48:04,937 INFO L443 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-10-02 00:48:04,937 INFO L443 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,937 INFO L443 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,937 INFO L443 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,937 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse14 (= ~a11~0 |old(~a11~0)|)) (.cse15 (= ~a17~0 |old(~a17~0)|)) (.cse20 (= ~a19~0 |old(~a19~0)|)) (.cse21 (= ~a28~0 |old(~a28~0)|)) (.cse12 (= ~a25~0 |old(~a25~0)|)) (.cse22 (= 1 |old(~a19~0)|)) (.cse13 (= 1 |old(~a11~0)|)) (.cse6 (= 1 |old(~a25~0)|))) (let ((.cse16 (not .cse6)) (.cse19 (not (= 7 |old(~a28~0)|))) (.cse10 (= ~a19~0 1)) (.cse17 (= ~a25~0 1)) (.cse9 (= ~a17~0 8)) (.cse11 (= ~a11~0 1)) (.cse7 (not (= 8 |old(~a17~0)|))) (.cse8 (not .cse13)) (.cse4 (not .cse22)) (.cse23 (not (= 1 ~a11~0))) (.cse24 (not (<= |old(~a17~0)| 7))) (.cse0 (not (<= |old(~a28~0)| 10))) (.cse3 (not (= 1 ~a21~0))) (.cse1 (= 8 |old(~a28~0)|)) (.cse18 (= 9 |old(~a28~0)|)) (.cse5 (not (<= |old(~a17~0)| 8))) (.cse2 (and .cse14 .cse15 .cse20 .cse21 .cse12))) (and (or .cse0 .cse1 .cse2 (or .cse3 .cse4 .cse5 .cse6)) (or .cse3 (not (= 10 |old(~a28~0)|)) .cse4 .cse7 .cse8 (and (= ~a28~0 10) .cse9 .cse10 .cse11 .cse12)) (or .cse0 .cse3 .cse13 .cse4 .cse1 .cse5 (and .cse14 .cse15)) (or .cse3 .cse16 .cse4 .cse7 (and (= ~a28~0 9) .cse9 .cse10 .cse17 .cse11) (not .cse18) .cse8) (or .cse3 .cse19 .cse4 (and (= ~a17~0 7) .cse11) .cse8 (not (= 7 |old(~a17~0)|))) (or .cse3 .cse13 .cse16 .cse4 .cse7 (and .cse14 .cse9 .cse20 .cse21 .cse12)) (or .cse22 .cse3 .cse19 (and (not .cse10) (not .cse17) .cse9 (= ~a28~0 7) .cse11) .cse7 .cse8 .cse6) (or .cse3 .cse13 .cse23 .cse24 .cse6) (or .cse0 .cse3 .cse13 .cse2 .cse18 .cse5 .cse6) (or .cse3 (and (<= ~a17~0 7) .cse20 .cse21 .cse12) .cse24) (or .cse3 .cse13 .cse4 .cse23 .cse24) (or .cse0 .cse3 .cse13 .cse1 .cse18 .cse5 .cse2)))) [2019-10-02 00:48:04,938 INFO L443 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,938 INFO L443 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,938 INFO L443 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,938 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-10-02 00:48:04,938 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-10-02 00:48:04,938 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-10-02 00:48:04,938 INFO L443 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-10-02 00:48:04,938 INFO L443 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-10-02 00:48:04,939 INFO L443 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-10-02 00:48:04,939 INFO L443 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-10-02 00:48:04,939 INFO L443 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-10-02 00:48:04,939 INFO L443 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-10-02 00:48:04,939 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-10-02 00:48:04,939 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-10-02 00:48:04,939 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-10-02 00:48:04,939 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-10-02 00:48:04,939 INFO L443 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,939 INFO L443 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,940 INFO L443 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,940 INFO L443 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,940 INFO L443 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,940 INFO L443 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,940 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-10-02 00:48:04,940 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-10-02 00:48:04,940 INFO L443 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-10-02 00:48:04,940 INFO L443 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-10-02 00:48:04,940 INFO L443 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-10-02 00:48:04,941 INFO L443 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-10-02 00:48:04,941 INFO L443 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-10-02 00:48:04,941 INFO L443 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-10-02 00:48:04,941 INFO L443 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-10-02 00:48:04,941 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-10-02 00:48:04,941 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-10-02 00:48:04,941 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-10-02 00:48:04,941 INFO L443 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-10-02 00:48:04,941 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-10-02 00:48:04,941 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-10-02 00:48:04,942 INFO L443 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-10-02 00:48:04,942 INFO L443 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,942 INFO L443 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,942 INFO L443 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,942 INFO L443 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,942 INFO L443 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:48:04,942 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-10-02 00:48:04,942 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-10-02 00:48:04,943 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-10-02 00:48:04,943 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-10-02 00:48:04,943 INFO L443 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-10-02 00:48:04,943 INFO L443 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-10-02 00:48:04,943 INFO L443 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-10-02 00:48:04,943 INFO L443 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-10-02 00:48:04,943 INFO L443 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-10-02 00:48:04,943 INFO L443 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-10-02 00:48:04,944 INFO L443 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-10-02 00:48:04,944 INFO L443 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-10-02 00:48:04,944 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-10-02 00:48:04,944 INFO L443 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-10-02 00:48:04,944 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-10-02 00:48:04,944 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-10-02 00:48:04,944 INFO L443 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-10-02 00:48:04,944 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-10-02 00:48:04,944 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-10-02 00:48:04,945 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 00:48:04,945 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= 1 ~a11~0)) (not (= ~a25~0 1)) (<= ~a28~0 10) (not (= ~a28~0 8)) (= ~a19~0 1) (= ~a21~0 1) (<= ~a17~0 8) (not (= ~a28~0 9))) [2019-10-02 00:48:04,945 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 00:48:04,945 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 00:48:04,945 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (<= |old(~a28~0)| 10)) (not (= 1 ~a21~0)) (and (= ~a11~0 |old(~a11~0)|) (= ~a17~0 |old(~a17~0)|) (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) (= 1 |old(~a11~0)|) (not (= 1 |old(~a19~0)|)) (= 8 |old(~a28~0)|) (= 9 |old(~a28~0)|) (not (<= |old(~a17~0)| 8)) (= 1 |old(~a25~0)|)) [2019-10-02 00:48:04,946 INFO L439 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse5 (= ~a28~0 9)) (.cse8 (= ~a25~0 1))) (let ((.cse2 (not .cse8)) (.cse0 (not (= 1 ~a11~0))) (.cse1 (= ~a17~0 |old(~a17~0)|)) (.cse3 (<= ~a28~0 10)) (.cse10 (not (= ~a28~0 8))) (.cse4 (not .cse5)) (.cse6 (= ~a17~0 8)) (.cse7 (= ~a19~0 1)) (.cse9 (= ~a11~0 1))) (or (not (= 1 ~a21~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9) (<= ~a17~0 7) (= 1 |old(~a25~0)|) (= 1 |old(~a11~0)|) (and (not .cse7) .cse2 .cse6 (= ~a28~0 7) .cse9) (and .cse3 (and .cse1 .cse2 .cse10 .cse7)) (and .cse0 .cse1 .cse3 .cse10 .cse4) (= 9 |old(~a28~0)|) (not (<= |old(~a28~0)| 10)) (not (= 1 |old(~a19~0)|)) (and .cse7 (= 8 |old(~a17~0)|) (<= ~a17~0 8) .cse8 (not .cse9)) (= 8 |old(~a28~0)|) (and (= ~a28~0 10) .cse6 .cse7 .cse8 .cse9) (not (<= |old(~a17~0)| 8))))) [2019-10-02 00:48:04,946 INFO L443 ceAbstractionStarter]: For program point L606-3(lines 600 617) no Hoare annotation was computed. [2019-10-02 00:48:04,946 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2019-10-02 00:48:04,946 INFO L439 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse5 (= ~a28~0 9)) (.cse8 (= ~a25~0 1))) (let ((.cse2 (not .cse8)) (.cse0 (not (= 1 ~a11~0))) (.cse1 (= ~a17~0 |old(~a17~0)|)) (.cse3 (<= ~a28~0 10)) (.cse10 (not (= ~a28~0 8))) (.cse4 (not .cse5)) (.cse6 (= ~a17~0 8)) (.cse7 (= ~a19~0 1)) (.cse9 (= ~a11~0 1))) (or (not (= 1 ~a21~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9) (<= ~a17~0 7) (= 1 |old(~a25~0)|) (= 1 |old(~a11~0)|) (and (not .cse7) .cse2 .cse6 (= ~a28~0 7) .cse9) (and .cse3 (and .cse1 .cse2 .cse10 .cse7)) (and .cse0 .cse1 .cse3 .cse10 .cse4) (= 9 |old(~a28~0)|) (not (<= |old(~a28~0)| 10)) (not (= 1 |old(~a19~0)|)) (and .cse7 (= 8 |old(~a17~0)|) (<= ~a17~0 8) .cse8 (not .cse9)) (= 8 |old(~a28~0)|) (and (= ~a28~0 10) .cse6 .cse7 .cse8 .cse9) (not (<= |old(~a17~0)| 8))))) [2019-10-02 00:48:04,946 INFO L443 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2019-10-02 00:48:04,946 INFO L443 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-10-02 00:48:04,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 12:48:04 BoogieIcfgContainer [2019-10-02 00:48:04,967 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 00:48:04,969 INFO L168 Benchmark]: Toolchain (without parser) took 32423.53 ms. Allocated memory was 132.1 MB in the beginning and 720.9 MB in the end (delta: 588.8 MB). Free memory was 87.0 MB in the beginning and 588.1 MB in the end (delta: -501.1 MB). Peak memory consumption was 558.3 MB. Max. memory is 7.1 GB. [2019-10-02 00:48:04,970 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 132.1 MB. Free memory is still 106.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-02 00:48:04,971 INFO L168 Benchmark]: CACSL2BoogieTranslator took 762.38 ms. Allocated memory was 132.1 MB in the beginning and 201.3 MB in the end (delta: 69.2 MB). Free memory was 86.6 MB in the beginning and 165.8 MB in the end (delta: -79.2 MB). Peak memory consumption was 35.7 MB. Max. memory is 7.1 GB. [2019-10-02 00:48:04,972 INFO L168 Benchmark]: Boogie Preprocessor took 127.19 ms. Allocated memory is still 201.3 MB. Free memory was 165.8 MB in the beginning and 160.8 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. [2019-10-02 00:48:04,973 INFO L168 Benchmark]: RCFGBuilder took 1412.01 ms. Allocated memory was 201.3 MB in the beginning and 224.4 MB in the end (delta: 23.1 MB). Free memory was 160.8 MB in the beginning and 176.7 MB in the end (delta: -15.8 MB). Peak memory consumption was 91.5 MB. Max. memory is 7.1 GB. [2019-10-02 00:48:04,974 INFO L168 Benchmark]: TraceAbstraction took 30116.73 ms. Allocated memory was 224.4 MB in the beginning and 720.9 MB in the end (delta: 496.5 MB). Free memory was 176.7 MB in the beginning and 588.1 MB in the end (delta: -411.5 MB). Peak memory consumption was 555.7 MB. Max. memory is 7.1 GB. [2019-10-02 00:48:04,978 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.23 ms. Allocated memory is still 132.1 MB. Free memory is still 106.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 762.38 ms. Allocated memory was 132.1 MB in the beginning and 201.3 MB in the end (delta: 69.2 MB). Free memory was 86.6 MB in the beginning and 165.8 MB in the end (delta: -79.2 MB). Peak memory consumption was 35.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 127.19 ms. Allocated memory is still 201.3 MB. Free memory was 165.8 MB in the beginning and 160.8 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1412.01 ms. Allocated memory was 201.3 MB in the beginning and 224.4 MB in the end (delta: 23.1 MB). Free memory was 160.8 MB in the beginning and 176.7 MB in the end (delta: -15.8 MB). Peak memory consumption was 91.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30116.73 ms. Allocated memory was 224.4 MB in the beginning and 720.9 MB in the end (delta: 496.5 MB). Free memory was 176.7 MB in the beginning and 588.1 MB in the end (delta: -411.5 MB). Peak memory consumption was 555.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 505]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((((((!(1 == a21) || ((((!(1 == a11) && a17 == \old(a17)) && !(a25 == 1)) && a28 <= 10) && !(a28 == 9))) || ((((a28 == 9 && a17 == 8) && a19 == 1) && a25 == 1) && a11 == 1)) || a17 <= 7) || 1 == \old(a25)) || 1 == \old(a11)) || ((((!(a19 == 1) && !(a25 == 1)) && a17 == 8) && a28 == 7) && a11 == 1)) || (a28 <= 10 && ((a17 == \old(a17) && !(a25 == 1)) && !(a28 == 8)) && a19 == 1)) || ((((!(1 == a11) && a17 == \old(a17)) && a28 <= 10) && !(a28 == 8)) && !(a28 == 9))) || 9 == \old(a28)) || !(\old(a28) <= 10)) || !(1 == \old(a19))) || ((((a19 == 1 && 8 == \old(a17)) && a17 <= 8) && a25 == 1) && !(a11 == 1))) || 8 == \old(a28)) || ((((a28 == 10 && a17 == 8) && a19 == 1) && a25 == 1) && a11 == 1)) || !(\old(a17) <= 8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 236 locations, 1 error locations. SAFE Result, 29.9s OverallTime, 11 OverallIterations, 4 TraceHistogramMax, 21.6s AutomataDifference, 0.0s DeadEndRemovalTime, 3.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 622 SDtfs, 8093 SDslu, 928 SDs, 0 SdLazy, 13040 SolverSat, 2498 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1126 GetRequests, 958 SyntacticMatches, 2 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3018 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1656occurred 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: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 317 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 148 PreInvPairs, 322 NumberOfFragments, 794 HoareAnnotationTreeSize, 148 FomulaSimplifications, 60229 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 7 FomulaSimplificationsInter, 3712 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2691 NumberOfCodeBlocks, 2691 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2676 ConstructedInterpolants, 0 QuantifiedInterpolants, 2505816 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2028 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 15 InterpolantComputations, 8 PerfectInterpolantSequences, 1243/1342 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...