java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label50.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 01:23:10,264 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 01:23:10,266 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 01:23:10,278 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 01:23:10,279 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 01:23:10,280 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 01:23:10,281 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 01:23:10,283 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 01:23:10,285 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 01:23:10,286 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 01:23:10,286 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 01:23:10,288 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 01:23:10,288 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 01:23:10,289 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 01:23:10,290 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 01:23:10,291 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 01:23:10,292 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 01:23:10,293 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 01:23:10,294 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 01:23:10,296 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 01:23:10,297 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 01:23:10,298 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 01:23:10,299 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 01:23:10,300 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 01:23:10,302 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 01:23:10,302 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 01:23:10,303 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 01:23:10,303 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 01:23:10,304 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 01:23:10,305 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 01:23:10,305 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 01:23:10,306 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 01:23:10,306 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 01:23:10,307 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 01:23:10,308 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 01:23:10,308 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 01:23:10,309 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 01:23:10,309 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 01:23:10,309 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 01:23:10,310 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 01:23:10,311 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 01:23:10,312 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 01:23:10,327 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 01:23:10,328 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 01:23:10,330 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 01:23:10,331 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 01:23:10,331 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 01:23:10,331 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 01:23:10,332 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 01:23:10,332 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 01:23:10,333 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 01:23:10,333 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 01:23:10,333 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 01:23:10,333 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 01:23:10,333 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 01:23:10,334 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 01:23:10,334 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 01:23:10,334 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 01:23:10,335 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 01:23:10,336 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 01:23:10,336 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 01:23:10,336 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 01:23:10,336 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 01:23:10,336 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 01:23:10,337 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 01:23:10,337 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 01:23:10,337 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 01:23:10,340 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 01:23:10,341 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 01:23:10,341 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 01:23:10,341 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 01:23:10,392 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 01:23:10,410 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 01:23:10,416 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 01:23:10,417 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 01:23:10,418 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 01:23:10,419 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label50.c [2019-10-02 01:23:10,493 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e93168f52/d7252db0cb6341c29f5d2ada2e0b4739/FLAGce29f1916 [2019-10-02 01:23:11,131 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 01:23:11,132 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label50.c [2019-10-02 01:23:11,148 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e93168f52/d7252db0cb6341c29f5d2ada2e0b4739/FLAGce29f1916 [2019-10-02 01:23:11,350 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e93168f52/d7252db0cb6341c29f5d2ada2e0b4739 [2019-10-02 01:23:11,361 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 01:23:11,362 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 01:23:11,363 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 01:23:11,363 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 01:23:11,366 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 01:23:11,367 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:23:11" (1/1) ... [2019-10-02 01:23:11,370 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@154386d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:11, skipping insertion in model container [2019-10-02 01:23:11,371 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:23:11" (1/1) ... [2019-10-02 01:23:11,377 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 01:23:11,434 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 01:23:12,041 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:23:12,048 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 01:23:12,203 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 01:23:12,224 INFO L192 MainTranslator]: Completed translation [2019-10-02 01:23:12,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:12 WrapperNode [2019-10-02 01:23:12,225 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 01:23:12,226 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 01:23:12,226 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 01:23:12,226 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 01:23:12,245 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:12" (1/1) ... [2019-10-02 01:23:12,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:12" (1/1) ... [2019-10-02 01:23:12,292 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:12" (1/1) ... [2019-10-02 01:23:12,294 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:12" (1/1) ... [2019-10-02 01:23:12,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:12" (1/1) ... [2019-10-02 01:23:12,357 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:12" (1/1) ... [2019-10-02 01:23:12,365 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:12" (1/1) ... [2019-10-02 01:23:12,375 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 01:23:12,376 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 01:23:12,376 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 01:23:12,376 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 01:23:12,377 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 01:23:12,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 01:23:12,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 01:23:12,464 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 01:23:12,464 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 01:23:12,465 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 01:23:12,465 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 01:23:12,465 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 01:23:12,465 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 01:23:12,466 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 01:23:12,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 01:23:12,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 01:23:14,371 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 01:23:14,371 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 01:23:14,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:23:14 BoogieIcfgContainer [2019-10-02 01:23:14,374 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 01:23:14,375 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 01:23:14,375 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 01:23:14,379 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 01:23:14,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:23:11" (1/3) ... [2019-10-02 01:23:14,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7de4b0a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:23:14, skipping insertion in model container [2019-10-02 01:23:14,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:23:12" (2/3) ... [2019-10-02 01:23:14,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7de4b0a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:23:14, skipping insertion in model container [2019-10-02 01:23:14,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:23:14" (3/3) ... [2019-10-02 01:23:14,384 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label50.c [2019-10-02 01:23:14,396 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 01:23:14,406 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 01:23:14,426 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 01:23:14,462 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 01:23:14,463 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 01:23:14,463 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 01:23:14,464 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 01:23:14,464 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 01:23:14,464 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 01:23:14,464 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 01:23:14,465 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 01:23:14,465 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 01:23:14,490 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states. [2019-10-02 01:23:14,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-02 01:23:14,499 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:23:14,500 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] [2019-10-02 01:23:14,503 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:23:14,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:23:14,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1557712066, now seen corresponding path program 1 times [2019-10-02 01:23:14,512 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:23:14,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:23:14,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:14,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:14,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:14,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:23:14,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:23:14,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 01:23:14,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 01:23:14,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 01:23:14,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 01:23:14,853 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 3 states. [2019-10-02 01:23:16,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:23:16,311 INFO L93 Difference]: Finished difference Result 688 states and 1223 transitions. [2019-10-02 01:23:16,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 01:23:16,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-02 01:23:16,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:23:16,346 INFO L225 Difference]: With dead ends: 688 [2019-10-02 01:23:16,346 INFO L226 Difference]: Without dead ends: 372 [2019-10-02 01:23:16,357 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 01:23:16,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-10-02 01:23:16,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2019-10-02 01:23:16,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-10-02 01:23:16,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 602 transitions. [2019-10-02 01:23:16,477 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 602 transitions. Word has length 43 [2019-10-02 01:23:16,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:23:16,477 INFO L475 AbstractCegarLoop]: Abstraction has 372 states and 602 transitions. [2019-10-02 01:23:16,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 01:23:16,478 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 602 transitions. [2019-10-02 01:23:16,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-02 01:23:16,494 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:23:16,494 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:23:16,495 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:23:16,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:23:16,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1883069890, now seen corresponding path program 1 times [2019-10-02 01:23:16,496 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:23:16,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:23:16,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:16,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:16,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:16,782 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:23:16,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:23:16,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 01:23:16,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 01:23:16,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 01:23:16,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 01:23:16,785 INFO L87 Difference]: Start difference. First operand 372 states and 602 transitions. Second operand 6 states. [2019-10-02 01:23:18,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:23:18,056 INFO L93 Difference]: Finished difference Result 936 states and 1526 transitions. [2019-10-02 01:23:18,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 01:23:18,060 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2019-10-02 01:23:18,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:23:18,064 INFO L225 Difference]: With dead ends: 936 [2019-10-02 01:23:18,064 INFO L226 Difference]: Without dead ends: 570 [2019-10-02 01:23:18,066 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 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 01:23:18,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-10-02 01:23:18,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 562. [2019-10-02 01:23:18,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-10-02 01:23:18,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 814 transitions. [2019-10-02 01:23:18,093 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 814 transitions. Word has length 129 [2019-10-02 01:23:18,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:23:18,094 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 814 transitions. [2019-10-02 01:23:18,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 01:23:18,094 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 814 transitions. [2019-10-02 01:23:18,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-02 01:23:18,097 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:23:18,097 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:23:18,097 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:23:18,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:23:18,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1079220531, now seen corresponding path program 1 times [2019-10-02 01:23:18,098 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:23:18,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:23:18,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:18,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:18,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:18,278 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:23:18,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 01:23:18,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 01:23:18,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 01:23:18,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 01:23:18,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 01:23:18,283 INFO L87 Difference]: Start difference. First operand 562 states and 814 transitions. Second operand 4 states. [2019-10-02 01:23:19,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:23:19,871 INFO L93 Difference]: Finished difference Result 2220 states and 3286 transitions. [2019-10-02 01:23:19,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 01:23:19,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-02 01:23:19,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:23:19,882 INFO L225 Difference]: With dead ends: 2220 [2019-10-02 01:23:19,882 INFO L226 Difference]: Without dead ends: 1664 [2019-10-02 01:23:19,884 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 01:23:19,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2019-10-02 01:23:19,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1664. [2019-10-02 01:23:19,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1664 states. [2019-10-02 01:23:19,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 2308 transitions. [2019-10-02 01:23:19,958 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 2308 transitions. Word has length 138 [2019-10-02 01:23:19,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:23:19,959 INFO L475 AbstractCegarLoop]: Abstraction has 1664 states and 2308 transitions. [2019-10-02 01:23:19,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 01:23:19,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2308 transitions. [2019-10-02 01:23:19,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-10-02 01:23:19,969 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:23:19,970 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 01:23:19,970 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:23:19,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:23:19,971 INFO L82 PathProgramCache]: Analyzing trace with hash 762391661, now seen corresponding path program 1 times [2019-10-02 01:23:19,971 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:23:19,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:23:19,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:19,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:19,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:20,871 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 145 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 01:23:20,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:23:20,872 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:23:20,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:21,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 01:23:21,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:23:21,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:23:21,307 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 01:23:21,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:23:21,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2019-10-02 01:23:21,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 01:23:21,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 01:23:21,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-10-02 01:23:21,315 INFO L87 Difference]: Start difference. First operand 1664 states and 2308 transitions. Second operand 15 states. [2019-10-02 01:23:24,714 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-10-02 01:23:25,184 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-10-02 01:23:26,097 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-10-02 01:23:27,397 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-10-02 01:23:30,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:23:30,171 INFO L93 Difference]: Finished difference Result 5614 states and 7973 transitions. [2019-10-02 01:23:30,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-02 01:23:30,177 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 274 [2019-10-02 01:23:30,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:23:30,235 INFO L225 Difference]: With dead ends: 5614 [2019-10-02 01:23:30,235 INFO L226 Difference]: Without dead ends: 3956 [2019-10-02 01:23:30,240 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 283 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=484, Invalid=2596, Unknown=0, NotChecked=0, Total=3080 [2019-10-02 01:23:30,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3956 states. [2019-10-02 01:23:30,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3956 to 3194. [2019-10-02 01:23:30,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3194 states. [2019-10-02 01:23:30,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3194 states to 3194 states and 4124 transitions. [2019-10-02 01:23:30,355 INFO L78 Accepts]: Start accepts. Automaton has 3194 states and 4124 transitions. Word has length 274 [2019-10-02 01:23:30,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:23:30,355 INFO L475 AbstractCegarLoop]: Abstraction has 3194 states and 4124 transitions. [2019-10-02 01:23:30,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 01:23:30,356 INFO L276 IsEmpty]: Start isEmpty. Operand 3194 states and 4124 transitions. [2019-10-02 01:23:30,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-10-02 01:23:30,366 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:23:30,366 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:23:30,367 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:23:30,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:23:30,367 INFO L82 PathProgramCache]: Analyzing trace with hash 440905297, now seen corresponding path program 1 times [2019-10-02 01:23:30,367 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:23:30,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:23:30,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:30,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:30,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:30,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:31,369 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 194 proven. 197 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 01:23:31,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:23:31,370 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 01:23:31,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:31,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-02 01:23:31,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:23:31,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 01:23:31,842 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 305 proven. 53 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 01:23:31,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:23:31,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2019-10-02 01:23:31,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 01:23:31,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 01:23:31,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-10-02 01:23:31,850 INFO L87 Difference]: Start difference. First operand 3194 states and 4124 transitions. Second operand 15 states. [2019-10-02 01:23:34,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:23:34,856 INFO L93 Difference]: Finished difference Result 6690 states and 8651 transitions. [2019-10-02 01:23:34,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 01:23:34,857 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 376 [2019-10-02 01:23:34,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:23:34,876 INFO L225 Difference]: With dead ends: 6690 [2019-10-02 01:23:34,877 INFO L226 Difference]: Without dead ends: 3604 [2019-10-02 01:23:34,887 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=198, Invalid=614, Unknown=0, NotChecked=0, Total=812 [2019-10-02 01:23:34,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3604 states. [2019-10-02 01:23:34,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3604 to 3560. [2019-10-02 01:23:34,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3560 states. [2019-10-02 01:23:35,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3560 states to 3560 states and 4229 transitions. [2019-10-02 01:23:35,001 INFO L78 Accepts]: Start accepts. Automaton has 3560 states and 4229 transitions. Word has length 376 [2019-10-02 01:23:35,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:23:35,002 INFO L475 AbstractCegarLoop]: Abstraction has 3560 states and 4229 transitions. [2019-10-02 01:23:35,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 01:23:35,002 INFO L276 IsEmpty]: Start isEmpty. Operand 3560 states and 4229 transitions. [2019-10-02 01:23:35,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2019-10-02 01:23:35,014 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:23:35,014 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 01:23:35,014 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:23:35,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:23:35,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1399345218, now seen corresponding path program 1 times [2019-10-02 01:23:35,015 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:23:35,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:23:35,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:35,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:35,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:36,032 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 337 proven. 2 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-02 01:23:36,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:23:36,033 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:23:36,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:36,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:36,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 01:23:36,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:23:36,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:23:36,393 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2019-10-02 01:23:36,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 01:23:36,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2019-10-02 01:23:36,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 01:23:36,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 01:23:36,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-10-02 01:23:36,400 INFO L87 Difference]: Start difference. First operand 3560 states and 4229 transitions. Second operand 16 states. [2019-10-02 01:23:40,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:23:40,531 INFO L93 Difference]: Finished difference Result 6964 states and 8310 transitions. [2019-10-02 01:23:40,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-02 01:23:40,531 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 401 [2019-10-02 01:23:40,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:23:40,545 INFO L225 Difference]: With dead ends: 6964 [2019-10-02 01:23:40,546 INFO L226 Difference]: Without dead ends: 3594 [2019-10-02 01:23:40,553 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 416 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=482, Invalid=1680, Unknown=0, NotChecked=0, Total=2162 [2019-10-02 01:23:40,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2019-10-02 01:23:40,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3582. [2019-10-02 01:23:40,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3582 states. [2019-10-02 01:23:40,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3582 states to 3582 states and 4109 transitions. [2019-10-02 01:23:40,628 INFO L78 Accepts]: Start accepts. Automaton has 3582 states and 4109 transitions. Word has length 401 [2019-10-02 01:23:40,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:23:40,628 INFO L475 AbstractCegarLoop]: Abstraction has 3582 states and 4109 transitions. [2019-10-02 01:23:40,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 01:23:40,629 INFO L276 IsEmpty]: Start isEmpty. Operand 3582 states and 4109 transitions. [2019-10-02 01:23:40,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2019-10-02 01:23:40,639 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:23:40,640 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:23:40,640 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:23:40,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:23:40,641 INFO L82 PathProgramCache]: Analyzing trace with hash -257550303, now seen corresponding path program 1 times [2019-10-02 01:23:40,641 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:23:40,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:23:40,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:40,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:40,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:41,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 302 proven. 607 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-02 01:23:41,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:23:41,488 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:23:41,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:41,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 883 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 01:23:41,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:23:41,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 01:23:42,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 604 proven. 2 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2019-10-02 01:23:42,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:23:42,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-10-02 01:23:42,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 01:23:42,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 01:23:42,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-10-02 01:23:42,137 INFO L87 Difference]: Start difference. First operand 3582 states and 4109 transitions. Second operand 11 states. [2019-10-02 01:23:45,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:23:45,969 INFO L93 Difference]: Finished difference Result 8108 states and 9591 transitions. [2019-10-02 01:23:45,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-02 01:23:45,969 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 590 [2019-10-02 01:23:45,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:23:45,992 INFO L225 Difference]: With dead ends: 8108 [2019-10-02 01:23:45,992 INFO L226 Difference]: Without dead ends: 4716 [2019-10-02 01:23:46,002 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 614 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=372, Invalid=1350, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 01:23:46,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4716 states. [2019-10-02 01:23:46,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4716 to 4512. [2019-10-02 01:23:46,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4512 states. [2019-10-02 01:23:46,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4512 states to 4512 states and 5140 transitions. [2019-10-02 01:23:46,110 INFO L78 Accepts]: Start accepts. Automaton has 4512 states and 5140 transitions. Word has length 590 [2019-10-02 01:23:46,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:23:46,111 INFO L475 AbstractCegarLoop]: Abstraction has 4512 states and 5140 transitions. [2019-10-02 01:23:46,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 01:23:46,111 INFO L276 IsEmpty]: Start isEmpty. Operand 4512 states and 5140 transitions. [2019-10-02 01:23:46,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2019-10-02 01:23:46,127 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:23:46,127 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 01:23:46,128 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:23:46,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:23:46,128 INFO L82 PathProgramCache]: Analyzing trace with hash 16391782, now seen corresponding path program 1 times [2019-10-02 01:23:46,128 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:23:46,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:23:46,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:46,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:46,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:47,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1317 backedges. 400 proven. 662 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-10-02 01:23:47,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:23:47,453 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:23:47,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:47,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 990 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 01:23:47,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:23:47,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:23:48,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1317 backedges. 956 proven. 2 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2019-10-02 01:23:48,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:23:48,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 15 [2019-10-02 01:23:48,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 01:23:48,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 01:23:48,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-10-02 01:23:48,209 INFO L87 Difference]: Start difference. First operand 4512 states and 5140 transitions. Second operand 15 states. [2019-10-02 01:23:53,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:23:53,100 INFO L93 Difference]: Finished difference Result 10380 states and 11910 transitions. [2019-10-02 01:23:53,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-02 01:23:53,101 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 693 [2019-10-02 01:23:53,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:23:53,125 INFO L225 Difference]: With dead ends: 10380 [2019-10-02 01:23:53,125 INFO L226 Difference]: Without dead ends: 5874 [2019-10-02 01:23:53,135 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 770 GetRequests, 720 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=495, Invalid=2055, Unknown=0, NotChecked=0, Total=2550 [2019-10-02 01:23:53,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5874 states. [2019-10-02 01:23:53,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5874 to 5684. [2019-10-02 01:23:53,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5684 states. [2019-10-02 01:23:53,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5684 states to 5684 states and 6318 transitions. [2019-10-02 01:23:53,260 INFO L78 Accepts]: Start accepts. Automaton has 5684 states and 6318 transitions. Word has length 693 [2019-10-02 01:23:53,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:23:53,261 INFO L475 AbstractCegarLoop]: Abstraction has 5684 states and 6318 transitions. [2019-10-02 01:23:53,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 01:23:53,261 INFO L276 IsEmpty]: Start isEmpty. Operand 5684 states and 6318 transitions. [2019-10-02 01:23:53,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 709 [2019-10-02 01:23:53,281 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:23:53,282 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 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] [2019-10-02 01:23:53,282 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:23:53,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:23:53,283 INFO L82 PathProgramCache]: Analyzing trace with hash -247966771, now seen corresponding path program 1 times [2019-10-02 01:23:53,283 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:23:53,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:23:53,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:53,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:53,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:54,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1745 backedges. 551 proven. 777 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2019-10-02 01:23:54,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:23:54,996 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:23:55,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:55,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-02 01:23:55,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:23:55,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 01:23:55,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1745 backedges. 1279 proven. 2 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2019-10-02 01:23:55,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:23:55,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 13 [2019-10-02 01:23:55,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 01:23:55,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 01:23:55,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-10-02 01:23:55,743 INFO L87 Difference]: Start difference. First operand 5684 states and 6318 transitions. Second operand 13 states. [2019-10-02 01:23:57,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:23:57,764 INFO L93 Difference]: Finished difference Result 10979 states and 12526 transitions. [2019-10-02 01:23:57,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 01:23:57,765 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 708 [2019-10-02 01:23:57,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:23:57,790 INFO L225 Difference]: With dead ends: 10979 [2019-10-02 01:23:57,790 INFO L226 Difference]: Without dead ends: 5808 [2019-10-02 01:23:57,802 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 716 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2019-10-02 01:23:57,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5808 states. [2019-10-02 01:23:57,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5808 to 5492. [2019-10-02 01:23:57,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5492 states. [2019-10-02 01:23:57,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5492 states to 5492 states and 5967 transitions. [2019-10-02 01:23:57,968 INFO L78 Accepts]: Start accepts. Automaton has 5492 states and 5967 transitions. Word has length 708 [2019-10-02 01:23:57,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:23:57,969 INFO L475 AbstractCegarLoop]: Abstraction has 5492 states and 5967 transitions. [2019-10-02 01:23:57,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 01:23:57,969 INFO L276 IsEmpty]: Start isEmpty. Operand 5492 states and 5967 transitions. [2019-10-02 01:23:57,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 808 [2019-10-02 01:23:57,997 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:23:57,998 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:23:57,998 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:23:57,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:23:57,999 INFO L82 PathProgramCache]: Analyzing trace with hash -286549582, now seen corresponding path program 1 times [2019-10-02 01:23:57,999 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:23:57,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:23:58,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:58,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:58,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:23:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:59,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2348 backedges. 700 proven. 1062 refuted. 0 times theorem prover too weak. 586 trivial. 0 not checked. [2019-10-02 01:23:59,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:23:59,437 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:23:59,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:23:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:23:59,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 1175 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 01:23:59,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:23:59,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:23:59,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2348 backedges. 1570 proven. 2 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2019-10-02 01:24:00,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:24:00,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 5] total 19 [2019-10-02 01:24:00,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 01:24:00,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 01:24:00,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-10-02 01:24:00,027 INFO L87 Difference]: Start difference. First operand 5492 states and 5967 transitions. Second operand 19 states. [2019-10-02 01:24:04,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:24:04,847 INFO L93 Difference]: Finished difference Result 10883 states and 12163 transitions. [2019-10-02 01:24:04,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-02 01:24:04,847 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 807 [2019-10-02 01:24:04,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:24:04,866 INFO L225 Difference]: With dead ends: 10883 [2019-10-02 01:24:04,866 INFO L226 Difference]: Without dead ends: 5437 [2019-10-02 01:24:04,882 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 880 GetRequests, 827 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=612, Invalid=2358, Unknown=0, NotChecked=0, Total=2970 [2019-10-02 01:24:04,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5437 states. [2019-10-02 01:24:04,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5437 to 4916. [2019-10-02 01:24:04,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4916 states. [2019-10-02 01:24:04,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4916 states to 4916 states and 5245 transitions. [2019-10-02 01:24:04,987 INFO L78 Accepts]: Start accepts. Automaton has 4916 states and 5245 transitions. Word has length 807 [2019-10-02 01:24:04,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:24:04,988 INFO L475 AbstractCegarLoop]: Abstraction has 4916 states and 5245 transitions. [2019-10-02 01:24:04,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 01:24:04,989 INFO L276 IsEmpty]: Start isEmpty. Operand 4916 states and 5245 transitions. [2019-10-02 01:24:05,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 837 [2019-10-02 01:24:05,001 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:24:05,002 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:24:05,002 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:24:05,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:24:05,003 INFO L82 PathProgramCache]: Analyzing trace with hash -761058727, now seen corresponding path program 1 times [2019-10-02 01:24:05,003 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:24:05,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:24:05,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:24:05,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:24:05,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:24:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:24:07,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1949 backedges. 777 proven. 841 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2019-10-02 01:24:07,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:24:07,642 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:24:07,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:24:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:24:07,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 1173 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 01:24:07,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:24:08,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1949 backedges. 1255 proven. 2 refuted. 0 times theorem prover too weak. 692 trivial. 0 not checked. [2019-10-02 01:24:08,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:24:08,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 5] total 20 [2019-10-02 01:24:08,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 01:24:08,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 01:24:08,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2019-10-02 01:24:08,226 INFO L87 Difference]: Start difference. First operand 4916 states and 5245 transitions. Second operand 20 states. [2019-10-02 01:24:15,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:24:15,478 INFO L93 Difference]: Finished difference Result 12208 states and 13141 transitions. [2019-10-02 01:24:15,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-10-02 01:24:15,478 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 836 [2019-10-02 01:24:15,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:24:15,501 INFO L225 Difference]: With dead ends: 12208 [2019-10-02 01:24:15,502 INFO L226 Difference]: Without dead ends: 7664 [2019-10-02 01:24:15,515 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 961 GetRequests, 882 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1810 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=859, Invalid=4993, Unknown=0, NotChecked=0, Total=5852 [2019-10-02 01:24:15,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7664 states. [2019-10-02 01:24:15,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7664 to 4694. [2019-10-02 01:24:15,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4694 states. [2019-10-02 01:24:15,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4694 states to 4694 states and 4936 transitions. [2019-10-02 01:24:15,614 INFO L78 Accepts]: Start accepts. Automaton has 4694 states and 4936 transitions. Word has length 836 [2019-10-02 01:24:15,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:24:15,615 INFO L475 AbstractCegarLoop]: Abstraction has 4694 states and 4936 transitions. [2019-10-02 01:24:15,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 01:24:15,615 INFO L276 IsEmpty]: Start isEmpty. Operand 4694 states and 4936 transitions. [2019-10-02 01:24:15,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1058 [2019-10-02 01:24:15,634 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:24:15,635 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:24:15,635 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:24:15,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:24:15,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1431587414, now seen corresponding path program 1 times [2019-10-02 01:24:15,636 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:24:15,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:24:15,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:24:15,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:24:15,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:24:15,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:24:18,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 673 proven. 1509 refuted. 0 times theorem prover too weak. 1098 trivial. 0 not checked. [2019-10-02 01:24:18,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:24:18,845 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:24:18,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:24:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:24:19,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 1470 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 01:24:19,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:24:19,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 2215 proven. 2 refuted. 0 times theorem prover too weak. 1063 trivial. 0 not checked. [2019-10-02 01:24:19,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:24:19,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 18 [2019-10-02 01:24:19,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 01:24:19,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 01:24:19,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-10-02 01:24:19,596 INFO L87 Difference]: Start difference. First operand 4694 states and 4936 transitions. Second operand 18 states. [2019-10-02 01:24:24,653 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-10-02 01:24:25,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:24:25,217 INFO L93 Difference]: Finished difference Result 10500 states and 11077 transitions. [2019-10-02 01:24:25,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-02 01:24:25,221 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 1057 [2019-10-02 01:24:25,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:24:25,241 INFO L225 Difference]: With dead ends: 10500 [2019-10-02 01:24:25,241 INFO L226 Difference]: Without dead ends: 5996 [2019-10-02 01:24:25,252 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1131 GetRequests, 1077 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=592, Invalid=2488, Unknown=0, NotChecked=0, Total=3080 [2019-10-02 01:24:25,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5996 states. [2019-10-02 01:24:25,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5996 to 4492. [2019-10-02 01:24:25,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4492 states. [2019-10-02 01:24:25,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4492 states to 4492 states and 4688 transitions. [2019-10-02 01:24:25,350 INFO L78 Accepts]: Start accepts. Automaton has 4492 states and 4688 transitions. Word has length 1057 [2019-10-02 01:24:25,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:24:25,351 INFO L475 AbstractCegarLoop]: Abstraction has 4492 states and 4688 transitions. [2019-10-02 01:24:25,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 01:24:25,352 INFO L276 IsEmpty]: Start isEmpty. Operand 4492 states and 4688 transitions. [2019-10-02 01:24:25,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1139 [2019-10-02 01:24:25,373 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:24:25,374 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:24:25,375 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:24:25,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:24:25,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1661791935, now seen corresponding path program 1 times [2019-10-02 01:24:25,376 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:24:25,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:24:25,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:24:25,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:24:25,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:24:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:24:30,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3959 backedges. 1492 proven. 2122 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-10-02 01:24:30,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:24:30,070 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:24:30,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:24:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:24:30,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 1589 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 01:24:30,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:24:30,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:24:30,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:24:31,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3959 backedges. 2442 proven. 6 refuted. 0 times theorem prover too weak. 1511 trivial. 0 not checked. [2019-10-02 01:24:31,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:24:31,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 7] total 38 [2019-10-02 01:24:31,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-02 01:24:31,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-02 01:24:31,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1239, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 01:24:31,291 INFO L87 Difference]: Start difference. First operand 4492 states and 4688 transitions. Second operand 38 states. [2019-10-02 01:24:40,860 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2019-10-02 01:24:41,906 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-10-02 01:24:42,101 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 52 [2019-10-02 01:24:42,498 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2019-10-02 01:24:46,098 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-10-02 01:24:49,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:24:49,749 INFO L93 Difference]: Finished difference Result 11815 states and 12609 transitions. [2019-10-02 01:24:49,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-10-02 01:24:49,749 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 1138 [2019-10-02 01:24:49,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:24:49,769 INFO L225 Difference]: With dead ends: 11815 [2019-10-02 01:24:49,769 INFO L226 Difference]: Without dead ends: 7513 [2019-10-02 01:24:49,782 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1312 GetRequests, 1190 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4566 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=2429, Invalid=12577, Unknown=0, NotChecked=0, Total=15006 [2019-10-02 01:24:49,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7513 states. [2019-10-02 01:24:49,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7513 to 5774. [2019-10-02 01:24:49,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5774 states. [2019-10-02 01:24:49,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5774 states to 5774 states and 5991 transitions. [2019-10-02 01:24:49,904 INFO L78 Accepts]: Start accepts. Automaton has 5774 states and 5991 transitions. Word has length 1138 [2019-10-02 01:24:49,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:24:49,906 INFO L475 AbstractCegarLoop]: Abstraction has 5774 states and 5991 transitions. [2019-10-02 01:24:49,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-02 01:24:49,906 INFO L276 IsEmpty]: Start isEmpty. Operand 5774 states and 5991 transitions. [2019-10-02 01:24:49,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1692 [2019-10-02 01:24:49,941 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:24:49,943 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:24:49,943 INFO L418 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:24:49,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:24:49,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1717289902, now seen corresponding path program 1 times [2019-10-02 01:24:49,944 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:24:49,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:24:49,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:24:49,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:24:49,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:24:50,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:24:55,678 INFO L134 CoverageAnalysis]: Checked inductivity of 8838 backedges. 2060 proven. 5380 refuted. 0 times theorem prover too weak. 1398 trivial. 0 not checked. [2019-10-02 01:24:55,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:24:55,679 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:24:55,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:24:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:24:56,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 2292 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-02 01:24:56,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:24:56,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:24:57,657 INFO L134 CoverageAnalysis]: Checked inductivity of 8838 backedges. 2852 proven. 84 refuted. 0 times theorem prover too weak. 5902 trivial. 0 not checked. [2019-10-02 01:24:57,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:24:57,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 8] total 36 [2019-10-02 01:24:57,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-02 01:24:57,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-02 01:24:57,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1147, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 01:24:57,665 INFO L87 Difference]: Start difference. First operand 5774 states and 5991 transitions. Second operand 36 states. [2019-10-02 01:25:01,361 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-10-02 01:25:03,527 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-10-02 01:25:05,506 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 32 [2019-10-02 01:25:10,839 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-10-02 01:25:11,037 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2019-10-02 01:25:12,324 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-10-02 01:25:15,706 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 44 [2019-10-02 01:25:17,088 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-10-02 01:25:17,973 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2019-10-02 01:25:18,185 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2019-10-02 01:25:18,504 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2019-10-02 01:25:18,729 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-10-02 01:25:19,250 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2019-10-02 01:25:20,896 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2019-10-02 01:25:21,141 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 41 [2019-10-02 01:25:21,758 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2019-10-02 01:25:22,019 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 23 [2019-10-02 01:25:22,817 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-10-02 01:25:23,145 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2019-10-02 01:25:23,574 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-10-02 01:25:23,969 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2019-10-02 01:25:24,353 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-10-02 01:25:24,989 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-10-02 01:25:29,385 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2019-10-02 01:25:35,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:25:35,828 INFO L93 Difference]: Finished difference Result 16097 states and 17105 transitions. [2019-10-02 01:25:35,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2019-10-02 01:25:35,828 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 1691 [2019-10-02 01:25:35,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:25:35,852 INFO L225 Difference]: With dead ends: 16097 [2019-10-02 01:25:35,853 INFO L226 Difference]: Without dead ends: 10513 [2019-10-02 01:25:35,872 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1995 GetRequests, 1774 SyntacticMatches, 1 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18756 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=5711, Invalid=43351, Unknown=0, NotChecked=0, Total=49062 [2019-10-02 01:25:35,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10513 states. [2019-10-02 01:25:36,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10513 to 6894. [2019-10-02 01:25:36,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6894 states. [2019-10-02 01:25:36,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6894 states to 6894 states and 7124 transitions. [2019-10-02 01:25:36,055 INFO L78 Accepts]: Start accepts. Automaton has 6894 states and 7124 transitions. Word has length 1691 [2019-10-02 01:25:36,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:25:36,057 INFO L475 AbstractCegarLoop]: Abstraction has 6894 states and 7124 transitions. [2019-10-02 01:25:36,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-02 01:25:36,058 INFO L276 IsEmpty]: Start isEmpty. Operand 6894 states and 7124 transitions. [2019-10-02 01:25:36,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1869 [2019-10-02 01:25:36,114 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:25:36,115 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 9, 9, 9, 9, 9, 9, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:25:36,115 INFO L418 AbstractCegarLoop]: === Iteration 15 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:25:36,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:25:36,116 INFO L82 PathProgramCache]: Analyzing trace with hash -2011551767, now seen corresponding path program 1 times [2019-10-02 01:25:36,116 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:25:36,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:25:36,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:25:36,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:25:36,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:25:36,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:25:38,605 INFO L134 CoverageAnalysis]: Checked inductivity of 10501 backedges. 1996 proven. 517 refuted. 0 times theorem prover too weak. 7988 trivial. 0 not checked. [2019-10-02 01:25:38,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:25:38,606 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:25:38,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:25:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:25:39,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 2511 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 01:25:39,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:25:40,281 INFO L134 CoverageAnalysis]: Checked inductivity of 10501 backedges. 4529 proven. 2 refuted. 0 times theorem prover too weak. 5970 trivial. 0 not checked. [2019-10-02 01:25:40,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:25:40,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-10-02 01:25:40,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 01:25:40,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 01:25:40,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-10-02 01:25:40,289 INFO L87 Difference]: Start difference. First operand 6894 states and 7124 transitions. Second operand 11 states. [2019-10-02 01:25:43,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:25:43,527 INFO L93 Difference]: Finished difference Result 15814 states and 16346 transitions. [2019-10-02 01:25:43,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 01:25:43,528 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1868 [2019-10-02 01:25:43,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:25:43,540 INFO L225 Difference]: With dead ends: 15814 [2019-10-02 01:25:43,540 INFO L226 Difference]: Without dead ends: 5199 [2019-10-02 01:25:43,554 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1907 GetRequests, 1879 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=218, Invalid=594, Unknown=0, NotChecked=0, Total=812 [2019-10-02 01:25:43,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5199 states. [2019-10-02 01:25:43,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5199 to 4810. [2019-10-02 01:25:43,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4810 states. [2019-10-02 01:25:43,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 4900 transitions. [2019-10-02 01:25:43,643 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 4900 transitions. Word has length 1868 [2019-10-02 01:25:43,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:25:43,644 INFO L475 AbstractCegarLoop]: Abstraction has 4810 states and 4900 transitions. [2019-10-02 01:25:43,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 01:25:43,644 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 4900 transitions. [2019-10-02 01:25:43,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1944 [2019-10-02 01:25:43,686 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:25:43,687 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 10, 10, 9, 8, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2019-10-02 01:25:43,687 INFO L418 AbstractCegarLoop]: === Iteration 16 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:25:43,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:25:43,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1661795698, now seen corresponding path program 1 times [2019-10-02 01:25:43,688 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:25:43,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:25:43,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:25:43,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:25:43,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:25:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:25:51,265 INFO L134 CoverageAnalysis]: Checked inductivity of 11981 backedges. 2912 proven. 6962 refuted. 0 times theorem prover too weak. 2107 trivial. 0 not checked. [2019-10-02 01:25:51,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:25:51,265 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:25:51,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:25:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:25:51,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 2620 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 01:25:51,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:25:51,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:25:51,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:25:54,493 WARN L191 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2019-10-02 01:25:55,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:25:57,093 INFO L134 CoverageAnalysis]: Checked inductivity of 11981 backedges. 5784 proven. 12 refuted. 0 times theorem prover too weak. 6185 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 01:25:57,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:25:57,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 9] total 42 [2019-10-02 01:25:57,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-02 01:25:57,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-02 01:25:57,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1561, Unknown=1, NotChecked=0, Total=1722 [2019-10-02 01:25:57,107 INFO L87 Difference]: Start difference. First operand 4810 states and 4900 transitions. Second operand 42 states. [2019-10-02 01:26:00,842 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 36 [2019-10-02 01:26:01,067 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2019-10-02 01:26:02,673 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 30 [2019-10-02 01:26:09,224 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2019-10-02 01:26:17,833 WARN L191 SmtUtils]: Spent 3.20 s on a formula simplification. DAG size of input: 73 DAG size of output: 42 [2019-10-02 01:26:25,812 WARN L191 SmtUtils]: Spent 3.33 s on a formula simplification. DAG size of input: 81 DAG size of output: 50 [2019-10-02 01:26:31,619 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-10-02 01:26:34,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:26:34,002 INFO L93 Difference]: Finished difference Result 10299 states and 10591 transitions. [2019-10-02 01:26:34,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-10-02 01:26:34,003 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 1943 [2019-10-02 01:26:34,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:26:34,014 INFO L225 Difference]: With dead ends: 10299 [2019-10-02 01:26:34,014 INFO L226 Difference]: Without dead ends: 5311 [2019-10-02 01:26:34,023 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2131 GetRequests, 1986 SyntacticMatches, 4 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6219 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=2771, Invalid=17533, Unknown=2, NotChecked=0, Total=20306 [2019-10-02 01:26:34,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5311 states. [2019-10-02 01:26:34,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5311 to 4072. [2019-10-02 01:26:34,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4072 states. [2019-10-02 01:26:34,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4072 states to 4072 states and 4113 transitions. [2019-10-02 01:26:34,085 INFO L78 Accepts]: Start accepts. Automaton has 4072 states and 4113 transitions. Word has length 1943 [2019-10-02 01:26:34,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:26:34,086 INFO L475 AbstractCegarLoop]: Abstraction has 4072 states and 4113 transitions. [2019-10-02 01:26:34,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-02 01:26:34,086 INFO L276 IsEmpty]: Start isEmpty. Operand 4072 states and 4113 transitions. [2019-10-02 01:26:34,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2426 [2019-10-02 01:26:34,139 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 01:26:34,140 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 14, 14, 14, 13, 13, 13, 13, 12, 11, 10, 10, 10, 10, 10, 10, 9, 9, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 01:26:34,140 INFO L418 AbstractCegarLoop]: === Iteration 17 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 01:26:34,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 01:26:34,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1253665598, now seen corresponding path program 1 times [2019-10-02 01:26:34,141 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 01:26:34,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 01:26:34,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:26:34,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:26:34,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 01:26:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:26:43,039 INFO L134 CoverageAnalysis]: Checked inductivity of 18039 backedges. 3338 proven. 9267 refuted. 0 times theorem prover too weak. 5434 trivial. 0 not checked. [2019-10-02 01:26:43,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 01:26:43,039 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 01:26:43,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 01:26:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 01:26:43,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 3212 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 01:26:43,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 01:26:43,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 01:26:46,016 INFO L134 CoverageAnalysis]: Checked inductivity of 18039 backedges. 2571 proven. 39 refuted. 0 times theorem prover too weak. 15429 trivial. 0 not checked. [2019-10-02 01:26:46,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 01:26:46,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 6] total 32 [2019-10-02 01:26:46,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-02 01:26:46,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-02 01:26:46,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=893, Unknown=0, NotChecked=0, Total=992 [2019-10-02 01:26:46,030 INFO L87 Difference]: Start difference. First operand 4072 states and 4113 transitions. Second operand 32 states. [2019-10-02 01:26:49,154 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-10-02 01:26:51,140 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2019-10-02 01:26:56,709 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-10-02 01:27:03,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 01:27:03,630 INFO L93 Difference]: Finished difference Result 5793 states and 5908 transitions. [2019-10-02 01:27:03,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-10-02 01:27:03,630 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 2425 [2019-10-02 01:27:03,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 01:27:03,633 INFO L225 Difference]: With dead ends: 5793 [2019-10-02 01:27:03,633 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 01:27:03,645 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2563 GetRequests, 2453 SyntacticMatches, 2 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3604 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1797, Invalid=10193, Unknown=0, NotChecked=0, Total=11990 [2019-10-02 01:27:03,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 01:27:03,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 01:27:03,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 01:27:03,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 01:27:03,646 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2425 [2019-10-02 01:27:03,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 01:27:03,647 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 01:27:03,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-02 01:27:03,647 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 01:27:03,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 01:27:03,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 01:27:07,284 WARN L191 SmtUtils]: Spent 2.44 s on a formula simplification. DAG size of input: 871 DAG size of output: 783 [2019-10-02 01:27:09,300 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 871 DAG size of output: 783 [2019-10-02 01:27:18,227 WARN L191 SmtUtils]: Spent 8.77 s on a formula simplification. DAG size of input: 677 DAG size of output: 216 [2019-10-02 01:27:27,977 WARN L191 SmtUtils]: Spent 9.72 s on a formula simplification. DAG size of input: 764 DAG size of output: 187 [2019-10-02 01:27:37,312 WARN L191 SmtUtils]: Spent 9.33 s on a formula simplification. DAG size of input: 764 DAG size of output: 187 [2019-10-02 01:27:37,315 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 01:27:37,315 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= ~a12~0 |old(~a12~0)|) (<= |old(~a12~0)| ~a12~0) (= ~a24~0 |old(~a24~0)|) (= ~a21~0 |old(~a21~0)|) (= ~a15~0 |old(~a15~0)|)) [2019-10-02 01:27:37,315 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 01:27:37,316 INFO L443 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-10-02 01:27:37,316 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-10-02 01:27:37,316 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,316 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,316 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,316 INFO L443 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-10-02 01:27:37,316 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-10-02 01:27:37,316 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-10-02 01:27:37,317 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-10-02 01:27:37,317 INFO L443 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-10-02 01:27:37,317 INFO L443 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-10-02 01:27:37,317 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-10-02 01:27:37,317 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-10-02 01:27:37,317 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,317 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,317 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,318 INFO L443 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-10-02 01:27:37,318 INFO L443 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-10-02 01:27:37,318 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-10-02 01:27:37,318 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-10-02 01:27:37,318 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-10-02 01:27:37,318 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-10-02 01:27:37,318 INFO L443 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-10-02 01:27:37,318 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-10-02 01:27:37,319 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,319 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,319 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,319 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-10-02 01:27:37,319 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-10-02 01:27:37,319 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-10-02 01:27:37,319 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-10-02 01:27:37,319 INFO L443 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-10-02 01:27:37,319 INFO L443 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-10-02 01:27:37,320 INFO L443 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-10-02 01:27:37,320 INFO L443 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-10-02 01:27:37,320 INFO L443 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-10-02 01:27:37,320 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,320 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,320 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,320 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-10-02 01:27:37,320 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-10-02 01:27:37,320 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-10-02 01:27:37,321 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-10-02 01:27:37,321 INFO L443 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-10-02 01:27:37,321 INFO L443 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-10-02 01:27:37,321 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-10-02 01:27:37,321 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,321 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,321 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,321 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-10-02 01:27:37,321 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-10-02 01:27:37,321 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-10-02 01:27:37,322 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-10-02 01:27:37,322 INFO L443 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-10-02 01:27:37,322 INFO L443 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-10-02 01:27:37,322 INFO L443 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-10-02 01:27:37,322 INFO L443 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-10-02 01:27:37,322 INFO L443 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-10-02 01:27:37,322 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,322 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,322 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,322 INFO L443 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,323 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-10-02 01:27:37,323 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-10-02 01:27:37,323 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-10-02 01:27:37,323 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-10-02 01:27:37,323 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-10-02 01:27:37,323 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-10-02 01:27:37,323 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-10-02 01:27:37,323 INFO L443 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-10-02 01:27:37,323 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,324 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,324 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,324 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-10-02 01:27:37,324 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-10-02 01:27:37,324 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-10-02 01:27:37,324 INFO L443 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-10-02 01:27:37,324 INFO L443 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-10-02 01:27:37,324 INFO L443 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-10-02 01:27:37,325 INFO L443 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-10-02 01:27:37,325 INFO L443 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-10-02 01:27:37,325 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,325 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,325 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,325 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-10-02 01:27:37,325 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-10-02 01:27:37,325 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-10-02 01:27:37,325 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-10-02 01:27:37,326 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-10-02 01:27:37,326 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-10-02 01:27:37,329 INFO L439 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 872) the Hoare annotation is: (let ((.cse37 (= 8 |old(~a15~0)|)) (.cse39 (<= ~a12~0 |old(~a12~0)|)) (.cse40 (<= |old(~a12~0)| ~a12~0)) (.cse11 (= 6 |old(~a21~0)|)) (.cse28 (= 9 |old(~a21~0)|)) (.cse29 (= 7 |old(~a21~0)|)) (.cse1 (not (= 1 |old(~a24~0)|))) (.cse3 (= 9 |old(~a15~0)|)) (.cse30 (= 10 |old(~a21~0)|))) (let ((.cse2 (not .cse30)) (.cse38 (or .cse11 .cse28 .cse29 .cse1 .cse3 .cse30)) (.cse42 (and .cse39 .cse40)) (.cse19 (= ~a21~0 |old(~a21~0)|)) (.cse9 (= ~a15~0 |old(~a15~0)|)) (.cse23 (not .cse11)) (.cse25 (not (<= (+ |old(~a12~0)| 49) 0))) (.cse7 (not .cse37)) (.cse24 (= 5 |old(~a15~0)|)) (.cse12 (not (<= |old(~a21~0)| 7))) (.cse44 (= ~a21~0 6)) (.cse45 (not (= 9 ~a15~0))) (.cse15 (= ~a24~0 |old(~a24~0)|)) (.cse41 (= ~a24~0 1))) (let ((.cse8 (and .cse39 .cse40 (<= |old(~a21~0)| ~a21~0) (<= ~a21~0 7) .cse41)) (.cse18 (and (and .cse39 (<= ~a12~0 76) (not .cse44) .cse40 .cse45 (not (= ~a21~0 7))) .cse41 .cse15)) (.cse4 (not (<= 19 |old(~a12~0)|))) (.cse10 (and (or (or (or (or .cse25 (not (<= 7 |old(~a21~0)|))) .cse12) .cse7) .cse1) (or .cse11 .cse24 .cse1 (forall ((v_~a12~0_BEFORE_CALL_24 Int)) (or (not (<= (+ |old(~a12~0)| 546123) (div (* 9 v_~a12~0_BEFORE_CALL_24) 10))) (not (<= v_~a12~0_BEFORE_CALL_24 95434)) (not (< 95380 v_~a12~0_BEFORE_CALL_24)))) .cse3 .cse12))) (.cse26 (or (or .cse23 .cse24 .cse3) .cse1)) (.cse27 (and (and .cse44 .cse39 .cse40 (not (= ~a15~0 5)) .cse45) .cse15 .cse9)) (.cse34 (and .cse42 .cse15 .cse19 .cse9)) (.cse31 (not (= 8 |old(~a21~0)|))) (.cse33 (and .cse39 .cse40 .cse19 .cse41 (= ~a15~0 9))) (.cse20 (not (<= |old(~a12~0)| 71))) (.cse32 (not .cse3)) (.cse22 (not (< 18 |old(~a12~0)|))) (.cse0 (and .cse39 .cse40 .cse19 .cse9 .cse41)) (.cse13 (not (<= |old(~a12~0)| 10))) (.cse6 (and .cse39 .cse40 (= ~a21~0 9) .cse9 .cse41)) (.cse5 (not .cse28)) (.cse21 (= 7 |old(~a15~0)|)) (.cse16 (and .cse39 .cse40 (= ~a21~0 10))) (.cse36 (not (<= 82 |old(~a12~0)|))) (.cse35 (or (forall ((v_~a12~0_447 Int)) (let ((.cse43 (+ v_~a12~0_447 366333))) (or (not (<= |old(~a12~0)| (div .cse43 5))) (not (<= v_~a12~0_447 80)) (not (<= 0 .cse43)) (not (< 11 v_~a12~0_447))))) .cse38)) (.cse17 (not (<= |old(~a15~0)| 7))) (.cse14 (or .cse2 .cse1 .cse3))) (and (or .cse0 .cse1 (or .cse2 (not (< 80 |old(~a12~0)|)) .cse3)) (or .cse4 (or .cse5 (not (<= |old(~a12~0)| 75))) .cse6 .cse1 .cse7) (or (and .cse8 .cse9) .cse10) (or (or (or .cse11 .cse12) .cse13) .cse1 .cse7 .cse0) (or .cse14 (and .cse15 .cse16 .cse9) .cse17) (or (and (or (and .cse18 .cse19) .cse8) .cse9) (or .cse20 .cse21 .cse1 .cse22) .cse17) (or .cse0 .cse23 .cse1 (not .cse24)) (or .cse25 (and (= ~a12~0 |old(~a12~0)|) .cse15 .cse19 .cse9) (or .cse23 .cse3)) (or (forall ((v_~a12~0_455 Int)) (or (not (<= 0 v_~a12~0_455)) (not (<= |old(~a12~0)| v_~a12~0_455)) (not (<= (+ (mod v_~a12~0_455 299959) 286349) |old(~a12~0)|)))) .cse26 .cse27 .cse7) (or (and .cse18 .cse19 .cse9) .cse4 .cse7 (or (or .cse11 .cse28 (not (<= |old(~a12~0)| 76)) .cse29) .cse1) .cse30) (or .cse10 .cse19) (or .cse13 .cse31 .cse32 .cse1 .cse33) (or .cse5 .cse6 .cse1 .cse17) (or (or .cse13 (or .cse5 .cse1)) .cse7 .cse6) (or .cse26 .cse27 .cse17) (or .cse34 .cse35 .cse7 .cse36) (or (and (or .cse32 (not .cse29)) (or .cse32 .cse31)) .cse34 .cse1 .cse36) (or .cse31 .cse33 .cse20 .cse32 .cse1 .cse22) (or (not (<= |old(~a12~0)| 95433)) .cse37 .cse23 .cse0 .cse1 (not (< 95380 |old(~a12~0)|))) (or .cse0 .cse2 .cse1 .cse13) (or .cse6 (or .cse5 .cse1 .cse37) .cse36) (or (not .cse21) .cse38 (and (and .cse39 .cse40 .cse41) .cse19 .cse9)) (or (and .cse15 .cse9 .cse16) (or .cse2 .cse1) .cse36) (or (and (and .cse42 .cse15 .cse19) .cse9) .cse35 .cse17) (or (and .cse15 .cse42 .cse19 .cse9) .cse14 (not (<= |old(~a12~0)| 11)) .cse7))))) [2019-10-02 01:27:37,329 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-10-02 01:27:37,329 INFO L443 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-10-02 01:27:37,329 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,329 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,329 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,329 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-10-02 01:27:37,330 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-10-02 01:27:37,330 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-10-02 01:27:37,330 INFO L443 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-10-02 01:27:37,330 INFO L443 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-10-02 01:27:37,330 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-10-02 01:27:37,330 INFO L443 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-10-02 01:27:37,330 INFO L443 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-10-02 01:27:37,330 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,331 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,331 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,331 INFO L443 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-10-02 01:27:37,331 INFO L443 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-10-02 01:27:37,331 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-10-02 01:27:37,331 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-10-02 01:27:37,331 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-10-02 01:27:37,331 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-10-02 01:27:37,332 INFO L443 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-10-02 01:27:37,332 INFO L443 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-10-02 01:27:37,332 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,332 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,332 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,332 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-10-02 01:27:37,332 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-10-02 01:27:37,332 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-10-02 01:27:37,332 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-10-02 01:27:37,333 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-10-02 01:27:37,333 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-10-02 01:27:37,333 INFO L443 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-10-02 01:27:37,333 INFO L443 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-10-02 01:27:37,333 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,333 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,333 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,333 INFO L443 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-10-02 01:27:37,333 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-10-02 01:27:37,334 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-10-02 01:27:37,334 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-10-02 01:27:37,334 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-10-02 01:27:37,334 INFO L443 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-10-02 01:27:37,334 INFO L443 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-10-02 01:27:37,334 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-10-02 01:27:37,334 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,335 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,335 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-10-02 01:27:37,335 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-10-02 01:27:37,335 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-10-02 01:27:37,335 INFO L443 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-10-02 01:27:37,335 INFO L443 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-10-02 01:27:37,335 INFO L443 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-10-02 01:27:37,335 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-10-02 01:27:37,335 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-10-02 01:27:37,336 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,336 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,336 INFO L443 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-10-02 01:27:37,336 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-10-02 01:27:37,336 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-10-02 01:27:37,336 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-10-02 01:27:37,336 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-10-02 01:27:37,336 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-10-02 01:27:37,336 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,336 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,337 INFO L443 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-10-02 01:27:37,337 INFO L443 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-10-02 01:27:37,337 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-10-02 01:27:37,337 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-10-02 01:27:37,337 INFO L443 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-10-02 01:27:37,337 INFO L443 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-10-02 01:27:37,337 INFO L443 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-10-02 01:27:37,337 INFO L443 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-10-02 01:27:37,337 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,338 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,338 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-10-02 01:27:37,338 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-10-02 01:27:37,338 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-10-02 01:27:37,338 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-10-02 01:27:37,338 INFO L443 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-10-02 01:27:37,338 INFO L443 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-10-02 01:27:37,338 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-10-02 01:27:37,338 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,339 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,339 INFO L443 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,339 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-10-02 01:27:37,339 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-10-02 01:27:37,339 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-10-02 01:27:37,339 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-10-02 01:27:37,339 INFO L443 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-10-02 01:27:37,339 INFO L443 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-10-02 01:27:37,339 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,340 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,340 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-10-02 01:27:37,340 INFO L443 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,340 INFO L443 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-10-02 01:27:37,340 INFO L443 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 115) no Hoare annotation was computed. [2019-10-02 01:27:37,340 INFO L443 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-10-02 01:27:37,340 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-10-02 01:27:37,340 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-10-02 01:27:37,341 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-10-02 01:27:37,341 INFO L443 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-10-02 01:27:37,341 INFO L443 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-10-02 01:27:37,341 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-10-02 01:27:37,341 INFO L443 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-10-02 01:27:37,341 INFO L443 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-10-02 01:27:37,341 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,342 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,342 INFO L443 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,342 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-10-02 01:27:37,342 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-10-02 01:27:37,342 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-10-02 01:27:37,342 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-10-02 01:27:37,342 INFO L443 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-10-02 01:27:37,342 INFO L443 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-10-02 01:27:37,343 INFO L443 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-10-02 01:27:37,343 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-10-02 01:27:37,343 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,343 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,343 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,343 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-10-02 01:27:37,343 INFO L443 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-10-02 01:27:37,343 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-10-02 01:27:37,343 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-10-02 01:27:37,344 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-10-02 01:27:37,344 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-10-02 01:27:37,344 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-10-02 01:27:37,344 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-10-02 01:27:37,344 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,344 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,344 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,344 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-10-02 01:27:37,344 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-10-02 01:27:37,345 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-10-02 01:27:37,345 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-10-02 01:27:37,345 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-10-02 01:27:37,345 INFO L443 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-10-02 01:27:37,345 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-10-02 01:27:37,345 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-10-02 01:27:37,345 INFO L443 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-10-02 01:27:37,345 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,346 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,346 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-10-02 01:27:37,346 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-10-02 01:27:37,346 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-10-02 01:27:37,346 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-02 01:27:37,346 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-10-02 01:27:37,346 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-10-02 01:27:37,347 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 01:27:37,347 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= ~a21~0 7) (<= 7 ~a21~0) (= ~a15~0 8) (= ~a24~0 1) (<= (+ ~a12~0 49) 0)) [2019-10-02 01:27:37,347 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 01:27:37,347 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 01:27:37,347 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 874 890) the Hoare annotation is: (or (not (<= (+ |old(~a12~0)| 49) 0)) (not (= 8 |old(~a15~0)|)) (not (<= 7 |old(~a21~0)|)) (not (= 1 |old(~a24~0)|)) (and (<= ~a12~0 |old(~a12~0)|) (<= |old(~a12~0)| ~a12~0) (= ~a15~0 |old(~a15~0)|) (<= |old(~a21~0)| ~a21~0) (<= ~a21~0 7) (= ~a24~0 1)) (not (<= |old(~a21~0)| 7))) [2019-10-02 01:27:37,347 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 874 890) no Hoare annotation was computed. [2019-10-02 01:27:37,348 INFO L439 ceAbstractionStarter]: At program point L888(line 888) the Hoare annotation is: (let ((.cse17 (= ~a21~0 10))) (let ((.cse35 (not (= 10 |old(~a21~0)|))) (.cse36 (or (and (<= |old(~a21~0)| 10) (<= |old(~a12~0)| 80)) (<= |old(~a21~0)| 6))) (.cse26 (not (= 9 ~a15~0))) (.cse23 (= ~a21~0 7)) (.cse13 (not .cse17)) (.cse8 (= ~a24~0 1)) (.cse20 (= ~a21~0 6)) (.cse15 (= ~a21~0 9))) (let ((.cse18 (+ ~a12~0 43)) (.cse29 (not .cse15)) (.cse4 (not .cse20)) (.cse22 (and (and .cse35 .cse36 .cse26 (not .cse23) .cse13) .cse8)) (.cse38 (= 8 |old(~a15~0)|))) (let ((.cse33 (= ~a15~0 8)) (.cse2 (not .cse38)) (.cse28 (= ~a15~0 5)) (.cse32 (and .cse29 .cse4 .cse22)) (.cse24 (= ~a15~0 9)) (.cse27 (< 80 ~a12~0)) (.cse25 (= ~a21~0 8)) (.cse34 (< 0 .cse18))) (let ((.cse7 (or .cse25 (= ~a21~0 |old(~a21~0)|) .cse34)) (.cse10 (and (or (and .cse20 (<= (+ ~a12~0 49) 0) (not .cse24)) (and (and .cse17 .cse27) .cse8)) .cse38)) (.cse6 (<= |old(~a12~0)| ~a12~0)) (.cse1 (and .cse32 (exists ((v_~a12~0_447 Int)) (let ((.cse37 (+ v_~a12~0_447 366333))) (and (<= v_~a12~0_447 80) (<= ~a12~0 (div .cse37 5)) (<= 0 .cse37) (< 11 v_~a12~0_447)))))) (.cse3 (and (and .cse20 (not .cse28) .cse36 .cse26) .cse8)) (.cse9 (= ~a15~0 |old(~a15~0)|)) (.cse0 (<= ~a15~0 7)) (.cse14 (= ~a24~0 |old(~a24~0)|)) (.cse5 (<= ~a12~0 10)) (.cse30 (<= ~a12~0 71)) (.cse16 (<= 19 ~a12~0)) (.cse31 (= ~a15~0 7)) (.cse21 (and (and (and .cse35 (or (not (= 9 |old(~a15~0)|)) (not (= 7 |old(~a21~0)|))) .cse17 .cse36 .cse26) (or (not (= 6 |old(~a21~0)|)) (not (= 5 |old(~a15~0)|)))) (or (not (= 9 |old(~a21~0)|)) .cse2 (<= 12 |old(~a12~0)|)))) (.cse12 (and .cse15 .cse8)) (.cse19 (not .cse33)) (.cse11 (<= 82 ~a12~0))) (or (and .cse0 .cse1) .cse2 (and .cse3 .cse0) (and (and (and (<= ~a21~0 7) .cse4) .cse5) .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse11) (and (and .cse5 .cse12) .cse7 .cse9) (and .cse10 .cse13) (and (and (<= ~a12~0 75) (and .cse14 .cse15)) .cse9 .cse16) (and .cse14 .cse17 (and .cse6 (<= .cse18 0))) (and .cse1 .cse11 .cse9) (and .cse19 .cse20 .cse8 (<= ~a12~0 95433) (< 95380 ~a12~0)) (and (and .cse21 .cse8) .cse0) (and (and .cse22 .cse15) .cse0) (not (<= (+ |old(~a12~0)| 49) 0)) (and (or (and (and .cse23 .cse24) .cse8) (and .cse8 .cse25 .cse24)) .cse11) (and (and .cse17 .cse26 .cse27) .cse8) (and .cse20 .cse8 .cse28) (and .cse9 (and (<= ~a12~0 76) .cse29 .cse4 .cse22) .cse16) (and (<= 286349 ~a12~0) .cse3 .cse9) (and (and (< 18 ~a12~0) (not (= 7 ~a15~0)) .cse14 .cse30) .cse0) (and .cse5 .cse14 .cse17 .cse19) (not (<= |old(~a21~0)| 7)) (and .cse31 .cse32) (and .cse5 .cse8 .cse25 .cse24) (and .cse30 .cse25 .cse8 .cse24 .cse16) (and (and .cse8 (exists ((v_~a12~0_BEFORE_CALL_24 Int)) (and (<= v_~a12~0_BEFORE_CALL_24 95434) (< 95380 v_~a12~0_BEFORE_CALL_24) (<= (+ ~a12~0 546123) (div (* 9 v_~a12~0_BEFORE_CALL_24) 10))))) .cse31) (not (<= 7 |old(~a21~0)|)) (and .cse8 (<= ~a12~0 11) (and .cse21 .cse33) .cse34) (not (= 1 |old(~a24~0)|)) (and (and .cse12 .cse19) .cse11))))))) [2019-10-02 01:27:37,348 INFO L443 ceAbstractionStarter]: For program point L888-1(line 888) no Hoare annotation was computed. [2019-10-02 01:27:37,348 INFO L443 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2019-10-02 01:27:37,349 INFO L439 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse17 (= ~a21~0 10))) (let ((.cse35 (not (= 10 |old(~a21~0)|))) (.cse36 (or (and (<= |old(~a21~0)| 10) (<= |old(~a12~0)| 80)) (<= |old(~a21~0)| 6))) (.cse26 (not (= 9 ~a15~0))) (.cse23 (= ~a21~0 7)) (.cse13 (not .cse17)) (.cse8 (= ~a24~0 1)) (.cse20 (= ~a21~0 6)) (.cse15 (= ~a21~0 9))) (let ((.cse18 (+ ~a12~0 43)) (.cse29 (not .cse15)) (.cse4 (not .cse20)) (.cse22 (and (and .cse35 .cse36 .cse26 (not .cse23) .cse13) .cse8)) (.cse38 (= 8 |old(~a15~0)|))) (let ((.cse33 (= ~a15~0 8)) (.cse2 (not .cse38)) (.cse28 (= ~a15~0 5)) (.cse32 (and .cse29 .cse4 .cse22)) (.cse24 (= ~a15~0 9)) (.cse27 (< 80 ~a12~0)) (.cse25 (= ~a21~0 8)) (.cse34 (< 0 .cse18))) (let ((.cse7 (or .cse25 (= ~a21~0 |old(~a21~0)|) .cse34)) (.cse10 (and (or (and .cse20 (<= (+ ~a12~0 49) 0) (not .cse24)) (and (and .cse17 .cse27) .cse8)) .cse38)) (.cse6 (<= |old(~a12~0)| ~a12~0)) (.cse1 (and .cse32 (exists ((v_~a12~0_447 Int)) (let ((.cse37 (+ v_~a12~0_447 366333))) (and (<= v_~a12~0_447 80) (<= ~a12~0 (div .cse37 5)) (<= 0 .cse37) (< 11 v_~a12~0_447)))))) (.cse3 (and (and .cse20 (not .cse28) .cse36 .cse26) .cse8)) (.cse9 (= ~a15~0 |old(~a15~0)|)) (.cse0 (<= ~a15~0 7)) (.cse14 (= ~a24~0 |old(~a24~0)|)) (.cse5 (<= ~a12~0 10)) (.cse30 (<= ~a12~0 71)) (.cse16 (<= 19 ~a12~0)) (.cse31 (= ~a15~0 7)) (.cse21 (and (and (and .cse35 (or (not (= 9 |old(~a15~0)|)) (not (= 7 |old(~a21~0)|))) .cse17 .cse36 .cse26) (or (not (= 6 |old(~a21~0)|)) (not (= 5 |old(~a15~0)|)))) (or (not (= 9 |old(~a21~0)|)) .cse2 (<= 12 |old(~a12~0)|)))) (.cse12 (and .cse15 .cse8)) (.cse19 (not .cse33)) (.cse11 (<= 82 ~a12~0))) (or (and .cse0 .cse1) .cse2 (and .cse3 .cse0) (and (and (and (<= ~a21~0 7) .cse4) .cse5) .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse11) (and (and .cse5 .cse12) .cse7 .cse9) (and .cse10 .cse13) (and (and (<= ~a12~0 75) (and .cse14 .cse15)) .cse9 .cse16) (and .cse14 .cse17 (and .cse6 (<= .cse18 0))) (and .cse1 .cse11 .cse9) (and .cse19 .cse20 .cse8 (<= ~a12~0 95433) (< 95380 ~a12~0)) (and (and .cse21 .cse8) .cse0) (and (and .cse22 .cse15) .cse0) (not (<= (+ |old(~a12~0)| 49) 0)) (and (or (and (and .cse23 .cse24) .cse8) (and .cse8 .cse25 .cse24)) .cse11) (and (and .cse17 .cse26 .cse27) .cse8) (and .cse20 .cse8 .cse28) (and .cse9 (and (<= ~a12~0 76) .cse29 .cse4 .cse22) .cse16) (and (<= 286349 ~a12~0) .cse3 .cse9) (and (and (< 18 ~a12~0) (not (= 7 ~a15~0)) .cse14 .cse30) .cse0) (and .cse5 .cse14 .cse17 .cse19) (not (<= |old(~a21~0)| 7)) (and .cse31 .cse32) (and .cse5 .cse8 .cse25 .cse24) (and .cse30 .cse25 .cse8 .cse24 .cse16) (and (and .cse8 (exists ((v_~a12~0_BEFORE_CALL_24 Int)) (and (<= v_~a12~0_BEFORE_CALL_24 95434) (< 95380 v_~a12~0_BEFORE_CALL_24) (<= (+ ~a12~0 546123) (div (* 9 v_~a12~0_BEFORE_CALL_24) 10))))) .cse31) (not (<= 7 |old(~a21~0)|)) (and .cse8 (<= ~a12~0 11) (and .cse21 .cse33) .cse34) (not (= 1 |old(~a24~0)|)) (and (and .cse12 .cse19) .cse11))))))) [2019-10-02 01:27:37,349 INFO L443 ceAbstractionStarter]: For program point L880-3(lines 874 890) no Hoare annotation was computed. [2019-10-02 01:27:37,361 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] [2019-10-02 01:27:37,362 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] [2019-10-02 01:27:37,363 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] [2019-10-02 01:27:37,363 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] [2019-10-02 01:27:37,364 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] [2019-10-02 01:27:37,364 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] [2019-10-02 01:27:37,365 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] [2019-10-02 01:27:37,365 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] [2019-10-02 01:27:37,367 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_BEFORE_CALL_24,QUANTIFIED] [2019-10-02 01:27:37,367 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_BEFORE_CALL_24,QUANTIFIED] [2019-10-02 01:27:37,367 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_BEFORE_CALL_24,QUANTIFIED] [2019-10-02 01:27:37,381 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] [2019-10-02 01:27:37,382 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] [2019-10-02 01:27:37,382 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] [2019-10-02 01:27:37,383 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] [2019-10-02 01:27:37,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] [2019-10-02 01:27:37,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] [2019-10-02 01:27:37,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] [2019-10-02 01:27:37,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] [2019-10-02 01:27:37,386 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_BEFORE_CALL_24,QUANTIFIED] [2019-10-02 01:27:37,386 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_BEFORE_CALL_24,QUANTIFIED] [2019-10-02 01:27:37,386 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_BEFORE_CALL_24,QUANTIFIED] [2019-10-02 01:27:37,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 01:27:37 BoogieIcfgContainer [2019-10-02 01:27:37,392 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 01:27:37,394 INFO L168 Benchmark]: Toolchain (without parser) took 266031.63 ms. Allocated memory was 133.2 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 85.1 MB in the beginning and 656.8 MB in the end (delta: -571.7 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-10-02 01:27:37,395 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 133.2 MB. Free memory was 106.1 MB in the beginning and 105.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-10-02 01:27:37,396 INFO L168 Benchmark]: CACSL2BoogieTranslator took 862.47 ms. Allocated memory was 133.2 MB in the beginning and 200.8 MB in the end (delta: 67.6 MB). Free memory was 84.9 MB in the beginning and 152.7 MB in the end (delta: -67.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 7.1 GB. [2019-10-02 01:27:37,396 INFO L168 Benchmark]: Boogie Preprocessor took 149.80 ms. Allocated memory is still 200.8 MB. Free memory was 152.7 MB in the beginning and 146.6 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 7.1 GB. [2019-10-02 01:27:37,397 INFO L168 Benchmark]: RCFGBuilder took 1997.65 ms. Allocated memory was 200.8 MB in the beginning and 225.4 MB in the end (delta: 24.6 MB). Free memory was 146.6 MB in the beginning and 138.6 MB in the end (delta: 8.0 MB). Peak memory consumption was 77.8 MB. Max. memory is 7.1 GB. [2019-10-02 01:27:37,398 INFO L168 Benchmark]: TraceAbstraction took 263017.29 ms. Allocated memory was 225.4 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 138.6 MB in the beginning and 656.8 MB in the end (delta: -518.2 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-10-02 01:27:37,402 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.45 ms. Allocated memory is still 133.2 MB. Free memory was 106.1 MB in the beginning and 105.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 862.47 ms. Allocated memory was 133.2 MB in the beginning and 200.8 MB in the end (delta: 67.6 MB). Free memory was 84.9 MB in the beginning and 152.7 MB in the end (delta: -67.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 149.80 ms. Allocated memory is still 200.8 MB. Free memory was 152.7 MB in the beginning and 146.6 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1997.65 ms. Allocated memory was 200.8 MB in the beginning and 225.4 MB in the end (delta: 24.6 MB). Free memory was 146.6 MB in the beginning and 138.6 MB in the end (delta: 8.0 MB). Peak memory consumption was 77.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 263017.29 ms. Allocated memory was 225.4 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 138.6 MB in the beginning and 656.8 MB in the end (delta: -518.2 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_BEFORE_CALL_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_BEFORE_CALL_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_BEFORE_CALL_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_BEFORE_CALL_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_BEFORE_CALL_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_BEFORE_CALL_24,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 115]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 880]: Loop Invariant [2019-10-02 01:27:37,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] [2019-10-02 01:27:37,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] [2019-10-02 01:27:37,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] [2019-10-02 01:27:37,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] [2019-10-02 01:27:37,415 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] [2019-10-02 01:27:37,415 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] [2019-10-02 01:27:37,415 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] [2019-10-02 01:27:37,416 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] [2019-10-02 01:27:37,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_BEFORE_CALL_24,QUANTIFIED] [2019-10-02 01:27:37,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_BEFORE_CALL_24,QUANTIFIED] [2019-10-02 01:27:37,417 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_BEFORE_CALL_24,QUANTIFIED] [2019-10-02 01:27:37,421 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] [2019-10-02 01:27:37,421 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] [2019-10-02 01:27:37,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] [2019-10-02 01:27:37,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] [2019-10-02 01:27:37,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] [2019-10-02 01:27:37,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] [2019-10-02 01:27:37,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] [2019-10-02 01:27:37,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_447,QUANTIFIED] [2019-10-02 01:27:37,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_BEFORE_CALL_24,QUANTIFIED] [2019-10-02 01:27:37,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_BEFORE_CALL_24,QUANTIFIED] [2019-10-02 01:27:37,425 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_BEFORE_CALL_24,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((a15 <= 7 && ((!(a21 == 9) && !(a21 == 6)) && ((((!(10 == \old(a21)) && ((\old(a21) <= 10 && \old(a12) <= 80) || \old(a21) <= 6)) && !(9 == a15)) && !(a21 == 7)) && !(a21 == 10)) && a24 == 1) && (\exists v_~a12~0_447 : int :: ((v_~a12~0_447 <= 80 && a12 <= (v_~a12~0_447 + 366333) / 5) && 0 <= v_~a12~0_447 + 366333) && 11 < v_~a12~0_447)) || !(8 == \old(a15))) || (((((a21 == 6 && !(a15 == 5)) && ((\old(a21) <= 10 && \old(a12) <= 80) || \old(a21) <= 6)) && !(9 == a15)) && a24 == 1) && a15 <= 7)) || ((((((a21 <= 7 && !(a21 == 6)) && a12 <= 10) && \old(a12) <= a12) && ((a21 == 8 || a21 == \old(a21)) || 0 < a12 + 43)) && a24 == 1) && a15 == \old(a15))) || (((((a21 == 6 && a12 + 49 <= 0) && !(a15 == 9)) || ((a21 == 10 && 80 < a12) && a24 == 1)) && 8 == \old(a15)) && 82 <= a12)) || (((a12 <= 10 && a21 == 9 && a24 == 1) && ((a21 == 8 || a21 == \old(a21)) || 0 < a12 + 43)) && a15 == \old(a15))) || (((((a21 == 6 && a12 + 49 <= 0) && !(a15 == 9)) || ((a21 == 10 && 80 < a12) && a24 == 1)) && 8 == \old(a15)) && !(a21 == 10))) || (((a12 <= 75 && a24 == \old(a24) && a21 == 9) && a15 == \old(a15)) && 19 <= a12)) || ((a24 == \old(a24) && a21 == 10) && \old(a12) <= a12 && a12 + 43 <= 0)) || (((((!(a21 == 9) && !(a21 == 6)) && ((((!(10 == \old(a21)) && ((\old(a21) <= 10 && \old(a12) <= 80) || \old(a21) <= 6)) && !(9 == a15)) && !(a21 == 7)) && !(a21 == 10)) && a24 == 1) && (\exists v_~a12~0_447 : int :: ((v_~a12~0_447 <= 80 && a12 <= (v_~a12~0_447 + 366333) / 5) && 0 <= v_~a12~0_447 + 366333) && 11 < v_~a12~0_447)) && 82 <= a12) && a15 == \old(a15))) || ((((!(a15 == 8) && a21 == 6) && a24 == 1) && a12 <= 95433) && 95380 < a12)) || ((((((((!(10 == \old(a21)) && (!(9 == \old(a15)) || !(7 == \old(a21)))) && a21 == 10) && ((\old(a21) <= 10 && \old(a12) <= 80) || \old(a21) <= 6)) && !(9 == a15)) && (!(6 == \old(a21)) || !(5 == \old(a15)))) && ((!(9 == \old(a21)) || !(8 == \old(a15))) || 12 <= \old(a12))) && a24 == 1) && a15 <= 7)) || (((((((!(10 == \old(a21)) && ((\old(a21) <= 10 && \old(a12) <= 80) || \old(a21) <= 6)) && !(9 == a15)) && !(a21 == 7)) && !(a21 == 10)) && a24 == 1) && a21 == 9) && a15 <= 7)) || !(\old(a12) + 49 <= 0)) || ((((a21 == 7 && a15 == 9) && a24 == 1) || ((a24 == 1 && a21 == 8) && a15 == 9)) && 82 <= a12)) || (((a21 == 10 && !(9 == a15)) && 80 < a12) && a24 == 1)) || ((a21 == 6 && a24 == 1) && a15 == 5)) || ((a15 == \old(a15) && ((a12 <= 76 && !(a21 == 9)) && !(a21 == 6)) && ((((!(10 == \old(a21)) && ((\old(a21) <= 10 && \old(a12) <= 80) || \old(a21) <= 6)) && !(9 == a15)) && !(a21 == 7)) && !(a21 == 10)) && a24 == 1) && 19 <= a12)) || ((286349 <= a12 && (((a21 == 6 && !(a15 == 5)) && ((\old(a21) <= 10 && \old(a12) <= 80) || \old(a21) <= 6)) && !(9 == a15)) && a24 == 1) && a15 == \old(a15))) || ((((18 < a12 && !(7 == a15)) && a24 == \old(a24)) && a12 <= 71) && a15 <= 7)) || (((a12 <= 10 && a24 == \old(a24)) && a21 == 10) && !(a15 == 8))) || !(\old(a21) <= 7)) || (a15 == 7 && (!(a21 == 9) && !(a21 == 6)) && ((((!(10 == \old(a21)) && ((\old(a21) <= 10 && \old(a12) <= 80) || \old(a21) <= 6)) && !(9 == a15)) && !(a21 == 7)) && !(a21 == 10)) && a24 == 1)) || (((a12 <= 10 && a24 == 1) && a21 == 8) && a15 == 9)) || ((((a12 <= 71 && a21 == 8) && a24 == 1) && a15 == 9) && 19 <= a12)) || ((a24 == 1 && (\exists v_~a12~0_BEFORE_CALL_24 : int :: (v_~a12~0_BEFORE_CALL_24 <= 95434 && 95380 < v_~a12~0_BEFORE_CALL_24) && a12 + 546123 <= 9 * v_~a12~0_BEFORE_CALL_24 / 10)) && a15 == 7)) || !(7 <= \old(a21))) || (((a24 == 1 && a12 <= 11) && ((((((!(10 == \old(a21)) && (!(9 == \old(a15)) || !(7 == \old(a21)))) && a21 == 10) && ((\old(a21) <= 10 && \old(a12) <= 80) || \old(a21) <= 6)) && !(9 == a15)) && (!(6 == \old(a21)) || !(5 == \old(a15)))) && ((!(9 == \old(a21)) || !(8 == \old(a15))) || 12 <= \old(a12))) && a15 == 8) && 0 < a12 + 43)) || !(1 == \old(a24))) || (((a21 == 9 && a24 == 1) && !(a15 == 8)) && 82 <= a12) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 254 locations, 1 error locations. SAFE Result, 262.8s OverallTime, 17 OverallIterations, 19 TraceHistogramMax, 163.6s AutomataDifference, 0.0s DeadEndRemovalTime, 33.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 999 SDtfs, 91099 SDslu, 5598 SDs, 0 SdLazy, 101939 SolverSat, 11977 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 84.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16278 GetRequests, 15213 SyntacticMatches, 21 SemanticMatches, 1044 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39529 ImplicationChecksByTransitivity, 68.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6894occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 13517 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 405 PreInvPairs, 551 NumberOfFragments, 2862 HoareAnnotationTreeSize, 405 FomulaSimplifications, 6754390 FormulaSimplificationTreeSizeReduction, 5.6s HoareSimplificationTime, 7 FomulaSimplificationsInter, 6055671 FormulaSimplificationTreeSizeReductionInter, 27.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.8s SsaConstructionTime, 4.2s SatisfiabilityAnalysisTime, 27.6s InterpolantComputationTime, 29924 NumberOfCodeBlocks, 29924 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 29893 ConstructedInterpolants, 49 QuantifiedInterpolants, 184322209 SizeOfPredicates, 19 NumberOfNonLiveVariables, 20630 ConjunctsInSsa, 159 ConjunctsInUnsatCore, 31 InterpolantComputations, 5 PerfectInterpolantSequences, 102206/132358 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...