./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem11_label11_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem11_label11_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7958494c6199e982ad9ca9c80defa7dd09ad4867 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 03:36:16,468 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 03:36:16,469 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 03:36:16,481 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 03:36:16,482 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 03:36:16,483 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 03:36:16,484 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 03:36:16,486 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 03:36:16,489 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 03:36:16,490 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 03:36:16,493 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 03:36:16,493 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 03:36:16,495 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 03:36:16,496 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 03:36:16,497 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 03:36:16,501 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 03:36:16,502 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 03:36:16,511 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 03:36:16,515 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 03:36:16,518 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 03:36:16,519 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 03:36:16,524 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 03:36:16,530 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 03:36:16,530 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 03:36:16,530 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 03:36:16,531 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 03:36:16,532 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 03:36:16,533 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 03:36:16,534 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 03:36:16,535 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 03:36:16,535 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 03:36:16,537 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 03:36:16,538 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 03:36:16,538 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 03:36:16,539 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 03:36:16,540 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 03:36:16,540 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 03:36:16,570 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 03:36:16,573 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 03:36:16,574 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 03:36:16,575 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 03:36:16,576 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 03:36:16,576 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 03:36:16,576 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 03:36:16,576 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 03:36:16,576 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 03:36:16,577 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 03:36:16,577 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 03:36:16,577 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 03:36:16,577 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 03:36:16,577 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 03:36:16,577 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 03:36:16,578 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 03:36:16,580 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 03:36:16,580 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 03:36:16,581 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 03:36:16,581 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 03:36:16,581 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 03:36:16,581 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 03:36:16,582 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 03:36:16,582 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 03:36:16,582 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 03:36:16,582 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 03:36:16,582 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 03:36:16,582 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 03:36:16,585 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7958494c6199e982ad9ca9c80defa7dd09ad4867 [2019-01-12 03:36:16,645 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 03:36:16,661 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 03:36:16,667 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 03:36:16,669 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 03:36:16,670 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 03:36:16,670 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem11_label11_true-unreach-call.c [2019-01-12 03:36:16,749 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac4e1554b/742bd174ceab49e2a49852d417a7593f/FLAGe08aff0ab [2019-01-12 03:36:17,371 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 03:36:17,372 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem11_label11_true-unreach-call.c [2019-01-12 03:36:17,388 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac4e1554b/742bd174ceab49e2a49852d417a7593f/FLAGe08aff0ab [2019-01-12 03:36:17,596 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac4e1554b/742bd174ceab49e2a49852d417a7593f [2019-01-12 03:36:17,599 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 03:36:17,600 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 03:36:17,601 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 03:36:17,601 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 03:36:17,605 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 03:36:17,606 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:36:17" (1/1) ... [2019-01-12 03:36:17,609 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6889cd69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:36:17, skipping insertion in model container [2019-01-12 03:36:17,609 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:36:17" (1/1) ... [2019-01-12 03:36:17,618 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 03:36:17,704 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 03:36:18,308 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 03:36:18,319 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 03:36:18,586 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 03:36:18,763 INFO L195 MainTranslator]: Completed translation [2019-01-12 03:36:18,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:36:18 WrapperNode [2019-01-12 03:36:18,765 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 03:36:18,767 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 03:36:18,767 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 03:36:18,767 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 03:36:18,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:36:18" (1/1) ... [2019-01-12 03:36:18,836 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:36:18" (1/1) ... [2019-01-12 03:36:18,996 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 03:36:18,997 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 03:36:18,997 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 03:36:18,997 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 03:36:19,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:36:18" (1/1) ... [2019-01-12 03:36:19,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:36:18" (1/1) ... [2019-01-12 03:36:19,024 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:36:18" (1/1) ... [2019-01-12 03:36:19,025 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:36:18" (1/1) ... [2019-01-12 03:36:19,091 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:36:18" (1/1) ... [2019-01-12 03:36:19,118 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:36:18" (1/1) ... [2019-01-12 03:36:19,149 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:36:18" (1/1) ... [2019-01-12 03:36:19,169 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 03:36:19,169 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 03:36:19,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 03:36:19,170 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 03:36:19,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:36:18" (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-01-12 03:36:19,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 03:36:19,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 03:36:22,981 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 03:36:22,981 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 03:36:22,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:36:22 BoogieIcfgContainer [2019-01-12 03:36:22,983 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 03:36:22,984 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 03:36:22,984 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 03:36:22,987 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 03:36:22,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:36:17" (1/3) ... [2019-01-12 03:36:22,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8c26e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:36:22, skipping insertion in model container [2019-01-12 03:36:22,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:36:18" (2/3) ... [2019-01-12 03:36:22,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8c26e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:36:22, skipping insertion in model container [2019-01-12 03:36:22,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:36:22" (3/3) ... [2019-01-12 03:36:22,991 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label11_true-unreach-call.c [2019-01-12 03:36:23,001 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 03:36:23,009 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 03:36:23,026 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 03:36:23,061 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 03:36:23,062 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 03:36:23,062 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 03:36:23,062 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 03:36:23,062 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 03:36:23,062 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 03:36:23,063 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 03:36:23,063 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 03:36:23,063 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 03:36:23,087 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-01-12 03:36:23,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-12 03:36:23,097 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:36:23,098 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:36:23,101 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:36:23,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:36:23,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1818267785, now seen corresponding path program 1 times [2019-01-12 03:36:23,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:36:23,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:36:23,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:36:23,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:36:23,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:36:23,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:36:23,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:36:23,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:36:23,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:36:23,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:36:23,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:36:23,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:36:23,630 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-01-12 03:36:26,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:36:26,994 INFO L93 Difference]: Finished difference Result 973 states and 1743 transitions. [2019-01-12 03:36:26,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:36:26,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-01-12 03:36:26,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:36:27,017 INFO L225 Difference]: With dead ends: 973 [2019-01-12 03:36:27,017 INFO L226 Difference]: Without dead ends: 607 [2019-01-12 03:36:27,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:36:27,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-01-12 03:36:27,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 604. [2019-01-12 03:36:27,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-01-12 03:36:27,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 874 transitions. [2019-01-12 03:36:27,105 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 874 transitions. Word has length 61 [2019-01-12 03:36:27,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:36:27,106 INFO L480 AbstractCegarLoop]: Abstraction has 604 states and 874 transitions. [2019-01-12 03:36:27,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:36:27,106 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 874 transitions. [2019-01-12 03:36:27,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-01-12 03:36:27,112 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:36:27,112 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:36:27,113 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:36:27,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:36:27,113 INFO L82 PathProgramCache]: Analyzing trace with hash -50014000, now seen corresponding path program 1 times [2019-01-12 03:36:27,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:36:27,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:36:27,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:36:27,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:36:27,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:36:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:36:27,355 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:36:27,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:36:27,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:36:27,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:36:27,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:36:27,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:36:27,358 INFO L87 Difference]: Start difference. First operand 604 states and 874 transitions. Second operand 4 states. [2019-01-12 03:36:29,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:36:29,567 INFO L93 Difference]: Finished difference Result 2328 states and 3390 transitions. [2019-01-12 03:36:29,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:36:29,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-01-12 03:36:29,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:36:29,580 INFO L225 Difference]: With dead ends: 2328 [2019-01-12 03:36:29,580 INFO L226 Difference]: Without dead ends: 1726 [2019-01-12 03:36:29,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-01-12 03:36:29,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2019-01-12 03:36:29,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1710. [2019-01-12 03:36:29,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1710 states. [2019-01-12 03:36:29,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2341 transitions. [2019-01-12 03:36:29,645 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2341 transitions. Word has length 129 [2019-01-12 03:36:29,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:36:29,646 INFO L480 AbstractCegarLoop]: Abstraction has 1710 states and 2341 transitions. [2019-01-12 03:36:29,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:36:29,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2341 transitions. [2019-01-12 03:36:29,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-01-12 03:36:29,652 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:36:29,653 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 03:36:29,653 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:36:29,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:36:29,654 INFO L82 PathProgramCache]: Analyzing trace with hash 2032903069, now seen corresponding path program 1 times [2019-01-12 03:36:29,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:36:29,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:36:29,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:36:29,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:36:29,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:36:29,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:36:29,931 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:36:29,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:36:29,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 03:36:29,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 03:36:29,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 03:36:29,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:36:29,937 INFO L87 Difference]: Start difference. First operand 1710 states and 2341 transitions. Second operand 3 states. [2019-01-12 03:36:31,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:36:31,931 INFO L93 Difference]: Finished difference Result 4707 states and 6451 transitions. [2019-01-12 03:36:31,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 03:36:31,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-01-12 03:36:31,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:36:31,947 INFO L225 Difference]: With dead ends: 4707 [2019-01-12 03:36:31,947 INFO L226 Difference]: Without dead ends: 2999 [2019-01-12 03:36:31,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:36:31,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2999 states. [2019-01-12 03:36:32,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2999 to 2999. [2019-01-12 03:36:32,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2999 states. [2019-01-12 03:36:32,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 3733 transitions. [2019-01-12 03:36:32,007 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 3733 transitions. Word has length 171 [2019-01-12 03:36:32,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:36:32,008 INFO L480 AbstractCegarLoop]: Abstraction has 2999 states and 3733 transitions. [2019-01-12 03:36:32,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 03:36:32,008 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 3733 transitions. [2019-01-12 03:36:32,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-01-12 03:36:32,011 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:36:32,011 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 03:36:32,011 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:36:32,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:36:32,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1226033499, now seen corresponding path program 1 times [2019-01-12 03:36:32,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:36:32,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:36:32,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:36:32,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:36:32,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:36:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:36:32,362 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-12 03:36:32,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:36:32,363 INFO L223 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-01-12 03:36:32,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:36:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:36:32,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:36:32,522 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-01-12 03:36:32,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 03:36:32,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-01-12 03:36:32,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:36:32,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:36:32,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:36:32,551 INFO L87 Difference]: Start difference. First operand 2999 states and 3733 transitions. Second operand 4 states. [2019-01-12 03:36:35,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:36:35,431 INFO L93 Difference]: Finished difference Result 9866 states and 12115 transitions. [2019-01-12 03:36:35,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:36:35,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2019-01-12 03:36:35,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:36:35,461 INFO L225 Difference]: With dead ends: 9866 [2019-01-12 03:36:35,462 INFO L226 Difference]: Without dead ends: 6869 [2019-01-12 03:36:35,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:36:35,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6869 states. [2019-01-12 03:36:35,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6869 to 6316. [2019-01-12 03:36:35,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6316 states. [2019-01-12 03:36:35,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6316 states to 6316 states and 7608 transitions. [2019-01-12 03:36:35,590 INFO L78 Accepts]: Start accepts. Automaton has 6316 states and 7608 transitions. Word has length 183 [2019-01-12 03:36:35,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:36:35,591 INFO L480 AbstractCegarLoop]: Abstraction has 6316 states and 7608 transitions. [2019-01-12 03:36:35,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:36:35,591 INFO L276 IsEmpty]: Start isEmpty. Operand 6316 states and 7608 transitions. [2019-01-12 03:36:35,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-01-12 03:36:35,594 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:36:35,594 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-12 03:36:35,595 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:36:35,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:36:35,595 INFO L82 PathProgramCache]: Analyzing trace with hash -570673419, now seen corresponding path program 1 times [2019-01-12 03:36:35,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:36:35,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:36:35,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:36:35,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:36:35,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:36:35,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:36:36,024 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:36:36,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:36:36,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:36:36,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:36:36,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:36:36,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:36:36,026 INFO L87 Difference]: Start difference. First operand 6316 states and 7608 transitions. Second operand 4 states. [2019-01-12 03:36:40,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:36:40,155 INFO L93 Difference]: Finished difference Result 16142 states and 19602 transitions. [2019-01-12 03:36:40,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:36:40,156 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2019-01-12 03:36:40,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:36:40,192 INFO L225 Difference]: With dead ends: 16142 [2019-01-12 03:36:40,192 INFO L226 Difference]: Without dead ends: 10012 [2019-01-12 03:36:40,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:36:40,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10012 states. [2019-01-12 03:36:40,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10012 to 8524. [2019-01-12 03:36:40,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8524 states. [2019-01-12 03:36:40,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8524 states to 8524 states and 10181 transitions. [2019-01-12 03:36:40,425 INFO L78 Accepts]: Start accepts. Automaton has 8524 states and 10181 transitions. Word has length 188 [2019-01-12 03:36:40,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:36:40,426 INFO L480 AbstractCegarLoop]: Abstraction has 8524 states and 10181 transitions. [2019-01-12 03:36:40,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:36:40,426 INFO L276 IsEmpty]: Start isEmpty. Operand 8524 states and 10181 transitions. [2019-01-12 03:36:40,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-01-12 03:36:40,435 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:36:40,436 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 03:36:40,436 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:36:40,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:36:40,437 INFO L82 PathProgramCache]: Analyzing trace with hash 94013981, now seen corresponding path program 1 times [2019-01-12 03:36:40,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:36:40,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:36:40,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:36:40,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:36:40,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:36:40,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:36:41,051 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:36:41,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:36:41,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:36:41,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 03:36:41,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 03:36:41,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:36:41,052 INFO L87 Difference]: Start difference. First operand 8524 states and 10181 transitions. Second operand 5 states. [2019-01-12 03:36:43,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:36:43,517 INFO L93 Difference]: Finished difference Result 24247 states and 29091 transitions. [2019-01-12 03:36:43,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 03:36:43,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 321 [2019-01-12 03:36:43,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:36:43,564 INFO L225 Difference]: With dead ends: 24247 [2019-01-12 03:36:43,564 INFO L226 Difference]: Without dead ends: 15173 [2019-01-12 03:36:43,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:36:43,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15173 states. [2019-01-12 03:36:43,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15173 to 12765. [2019-01-12 03:36:43,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12765 states. [2019-01-12 03:36:43,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12765 states to 12765 states and 14653 transitions. [2019-01-12 03:36:43,896 INFO L78 Accepts]: Start accepts. Automaton has 12765 states and 14653 transitions. Word has length 321 [2019-01-12 03:36:43,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:36:43,897 INFO L480 AbstractCegarLoop]: Abstraction has 12765 states and 14653 transitions. [2019-01-12 03:36:43,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 03:36:43,897 INFO L276 IsEmpty]: Start isEmpty. Operand 12765 states and 14653 transitions. [2019-01-12 03:36:43,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2019-01-12 03:36:43,918 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:36:43,918 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-01-12 03:36:43,919 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:36:43,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:36:43,920 INFO L82 PathProgramCache]: Analyzing trace with hash -258687416, now seen corresponding path program 1 times [2019-01-12 03:36:43,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:36:43,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:36:43,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:36:43,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:36:43,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:36:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:36:44,497 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 367 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-01-12 03:36:44,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:36:44,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:36:44,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:36:44,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:36:44,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:36:44,500 INFO L87 Difference]: Start difference. First operand 12765 states and 14653 transitions. Second operand 4 states. [2019-01-12 03:36:47,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:36:47,353 INFO L93 Difference]: Finished difference Result 27202 states and 31250 transitions. [2019-01-12 03:36:47,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:36:47,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 389 [2019-01-12 03:36:47,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:36:47,386 INFO L225 Difference]: With dead ends: 27202 [2019-01-12 03:36:47,386 INFO L226 Difference]: Without dead ends: 14623 [2019-01-12 03:36:47,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:36:47,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14623 states. [2019-01-12 03:36:47,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14623 to 12580. [2019-01-12 03:36:47,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12580 states. [2019-01-12 03:36:47,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12580 states to 12580 states and 14185 transitions. [2019-01-12 03:36:47,798 INFO L78 Accepts]: Start accepts. Automaton has 12580 states and 14185 transitions. Word has length 389 [2019-01-12 03:36:47,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:36:47,801 INFO L480 AbstractCegarLoop]: Abstraction has 12580 states and 14185 transitions. [2019-01-12 03:36:47,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:36:47,801 INFO L276 IsEmpty]: Start isEmpty. Operand 12580 states and 14185 transitions. [2019-01-12 03:36:47,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2019-01-12 03:36:47,837 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:36:47,838 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:36:47,838 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:36:47,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:36:47,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1552606349, now seen corresponding path program 1 times [2019-01-12 03:36:47,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:36:47,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:36:47,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:36:47,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:36:47,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:36:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:36:48,594 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 327 proven. 102 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-01-12 03:36:48,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:36:48,595 INFO L223 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-01-12 03:36:48,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:36:48,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:36:48,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:36:48,995 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 327 proven. 102 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-01-12 03:36:49,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:36:49,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2019-01-12 03:36:49,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 03:36:49,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 03:36:49,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:36:49,025 INFO L87 Difference]: Start difference. First operand 12580 states and 14185 transitions. Second operand 5 states. [2019-01-12 03:36:52,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:36:52,357 INFO L93 Difference]: Finished difference Result 32162 states and 36513 transitions. [2019-01-12 03:36:52,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 03:36:52,358 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 401 [2019-01-12 03:36:52,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:36:52,396 INFO L225 Difference]: With dead ends: 32162 [2019-01-12 03:36:52,396 INFO L226 Difference]: Without dead ends: 19952 [2019-01-12 03:36:52,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 400 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 03:36:52,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19952 states. [2019-01-12 03:36:52,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19952 to 13679. [2019-01-12 03:36:52,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13679 states. [2019-01-12 03:36:52,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13679 states to 13679 states and 15483 transitions. [2019-01-12 03:36:52,639 INFO L78 Accepts]: Start accepts. Automaton has 13679 states and 15483 transitions. Word has length 401 [2019-01-12 03:36:52,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:36:52,639 INFO L480 AbstractCegarLoop]: Abstraction has 13679 states and 15483 transitions. [2019-01-12 03:36:52,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 03:36:52,639 INFO L276 IsEmpty]: Start isEmpty. Operand 13679 states and 15483 transitions. [2019-01-12 03:36:52,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2019-01-12 03:36:52,663 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:36:52,665 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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-01-12 03:36:52,665 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:36:52,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:36:52,665 INFO L82 PathProgramCache]: Analyzing trace with hash -284474862, now seen corresponding path program 1 times [2019-01-12 03:36:52,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:36:52,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:36:52,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:36:52,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:36:52,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:36:52,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:36:53,159 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-12 03:36:53,645 WARN L181 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2019-01-12 03:36:54,330 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 277 proven. 226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:36:54,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:36:54,331 INFO L223 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-01-12 03:36:54,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:36:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:36:54,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:36:55,043 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 277 proven. 226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:36:55,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:36:55,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 11 [2019-01-12 03:36:55,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 03:36:55,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 03:36:55,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-01-12 03:36:55,063 INFO L87 Difference]: Start difference. First operand 13679 states and 15483 transitions. Second operand 12 states. [2019-01-12 03:37:02,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:37:02,961 INFO L93 Difference]: Finished difference Result 32463 states and 36702 transitions. [2019-01-12 03:37:02,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-12 03:37:02,962 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 424 [2019-01-12 03:37:02,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:37:03,007 INFO L225 Difference]: With dead ends: 32463 [2019-01-12 03:37:03,008 INFO L226 Difference]: Without dead ends: 19154 [2019-01-12 03:37:03,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 420 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=247, Invalid=509, Unknown=0, NotChecked=0, Total=756 [2019-01-12 03:37:03,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19154 states. [2019-01-12 03:37:03,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19154 to 13853. [2019-01-12 03:37:03,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13853 states. [2019-01-12 03:37:03,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13853 states to 13853 states and 15126 transitions. [2019-01-12 03:37:03,294 INFO L78 Accepts]: Start accepts. Automaton has 13853 states and 15126 transitions. Word has length 424 [2019-01-12 03:37:03,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:37:03,294 INFO L480 AbstractCegarLoop]: Abstraction has 13853 states and 15126 transitions. [2019-01-12 03:37:03,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 03:37:03,295 INFO L276 IsEmpty]: Start isEmpty. Operand 13853 states and 15126 transitions. [2019-01-12 03:37:03,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2019-01-12 03:37:03,326 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:37:03,327 INFO L402 BasicCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-01-12 03:37:03,328 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:37:03,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:37:03,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1134199501, now seen corresponding path program 1 times [2019-01-12 03:37:03,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:37:03,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:37:03,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:37:03,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:37:03,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:37:03,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:37:03,922 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 699 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-01-12 03:37:03,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:37:03,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:37:03,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:37:03,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:37:03,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:37:03,924 INFO L87 Difference]: Start difference. First operand 13853 states and 15126 transitions. Second operand 4 states. [2019-01-12 03:37:05,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:37:05,415 INFO L93 Difference]: Finished difference Result 28632 states and 31278 transitions. [2019-01-12 03:37:05,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:37:05,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 535 [2019-01-12 03:37:05,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:37:05,438 INFO L225 Difference]: With dead ends: 28632 [2019-01-12 03:37:05,438 INFO L226 Difference]: Without dead ends: 15887 [2019-01-12 03:37:05,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:37:05,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15887 states. [2019-01-12 03:37:05,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15887 to 14589. [2019-01-12 03:37:05,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14589 states. [2019-01-12 03:37:05,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14589 states to 14589 states and 15878 transitions. [2019-01-12 03:37:05,661 INFO L78 Accepts]: Start accepts. Automaton has 14589 states and 15878 transitions. Word has length 535 [2019-01-12 03:37:05,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:37:05,662 INFO L480 AbstractCegarLoop]: Abstraction has 14589 states and 15878 transitions. [2019-01-12 03:37:05,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:37:05,662 INFO L276 IsEmpty]: Start isEmpty. Operand 14589 states and 15878 transitions. [2019-01-12 03:37:05,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2019-01-12 03:37:05,684 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:37:05,685 INFO L402 BasicCegarLoop]: trace histogram [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, 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, 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] [2019-01-12 03:37:05,685 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:37:05,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:37:05,685 INFO L82 PathProgramCache]: Analyzing trace with hash -187460572, now seen corresponding path program 1 times [2019-01-12 03:37:05,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:37:05,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:37:05,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:37:05,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:37:05,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:37:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:37:06,106 INFO L134 CoverageAnalysis]: Checked inductivity of 833 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 598 trivial. 0 not checked. [2019-01-12 03:37:06,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:37:06,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:37:06,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 03:37:06,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 03:37:06,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:37:06,108 INFO L87 Difference]: Start difference. First operand 14589 states and 15878 transitions. Second operand 3 states. [2019-01-12 03:37:07,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:37:07,190 INFO L93 Difference]: Finished difference Result 28805 states and 31336 transitions. [2019-01-12 03:37:07,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 03:37:07,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 549 [2019-01-12 03:37:07,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:37:07,204 INFO L225 Difference]: With dead ends: 28805 [2019-01-12 03:37:07,204 INFO L226 Difference]: Without dead ends: 13666 [2019-01-12 03:37:07,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:37:07,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13666 states. [2019-01-12 03:37:07,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13666 to 13666. [2019-01-12 03:37:07,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13666 states. [2019-01-12 03:37:07,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13666 states to 13666 states and 14672 transitions. [2019-01-12 03:37:07,378 INFO L78 Accepts]: Start accepts. Automaton has 13666 states and 14672 transitions. Word has length 549 [2019-01-12 03:37:07,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:37:07,378 INFO L480 AbstractCegarLoop]: Abstraction has 13666 states and 14672 transitions. [2019-01-12 03:37:07,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 03:37:07,380 INFO L276 IsEmpty]: Start isEmpty. Operand 13666 states and 14672 transitions. [2019-01-12 03:37:07,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2019-01-12 03:37:07,399 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:37:07,399 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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] [2019-01-12 03:37:07,400 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:37:07,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:37:07,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1300429429, now seen corresponding path program 1 times [2019-01-12 03:37:07,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:37:07,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:37:07,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:37:07,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:37:07,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:37:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:37:08,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1261 backedges. 773 proven. 8 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-01-12 03:37:08,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:37:08,289 INFO L223 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-01-12 03:37:08,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:37:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:37:08,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:37:08,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1261 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2019-01-12 03:37:08,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 03:37:08,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-01-12 03:37:08,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:37:08,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:37:08,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:37:08,700 INFO L87 Difference]: Start difference. First operand 13666 states and 14672 transitions. Second operand 4 states. [2019-01-12 03:37:09,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:37:09,891 INFO L93 Difference]: Finished difference Result 26406 states and 28333 transitions. [2019-01-12 03:37:09,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 03:37:09,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 647 [2019-01-12 03:37:09,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:37:09,907 INFO L225 Difference]: With dead ends: 26406 [2019-01-12 03:37:09,908 INFO L226 Difference]: Without dead ends: 13848 [2019-01-12 03:37:09,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 650 GetRequests, 648 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:37:09,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13848 states. [2019-01-12 03:37:10,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13848 to 13661. [2019-01-12 03:37:10,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13661 states. [2019-01-12 03:37:10,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13661 states to 13661 states and 14657 transitions. [2019-01-12 03:37:10,100 INFO L78 Accepts]: Start accepts. Automaton has 13661 states and 14657 transitions. Word has length 647 [2019-01-12 03:37:10,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:37:10,101 INFO L480 AbstractCegarLoop]: Abstraction has 13661 states and 14657 transitions. [2019-01-12 03:37:10,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:37:10,102 INFO L276 IsEmpty]: Start isEmpty. Operand 13661 states and 14657 transitions. [2019-01-12 03:37:10,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2019-01-12 03:37:10,122 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:37:10,122 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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] [2019-01-12 03:37:10,123 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:37:10,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:37:10,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1991250711, now seen corresponding path program 1 times [2019-01-12 03:37:10,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:37:10,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:37:10,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:37:10,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:37:10,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:37:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:37:11,047 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2019-01-12 03:37:12,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1298 backedges. 584 proven. 440 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2019-01-12 03:37:12,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:37:12,018 INFO L223 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-01-12 03:37:12,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:37:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:37:12,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:37:13,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1298 backedges. 577 proven. 122 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2019-01-12 03:37:13,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:37:13,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 7 [2019-01-12 03:37:13,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 03:37:13,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 03:37:13,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-12 03:37:13,114 INFO L87 Difference]: Start difference. First operand 13661 states and 14657 transitions. Second operand 8 states. [2019-01-12 03:37:15,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:37:15,475 INFO L93 Difference]: Finished difference Result 26600 states and 28507 transitions. [2019-01-12 03:37:15,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 03:37:15,476 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 658 [2019-01-12 03:37:15,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:37:15,490 INFO L225 Difference]: With dead ends: 26600 [2019-01-12 03:37:15,490 INFO L226 Difference]: Without dead ends: 14047 [2019-01-12 03:37:15,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 669 GetRequests, 655 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-01-12 03:37:15,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14047 states. [2019-01-12 03:37:15,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14047 to 13477. [2019-01-12 03:37:15,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13477 states. [2019-01-12 03:37:15,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13477 states to 13477 states and 14456 transitions. [2019-01-12 03:37:15,711 INFO L78 Accepts]: Start accepts. Automaton has 13477 states and 14456 transitions. Word has length 658 [2019-01-12 03:37:15,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:37:15,712 INFO L480 AbstractCegarLoop]: Abstraction has 13477 states and 14456 transitions. [2019-01-12 03:37:15,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 03:37:15,712 INFO L276 IsEmpty]: Start isEmpty. Operand 13477 states and 14456 transitions. [2019-01-12 03:37:15,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 660 [2019-01-12 03:37:15,734 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:37:15,735 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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] [2019-01-12 03:37:15,735 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:37:15,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:37:15,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1728529722, now seen corresponding path program 1 times [2019-01-12 03:37:15,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:37:15,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:37:15,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:37:15,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:37:15,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:37:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:37:17,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 584 proven. 439 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2019-01-12 03:37:17,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:37:17,493 INFO L223 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-01-12 03:37:17,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:37:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:37:17,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:37:18,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 663 proven. 36 refuted. 0 times theorem prover too weak. 598 trivial. 0 not checked. [2019-01-12 03:37:18,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:37:18,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 8 [2019-01-12 03:37:18,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 03:37:18,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 03:37:18,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-12 03:37:18,934 INFO L87 Difference]: Start difference. First operand 13477 states and 14456 transitions. Second operand 9 states. [2019-01-12 03:37:21,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:37:21,900 INFO L93 Difference]: Finished difference Result 26411 states and 28289 transitions. [2019-01-12 03:37:21,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 03:37:21,901 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 659 [2019-01-12 03:37:21,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:37:21,918 INFO L225 Difference]: With dead ends: 26411 [2019-01-12 03:37:21,918 INFO L226 Difference]: Without dead ends: 14042 [2019-01-12 03:37:21,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 673 GetRequests, 657 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-01-12 03:37:21,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14042 states. [2019-01-12 03:37:22,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14042 to 13475. [2019-01-12 03:37:22,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13475 states. [2019-01-12 03:37:22,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13475 states to 13475 states and 14441 transitions. [2019-01-12 03:37:22,142 INFO L78 Accepts]: Start accepts. Automaton has 13475 states and 14441 transitions. Word has length 659 [2019-01-12 03:37:22,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:37:22,143 INFO L480 AbstractCegarLoop]: Abstraction has 13475 states and 14441 transitions. [2019-01-12 03:37:22,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 03:37:22,143 INFO L276 IsEmpty]: Start isEmpty. Operand 13475 states and 14441 transitions. [2019-01-12 03:37:22,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 718 [2019-01-12 03:37:22,165 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:37:22,165 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:37:22,166 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:37:22,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:37:22,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1191977518, now seen corresponding path program 1 times [2019-01-12 03:37:22,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:37:22,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:37:22,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:37:22,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:37:22,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:37:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:37:23,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1878 backedges. 1269 proven. 0 refuted. 0 times theorem prover too weak. 609 trivial. 0 not checked. [2019-01-12 03:37:23,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:37:23,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:37:23,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 03:37:23,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 03:37:23,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:37:23,030 INFO L87 Difference]: Start difference. First operand 13475 states and 14441 transitions. Second operand 3 states. [2019-01-12 03:37:23,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:37:23,948 INFO L93 Difference]: Finished difference Result 26765 states and 28644 transitions. [2019-01-12 03:37:23,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 03:37:23,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 717 [2019-01-12 03:37:23,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:37:23,964 INFO L225 Difference]: With dead ends: 26765 [2019-01-12 03:37:23,964 INFO L226 Difference]: Without dead ends: 14030 [2019-01-12 03:37:23,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:37:23,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14030 states. [2019-01-12 03:37:24,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14030 to 12923. [2019-01-12 03:37:24,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12923 states. [2019-01-12 03:37:24,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12923 states to 12923 states and 13828 transitions. [2019-01-12 03:37:24,328 INFO L78 Accepts]: Start accepts. Automaton has 12923 states and 13828 transitions. Word has length 717 [2019-01-12 03:37:24,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:37:24,329 INFO L480 AbstractCegarLoop]: Abstraction has 12923 states and 13828 transitions. [2019-01-12 03:37:24,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 03:37:24,329 INFO L276 IsEmpty]: Start isEmpty. Operand 12923 states and 13828 transitions. [2019-01-12 03:37:24,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 719 [2019-01-12 03:37:24,346 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:37:24,347 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:37:24,348 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:37:24,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:37:24,348 INFO L82 PathProgramCache]: Analyzing trace with hash -856846528, now seen corresponding path program 1 times [2019-01-12 03:37:24,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:37:24,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:37:24,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:37:24,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:37:24,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:37:24,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:37:25,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1882 backedges. 377 proven. 495 refuted. 0 times theorem prover too weak. 1010 trivial. 0 not checked. [2019-01-12 03:37:25,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:37:25,960 INFO L223 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-01-12 03:37:25,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:37:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:37:26,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:37:26,822 WARN L181 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 27 [2019-01-12 03:37:27,227 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-12 03:37:28,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1882 backedges. 707 proven. 165 refuted. 0 times theorem prover too weak. 1010 trivial. 0 not checked. [2019-01-12 03:37:28,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:37:28,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-01-12 03:37:28,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 03:37:28,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 03:37:28,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-12 03:37:28,711 INFO L87 Difference]: Start difference. First operand 12923 states and 13828 transitions. Second operand 9 states. [2019-01-12 03:37:31,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:37:31,264 INFO L93 Difference]: Finished difference Result 25300 states and 27033 transitions. [2019-01-12 03:37:31,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 03:37:31,265 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 718 [2019-01-12 03:37:31,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:37:31,292 INFO L225 Difference]: With dead ends: 25300 [2019-01-12 03:37:31,292 INFO L226 Difference]: Without dead ends: 13485 [2019-01-12 03:37:31,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 715 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-01-12 03:37:31,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13485 states. [2019-01-12 03:37:31,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13485 to 12923. [2019-01-12 03:37:31,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12923 states. [2019-01-12 03:37:31,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12923 states to 12923 states and 13822 transitions. [2019-01-12 03:37:31,524 INFO L78 Accepts]: Start accepts. Automaton has 12923 states and 13822 transitions. Word has length 718 [2019-01-12 03:37:31,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:37:31,526 INFO L480 AbstractCegarLoop]: Abstraction has 12923 states and 13822 transitions. [2019-01-12 03:37:31,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 03:37:31,526 INFO L276 IsEmpty]: Start isEmpty. Operand 12923 states and 13822 transitions. [2019-01-12 03:37:31,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 861 [2019-01-12 03:37:31,550 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:37:31,551 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-01-12 03:37:31,551 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:37:31,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:37:31,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1612885747, now seen corresponding path program 1 times [2019-01-12 03:37:31,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:37:31,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:37:31,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:37:31,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:37:31,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:37:31,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:37:32,162 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-12 03:37:32,601 WARN L181 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 15 [2019-01-12 03:37:33,104 WARN L181 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2019-01-12 03:37:34,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2469 backedges. 1133 proven. 111 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-01-12 03:37:34,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:37:34,577 INFO L223 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-01-12 03:37:34,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:37:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:37:34,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:37:37,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2469 backedges. 1481 proven. 405 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2019-01-12 03:37:37,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:37:37,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 12 [2019-01-12 03:37:37,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 03:37:37,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 03:37:37,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-01-12 03:37:37,054 INFO L87 Difference]: Start difference. First operand 12923 states and 13822 transitions. Second operand 13 states. [2019-01-12 03:43:01,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:43:01,072 INFO L93 Difference]: Finished difference Result 40603 states and 43401 transitions. [2019-01-12 03:43:01,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-12 03:43:01,074 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 860 [2019-01-12 03:43:01,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:43:01,101 INFO L225 Difference]: With dead ends: 40603 [2019-01-12 03:43:01,101 INFO L226 Difference]: Without dead ends: 28227 [2019-01-12 03:43:01,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 911 GetRequests, 857 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 944 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=642, Invalid=2327, Unknown=1, NotChecked=0, Total=2970 [2019-01-12 03:43:01,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28227 states. [2019-01-12 03:43:01,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28227 to 21212. [2019-01-12 03:43:01,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21212 states. [2019-01-12 03:43:01,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21212 states to 21212 states and 22725 transitions. [2019-01-12 03:43:01,412 INFO L78 Accepts]: Start accepts. Automaton has 21212 states and 22725 transitions. Word has length 860 [2019-01-12 03:43:01,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:43:01,412 INFO L480 AbstractCegarLoop]: Abstraction has 21212 states and 22725 transitions. [2019-01-12 03:43:01,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 03:43:01,412 INFO L276 IsEmpty]: Start isEmpty. Operand 21212 states and 22725 transitions. [2019-01-12 03:43:01,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 907 [2019-01-12 03:43:01,435 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:43:01,436 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 4, 4, 4, 4, 4, 4, 4, 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] [2019-01-12 03:43:01,438 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:43:01,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:43:01,439 INFO L82 PathProgramCache]: Analyzing trace with hash -550943215, now seen corresponding path program 1 times [2019-01-12 03:43:01,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:43:01,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:43:01,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:01,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:01,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:02,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2204 backedges. 862 proven. 0 refuted. 0 times theorem prover too weak. 1342 trivial. 0 not checked. [2019-01-12 03:43:02,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:43:02,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:43:02,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 03:43:02,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 03:43:02,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:43:02,311 INFO L87 Difference]: Start difference. First operand 21212 states and 22725 transitions. Second operand 3 states. [2019-01-12 03:43:03,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:43:03,392 INFO L93 Difference]: Finished difference Result 41866 states and 44797 transitions. [2019-01-12 03:43:03,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 03:43:03,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 906 [2019-01-12 03:43:03,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:43:03,414 INFO L225 Difference]: With dead ends: 41866 [2019-01-12 03:43:03,414 INFO L226 Difference]: Without dead ends: 21578 [2019-01-12 03:43:03,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:43:03,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21578 states. [2019-01-12 03:43:03,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21578 to 18998. [2019-01-12 03:43:03,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18998 states. [2019-01-12 03:43:03,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18998 states to 18998 states and 20294 transitions. [2019-01-12 03:43:03,671 INFO L78 Accepts]: Start accepts. Automaton has 18998 states and 20294 transitions. Word has length 906 [2019-01-12 03:43:03,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:43:03,672 INFO L480 AbstractCegarLoop]: Abstraction has 18998 states and 20294 transitions. [2019-01-12 03:43:03,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 03:43:03,672 INFO L276 IsEmpty]: Start isEmpty. Operand 18998 states and 20294 transitions. [2019-01-12 03:43:03,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1084 [2019-01-12 03:43:03,689 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:43:03,690 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 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, 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-01-12 03:43:03,690 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:43:03,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:43:03,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1186542856, now seen corresponding path program 1 times [2019-01-12 03:43:03,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:43:03,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:43:03,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:03,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:03,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:05,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3567 backedges. 1956 proven. 989 refuted. 0 times theorem prover too weak. 622 trivial. 0 not checked. [2019-01-12 03:43:05,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:43:05,396 INFO L223 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-01-12 03:43:05,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:05,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:43:06,842 INFO L134 CoverageAnalysis]: Checked inductivity of 3567 backedges. 2324 proven. 0 refuted. 0 times theorem prover too weak. 1243 trivial. 0 not checked. [2019-01-12 03:43:06,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 03:43:06,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-01-12 03:43:06,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 03:43:06,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 03:43:06,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-12 03:43:06,862 INFO L87 Difference]: Start difference. First operand 18998 states and 20294 transitions. Second operand 8 states. [2019-01-12 03:43:14,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:43:14,798 INFO L93 Difference]: Finished difference Result 44642 states and 47474 transitions. [2019-01-12 03:43:14,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 03:43:14,799 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1083 [2019-01-12 03:43:14,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:43:14,822 INFO L225 Difference]: With dead ends: 44642 [2019-01-12 03:43:14,822 INFO L226 Difference]: Without dead ends: 24726 [2019-01-12 03:43:14,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1099 GetRequests, 1087 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-01-12 03:43:14,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24726 states. [2019-01-12 03:43:15,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24726 to 15866. [2019-01-12 03:43:15,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15866 states. [2019-01-12 03:43:15,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15866 states to 15866 states and 16829 transitions. [2019-01-12 03:43:15,064 INFO L78 Accepts]: Start accepts. Automaton has 15866 states and 16829 transitions. Word has length 1083 [2019-01-12 03:43:15,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:43:15,065 INFO L480 AbstractCegarLoop]: Abstraction has 15866 states and 16829 transitions. [2019-01-12 03:43:15,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 03:43:15,065 INFO L276 IsEmpty]: Start isEmpty. Operand 15866 states and 16829 transitions. [2019-01-12 03:43:15,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1099 [2019-01-12 03:43:15,083 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:43:15,083 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 4, 4, 4, 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] [2019-01-12 03:43:15,084 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:43:15,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:43:15,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1145857182, now seen corresponding path program 1 times [2019-01-12 03:43:15,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:43:15,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:43:15,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:15,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:15,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:15,891 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2019-01-12 03:43:17,247 INFO L134 CoverageAnalysis]: Checked inductivity of 4393 backedges. 2431 proven. 1267 refuted. 0 times theorem prover too weak. 695 trivial. 0 not checked. [2019-01-12 03:43:17,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:43:17,247 INFO L223 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-01-12 03:43:17,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:17,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:17,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:43:19,450 INFO L134 CoverageAnalysis]: Checked inductivity of 4393 backedges. 3472 proven. 0 refuted. 0 times theorem prover too weak. 921 trivial. 0 not checked. [2019-01-12 03:43:19,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 03:43:19,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2019-01-12 03:43:19,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 03:43:19,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 03:43:19,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2019-01-12 03:43:19,479 INFO L87 Difference]: Start difference. First operand 15866 states and 16829 transitions. Second operand 9 states. [2019-01-12 03:43:24,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:43:24,390 INFO L93 Difference]: Finished difference Result 42789 states and 45353 transitions. [2019-01-12 03:43:24,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 03:43:24,391 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1098 [2019-01-12 03:43:24,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:43:24,414 INFO L225 Difference]: With dead ends: 42789 [2019-01-12 03:43:24,414 INFO L226 Difference]: Without dead ends: 27297 [2019-01-12 03:43:24,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1104 GetRequests, 1096 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2019-01-12 03:43:24,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27297 states. [2019-01-12 03:43:24,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27297 to 18628. [2019-01-12 03:43:24,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18628 states. [2019-01-12 03:43:24,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18628 states to 18628 states and 19751 transitions. [2019-01-12 03:43:24,708 INFO L78 Accepts]: Start accepts. Automaton has 18628 states and 19751 transitions. Word has length 1098 [2019-01-12 03:43:24,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:43:24,708 INFO L480 AbstractCegarLoop]: Abstraction has 18628 states and 19751 transitions. [2019-01-12 03:43:24,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 03:43:24,709 INFO L276 IsEmpty]: Start isEmpty. Operand 18628 states and 19751 transitions. [2019-01-12 03:43:24,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1108 [2019-01-12 03:43:24,725 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:43:24,726 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:43:24,726 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:43:24,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:43:24,728 INFO L82 PathProgramCache]: Analyzing trace with hash 772585210, now seen corresponding path program 1 times [2019-01-12 03:43:24,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:43:24,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:43:24,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:24,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:24,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:25,152 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-12 03:43:26,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4215 backedges. 1650 proven. 45 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2019-01-12 03:43:26,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:43:26,315 INFO L223 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-01-12 03:43:26,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:26,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:43:27,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4215 backedges. 1657 proven. 38 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2019-01-12 03:43:27,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:43:27,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2019-01-12 03:43:27,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 03:43:27,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 03:43:27,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-01-12 03:43:27,835 INFO L87 Difference]: Start difference. First operand 18628 states and 19751 transitions. Second operand 8 states. [2019-01-12 03:43:30,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:43:30,581 INFO L93 Difference]: Finished difference Result 36065 states and 38224 transitions. [2019-01-12 03:43:30,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 03:43:30,582 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1107 [2019-01-12 03:43:30,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:43:30,598 INFO L225 Difference]: With dead ends: 36065 [2019-01-12 03:43:30,598 INFO L226 Difference]: Without dead ends: 20387 [2019-01-12 03:43:30,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1118 GetRequests, 1104 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-12 03:43:30,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20387 states. [2019-01-12 03:43:30,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20387 to 18996. [2019-01-12 03:43:30,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18996 states. [2019-01-12 03:43:30,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18996 states to 18996 states and 20115 transitions. [2019-01-12 03:43:30,879 INFO L78 Accepts]: Start accepts. Automaton has 18996 states and 20115 transitions. Word has length 1107 [2019-01-12 03:43:30,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:43:30,880 INFO L480 AbstractCegarLoop]: Abstraction has 18996 states and 20115 transitions. [2019-01-12 03:43:30,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 03:43:30,880 INFO L276 IsEmpty]: Start isEmpty. Operand 18996 states and 20115 transitions. [2019-01-12 03:43:30,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1127 [2019-01-12 03:43:30,897 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:43:30,898 INFO L402 BasicCegarLoop]: trace histogram [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, 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, 11, 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, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:43:30,898 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:43:30,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:43:30,898 INFO L82 PathProgramCache]: Analyzing trace with hash -33287460, now seen corresponding path program 1 times [2019-01-12 03:43:30,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:43:30,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:43:30,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:30,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:30,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:32,101 WARN L181 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 9 [2019-01-12 03:43:32,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4882 backedges. 2533 proven. 428 refuted. 0 times theorem prover too weak. 1921 trivial. 0 not checked. [2019-01-12 03:43:32,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:43:32,825 INFO L223 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-01-12 03:43:32,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:43:33,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:43:33,414 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 26 [2019-01-12 03:43:35,328 WARN L181 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 213 DAG size of output: 30 [2019-01-12 03:43:37,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4882 backedges. 3211 proven. 90 refuted. 0 times theorem prover too weak. 1581 trivial. 0 not checked. [2019-01-12 03:43:37,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:43:37,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2019-01-12 03:43:37,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 03:43:37,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 03:43:37,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-12 03:43:37,762 INFO L87 Difference]: Start difference. First operand 18996 states and 20115 transitions. Second operand 8 states. [2019-01-12 03:43:59,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:43:59,297 INFO L93 Difference]: Finished difference Result 35598 states and 37652 transitions. [2019-01-12 03:43:59,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 03:43:59,298 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1126 [2019-01-12 03:43:59,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:43:59,315 INFO L225 Difference]: With dead ends: 35598 [2019-01-12 03:43:59,316 INFO L226 Difference]: Without dead ends: 19552 [2019-01-12 03:43:59,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1141 GetRequests, 1130 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-01-12 03:43:59,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19552 states. [2019-01-12 03:43:59,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19552 to 13646. [2019-01-12 03:43:59,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13646 states. [2019-01-12 03:43:59,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13646 states to 13646 states and 14471 transitions. [2019-01-12 03:43:59,660 INFO L78 Accepts]: Start accepts. Automaton has 13646 states and 14471 transitions. Word has length 1126 [2019-01-12 03:43:59,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:43:59,661 INFO L480 AbstractCegarLoop]: Abstraction has 13646 states and 14471 transitions. [2019-01-12 03:43:59,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 03:43:59,661 INFO L276 IsEmpty]: Start isEmpty. Operand 13646 states and 14471 transitions. [2019-01-12 03:43:59,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1286 [2019-01-12 03:43:59,675 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:43:59,676 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 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, 11, 10, 10, 10, 10, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:43:59,676 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:43:59,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:43:59,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1362696592, now seen corresponding path program 1 times [2019-01-12 03:43:59,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:43:59,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:43:59,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:59,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:43:59,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:43:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:44:00,210 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 7 [2019-01-12 03:44:00,796 INFO L134 CoverageAnalysis]: Checked inductivity of 6264 backedges. 3722 proven. 0 refuted. 0 times theorem prover too weak. 2542 trivial. 0 not checked. [2019-01-12 03:44:00,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:44:00,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:44:00,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:44:00,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:44:00,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:44:00,798 INFO L87 Difference]: Start difference. First operand 13646 states and 14471 transitions. Second operand 4 states. [2019-01-12 03:44:02,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:44:02,195 INFO L93 Difference]: Finished difference Result 24900 states and 26401 transitions. [2019-01-12 03:44:02,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:44:02,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1285 [2019-01-12 03:44:02,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:44:02,207 INFO L225 Difference]: With dead ends: 24900 [2019-01-12 03:44:02,207 INFO L226 Difference]: Without dead ends: 14018 [2019-01-12 03:44:02,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:44:02,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14018 states. [2019-01-12 03:44:02,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14018 to 8126. [2019-01-12 03:44:02,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8126 states. [2019-01-12 03:44:02,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8126 states to 8126 states and 8559 transitions. [2019-01-12 03:44:02,353 INFO L78 Accepts]: Start accepts. Automaton has 8126 states and 8559 transitions. Word has length 1285 [2019-01-12 03:44:02,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:44:02,354 INFO L480 AbstractCegarLoop]: Abstraction has 8126 states and 8559 transitions. [2019-01-12 03:44:02,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:44:02,354 INFO L276 IsEmpty]: Start isEmpty. Operand 8126 states and 8559 transitions. [2019-01-12 03:44:02,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1333 [2019-01-12 03:44:02,368 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:44:02,369 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 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, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:44:02,369 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:44:02,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:44:02,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1637180648, now seen corresponding path program 1 times [2019-01-12 03:44:02,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:44:02,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:44:02,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:44:02,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:44:02,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:44:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:44:03,622 INFO L134 CoverageAnalysis]: Checked inductivity of 6394 backedges. 2750 proven. 237 refuted. 0 times theorem prover too weak. 3407 trivial. 0 not checked. [2019-01-12 03:44:03,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:44:03,623 INFO L223 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-01-12 03:44:03,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:44:03,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:44:03,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:44:04,641 INFO L134 CoverageAnalysis]: Checked inductivity of 6394 backedges. 2750 proven. 237 refuted. 0 times theorem prover too weak. 3407 trivial. 0 not checked. [2019-01-12 03:44:04,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:44:04,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2019-01-12 03:44:04,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 03:44:04,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 03:44:04,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:44:04,673 INFO L87 Difference]: Start difference. First operand 8126 states and 8559 transitions. Second operand 5 states. [2019-01-12 03:44:06,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:44:06,955 INFO L93 Difference]: Finished difference Result 19749 states and 20777 transitions. [2019-01-12 03:44:06,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 03:44:06,956 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1332 [2019-01-12 03:44:06,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:44:06,962 INFO L225 Difference]: With dead ends: 19749 [2019-01-12 03:44:06,962 INFO L226 Difference]: Without dead ends: 6824 [2019-01-12 03:44:06,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1335 GetRequests, 1331 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:44:06,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6824 states. [2019-01-12 03:44:07,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6824 to 3512. [2019-01-12 03:44:07,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3512 states. [2019-01-12 03:44:07,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3512 states to 3512 states and 3564 transitions. [2019-01-12 03:44:07,023 INFO L78 Accepts]: Start accepts. Automaton has 3512 states and 3564 transitions. Word has length 1332 [2019-01-12 03:44:07,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:44:07,024 INFO L480 AbstractCegarLoop]: Abstraction has 3512 states and 3564 transitions. [2019-01-12 03:44:07,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 03:44:07,024 INFO L276 IsEmpty]: Start isEmpty. Operand 3512 states and 3564 transitions. [2019-01-12 03:44:07,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1522 [2019-01-12 03:44:07,037 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:44:07,038 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-01-12 03:44:07,038 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:44:07,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:44:07,039 INFO L82 PathProgramCache]: Analyzing trace with hash -845056045, now seen corresponding path program 1 times [2019-01-12 03:44:07,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:44:07,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:44:07,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:44:07,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:44:07,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:44:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:44:07,765 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2019-01-12 03:44:08,655 INFO L134 CoverageAnalysis]: Checked inductivity of 7742 backedges. 4623 proven. 0 refuted. 0 times theorem prover too weak. 3119 trivial. 0 not checked. [2019-01-12 03:44:08,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:44:08,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 03:44:08,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 03:44:08,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 03:44:08,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:44:08,658 INFO L87 Difference]: Start difference. First operand 3512 states and 3564 transitions. Second operand 5 states. [2019-01-12 03:44:10,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:44:10,264 INFO L93 Difference]: Finished difference Result 7756 states and 7875 transitions. [2019-01-12 03:44:10,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 03:44:10,265 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1521 [2019-01-12 03:44:10,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:44:10,270 INFO L225 Difference]: With dead ends: 7756 [2019-01-12 03:44:10,270 INFO L226 Difference]: Without dead ends: 4800 [2019-01-12 03:44:10,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-12 03:44:10,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4800 states. [2019-01-12 03:44:10,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4800 to 3512. [2019-01-12 03:44:10,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3512 states. [2019-01-12 03:44:10,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3512 states to 3512 states and 3564 transitions. [2019-01-12 03:44:10,323 INFO L78 Accepts]: Start accepts. Automaton has 3512 states and 3564 transitions. Word has length 1521 [2019-01-12 03:44:10,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:44:10,324 INFO L480 AbstractCegarLoop]: Abstraction has 3512 states and 3564 transitions. [2019-01-12 03:44:10,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 03:44:10,324 INFO L276 IsEmpty]: Start isEmpty. Operand 3512 states and 3564 transitions. [2019-01-12 03:44:10,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1591 [2019-01-12 03:44:10,338 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:44:10,339 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-01-12 03:44:10,339 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:44:10,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:44:10,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1380787000, now seen corresponding path program 1 times [2019-01-12 03:44:10,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:44:10,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:44:10,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:44:10,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:44:10,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:44:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:44:11,899 INFO L134 CoverageAnalysis]: Checked inductivity of 8104 backedges. 6082 proven. 0 refuted. 0 times theorem prover too weak. 2022 trivial. 0 not checked. [2019-01-12 03:44:11,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:44:11,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 03:44:11,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 03:44:11,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 03:44:11,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:44:11,902 INFO L87 Difference]: Start difference. First operand 3512 states and 3564 transitions. Second operand 5 states. [2019-01-12 03:44:12,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:44:12,958 INFO L93 Difference]: Finished difference Result 5538 states and 5619 transitions. [2019-01-12 03:44:12,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 03:44:12,959 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1590 [2019-01-12 03:44:12,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:44:12,960 INFO L225 Difference]: With dead ends: 5538 [2019-01-12 03:44:12,960 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 03:44:12,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:44:12,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 03:44:12,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 03:44:12,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 03:44:12,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 03:44:12,964 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1590 [2019-01-12 03:44:12,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:44:12,965 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 03:44:12,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 03:44:12,967 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 03:44:12,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 03:44:12,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 03:44:13,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:13,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:13,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:13,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:13,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:13,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:13,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:13,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:13,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:13,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:13,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:13,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:13,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:13,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:13,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:13,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:13,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:14,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:14,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:14,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:14,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:14,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:14,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:14,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:14,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:14,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:14,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:14,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:14,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:14,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:14,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:14,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:14,661 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:14,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:14,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:14,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:15,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:15,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:15,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:15,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:15,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:15,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:15,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:15,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:15,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:15,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:15,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:15,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:15,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:15,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:15,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:15,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:15,678 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:15,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:15,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:15,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:15,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:15,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:16,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:16,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:16,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:16,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:16,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:16,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:16,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:16,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:16,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:16,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:16,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:16,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:17,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:17,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:17,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:17,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:17,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:18,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:18,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:18,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:18,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:18,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:18,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:18,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:18,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:18,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:18,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:18,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:18,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:18,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:18,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:19,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:19,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:19,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:19,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:19,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:19,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:20,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:21,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:21,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:21,973 WARN L181 SmtUtils]: Spent 8.99 s on a formula simplification. DAG size of input: 1975 DAG size of output: 1490 [2019-01-12 03:44:22,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:22,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:22,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:22,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:22,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:22,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:22,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:22,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:22,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:22,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:22,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:22,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:22,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:22,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:22,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:22,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:22,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:22,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:22,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:22,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:22,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:22,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:22,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:22,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:22,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:22,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:22,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:22,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:22,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:22,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:22,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:23,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:23,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:23,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:23,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:23,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:23,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:23,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:23,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:23,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:23,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:23,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:23,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:23,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:23,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:23,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:23,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:23,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:23,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:23,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:23,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:23,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:23,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:23,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:23,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:23,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:23,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:23,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:23,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:24,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:24,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:24,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:24,544 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:24,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:24,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:24,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:24,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:24,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:24,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:24,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:24,910 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:25,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:25,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:25,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:25,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:25,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:25,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:26,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:26,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:26,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:26,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:26,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:26,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:26,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:26,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:26,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:26,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:26,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:26,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:26,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:27,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:27,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:27,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:27,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:27,758 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:27,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:29,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:29,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:44:29,893 WARN L181 SmtUtils]: Spent 7.91 s on a formula simplification. DAG size of input: 1969 DAG size of output: 1486 [2019-01-12 03:45:11,286 WARN L181 SmtUtils]: Spent 41.37 s on a formula simplification. DAG size of input: 1368 DAG size of output: 195 [2019-01-12 03:45:58,080 WARN L181 SmtUtils]: Spent 46.79 s on a formula simplification. DAG size of input: 1364 DAG size of output: 195 [2019-01-12 03:45:58,085 INFO L448 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-01-12 03:45:58,085 INFO L448 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-01-12 03:45:58,085 INFO L448 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-01-12 03:45:58,085 INFO L451 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-01-12 03:45:58,085 INFO L448 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,085 INFO L448 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,085 INFO L448 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,086 INFO L448 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,086 INFO L448 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,086 INFO L448 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,086 INFO L448 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,086 INFO L448 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-01-12 03:45:58,086 INFO L448 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-01-12 03:45:58,086 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-01-12 03:45:58,086 INFO L448 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,086 INFO L448 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,086 INFO L448 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,086 INFO L448 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,086 INFO L448 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,087 INFO L448 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,087 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,087 INFO L448 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,087 INFO L448 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,087 INFO L448 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-01-12 03:45:58,087 INFO L448 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-01-12 03:45:58,087 INFO L448 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-01-12 03:45:58,087 INFO L448 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,088 INFO L444 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse30 (= ~a25~0 13)) (.cse32 (+ ~a23~0 43))) (let ((.cse22 (= ~a25~0 11)) (.cse1 (< 0 .cse32)) (.cse9 (not .cse30)) (.cse2 (= ~a4~0 1))) (let ((.cse14 (= ~a25~0 12)) (.cse25 (< 140 ~a29~0)) (.cse29 (and .cse1 .cse9 .cse2)) (.cse17 (not .cse22)) (.cse11 (< 245 ~a29~0))) (let ((.cse5 (<= .cse32 0)) (.cse12 (or (and .cse29 .cse11) (and .cse17 .cse9 .cse11))) (.cse19 (<= ~a23~0 599997)) (.cse13 (exists ((v_prenex_13 Int)) (and (<= 0 v_prenex_13) (<= 312 v_prenex_13) (<= ~a23~0 (+ (mod v_prenex_13 299846) 300155))))) (.cse27 (not (= ULTIMATE.start_calculate_output_~input 1))) (.cse20 (= 15 ~a8~0)) (.cse21 (= 1 ~a4~0)) (.cse26 (<= ~a23~0 312)) (.cse10 (<= ~a29~0 140)) (.cse8 (<= ~a4~0 0)) (.cse7 (<= ~a29~0 130)) (.cse23 (exists ((v_~a29~0_504 Int)) (let ((.cse31 (mod (+ v_~a29~0_504 26) 52))) (and (< (+ v_~a29~0_504 370578) 0) (<= (+ .cse31 140) ~a29~0) (not (= .cse31 0)))))) (.cse28 (<= ~a29~0 277)) (.cse4 (= ~a25~0 10)) (.cse6 (= ~a25~0 9)) (.cse0 (= ~a8~0 15)) (.cse16 (or (and .cse14 (not .cse2)) .cse25)) (.cse18 (<= ~a29~0 245)) (.cse3 (= ~a3~0 1)) (.cse24 (<= 312 ~a23~0))) (or (and (and .cse0 (and .cse1 .cse2) .cse3) (<= ~a23~0 306)) (and .cse2 .cse4 .cse5) (and (and .cse6 (and .cse0 (and .cse7 .cse5))) .cse3) (and (<= (+ ~a23~0 307) 0) (and (and (and .cse8 (and .cse0 (and (not .cse6) .cse9))) .cse3) .cse10)) (and (and (or (and .cse0 .cse2 .cse4 .cse11) (and .cse2 (and .cse6 .cse0 .cse12))) .cse3) .cse13) (and .cse3 (let ((.cse15 (or (and .cse17 .cse9 .cse2 .cse5) (and .cse17 .cse2 .cse18 .cse5)))) (or (and .cse14 .cse0 .cse15) (and .cse0 .cse16 .cse15)))) (and .cse19 (or (and .cse20 .cse21 .cse22 .cse23 .cse3 .cse24) (and (and .cse0 (and .cse25 .cse14 .cse2)) .cse3 .cse24)) .cse18) (and (and (and (and .cse14 .cse26) .cse27 (<= ~a29~0 220) .cse3) .cse23) .cse20 .cse21) (and (and .cse8 (and .cse6 .cse0 (<= 10250 ~a29~0) .cse5)) .cse3) (and .cse0 .cse8 (and .cse11 (and .cse14 .cse28)) .cse3) (and (and .cse6 (and .cse0 .cse11 (and .cse29 .cse28))) .cse3) (and .cse19 (and (and .cse30 .cse1) (= 1 ~a3~0) .cse20 .cse21)) (and (and (and (and .cse14 .cse0 .cse8) .cse3) .cse23) .cse18 .cse5) (and (and (and .cse13 .cse3 .cse12) .cse20) .cse22) (and .cse19 (or (and .cse14 .cse0 .cse2 .cse27 .cse7 .cse3 .cse24) (and .cse4 .cse20 .cse21 .cse3))) (and (and .cse13 .cse27 .cse28 (and .cse14 .cse11) .cse3) .cse20 .cse21) (and .cse0 (and .cse30 .cse16 .cse2 .cse18) .cse3) (and (and .cse3 (and (and .cse26 .cse1 .cse2) .cse6 .cse0)) .cse10) (and (and .cse14 .cse0 .cse8 (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse7 .cse3) (exists ((v_prenex_18 Int) (v_prenex_17 Int)) (and (<= 0 v_prenex_18) (<= v_prenex_17 (+ (mod v_prenex_18 299846) 300155)) (not (= 0 (mod (+ v_prenex_17 4) 5))) (<= 312 v_prenex_18) (< v_prenex_17 600276) (<= ~a23~0 (+ (div (+ v_prenex_17 (- 600276)) 5) 1))))) (or (and .cse23 (and .cse0 (and .cse2 .cse28 .cse4) .cse3)) (and (and .cse6 .cse0 .cse2 .cse16 .cse18) .cse3 .cse24))))))) [2019-01-12 03:45:58,088 INFO L448 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,088 INFO L448 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,088 INFO L448 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,088 INFO L448 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,088 INFO L448 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,088 INFO L448 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,089 INFO L448 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,089 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,089 INFO L448 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-01-12 03:45:58,089 INFO L448 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-01-12 03:45:58,089 INFO L448 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-01-12 03:45:58,089 INFO L448 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-01-12 03:45:58,089 INFO L448 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-01-12 03:45:58,089 INFO L448 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-01-12 03:45:58,089 INFO L448 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-01-12 03:45:58,089 INFO L448 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,089 INFO L448 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,089 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,090 INFO L448 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,090 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,090 INFO L448 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,090 INFO L448 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,090 INFO L448 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,090 INFO L448 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,090 INFO L448 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,090 INFO L448 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-01-12 03:45:58,090 INFO L448 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-01-12 03:45:58,090 INFO L448 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-01-12 03:45:58,090 INFO L448 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-01-12 03:45:58,090 INFO L448 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,091 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,091 INFO L448 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,091 INFO L448 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,091 INFO L448 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,091 INFO L448 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-01-12 03:45:58,091 INFO L448 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-01-12 03:45:58,091 INFO L448 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-01-12 03:45:58,091 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,091 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,091 INFO L448 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,092 INFO L448 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,092 INFO L448 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-01-12 03:45:58,092 INFO L448 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-01-12 03:45:58,092 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,092 INFO L448 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,092 INFO L448 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,092 INFO L448 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,092 INFO L448 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,092 INFO L448 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,092 INFO L448 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-01-12 03:45:58,093 INFO L448 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-01-12 03:45:58,093 INFO L448 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,093 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,093 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-01-12 03:45:58,093 INFO L448 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-01-12 03:45:58,093 INFO L448 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-01-12 03:45:58,093 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,093 INFO L448 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,093 INFO L448 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,093 INFO L448 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,093 INFO L448 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,093 INFO L448 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,094 INFO L448 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,094 INFO L448 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-01-12 03:45:58,094 INFO L448 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-01-12 03:45:58,094 INFO L448 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-01-12 03:45:58,094 INFO L448 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-01-12 03:45:58,094 INFO L448 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-01-12 03:45:58,094 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-01-12 03:45:58,094 INFO L448 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-01-12 03:45:58,094 INFO L448 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,094 INFO L448 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,094 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 03:45:58,094 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-01-12 03:45:58,094 INFO L448 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-01-12 03:45:58,095 INFO L448 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,095 INFO L448 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,095 INFO L448 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,095 INFO L448 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,095 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,095 INFO L448 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-01-12 03:45:58,095 INFO L448 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-01-12 03:45:58,095 INFO L448 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-01-12 03:45:58,095 INFO L448 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,095 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,095 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,096 INFO L448 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,096 INFO L448 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,096 INFO L448 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,096 INFO L448 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-01-12 03:45:58,096 INFO L448 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-01-12 03:45:58,096 INFO L448 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-01-12 03:45:58,096 INFO L448 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,096 INFO L448 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,096 INFO L448 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,096 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,096 INFO L448 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,097 INFO L448 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,097 INFO L448 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,097 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 03:45:58,097 INFO L448 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,097 INFO L448 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-01-12 03:45:58,097 INFO L448 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-01-12 03:45:58,097 INFO L448 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-01-12 03:45:58,097 INFO L448 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,097 INFO L448 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,097 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,097 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,098 INFO L448 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,098 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,098 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,098 INFO L448 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,098 INFO L448 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,098 INFO L448 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,098 INFO L448 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,098 INFO L448 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-01-12 03:45:58,098 INFO L448 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-01-12 03:45:58,098 INFO L448 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-01-12 03:45:58,098 INFO L448 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-01-12 03:45:58,099 INFO L448 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-01-12 03:45:58,099 INFO L448 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,099 INFO L448 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,099 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,099 INFO L448 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,099 INFO L448 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,099 INFO L448 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,099 INFO L448 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,099 INFO L448 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-01-12 03:45:58,099 INFO L448 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-01-12 03:45:58,099 INFO L448 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-01-12 03:45:58,100 INFO L448 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,100 INFO L448 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,100 INFO L448 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,100 INFO L448 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-01-12 03:45:58,100 INFO L448 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-01-12 03:45:58,100 INFO L448 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,100 INFO L448 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,100 INFO L448 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,100 INFO L448 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,100 INFO L448 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,100 INFO L448 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-01-12 03:45:58,100 INFO L448 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-01-12 03:45:58,101 INFO L448 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,101 INFO L448 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,101 INFO L448 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-01-12 03:45:58,101 INFO L448 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-01-12 03:45:58,101 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,101 INFO L448 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,101 INFO L448 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,101 INFO L448 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,101 INFO L448 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,101 INFO L448 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,101 INFO L448 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-01-12 03:45:58,101 INFO L448 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-01-12 03:45:58,101 INFO L448 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-01-12 03:45:58,102 INFO L448 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-01-12 03:45:58,102 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,102 INFO L448 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,102 INFO L448 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,102 INFO L448 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,102 INFO L448 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,102 INFO L448 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,102 INFO L448 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,102 INFO L448 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,102 INFO L448 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-01-12 03:45:58,102 INFO L448 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-01-12 03:45:58,102 INFO L448 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-01-12 03:45:58,102 INFO L448 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-01-12 03:45:58,103 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-01-12 03:45:58,103 INFO L448 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-01-12 03:45:58,103 INFO L448 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,103 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,103 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,103 INFO L448 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,103 INFO L448 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,103 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,103 INFO L448 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,103 INFO L448 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-01-12 03:45:58,103 INFO L448 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-01-12 03:45:58,104 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2019-01-12 03:45:58,104 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 03:45:58,104 INFO L448 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,104 INFO L448 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,104 INFO L448 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,104 INFO L448 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,104 INFO L448 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,104 INFO L448 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,104 INFO L448 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-01-12 03:45:58,104 INFO L448 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-01-12 03:45:58,104 INFO L448 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,104 INFO L448 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,105 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,105 INFO L448 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,105 INFO L448 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,105 INFO L448 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,105 INFO L448 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,105 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-01-12 03:45:58,105 INFO L448 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,105 INFO L448 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,105 INFO L448 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,105 INFO L448 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-01-12 03:45:58,105 INFO L448 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-01-12 03:45:58,105 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-01-12 03:45:58,105 INFO L448 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,106 INFO L448 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-01-12 03:45:58,106 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,106 INFO L448 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-01-12 03:45:58,106 INFO L448 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,106 INFO L448 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,106 INFO L448 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,106 INFO L448 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,106 INFO L448 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,106 INFO L448 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,106 INFO L448 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-01-12 03:45:58,106 INFO L448 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-01-12 03:45:58,106 INFO L448 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-01-12 03:45:58,107 INFO L448 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,107 INFO L448 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,107 INFO L448 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,107 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 03:45:58,107 INFO L448 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,107 INFO L448 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,107 INFO L448 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,107 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,107 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,107 INFO L448 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,107 INFO L448 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,107 INFO L448 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-01-12 03:45:58,108 INFO L448 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-01-12 03:45:58,108 INFO L448 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-01-12 03:45:58,108 INFO L448 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,108 INFO L448 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-01-12 03:45:58,108 INFO L448 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-01-12 03:45:58,108 INFO L448 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,108 INFO L448 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,108 INFO L448 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,108 INFO L448 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,108 INFO L448 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,108 INFO L448 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,108 INFO L448 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-01-12 03:45:58,109 INFO L448 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-01-12 03:45:58,109 INFO L448 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-01-12 03:45:58,109 INFO L448 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,109 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,109 INFO L448 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,110 INFO L444 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse30 (= ~a25~0 13)) (.cse32 (+ ~a23~0 43))) (let ((.cse22 (= ~a25~0 11)) (.cse1 (< 0 .cse32)) (.cse9 (not .cse30)) (.cse2 (= ~a4~0 1))) (let ((.cse14 (= ~a25~0 12)) (.cse25 (< 140 ~a29~0)) (.cse29 (and .cse1 .cse9 .cse2)) (.cse17 (not .cse22)) (.cse11 (< 245 ~a29~0))) (let ((.cse5 (<= .cse32 0)) (.cse12 (or (and .cse29 .cse11) (and .cse17 .cse9 .cse11))) (.cse19 (<= ~a23~0 599997)) (.cse13 (exists ((v_prenex_13 Int)) (and (<= 0 v_prenex_13) (<= 312 v_prenex_13) (<= ~a23~0 (+ (mod v_prenex_13 299846) 300155))))) (.cse27 (not (= ULTIMATE.start_calculate_output_~input 1))) (.cse20 (= 15 ~a8~0)) (.cse21 (= 1 ~a4~0)) (.cse26 (<= ~a23~0 312)) (.cse10 (<= ~a29~0 140)) (.cse8 (<= ~a4~0 0)) (.cse7 (<= ~a29~0 130)) (.cse23 (exists ((v_~a29~0_504 Int)) (let ((.cse31 (mod (+ v_~a29~0_504 26) 52))) (and (< (+ v_~a29~0_504 370578) 0) (<= (+ .cse31 140) ~a29~0) (not (= .cse31 0)))))) (.cse28 (<= ~a29~0 277)) (.cse4 (= ~a25~0 10)) (.cse6 (= ~a25~0 9)) (.cse0 (= ~a8~0 15)) (.cse16 (or (and .cse14 (not .cse2)) .cse25)) (.cse18 (<= ~a29~0 245)) (.cse3 (= ~a3~0 1)) (.cse24 (<= 312 ~a23~0))) (or (and (and .cse0 (and .cse1 .cse2) .cse3) (<= ~a23~0 306)) (and .cse2 .cse4 .cse5) (and (and .cse6 (and .cse0 (and .cse7 .cse5))) .cse3) (and (<= (+ ~a23~0 307) 0) (and (and (and .cse8 (and .cse0 (and (not .cse6) .cse9))) .cse3) .cse10)) (and (and (or (and .cse0 .cse2 .cse4 .cse11) (and .cse2 (and .cse6 .cse0 .cse12))) .cse3) .cse13) (and .cse3 (let ((.cse15 (or (and .cse17 .cse9 .cse2 .cse5) (and .cse17 .cse2 .cse18 .cse5)))) (or (and .cse14 .cse0 .cse15) (and .cse0 .cse16 .cse15)))) (and .cse19 (or (and .cse20 .cse21 .cse22 .cse23 .cse3 .cse24) (and (and .cse0 (and .cse25 .cse14 .cse2)) .cse3 .cse24)) .cse18) (and (and (and (and .cse14 .cse26) .cse27 (<= ~a29~0 220) .cse3) .cse23) .cse20 .cse21) (and (and .cse8 (and .cse6 .cse0 (<= 10250 ~a29~0) .cse5)) .cse3) (and .cse0 .cse8 (and .cse11 (and .cse14 .cse28)) .cse3) (and (and .cse6 (and .cse0 .cse11 (and .cse29 .cse28))) .cse3) (and .cse19 (and (and .cse30 .cse1) (= 1 ~a3~0) .cse20 .cse21)) (and (and (and (and .cse14 .cse0 .cse8) .cse3) .cse23) .cse18 .cse5) (and (and (and .cse13 .cse3 .cse12) .cse20) .cse22) (and .cse19 (or (and .cse14 .cse0 .cse2 .cse27 .cse7 .cse3 .cse24) (and .cse4 .cse20 .cse21 .cse3))) (and (and .cse13 .cse27 .cse28 (and .cse14 .cse11) .cse3) .cse20 .cse21) (and .cse0 (and .cse30 .cse16 .cse2 .cse18) .cse3) (and (and .cse3 (and (and .cse26 .cse1 .cse2) .cse6 .cse0)) .cse10) (and (and .cse14 .cse0 .cse8 (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse7 .cse3) (exists ((v_prenex_18 Int) (v_prenex_17 Int)) (and (<= 0 v_prenex_18) (<= v_prenex_17 (+ (mod v_prenex_18 299846) 300155)) (not (= 0 (mod (+ v_prenex_17 4) 5))) (<= 312 v_prenex_18) (< v_prenex_17 600276) (<= ~a23~0 (+ (div (+ v_prenex_17 (- 600276)) 5) 1))))) (or (and .cse23 (and .cse0 (and .cse2 .cse28 .cse4) .cse3)) (and (and .cse6 .cse0 .cse2 .cse16 .cse18) .cse3 .cse24))))))) [2019-01-12 03:45:58,110 INFO L448 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,110 INFO L448 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-01-12 03:45:58,110 INFO L448 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-01-12 03:45:58,110 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,110 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,110 INFO L448 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-01-12 03:45:58,110 INFO L448 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,110 INFO L448 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,111 INFO L448 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-01-12 03:45:58,124 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,125 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,125 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,126 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,126 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,126 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,127 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,127 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,127 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,128 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,128 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,129 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,129 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,129 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,129 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,130 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,130 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,130 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,131 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2019-01-12 03:45:58,131 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 03:45:58,131 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2019-01-12 03:45:58,131 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 03:45:58,132 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2019-01-12 03:45:58,132 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 03:45:58,132 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 03:45:58,132 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,132 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,133 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,146 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,146 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,146 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,147 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,147 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,147 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,148 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,148 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,148 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,149 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,149 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,149 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,149 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,150 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,150 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,150 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,150 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,151 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,151 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2019-01-12 03:45:58,151 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 03:45:58,151 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2019-01-12 03:45:58,152 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 03:45:58,152 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2019-01-12 03:45:58,152 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 03:45:58,152 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 03:45:58,152 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,152 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,153 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,158 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,158 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,159 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,159 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,159 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,160 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,160 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,160 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,161 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,161 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,161 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,162 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,162 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,162 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,162 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,163 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,163 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,163 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2019-01-12 03:45:58,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 03:45:58,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2019-01-12 03:45:58,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 03:45:58,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2019-01-12 03:45:58,165 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 03:45:58,165 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 03:45:58,165 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,165 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,165 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,169 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,170 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,170 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,170 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,170 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,171 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,171 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,171 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,172 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,172 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,172 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,173 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,173 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,173 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,173 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,174 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,174 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,174 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,174 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2019-01-12 03:45:58,175 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 03:45:58,175 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2019-01-12 03:45:58,175 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 03:45:58,175 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2019-01-12 03:45:58,175 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 03:45:58,175 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 03:45:58,176 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,176 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,176 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:45:58 BoogieIcfgContainer [2019-01-12 03:45:58,181 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 03:45:58,182 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 03:45:58,182 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 03:45:58,182 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 03:45:58,182 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:36:22" (3/4) ... [2019-01-12 03:45:58,189 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 03:45:58,247 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 03:45:58,251 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 03:45:58,319 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((a8 == 15 && 0 < a23 + 43 && a4 == 1) && a3 == 1) && a23 <= 306) || ((a4 == 1 && a25 == 10) && a23 + 43 <= 0)) || ((a25 == 9 && a8 == 15 && a29 <= 130 && a23 + 43 <= 0) && a3 == 1)) || (a23 + 307 <= 0 && ((a4 <= 0 && a8 == 15 && !(a25 == 9) && !(a25 == 13)) && a3 == 1) && a29 <= 140)) || ((((((a8 == 15 && a4 == 1) && a25 == 10) && 245 < a29) || (a4 == 1 && (a25 == 9 && a8 == 15) && ((((0 < a23 + 43 && !(a25 == 13)) && a4 == 1) && 245 < a29) || ((!(a25 == 11) && !(a25 == 13)) && 245 < a29)))) && a3 == 1) && (\exists v_prenex_13 : int :: (0 <= v_prenex_13 && 312 <= v_prenex_13) && a23 <= v_prenex_13 % 299846 + 300155))) || (a3 == 1 && (((a25 == 12 && a8 == 15) && ((((!(a25 == 11) && !(a25 == 13)) && a4 == 1) && a23 + 43 <= 0) || (((!(a25 == 11) && a4 == 1) && a29 <= 245) && a23 + 43 <= 0))) || ((a8 == 15 && ((a25 == 12 && !(a4 == 1)) || 140 < a29)) && ((((!(a25 == 11) && !(a25 == 13)) && a4 == 1) && a23 + 43 <= 0) || (((!(a25 == 11) && a4 == 1) && a29 <= 245) && a23 + 43 <= 0)))))) || ((a23 <= 599997 && ((((((15 == a8 && 1 == a4) && a25 == 11) && (\exists v_~a29~0_504 : int :: (v_~a29~0_504 + 370578 < 0 && (v_~a29~0_504 + 26) % 52 + 140 <= a29) && !((v_~a29~0_504 + 26) % 52 == 0))) && a3 == 1) && 312 <= a23) || (((a8 == 15 && (140 < a29 && a25 == 12) && a4 == 1) && a3 == 1) && 312 <= a23))) && a29 <= 245)) || (((((((a25 == 12 && a23 <= 312) && !(input == 1)) && a29 <= 220) && a3 == 1) && (\exists v_~a29~0_504 : int :: (v_~a29~0_504 + 370578 < 0 && (v_~a29~0_504 + 26) % 52 + 140 <= a29) && !((v_~a29~0_504 + 26) % 52 == 0))) && 15 == a8) && 1 == a4)) || ((a4 <= 0 && ((a25 == 9 && a8 == 15) && 10250 <= a29) && a23 + 43 <= 0) && a3 == 1)) || (((a8 == 15 && a4 <= 0) && 245 < a29 && a25 == 12 && a29 <= 277) && a3 == 1)) || ((a25 == 9 && (a8 == 15 && 245 < a29) && ((0 < a23 + 43 && !(a25 == 13)) && a4 == 1) && a29 <= 277) && a3 == 1)) || (a23 <= 599997 && (((a25 == 13 && 0 < a23 + 43) && 1 == a3) && 15 == a8) && 1 == a4)) || ((((((a25 == 12 && a8 == 15) && a4 <= 0) && a3 == 1) && (\exists v_~a29~0_504 : int :: (v_~a29~0_504 + 370578 < 0 && (v_~a29~0_504 + 26) % 52 + 140 <= a29) && !((v_~a29~0_504 + 26) % 52 == 0))) && a29 <= 245) && a23 + 43 <= 0)) || (((((\exists v_prenex_13 : int :: (0 <= v_prenex_13 && 312 <= v_prenex_13) && a23 <= v_prenex_13 % 299846 + 300155) && a3 == 1) && ((((0 < a23 + 43 && !(a25 == 13)) && a4 == 1) && 245 < a29) || ((!(a25 == 11) && !(a25 == 13)) && 245 < a29))) && 15 == a8) && a25 == 11)) || (a23 <= 599997 && (((((((a25 == 12 && a8 == 15) && a4 == 1) && !(input == 1)) && a29 <= 130) && a3 == 1) && 312 <= a23) || (((a25 == 10 && 15 == a8) && 1 == a4) && a3 == 1)))) || (((((((\exists v_prenex_13 : int :: (0 <= v_prenex_13 && 312 <= v_prenex_13) && a23 <= v_prenex_13 % 299846 + 300155) && !(input == 1)) && a29 <= 277) && a25 == 12 && 245 < a29) && a3 == 1) && 15 == a8) && 1 == a4)) || ((a8 == 15 && ((a25 == 13 && ((a25 == 12 && !(a4 == 1)) || 140 < a29)) && a4 == 1) && a29 <= 245) && a3 == 1)) || ((a3 == 1 && (((a23 <= 312 && 0 < a23 + 43) && a4 == 1) && a25 == 9) && a8 == 15) && a29 <= 140)) || ((((((a25 == 12 && a8 == 15) && a4 <= 0) && !(3 == input)) && a29 <= 130) && a3 == 1) && (\exists v_prenex_18 : int, v_prenex_17 : int :: ((((0 <= v_prenex_18 && v_prenex_17 <= v_prenex_18 % 299846 + 300155) && !(0 == (v_prenex_17 + 4) % 5)) && 312 <= v_prenex_18) && v_prenex_17 < 600276) && a23 <= (v_prenex_17 + -600276) / 5 + 1))) || ((\exists v_~a29~0_504 : int :: (v_~a29~0_504 + 370578 < 0 && (v_~a29~0_504 + 26) % 52 + 140 <= a29) && !((v_~a29~0_504 + 26) % 52 == 0)) && (a8 == 15 && (a4 == 1 && a29 <= 277) && a25 == 10) && a3 == 1) || ((((((a25 == 9 && a8 == 15) && a4 == 1) && ((a25 == 12 && !(a4 == 1)) || 140 < a29)) && a29 <= 245) && a3 == 1) && 312 <= a23) [2019-01-12 03:45:58,325 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((a8 == 15 && 0 < a23 + 43 && a4 == 1) && a3 == 1) && a23 <= 306) || ((a4 == 1 && a25 == 10) && a23 + 43 <= 0)) || ((a25 == 9 && a8 == 15 && a29 <= 130 && a23 + 43 <= 0) && a3 == 1)) || (a23 + 307 <= 0 && ((a4 <= 0 && a8 == 15 && !(a25 == 9) && !(a25 == 13)) && a3 == 1) && a29 <= 140)) || ((((((a8 == 15 && a4 == 1) && a25 == 10) && 245 < a29) || (a4 == 1 && (a25 == 9 && a8 == 15) && ((((0 < a23 + 43 && !(a25 == 13)) && a4 == 1) && 245 < a29) || ((!(a25 == 11) && !(a25 == 13)) && 245 < a29)))) && a3 == 1) && (\exists v_prenex_13 : int :: (0 <= v_prenex_13 && 312 <= v_prenex_13) && a23 <= v_prenex_13 % 299846 + 300155))) || (a3 == 1 && (((a25 == 12 && a8 == 15) && ((((!(a25 == 11) && !(a25 == 13)) && a4 == 1) && a23 + 43 <= 0) || (((!(a25 == 11) && a4 == 1) && a29 <= 245) && a23 + 43 <= 0))) || ((a8 == 15 && ((a25 == 12 && !(a4 == 1)) || 140 < a29)) && ((((!(a25 == 11) && !(a25 == 13)) && a4 == 1) && a23 + 43 <= 0) || (((!(a25 == 11) && a4 == 1) && a29 <= 245) && a23 + 43 <= 0)))))) || ((a23 <= 599997 && ((((((15 == a8 && 1 == a4) && a25 == 11) && (\exists v_~a29~0_504 : int :: (v_~a29~0_504 + 370578 < 0 && (v_~a29~0_504 + 26) % 52 + 140 <= a29) && !((v_~a29~0_504 + 26) % 52 == 0))) && a3 == 1) && 312 <= a23) || (((a8 == 15 && (140 < a29 && a25 == 12) && a4 == 1) && a3 == 1) && 312 <= a23))) && a29 <= 245)) || (((((((a25 == 12 && a23 <= 312) && !(input == 1)) && a29 <= 220) && a3 == 1) && (\exists v_~a29~0_504 : int :: (v_~a29~0_504 + 370578 < 0 && (v_~a29~0_504 + 26) % 52 + 140 <= a29) && !((v_~a29~0_504 + 26) % 52 == 0))) && 15 == a8) && 1 == a4)) || ((a4 <= 0 && ((a25 == 9 && a8 == 15) && 10250 <= a29) && a23 + 43 <= 0) && a3 == 1)) || (((a8 == 15 && a4 <= 0) && 245 < a29 && a25 == 12 && a29 <= 277) && a3 == 1)) || ((a25 == 9 && (a8 == 15 && 245 < a29) && ((0 < a23 + 43 && !(a25 == 13)) && a4 == 1) && a29 <= 277) && a3 == 1)) || (a23 <= 599997 && (((a25 == 13 && 0 < a23 + 43) && 1 == a3) && 15 == a8) && 1 == a4)) || ((((((a25 == 12 && a8 == 15) && a4 <= 0) && a3 == 1) && (\exists v_~a29~0_504 : int :: (v_~a29~0_504 + 370578 < 0 && (v_~a29~0_504 + 26) % 52 + 140 <= a29) && !((v_~a29~0_504 + 26) % 52 == 0))) && a29 <= 245) && a23 + 43 <= 0)) || (((((\exists v_prenex_13 : int :: (0 <= v_prenex_13 && 312 <= v_prenex_13) && a23 <= v_prenex_13 % 299846 + 300155) && a3 == 1) && ((((0 < a23 + 43 && !(a25 == 13)) && a4 == 1) && 245 < a29) || ((!(a25 == 11) && !(a25 == 13)) && 245 < a29))) && 15 == a8) && a25 == 11)) || (a23 <= 599997 && (((((((a25 == 12 && a8 == 15) && a4 == 1) && !(input == 1)) && a29 <= 130) && a3 == 1) && 312 <= a23) || (((a25 == 10 && 15 == a8) && 1 == a4) && a3 == 1)))) || (((((((\exists v_prenex_13 : int :: (0 <= v_prenex_13 && 312 <= v_prenex_13) && a23 <= v_prenex_13 % 299846 + 300155) && !(input == 1)) && a29 <= 277) && a25 == 12 && 245 < a29) && a3 == 1) && 15 == a8) && 1 == a4)) || ((a8 == 15 && ((a25 == 13 && ((a25 == 12 && !(a4 == 1)) || 140 < a29)) && a4 == 1) && a29 <= 245) && a3 == 1)) || ((a3 == 1 && (((a23 <= 312 && 0 < a23 + 43) && a4 == 1) && a25 == 9) && a8 == 15) && a29 <= 140)) || ((((((a25 == 12 && a8 == 15) && a4 <= 0) && !(3 == input)) && a29 <= 130) && a3 == 1) && (\exists v_prenex_18 : int, v_prenex_17 : int :: ((((0 <= v_prenex_18 && v_prenex_17 <= v_prenex_18 % 299846 + 300155) && !(0 == (v_prenex_17 + 4) % 5)) && 312 <= v_prenex_18) && v_prenex_17 < 600276) && a23 <= (v_prenex_17 + -600276) / 5 + 1))) || ((\exists v_~a29~0_504 : int :: (v_~a29~0_504 + 370578 < 0 && (v_~a29~0_504 + 26) % 52 + 140 <= a29) && !((v_~a29~0_504 + 26) % 52 == 0)) && (a8 == 15 && (a4 == 1 && a29 <= 277) && a25 == 10) && a3 == 1) || ((((((a25 == 9 && a8 == 15) && a4 == 1) && ((a25 == 12 && !(a4 == 1)) || 140 < a29)) && a29 <= 245) && a3 == 1) && 312 <= a23) [2019-01-12 03:45:58,516 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 03:45:58,517 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 03:45:58,518 INFO L168 Benchmark]: Toolchain (without parser) took 580917.90 ms. Allocated memory was 1.0 GB in the beginning and 4.2 GB in the end (delta: 3.2 GB). Free memory was 948.7 MB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2019-01-12 03:45:58,518 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 03:45:58,518 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1164.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -152.6 MB). Peak memory consumption was 83.6 MB. Max. memory is 11.5 GB. [2019-01-12 03:45:58,519 INFO L168 Benchmark]: Boogie Procedure Inliner took 229.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-01-12 03:45:58,519 INFO L168 Benchmark]: Boogie Preprocessor took 172.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2019-01-12 03:45:58,519 INFO L168 Benchmark]: RCFGBuilder took 3813.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 897.6 MB in the end (delta: 174.4 MB). Peak memory consumption was 174.4 MB. Max. memory is 11.5 GB. [2019-01-12 03:45:58,520 INFO L168 Benchmark]: TraceAbstraction took 575197.56 ms. Allocated memory was 1.1 GB in the beginning and 4.2 GB in the end (delta: 3.1 GB). Free memory was 897.6 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. [2019-01-12 03:45:58,520 INFO L168 Benchmark]: Witness Printer took 334.97 ms. Allocated memory is still 4.2 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 68.1 MB). Peak memory consumption was 68.1 MB. Max. memory is 11.5 GB. [2019-01-12 03:45:58,523 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1164.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -152.6 MB). Peak memory consumption was 83.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 229.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 172.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3813.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 897.6 MB in the end (delta: 174.4 MB). Peak memory consumption was 174.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 575197.56 ms. Allocated memory was 1.1 GB in the beginning and 4.2 GB in the end (delta: 3.1 GB). Free memory was 897.6 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. * Witness Printer took 334.97 ms. Allocated memory is still 4.2 GB. Free memory was 2.0 GB in the beginning and 2.0 GB in the end (delta: 68.1 MB). Peak memory consumption was 68.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 189]: 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: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant [2019-01-12 03:45:58,532 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,532 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,532 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,533 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,533 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,533 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,534 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,541 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,541 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,542 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,542 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,542 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,542 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,542 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,543 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,543 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,543 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,543 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,544 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2019-01-12 03:45:58,545 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 03:45:58,545 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2019-01-12 03:45:58,545 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 03:45:58,545 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2019-01-12 03:45:58,545 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 03:45:58,546 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 03:45:58,546 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,546 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,546 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,553 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,553 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,553 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,554 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,554 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,554 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,554 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,555 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,555 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,555 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,555 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,555 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,556 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,556 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,556 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,556 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,556 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2019-01-12 03:45:58,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 03:45:58,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2019-01-12 03:45:58,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 03:45:58,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2019-01-12 03:45:58,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 03:45:58,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 03:45:58,558 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,558 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,558 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((a8 == 15 && 0 < a23 + 43 && a4 == 1) && a3 == 1) && a23 <= 306) || ((a4 == 1 && a25 == 10) && a23 + 43 <= 0)) || ((a25 == 9 && a8 == 15 && a29 <= 130 && a23 + 43 <= 0) && a3 == 1)) || (a23 + 307 <= 0 && ((a4 <= 0 && a8 == 15 && !(a25 == 9) && !(a25 == 13)) && a3 == 1) && a29 <= 140)) || ((((((a8 == 15 && a4 == 1) && a25 == 10) && 245 < a29) || (a4 == 1 && (a25 == 9 && a8 == 15) && ((((0 < a23 + 43 && !(a25 == 13)) && a4 == 1) && 245 < a29) || ((!(a25 == 11) && !(a25 == 13)) && 245 < a29)))) && a3 == 1) && (\exists v_prenex_13 : int :: (0 <= v_prenex_13 && 312 <= v_prenex_13) && a23 <= v_prenex_13 % 299846 + 300155))) || (a3 == 1 && (((a25 == 12 && a8 == 15) && ((((!(a25 == 11) && !(a25 == 13)) && a4 == 1) && a23 + 43 <= 0) || (((!(a25 == 11) && a4 == 1) && a29 <= 245) && a23 + 43 <= 0))) || ((a8 == 15 && ((a25 == 12 && !(a4 == 1)) || 140 < a29)) && ((((!(a25 == 11) && !(a25 == 13)) && a4 == 1) && a23 + 43 <= 0) || (((!(a25 == 11) && a4 == 1) && a29 <= 245) && a23 + 43 <= 0)))))) || ((a23 <= 599997 && ((((((15 == a8 && 1 == a4) && a25 == 11) && (\exists v_~a29~0_504 : int :: (v_~a29~0_504 + 370578 < 0 && (v_~a29~0_504 + 26) % 52 + 140 <= a29) && !((v_~a29~0_504 + 26) % 52 == 0))) && a3 == 1) && 312 <= a23) || (((a8 == 15 && (140 < a29 && a25 == 12) && a4 == 1) && a3 == 1) && 312 <= a23))) && a29 <= 245)) || (((((((a25 == 12 && a23 <= 312) && !(input == 1)) && a29 <= 220) && a3 == 1) && (\exists v_~a29~0_504 : int :: (v_~a29~0_504 + 370578 < 0 && (v_~a29~0_504 + 26) % 52 + 140 <= a29) && !((v_~a29~0_504 + 26) % 52 == 0))) && 15 == a8) && 1 == a4)) || ((a4 <= 0 && ((a25 == 9 && a8 == 15) && 10250 <= a29) && a23 + 43 <= 0) && a3 == 1)) || (((a8 == 15 && a4 <= 0) && 245 < a29 && a25 == 12 && a29 <= 277) && a3 == 1)) || ((a25 == 9 && (a8 == 15 && 245 < a29) && ((0 < a23 + 43 && !(a25 == 13)) && a4 == 1) && a29 <= 277) && a3 == 1)) || (a23 <= 599997 && (((a25 == 13 && 0 < a23 + 43) && 1 == a3) && 15 == a8) && 1 == a4)) || ((((((a25 == 12 && a8 == 15) && a4 <= 0) && a3 == 1) && (\exists v_~a29~0_504 : int :: (v_~a29~0_504 + 370578 < 0 && (v_~a29~0_504 + 26) % 52 + 140 <= a29) && !((v_~a29~0_504 + 26) % 52 == 0))) && a29 <= 245) && a23 + 43 <= 0)) || (((((\exists v_prenex_13 : int :: (0 <= v_prenex_13 && 312 <= v_prenex_13) && a23 <= v_prenex_13 % 299846 + 300155) && a3 == 1) && ((((0 < a23 + 43 && !(a25 == 13)) && a4 == 1) && 245 < a29) || ((!(a25 == 11) && !(a25 == 13)) && 245 < a29))) && 15 == a8) && a25 == 11)) || (a23 <= 599997 && (((((((a25 == 12 && a8 == 15) && a4 == 1) && !(input == 1)) && a29 <= 130) && a3 == 1) && 312 <= a23) || (((a25 == 10 && 15 == a8) && 1 == a4) && a3 == 1)))) || (((((((\exists v_prenex_13 : int :: (0 <= v_prenex_13 && 312 <= v_prenex_13) && a23 <= v_prenex_13 % 299846 + 300155) && !(input == 1)) && a29 <= 277) && a25 == 12 && 245 < a29) && a3 == 1) && 15 == a8) && 1 == a4)) || ((a8 == 15 && ((a25 == 13 && ((a25 == 12 && !(a4 == 1)) || 140 < a29)) && a4 == 1) && a29 <= 245) && a3 == 1)) || ((a3 == 1 && (((a23 <= 312 && 0 < a23 + 43) && a4 == 1) && a25 == 9) && a8 == 15) && a29 <= 140)) || ((((((a25 == 12 && a8 == 15) && a4 <= 0) && !(3 == input)) && a29 <= 130) && a3 == 1) && (\exists v_prenex_18 : int, v_prenex_17 : int :: ((((0 <= v_prenex_18 && v_prenex_17 <= v_prenex_18 % 299846 + 300155) && !(0 == (v_prenex_17 + 4) % 5)) && 312 <= v_prenex_18) && v_prenex_17 < 600276) && a23 <= (v_prenex_17 + -600276) / 5 + 1))) || ((\exists v_~a29~0_504 : int :: (v_~a29~0_504 + 370578 < 0 && (v_~a29~0_504 + 26) % 52 + 140 <= a29) && !((v_~a29~0_504 + 26) % 52 == 0)) && (a8 == 15 && (a4 == 1 && a29 <= 277) && a25 == 10) && a3 == 1) || ((((((a25 == 9 && a8 == 15) && a4 == 1) && ((a25 == 12 && !(a4 == 1)) || 140 < a29)) && a29 <= 245) && a3 == 1) && 312 <= a23) - InvariantResult [Line: 22]: Loop Invariant [2019-01-12 03:45:58,560 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,560 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,561 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,561 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,561 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,561 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,562 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,562 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,562 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,562 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,563 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,563 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,563 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,563 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,563 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,564 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,564 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,564 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,564 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2019-01-12 03:45:58,564 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 03:45:58,564 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2019-01-12 03:45:58,565 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 03:45:58,565 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2019-01-12 03:45:58,565 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 03:45:58,565 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 03:45:58,565 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,565 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,566 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,567 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,567 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,568 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,568 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,568 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,568 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,569 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,569 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,569 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,569 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,569 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,570 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,570 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,570 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,570 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,570 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,571 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,571 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_13,QUANTIFIED] [2019-01-12 03:45:58,571 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2019-01-12 03:45:58,571 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 03:45:58,571 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2019-01-12 03:45:58,571 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 03:45:58,572 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_18,QUANTIFIED] [2019-01-12 03:45:58,572 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 03:45:58,572 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 03:45:58,572 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,572 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-01-12 03:45:58,572 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((a8 == 15 && 0 < a23 + 43 && a4 == 1) && a3 == 1) && a23 <= 306) || ((a4 == 1 && a25 == 10) && a23 + 43 <= 0)) || ((a25 == 9 && a8 == 15 && a29 <= 130 && a23 + 43 <= 0) && a3 == 1)) || (a23 + 307 <= 0 && ((a4 <= 0 && a8 == 15 && !(a25 == 9) && !(a25 == 13)) && a3 == 1) && a29 <= 140)) || ((((((a8 == 15 && a4 == 1) && a25 == 10) && 245 < a29) || (a4 == 1 && (a25 == 9 && a8 == 15) && ((((0 < a23 + 43 && !(a25 == 13)) && a4 == 1) && 245 < a29) || ((!(a25 == 11) && !(a25 == 13)) && 245 < a29)))) && a3 == 1) && (\exists v_prenex_13 : int :: (0 <= v_prenex_13 && 312 <= v_prenex_13) && a23 <= v_prenex_13 % 299846 + 300155))) || (a3 == 1 && (((a25 == 12 && a8 == 15) && ((((!(a25 == 11) && !(a25 == 13)) && a4 == 1) && a23 + 43 <= 0) || (((!(a25 == 11) && a4 == 1) && a29 <= 245) && a23 + 43 <= 0))) || ((a8 == 15 && ((a25 == 12 && !(a4 == 1)) || 140 < a29)) && ((((!(a25 == 11) && !(a25 == 13)) && a4 == 1) && a23 + 43 <= 0) || (((!(a25 == 11) && a4 == 1) && a29 <= 245) && a23 + 43 <= 0)))))) || ((a23 <= 599997 && ((((((15 == a8 && 1 == a4) && a25 == 11) && (\exists v_~a29~0_504 : int :: (v_~a29~0_504 + 370578 < 0 && (v_~a29~0_504 + 26) % 52 + 140 <= a29) && !((v_~a29~0_504 + 26) % 52 == 0))) && a3 == 1) && 312 <= a23) || (((a8 == 15 && (140 < a29 && a25 == 12) && a4 == 1) && a3 == 1) && 312 <= a23))) && a29 <= 245)) || (((((((a25 == 12 && a23 <= 312) && !(input == 1)) && a29 <= 220) && a3 == 1) && (\exists v_~a29~0_504 : int :: (v_~a29~0_504 + 370578 < 0 && (v_~a29~0_504 + 26) % 52 + 140 <= a29) && !((v_~a29~0_504 + 26) % 52 == 0))) && 15 == a8) && 1 == a4)) || ((a4 <= 0 && ((a25 == 9 && a8 == 15) && 10250 <= a29) && a23 + 43 <= 0) && a3 == 1)) || (((a8 == 15 && a4 <= 0) && 245 < a29 && a25 == 12 && a29 <= 277) && a3 == 1)) || ((a25 == 9 && (a8 == 15 && 245 < a29) && ((0 < a23 + 43 && !(a25 == 13)) && a4 == 1) && a29 <= 277) && a3 == 1)) || (a23 <= 599997 && (((a25 == 13 && 0 < a23 + 43) && 1 == a3) && 15 == a8) && 1 == a4)) || ((((((a25 == 12 && a8 == 15) && a4 <= 0) && a3 == 1) && (\exists v_~a29~0_504 : int :: (v_~a29~0_504 + 370578 < 0 && (v_~a29~0_504 + 26) % 52 + 140 <= a29) && !((v_~a29~0_504 + 26) % 52 == 0))) && a29 <= 245) && a23 + 43 <= 0)) || (((((\exists v_prenex_13 : int :: (0 <= v_prenex_13 && 312 <= v_prenex_13) && a23 <= v_prenex_13 % 299846 + 300155) && a3 == 1) && ((((0 < a23 + 43 && !(a25 == 13)) && a4 == 1) && 245 < a29) || ((!(a25 == 11) && !(a25 == 13)) && 245 < a29))) && 15 == a8) && a25 == 11)) || (a23 <= 599997 && (((((((a25 == 12 && a8 == 15) && a4 == 1) && !(input == 1)) && a29 <= 130) && a3 == 1) && 312 <= a23) || (((a25 == 10 && 15 == a8) && 1 == a4) && a3 == 1)))) || (((((((\exists v_prenex_13 : int :: (0 <= v_prenex_13 && 312 <= v_prenex_13) && a23 <= v_prenex_13 % 299846 + 300155) && !(input == 1)) && a29 <= 277) && a25 == 12 && 245 < a29) && a3 == 1) && 15 == a8) && 1 == a4)) || ((a8 == 15 && ((a25 == 13 && ((a25 == 12 && !(a4 == 1)) || 140 < a29)) && a4 == 1) && a29 <= 245) && a3 == 1)) || ((a3 == 1 && (((a23 <= 312 && 0 < a23 + 43) && a4 == 1) && a25 == 9) && a8 == 15) && a29 <= 140)) || ((((((a25 == 12 && a8 == 15) && a4 <= 0) && !(3 == input)) && a29 <= 130) && a3 == 1) && (\exists v_prenex_18 : int, v_prenex_17 : int :: ((((0 <= v_prenex_18 && v_prenex_17 <= v_prenex_18 % 299846 + 300155) && !(0 == (v_prenex_17 + 4) % 5)) && 312 <= v_prenex_18) && v_prenex_17 < 600276) && a23 <= (v_prenex_17 + -600276) / 5 + 1))) || ((\exists v_~a29~0_504 : int :: (v_~a29~0_504 + 370578 < 0 && (v_~a29~0_504 + 26) % 52 + 140 <= a29) && !((v_~a29~0_504 + 26) % 52 == 0)) && (a8 == 15 && (a4 == 1 && a29 <= 277) && a25 == 10) && a3 == 1) || ((((((a25 == 9 && a8 == 15) && a4 == 1) && ((a25 == 12 && !(a4 == 1)) || 140 < a29)) && a29 <= 245) && a3 == 1) && 312 <= a23) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. SAFE Result, 575.0s OverallTime, 26 OverallIterations, 13 TraceHistogramMax, 413.1s AutomataDifference, 0.0s DeadEndRemovalTime, 105.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 2824 SDtfs, 19293 SDslu, 1369 SDs, 0 SdLazy, 50091 SolverSat, 6235 SolverUnsat, 172 SolverUnknown, 0 SolverNotchecked, 388.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10521 GetRequests, 10306 SyntacticMatches, 22 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1282 ImplicationChecksByTransitivity, 18.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21212occurred in iteration=17, 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: 5.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 67289 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 156 NumberOfFragments, 1695 HoareAnnotationTreeSize, 3 FomulaSimplifications, 67448137 FormulaSimplificationTreeSizeReduction, 16.9s HoareSimplificationTime, 3 FomulaSimplificationsInter, 18444672 FormulaSimplificationTreeSizeReductionInter, 88.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.9s SsaConstructionTime, 4.0s SatisfiabilityAnalysisTime, 32.0s InterpolantComputationTime, 28954 NumberOfCodeBlocks, 28954 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 28915 ConstructedInterpolants, 987 QuantifiedInterpolants, 111025447 SizeOfPredicates, 40 NumberOfNonLiveVariables, 13103 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 39 InterpolantComputations, 17 PerfectInterpolantSequences, 87994/94205 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...