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_label08.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 00:45:42,489 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 00:45:42,491 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 00:45:42,511 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 00:45:42,512 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 00:45:42,513 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 00:45:42,515 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 00:45:42,524 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 00:45:42,526 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 00:45:42,528 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 00:45:42,529 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 00:45:42,530 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 00:45:42,530 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 00:45:42,531 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 00:45:42,532 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 00:45:42,533 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 00:45:42,534 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 00:45:42,535 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 00:45:42,536 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 00:45:42,538 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 00:45:42,539 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 00:45:42,540 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 00:45:42,541 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 00:45:42,542 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 00:45:42,544 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 00:45:42,544 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 00:45:42,544 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 00:45:42,545 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 00:45:42,546 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 00:45:42,547 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 00:45:42,547 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 00:45:42,548 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 00:45:42,548 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 00:45:42,549 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 00:45:42,550 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 00:45:42,550 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 00:45:42,551 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 00:45:42,551 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 00:45:42,551 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 00:45:42,552 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 00:45:42,553 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 00:45:42,554 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:45:42,568 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 00:45:42,568 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 00:45:42,569 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 00:45:42,570 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 00:45:42,570 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 00:45:42,570 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 00:45:42,570 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 00:45:42,570 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 00:45:42,571 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 00:45:42,571 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 00:45:42,571 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 00:45:42,571 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 00:45:42,571 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 00:45:42,572 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 00:45:42,572 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 00:45:42,572 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 00:45:42,572 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 00:45:42,572 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 00:45:42,573 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 00:45:42,573 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 00:45:42,573 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 00:45:42,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 00:45:42,573 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 00:45:42,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 00:45:42,574 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 00:45:42,574 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 00:45:42,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 00:45:42,574 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 00:45:42,575 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 00:45:42,608 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 00:45:42,623 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 00:45:42,628 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 00:45:42,630 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 00:45:42,631 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 00:45:42,631 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem02_label08.c [2019-10-02 00:45:42,690 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f7467e9b/cb0a1af5d6e84807965aa0cb292b5cbd/FLAGea5b07aa0 [2019-10-02 00:45:43,243 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 00:45:43,244 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem02_label08.c [2019-10-02 00:45:43,258 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f7467e9b/cb0a1af5d6e84807965aa0cb292b5cbd/FLAGea5b07aa0 [2019-10-02 00:45:43,475 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f7467e9b/cb0a1af5d6e84807965aa0cb292b5cbd [2019-10-02 00:45:43,490 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 00:45:43,491 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 00:45:43,493 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 00:45:43,493 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 00:45:43,496 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 00:45:43,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:45:43" (1/1) ... [2019-10-02 00:45:43,499 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77a1e17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:43, skipping insertion in model container [2019-10-02 00:45:43,499 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:45:43" (1/1) ... [2019-10-02 00:45:43,506 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 00:45:43,560 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 00:45:44,071 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 00:45:44,085 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 00:45:44,190 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 00:45:44,207 INFO L192 MainTranslator]: Completed translation [2019-10-02 00:45:44,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:44 WrapperNode [2019-10-02 00:45:44,207 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 00:45:44,208 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 00:45:44,208 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 00:45:44,208 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 00:45:44,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:44" (1/1) ... [2019-10-02 00:45:44,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:44" (1/1) ... [2019-10-02 00:45:44,238 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:44" (1/1) ... [2019-10-02 00:45:44,238 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:44" (1/1) ... [2019-10-02 00:45:44,277 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:44" (1/1) ... [2019-10-02 00:45:44,294 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:44" (1/1) ... [2019-10-02 00:45:44,299 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:44" (1/1) ... [2019-10-02 00:45:44,306 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 00:45:44,307 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 00:45:44,307 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 00:45:44,307 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 00:45:44,308 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:44" (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:45:44,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 00:45:44,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 00:45:44,373 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 00:45:44,373 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 00:45:44,374 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 00:45:44,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 00:45:44,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 00:45:44,374 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 00:45:44,374 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 00:45:44,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 00:45:44,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 00:45:45,492 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 00:45:45,492 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 00:45:45,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:45:45 BoogieIcfgContainer [2019-10-02 00:45:45,494 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 00:45:45,495 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 00:45:45,495 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 00:45:45,498 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 00:45:45,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:45:43" (1/3) ... [2019-10-02 00:45:45,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f95074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:45:45, skipping insertion in model container [2019-10-02 00:45:45,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:45:44" (2/3) ... [2019-10-02 00:45:45,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f95074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:45:45, skipping insertion in model container [2019-10-02 00:45:45,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:45:45" (3/3) ... [2019-10-02 00:45:45,502 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label08.c [2019-10-02 00:45:45,512 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 00:45:45,520 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 00:45:45,538 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 00:45:45,572 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 00:45:45,573 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 00:45:45,573 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 00:45:45,573 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 00:45:45,573 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 00:45:45,574 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 00:45:45,574 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 00:45:45,574 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 00:45:45,574 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 00:45:45,599 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states. [2019-10-02 00:45:45,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-02 00:45:45,613 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:45:45,614 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:45:45,616 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:45:45,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:45:45,622 INFO L82 PathProgramCache]: Analyzing trace with hash -218350154, now seen corresponding path program 1 times [2019-10-02 00:45:45,624 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:45:45,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:45:45,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:45:45,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:45:45,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:45:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:45:46,165 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:45:46,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:45:46,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 00:45:46,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 00:45:46,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 00:45:46,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 00:45:46,191 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 3 states. [2019-10-02 00:45:47,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:45:47,068 INFO L93 Difference]: Finished difference Result 618 states and 1056 transitions. [2019-10-02 00:45:47,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 00:45:47,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-10-02 00:45:47,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:45:47,086 INFO L225 Difference]: With dead ends: 618 [2019-10-02 00:45:47,086 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 00:45:47,095 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:45:47,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 00:45:47,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 00:45:47,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 00:45:47,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 465 transitions. [2019-10-02 00:45:47,190 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 465 transitions. Word has length 128 [2019-10-02 00:45:47,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:45:47,192 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 465 transitions. [2019-10-02 00:45:47,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 00:45:47,192 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 465 transitions. [2019-10-02 00:45:47,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-02 00:45:47,204 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:45:47,205 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:45:47,205 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:45:47,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:45:47,207 INFO L82 PathProgramCache]: Analyzing trace with hash 206670545, now seen corresponding path program 1 times [2019-10-02 00:45:47,208 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:45:47,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:45:47,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:45:47,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:45:47,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:45:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:45:47,656 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:45:47,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:45:47,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 00:45:47,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 00:45:47,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 00:45:47,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:45:47,661 INFO L87 Difference]: Start difference. First operand 320 states and 465 transitions. Second operand 5 states. [2019-10-02 00:45:48,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:45:48,384 INFO L93 Difference]: Finished difference Result 721 states and 1089 transitions. [2019-10-02 00:45:48,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:45:48,386 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2019-10-02 00:45:48,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:45:48,392 INFO L225 Difference]: With dead ends: 721 [2019-10-02 00:45:48,392 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 00:45:48,394 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:45:48,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 00:45:48,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 00:45:48,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 00:45:48,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 461 transitions. [2019-10-02 00:45:48,413 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 461 transitions. Word has length 136 [2019-10-02 00:45:48,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:45:48,413 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 461 transitions. [2019-10-02 00:45:48,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 00:45:48,414 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 461 transitions. [2019-10-02 00:45:48,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-02 00:45:48,416 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:45:48,416 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:45:48,416 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:45:48,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:45:48,417 INFO L82 PathProgramCache]: Analyzing trace with hash 2140526213, now seen corresponding path program 1 times [2019-10-02 00:45:48,417 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:45:48,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:45:48,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:45:48,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:45:48,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:45:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:45:48,720 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:45:48,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:45:48,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 00:45:48,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 00:45:48,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 00:45:48,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:45:48,722 INFO L87 Difference]: Start difference. First operand 320 states and 461 transitions. Second operand 5 states. [2019-10-02 00:45:49,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:45:49,473 INFO L93 Difference]: Finished difference Result 717 states and 1075 transitions. [2019-10-02 00:45:49,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:45:49,476 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2019-10-02 00:45:49,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:45:49,479 INFO L225 Difference]: With dead ends: 717 [2019-10-02 00:45:49,479 INFO L226 Difference]: Without dead ends: 320 [2019-10-02 00:45:49,480 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:45:49,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-02 00:45:49,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-10-02 00:45:49,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-02 00:45:49,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 455 transitions. [2019-10-02 00:45:49,497 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 455 transitions. Word has length 142 [2019-10-02 00:45:49,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:45:49,498 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 455 transitions. [2019-10-02 00:45:49,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 00:45:49,498 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 455 transitions. [2019-10-02 00:45:49,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-02 00:45:49,501 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:45:49,501 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:45:49,501 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:45:49,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:45:49,502 INFO L82 PathProgramCache]: Analyzing trace with hash 507332814, now seen corresponding path program 1 times [2019-10-02 00:45:49,502 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:45:49,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:45:49,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:45:49,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:45:49,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:45:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:45:49,630 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:45:49,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:45:49,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 00:45:49,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 00:45:49,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 00:45:49,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 00:45:49,632 INFO L87 Difference]: Start difference. First operand 320 states and 455 transitions. Second operand 6 states. [2019-10-02 00:45:50,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:45:50,399 INFO L93 Difference]: Finished difference Result 951 states and 1383 transitions. [2019-10-02 00:45:50,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 00:45:50,400 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-10-02 00:45:50,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:45:50,406 INFO L225 Difference]: With dead ends: 951 [2019-10-02 00:45:50,406 INFO L226 Difference]: Without dead ends: 637 [2019-10-02 00:45:50,407 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:45:50,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2019-10-02 00:45:50,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 626. [2019-10-02 00:45:50,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 00:45:50,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 871 transitions. [2019-10-02 00:45:50,440 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 871 transitions. Word has length 150 [2019-10-02 00:45:50,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:45:50,441 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 871 transitions. [2019-10-02 00:45:50,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 00:45:50,441 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 871 transitions. [2019-10-02 00:45:50,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-02 00:45:50,445 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:45:50,445 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:45:50,445 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:45:50,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:45:50,446 INFO L82 PathProgramCache]: Analyzing trace with hash 842155530, now seen corresponding path program 1 times [2019-10-02 00:45:50,446 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:45:50,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:45:50,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:45:50,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:45:50,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:45:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:45:50,769 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:45:50,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:45:50,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 00:45:50,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 00:45:50,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 00:45:50,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:45:50,771 INFO L87 Difference]: Start difference. First operand 626 states and 871 transitions. Second operand 5 states. [2019-10-02 00:45:51,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:45:51,401 INFO L93 Difference]: Finished difference Result 1330 states and 1903 transitions. [2019-10-02 00:45:51,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:45:51,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 152 [2019-10-02 00:45:51,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:45:51,406 INFO L225 Difference]: With dead ends: 1330 [2019-10-02 00:45:51,406 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 00:45:51,408 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:45:51,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 00:45:51,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 00:45:51,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 00:45:51,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 859 transitions. [2019-10-02 00:45:51,428 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 859 transitions. Word has length 152 [2019-10-02 00:45:51,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:45:51,429 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 859 transitions. [2019-10-02 00:45:51,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 00:45:51,429 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 859 transitions. [2019-10-02 00:45:51,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-02 00:45:51,432 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:45:51,432 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:45:51,432 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:45:51,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:45:51,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1322550086, now seen corresponding path program 1 times [2019-10-02 00:45:51,433 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:45:51,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:45:51,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:45:51,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:45:51,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:45:51,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:45:51,626 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:45:51,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:45:51,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 00:45:51,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 00:45:51,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 00:45:51,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 00:45:51,629 INFO L87 Difference]: Start difference. First operand 626 states and 859 transitions. Second operand 5 states. [2019-10-02 00:45:52,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:45:52,234 INFO L93 Difference]: Finished difference Result 1332 states and 1878 transitions. [2019-10-02 00:45:52,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 00:45:52,235 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 154 [2019-10-02 00:45:52,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:45:52,239 INFO L225 Difference]: With dead ends: 1332 [2019-10-02 00:45:52,239 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 00:45:52,241 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:45:52,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 00:45:52,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 00:45:52,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 00:45:52,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 843 transitions. [2019-10-02 00:45:52,260 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 843 transitions. Word has length 154 [2019-10-02 00:45:52,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:45:52,260 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 843 transitions. [2019-10-02 00:45:52,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 00:45:52,261 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 843 transitions. [2019-10-02 00:45:52,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 00:45:52,263 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:45:52,264 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:45:52,264 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:45:52,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:45:52,264 INFO L82 PathProgramCache]: Analyzing trace with hash 484490686, now seen corresponding path program 1 times [2019-10-02 00:45:52,265 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:45:52,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:45:52,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:45:52,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:45:52,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:45:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:45:52,346 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:45:52,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 00:45:52,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 00:45:52,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 00:45:52,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 00:45:52,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 00:45:52,348 INFO L87 Difference]: Start difference. First operand 626 states and 843 transitions. Second operand 6 states. [2019-10-02 00:45:53,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:45:53,221 INFO L93 Difference]: Finished difference Result 1858 states and 2601 transitions. [2019-10-02 00:45:53,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 00:45:53,222 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 158 [2019-10-02 00:45:53,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:45:53,230 INFO L225 Difference]: With dead ends: 1858 [2019-10-02 00:45:53,230 INFO L226 Difference]: Without dead ends: 1238 [2019-10-02 00:45:53,232 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:45:53,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2019-10-02 00:45:53,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1218. [2019-10-02 00:45:53,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-10-02 00:45:53,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1637 transitions. [2019-10-02 00:45:53,272 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1637 transitions. Word has length 158 [2019-10-02 00:45:53,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:45:53,272 INFO L475 AbstractCegarLoop]: Abstraction has 1218 states and 1637 transitions. [2019-10-02 00:45:53,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 00:45:53,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1637 transitions. [2019-10-02 00:45:53,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-02 00:45:53,277 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:45:53,278 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 00:45:53,278 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:45:53,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:45:53,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1847232649, now seen corresponding path program 1 times [2019-10-02 00:45:53,279 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:45:53,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:45:53,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:45:53,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:45:53,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:45:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:45:53,423 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 25 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:45:53,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:45:53,424 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) [2019-10-02 00:45:53,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 00:45:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:45:53,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 00:45:53,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:45:53,688 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-02 00:45:53,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 00:45:53,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-10-02 00:45:53,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 00:45:53,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 00:45:53,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-10-02 00:45:53,703 INFO L87 Difference]: Start difference. First operand 1218 states and 1637 transitions. Second operand 9 states. [2019-10-02 00:45:56,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:45:56,835 INFO L93 Difference]: Finished difference Result 5741 states and 8286 transitions. [2019-10-02 00:45:56,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 00:45:56,836 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 163 [2019-10-02 00:45:56,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:45:56,863 INFO L225 Difference]: With dead ends: 5741 [2019-10-02 00:45:56,863 INFO L226 Difference]: Without dead ends: 4529 [2019-10-02 00:45:56,869 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=456, Unknown=0, NotChecked=0, Total=600 [2019-10-02 00:45:56,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4529 states. [2019-10-02 00:45:56,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4529 to 4359. [2019-10-02 00:45:56,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4359 states. [2019-10-02 00:45:57,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4359 states to 4359 states and 5657 transitions. [2019-10-02 00:45:57,008 INFO L78 Accepts]: Start accepts. Automaton has 4359 states and 5657 transitions. Word has length 163 [2019-10-02 00:45:57,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:45:57,009 INFO L475 AbstractCegarLoop]: Abstraction has 4359 states and 5657 transitions. [2019-10-02 00:45:57,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 00:45:57,009 INFO L276 IsEmpty]: Start isEmpty. Operand 4359 states and 5657 transitions. [2019-10-02 00:45:57,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-10-02 00:45:57,029 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 00:45:57,030 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 00:45:57,030 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 00:45:57,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 00:45:57,031 INFO L82 PathProgramCache]: Analyzing trace with hash 694498944, now seen corresponding path program 1 times [2019-10-02 00:45:57,031 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 00:45:57,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 00:45:57,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:45:57,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:45:57,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 00:45:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:45:57,365 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 138 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:45:57,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 00:45:57,366 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:45:57,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 00:45:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 00:45:57,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 00:45:57,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 00:45:57,682 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 203 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 00:45:57,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 00:45:57,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2019-10-02 00:45:57,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 00:45:57,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 00:45:57,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-10-02 00:45:57,696 INFO L87 Difference]: Start difference. First operand 4359 states and 5657 transitions. Second operand 14 states. [2019-10-02 00:46:00,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 00:46:00,466 INFO L93 Difference]: Finished difference Result 9180 states and 12135 transitions. [2019-10-02 00:46:00,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 00:46:00,466 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 275 [2019-10-02 00:46:00,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 00:46:00,467 INFO L225 Difference]: With dead ends: 9180 [2019-10-02 00:46:00,467 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 00:46:00,494 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2019-10-02 00:46:00,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 00:46:00,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 00:46:00,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 00:46:00,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 00:46:00,495 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 275 [2019-10-02 00:46:00,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 00:46:00,495 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 00:46:00,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 00:46:00,496 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 00:46:00,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 00:46:00,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 00:46:00,832 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 71 [2019-10-02 00:46:02,249 WARN L191 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 150 DAG size of output: 84 [2019-10-02 00:46:02,687 WARN L191 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-10-02 00:46:03,113 WARN L191 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-10-02 00:46:03,116 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 00:46:03,117 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a17~0 |old(~a17~0)|) (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) [2019-10-02 00:46:03,117 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 00:46:03,117 INFO L443 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,117 INFO L443 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,117 INFO L443 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,117 INFO L443 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,117 INFO L443 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,117 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-10-02 00:46:03,118 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-10-02 00:46:03,118 INFO L443 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-10-02 00:46:03,118 INFO L443 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-10-02 00:46:03,118 INFO L443 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-10-02 00:46:03,118 INFO L443 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-10-02 00:46:03,118 INFO L443 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-10-02 00:46:03,118 INFO L443 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-10-02 00:46:03,119 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-10-02 00:46:03,119 INFO L443 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-10-02 00:46:03,119 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-10-02 00:46:03,119 INFO L443 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-10-02 00:46:03,119 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-10-02 00:46:03,119 INFO L443 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,119 INFO L443 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,120 INFO L443 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,120 INFO L443 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,120 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-10-02 00:46:03,120 INFO L443 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,120 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-10-02 00:46:03,120 INFO L443 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-10-02 00:46:03,120 INFO L443 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-10-02 00:46:03,120 INFO L443 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-10-02 00:46:03,121 INFO L443 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-10-02 00:46:03,121 INFO L443 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-10-02 00:46:03,121 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 538) no Hoare annotation was computed. [2019-10-02 00:46:03,121 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-10-02 00:46:03,121 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-10-02 00:46:03,121 INFO L443 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-10-02 00:46:03,121 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-10-02 00:46:03,122 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-10-02 00:46:03,122 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-10-02 00:46:03,122 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-10-02 00:46:03,122 INFO L443 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-10-02 00:46:03,122 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-10-02 00:46:03,122 INFO L443 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,122 INFO L443 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,122 INFO L443 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,123 INFO L443 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,123 INFO L443 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,123 INFO L443 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-10-02 00:46:03,123 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-10-02 00:46:03,123 INFO L443 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-10-02 00:46:03,123 INFO L443 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-10-02 00:46:03,123 INFO L443 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-10-02 00:46:03,123 INFO L443 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-10-02 00:46:03,124 INFO L443 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-10-02 00:46:03,124 INFO L443 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-10-02 00:46:03,124 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-10-02 00:46:03,124 INFO L443 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-10-02 00:46:03,124 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-10-02 00:46:03,124 INFO L443 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,124 INFO L443 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,124 INFO L443 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,124 INFO L443 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,125 INFO L443 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,125 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-10-02 00:46:03,125 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-10-02 00:46:03,125 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-10-02 00:46:03,125 INFO L443 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-10-02 00:46:03,125 INFO L443 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-10-02 00:46:03,125 INFO L443 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-10-02 00:46:03,125 INFO L443 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-10-02 00:46:03,125 INFO L443 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-10-02 00:46:03,126 INFO L443 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-10-02 00:46:03,126 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-10-02 00:46:03,126 INFO L443 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-10-02 00:46:03,126 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-10-02 00:46:03,126 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-10-02 00:46:03,126 INFO L443 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,126 INFO L443 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,127 INFO L443 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,127 INFO L443 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,127 INFO L443 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,127 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-10-02 00:46:03,127 INFO L443 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-10-02 00:46:03,127 INFO L443 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-10-02 00:46:03,127 INFO L443 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-10-02 00:46:03,127 INFO L443 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-10-02 00:46:03,128 INFO L443 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-10-02 00:46:03,128 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-10-02 00:46:03,128 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-10-02 00:46:03,128 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-10-02 00:46:03,128 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-10-02 00:46:03,128 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-10-02 00:46:03,128 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-10-02 00:46:03,128 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-10-02 00:46:03,128 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-10-02 00:46:03,129 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-10-02 00:46:03,129 INFO L443 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-10-02 00:46:03,129 INFO L443 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,129 INFO L443 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,129 INFO L443 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,129 INFO L443 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,129 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-10-02 00:46:03,129 INFO L443 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,130 INFO L443 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-10-02 00:46:03,130 INFO L443 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,130 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-10-02 00:46:03,130 INFO L443 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-10-02 00:46:03,130 INFO L443 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-10-02 00:46:03,130 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,130 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,131 INFO L443 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-10-02 00:46:03,131 INFO L443 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-10-02 00:46:03,131 INFO L443 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-10-02 00:46:03,131 INFO L443 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-10-02 00:46:03,131 INFO L443 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-10-02 00:46:03,131 INFO L443 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-10-02 00:46:03,131 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-10-02 00:46:03,131 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-10-02 00:46:03,131 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-10-02 00:46:03,132 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-10-02 00:46:03,132 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-10-02 00:46:03,132 INFO L443 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,132 INFO L443 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,132 INFO L443 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,132 INFO L443 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,132 INFO L443 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,132 INFO L443 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,133 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-10-02 00:46:03,133 INFO L443 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-10-02 00:46:03,133 INFO L443 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-10-02 00:46:03,133 INFO L443 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-10-02 00:46:03,133 INFO L443 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-10-02 00:46:03,133 INFO L443 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-10-02 00:46:03,133 INFO L443 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-10-02 00:46:03,133 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-10-02 00:46:03,133 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-10-02 00:46:03,134 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-10-02 00:46:03,134 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-10-02 00:46:03,134 INFO L443 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,134 INFO L443 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,134 INFO L443 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,134 INFO L443 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,134 INFO L443 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,134 INFO L443 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,135 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-10-02 00:46:03,135 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-10-02 00:46:03,135 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-10-02 00:46:03,135 INFO L443 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-10-02 00:46:03,135 INFO L443 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-10-02 00:46:03,135 INFO L443 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-10-02 00:46:03,135 INFO L443 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-10-02 00:46:03,135 INFO L443 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-10-02 00:46:03,136 INFO L443 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-10-02 00:46:03,136 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-10-02 00:46:03,136 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-10-02 00:46:03,136 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-10-02 00:46:03,136 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-10-02 00:46:03,136 INFO L443 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-10-02 00:46:03,136 INFO L443 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,136 INFO L443 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,136 INFO L443 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,137 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 29 598) the Hoare annotation is: (let ((.cse21 (not (= 1 ~a11~0))) (.cse2 (= 1 |old(~a11~0)|)) (.cse10 (= 1 |old(~a19~0)|)) (.cse7 (= 1 |old(~a25~0)|)) (.cse19 (= ~a17~0 |old(~a17~0)|)) (.cse22 (= ~a19~0 |old(~a19~0)|)) (.cse20 (= ~a28~0 |old(~a28~0)|)) (.cse23 (= ~a25~0 |old(~a25~0)|))) (let ((.cse24 (not (= 7 |old(~a28~0)|))) (.cse15 (= ~a19~0 1)) (.cse16 (= ~a25~0 1)) (.cse14 (= ~a17~0 8)) (.cse25 (= ~a28~0 7)) (.cse11 (not (<= |old(~a17~0)| 7))) (.cse9 (and .cse19 .cse22 .cse20 .cse23)) (.cse6 (not (<= 1 |old(~a19~0)|))) (.cse12 (not .cse7)) (.cse13 (not .cse10)) (.cse18 (not .cse2)) (.cse17 (= ~a11~0 1)) (.cse0 (not (<= |old(~a28~0)| 10))) (.cse1 (not (= 1 ~a21~0))) (.cse4 (= 8 |old(~a28~0)|)) (.cse5 (= 9 |old(~a28~0)|)) (.cse8 (not (= 8 |old(~a17~0)|))) (.cse3 (and .cse21 .cse19 .cse22 .cse20 .cse23))) (and (or .cse0 (= 10 |old(~a17~0)|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse4 .cse8 .cse9 .cse6 .cse7) (or .cse0 .cse10 .cse1 .cse4 .cse9 .cse11) (or .cse1 .cse12 .cse13 .cse8 (and (= ~a28~0 9) .cse14 .cse15 .cse16 .cse17) (not .cse5) .cse18) (or .cse1 .cse2 .cse3 .cse8 .cse6) (or (or .cse1 .cse2 (not (<= |old(~a19~0)| 0)) .cse7) (and .cse19 .cse20 (or (<= ~a28~0 10) (and .cse21 .cse22 .cse23))) .cse4 .cse11) (or .cse1 .cse24 .cse12 .cse13 (and (= ~a17~0 7) .cse15 .cse25 .cse17 .cse23) .cse18 (not (= 7 |old(~a17~0)|))) (or .cse10 .cse1 .cse24 (and (not .cse15) (not .cse16) .cse14 .cse25 .cse17) .cse8 .cse18 .cse7) (or .cse0 .cse1 .cse9 .cse4 .cse5 .cse11 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse8 .cse7) (or .cse0 .cse1 .cse9 .cse4 .cse5 .cse8 .cse6) (or .cse1 (not (= 10 |old(~a28~0)|)) .cse12 .cse13 .cse8 .cse18 .cse17) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse8 .cse3)))) [2019-10-02 00:46:03,137 INFO L443 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,137 INFO L443 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,138 INFO L443 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,138 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-10-02 00:46:03,138 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-10-02 00:46:03,138 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-10-02 00:46:03,138 INFO L443 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-10-02 00:46:03,138 INFO L443 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-10-02 00:46:03,138 INFO L443 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-10-02 00:46:03,139 INFO L443 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-10-02 00:46:03,139 INFO L443 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-10-02 00:46:03,139 INFO L443 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-10-02 00:46:03,139 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-10-02 00:46:03,139 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-10-02 00:46:03,139 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-10-02 00:46:03,139 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-10-02 00:46:03,139 INFO L443 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,140 INFO L443 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,140 INFO L443 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,140 INFO L443 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,140 INFO L443 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,140 INFO L443 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,140 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-10-02 00:46:03,140 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-10-02 00:46:03,140 INFO L443 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-10-02 00:46:03,141 INFO L443 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-10-02 00:46:03,141 INFO L443 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-10-02 00:46:03,141 INFO L443 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-10-02 00:46:03,141 INFO L443 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-10-02 00:46:03,141 INFO L443 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-10-02 00:46:03,141 INFO L443 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-10-02 00:46:03,141 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-10-02 00:46:03,141 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-10-02 00:46:03,142 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-10-02 00:46:03,142 INFO L443 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-10-02 00:46:03,142 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-10-02 00:46:03,142 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-10-02 00:46:03,142 INFO L443 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-10-02 00:46:03,142 INFO L443 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,142 INFO L443 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,142 INFO L443 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,143 INFO L443 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,143 INFO L443 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-10-02 00:46:03,143 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-10-02 00:46:03,143 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-10-02 00:46:03,143 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-10-02 00:46:03,143 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-10-02 00:46:03,143 INFO L443 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-10-02 00:46:03,143 INFO L443 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-10-02 00:46:03,144 INFO L443 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-10-02 00:46:03,144 INFO L443 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-10-02 00:46:03,144 INFO L443 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-10-02 00:46:03,144 INFO L443 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-10-02 00:46:03,144 INFO L443 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-10-02 00:46:03,144 INFO L443 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-10-02 00:46:03,144 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-10-02 00:46:03,144 INFO L443 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-10-02 00:46:03,145 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-10-02 00:46:03,145 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-10-02 00:46:03,145 INFO L443 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-10-02 00:46:03,145 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-10-02 00:46:03,145 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-10-02 00:46:03,145 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 00:46:03,145 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= 1 ~a11~0)) (not (= ~a17~0 10)) (not (= ~a25~0 1)) (<= ~a28~0 10) (not (= ~a28~0 8)) (= ~a21~0 1) (not (= ~a28~0 9)) (<= 1 ~a19~0)) [2019-10-02 00:46:03,146 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 00:46:03,146 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 00:46:03,146 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 600 617) the Hoare annotation is: (or (not (<= |old(~a28~0)| 10)) (= 10 |old(~a17~0)|) (not (= 1 ~a21~0)) (= 1 |old(~a11~0)|) (and (not (= 1 ~a11~0)) (= ~a17~0 |old(~a17~0)|) (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|) (= ~a25~0 |old(~a25~0)|)) (= 8 |old(~a28~0)|) (= 9 |old(~a28~0)|) (not (<= 1 |old(~a19~0)|)) (= 1 |old(~a25~0)|)) [2019-10-02 00:46:03,146 INFO L439 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse7 (= ~a25~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a19~0 1))) (let ((.cse3 (<= 1 ~a19~0)) (.cse9 (not .cse6)) (.cse13 (= ~a28~0 7)) (.cse11 (<= ~a28~0 10)) (.cse12 (not (= ~a28~0 8))) (.cse15 (not .cse4)) (.cse0 (not (= 1 ~a11~0))) (.cse1 (= ~a17~0 |old(~a17~0)|)) (.cse10 (<= ~a17~0 7)) (.cse14 (not .cse7)) (.cse2 (= 8 |old(~a17~0)|)) (.cse16 (= ~a28~0 10)) (.cse5 (= ~a17~0 8)) (.cse8 (= ~a11~0 1))) (or (not (= 1 ~a21~0)) (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8) (not (<= 1 |old(~a19~0)|)) (= 1 |old(~a25~0)|) (and .cse9 .cse10 .cse11 .cse12 .cse2) (and (= ~a17~0 7) .cse6 .cse13 .cse7 .cse8) (= 10 |old(~a17~0)|) (= 1 |old(~a11~0)|) (and .cse1 .cse14 .cse11 .cse12 .cse2 .cse3) (and .cse1 .cse11 .cse12 .cse2 .cse15 .cse3) (and .cse9 .cse14 .cse5 .cse13 .cse8) (and .cse0 .cse1 .cse14 .cse11 .cse2 .cse15) (and .cse0 .cse1 .cse11 .cse12 .cse2 .cse15) (= 9 |old(~a28~0)|) (and .cse0 .cse1 .cse14 (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|)) (not (<= |old(~a28~0)| 10)) (and .cse16 .cse10 .cse14 .cse2) (= 8 |old(~a28~0)|) (and .cse16 .cse5 .cse6 .cse7 .cse8)))) [2019-10-02 00:46:03,146 INFO L443 ceAbstractionStarter]: For program point L606-3(lines 600 617) no Hoare annotation was computed. [2019-10-02 00:46:03,147 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 600 617) no Hoare annotation was computed. [2019-10-02 00:46:03,147 INFO L439 ceAbstractionStarter]: At program point L614(line 614) the Hoare annotation is: (let ((.cse7 (= ~a25~0 1)) (.cse4 (= ~a28~0 9)) (.cse6 (= ~a19~0 1))) (let ((.cse3 (<= 1 ~a19~0)) (.cse9 (not .cse6)) (.cse13 (= ~a28~0 7)) (.cse11 (<= ~a28~0 10)) (.cse12 (not (= ~a28~0 8))) (.cse15 (not .cse4)) (.cse0 (not (= 1 ~a11~0))) (.cse1 (= ~a17~0 |old(~a17~0)|)) (.cse10 (<= ~a17~0 7)) (.cse14 (not .cse7)) (.cse2 (= 8 |old(~a17~0)|)) (.cse16 (= ~a28~0 10)) (.cse5 (= ~a17~0 8)) (.cse8 (= ~a11~0 1))) (or (not (= 1 ~a21~0)) (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8) (not (<= 1 |old(~a19~0)|)) (= 1 |old(~a25~0)|) (and .cse9 .cse10 .cse11 .cse12 .cse2) (and (= ~a17~0 7) .cse6 .cse13 .cse7 .cse8) (= 10 |old(~a17~0)|) (= 1 |old(~a11~0)|) (and .cse1 .cse14 .cse11 .cse12 .cse2 .cse3) (and .cse1 .cse11 .cse12 .cse2 .cse15 .cse3) (and .cse9 .cse14 .cse5 .cse13 .cse8) (and .cse0 .cse1 .cse14 .cse11 .cse2 .cse15) (and .cse0 .cse1 .cse11 .cse12 .cse2 .cse15) (= 9 |old(~a28~0)|) (and .cse0 .cse1 .cse14 (= ~a19~0 |old(~a19~0)|) (= ~a28~0 |old(~a28~0)|)) (not (<= |old(~a28~0)| 10)) (and .cse16 .cse10 .cse14 .cse2) (= 8 |old(~a28~0)|) (and .cse16 .cse5 .cse6 .cse7 .cse8)))) [2019-10-02 00:46:03,147 INFO L443 ceAbstractionStarter]: For program point L614-1(line 614) no Hoare annotation was computed. [2019-10-02 00:46:03,147 INFO L443 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-10-02 00:46:03,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 12:46:03 BoogieIcfgContainer [2019-10-02 00:46:03,169 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 00:46:03,171 INFO L168 Benchmark]: Toolchain (without parser) took 19679.50 ms. Allocated memory was 141.0 MB in the beginning and 541.1 MB in the end (delta: 400.0 MB). Free memory was 87.4 MB in the beginning and 306.4 MB in the end (delta: -219.0 MB). Peak memory consumption was 414.3 MB. Max. memory is 7.1 GB. [2019-10-02 00:46:03,172 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 141.0 MB. Free memory was 107.1 MB in the beginning and 106.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 00:46:03,173 INFO L168 Benchmark]: CACSL2BoogieTranslator took 715.19 ms. Allocated memory was 141.0 MB in the beginning and 202.4 MB in the end (delta: 61.3 MB). Free memory was 87.2 MB in the beginning and 163.6 MB in the end (delta: -76.4 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. [2019-10-02 00:46:03,174 INFO L168 Benchmark]: Boogie Preprocessor took 98.58 ms. Allocated memory is still 202.4 MB. Free memory was 163.6 MB in the beginning and 158.7 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2019-10-02 00:46:03,175 INFO L168 Benchmark]: RCFGBuilder took 1187.14 ms. Allocated memory was 202.4 MB in the beginning and 229.1 MB in the end (delta: 26.7 MB). Free memory was 158.7 MB in the beginning and 173.3 MB in the end (delta: -14.6 MB). Peak memory consumption was 84.5 MB. Max. memory is 7.1 GB. [2019-10-02 00:46:03,176 INFO L168 Benchmark]: TraceAbstraction took 17673.90 ms. Allocated memory was 229.1 MB in the beginning and 541.1 MB in the end (delta: 312.0 MB). Free memory was 173.3 MB in the beginning and 306.4 MB in the end (delta: -133.1 MB). Peak memory consumption was 412.1 MB. Max. memory is 7.1 GB. [2019-10-02 00:46:03,180 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.50 ms. Allocated memory is still 141.0 MB. Free memory was 107.1 MB in the beginning and 106.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 715.19 ms. Allocated memory was 141.0 MB in the beginning and 202.4 MB in the end (delta: 61.3 MB). Free memory was 87.2 MB in the beginning and 163.6 MB in the end (delta: -76.4 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 98.58 ms. Allocated memory is still 202.4 MB. Free memory was 163.6 MB in the beginning and 158.7 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1187.14 ms. Allocated memory was 202.4 MB in the beginning and 229.1 MB in the end (delta: 26.7 MB). Free memory was 158.7 MB in the beginning and 173.3 MB in the end (delta: -14.6 MB). Peak memory consumption was 84.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17673.90 ms. Allocated memory was 229.1 MB in the beginning and 541.1 MB in the end (delta: 312.0 MB). Free memory was 173.3 MB in the beginning and 306.4 MB in the end (delta: -133.1 MB). Peak memory consumption was 412.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 538]: 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)) && 8 == \old(a17)) && 1 <= a19)) || ((((a28 == 9 && a17 == 8) && a19 == 1) && a25 == 1) && a11 == 1)) || !(1 <= \old(a19))) || 1 == \old(a25)) || ((((!(a19 == 1) && a17 <= 7) && a28 <= 10) && !(a28 == 8)) && 8 == \old(a17))) || ((((a17 == 7 && a19 == 1) && a28 == 7) && a25 == 1) && a11 == 1)) || 10 == \old(a17)) || 1 == \old(a11)) || (((((a17 == \old(a17) && !(a25 == 1)) && a28 <= 10) && !(a28 == 8)) && 8 == \old(a17)) && 1 <= a19)) || (((((a17 == \old(a17) && a28 <= 10) && !(a28 == 8)) && 8 == \old(a17)) && !(a28 == 9)) && 1 <= a19)) || ((((!(a19 == 1) && !(a25 == 1)) && a17 == 8) && a28 == 7) && a11 == 1)) || (((((!(1 == a11) && a17 == \old(a17)) && !(a25 == 1)) && a28 <= 10) && 8 == \old(a17)) && !(a28 == 9))) || (((((!(1 == a11) && a17 == \old(a17)) && a28 <= 10) && !(a28 == 8)) && 8 == \old(a17)) && !(a28 == 9))) || 9 == \old(a28)) || ((((!(1 == a11) && a17 == \old(a17)) && !(a25 == 1)) && a19 == \old(a19)) && a28 == \old(a28))) || !(\old(a28) <= 10)) || (((a28 == 10 && a17 <= 7) && !(a25 == 1)) && 8 == \old(a17))) || 8 == \old(a28)) || ((((a28 == 10 && a17 == 8) && a19 == 1) && a25 == 1) && a11 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 236 locations, 1 error locations. SAFE Result, 17.5s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 11.2s AutomataDifference, 0.0s DeadEndRemovalTime, 2.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 557 SDtfs, 7433 SDslu, 649 SDs, 0 SdLazy, 9023 SolverSat, 1797 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 571 GetRequests, 490 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4359occurred in iteration=8, 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, 9 MinimizatonAttempts, 201 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 140 PreInvPairs, 266 NumberOfFragments, 1069 HoareAnnotationTreeSize, 140 FomulaSimplifications, 6132 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 7 FomulaSimplificationsInter, 2417 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1896 NumberOfCodeBlocks, 1896 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1885 ConstructedInterpolants, 0 QuantifiedInterpolants, 1783122 SizeOfPredicates, 3 NumberOfNonLiveVariables, 949 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 514/600 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...