./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem15_label08_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/Problem15_label08_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 d9cc1dd0bb631e7337db73d708375fb42ff5290c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 04:29:36,155 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 04:29:36,156 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 04:29:36,168 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 04:29:36,168 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 04:29:36,169 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 04:29:36,170 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 04:29:36,172 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 04:29:36,174 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 04:29:36,174 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 04:29:36,175 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 04:29:36,176 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 04:29:36,176 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 04:29:36,177 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 04:29:36,179 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 04:29:36,179 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 04:29:36,180 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 04:29:36,182 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 04:29:36,184 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 04:29:36,185 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 04:29:36,186 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 04:29:36,188 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 04:29:36,190 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 04:29:36,191 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 04:29:36,191 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 04:29:36,192 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 04:29:36,193 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 04:29:36,194 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 04:29:36,195 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 04:29:36,196 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 04:29:36,196 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 04:29:36,197 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 04:29:36,197 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 04:29:36,197 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 04:29:36,198 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 04:29:36,199 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 04:29:36,200 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 04:29:36,215 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 04:29:36,216 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 04:29:36,217 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 04:29:36,217 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 04:29:36,217 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 04:29:36,218 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 04:29:36,218 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 04:29:36,218 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 04:29:36,218 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 04:29:36,218 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 04:29:36,219 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 04:29:36,219 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 04:29:36,219 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 04:29:36,219 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 04:29:36,219 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 04:29:36,219 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 04:29:36,220 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 04:29:36,220 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 04:29:36,220 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 04:29:36,220 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 04:29:36,221 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 04:29:36,221 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 04:29:36,221 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 04:29:36,221 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 04:29:36,221 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 04:29:36,222 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 04:29:36,222 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 04:29:36,222 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 04:29:36,222 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 -> d9cc1dd0bb631e7337db73d708375fb42ff5290c [2019-01-12 04:29:36,271 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 04:29:36,291 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 04:29:36,295 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 04:29:36,297 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 04:29:36,297 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 04:29:36,298 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem15_label08_true-unreach-call.c [2019-01-12 04:29:36,356 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47f932a0b/f13f79a368bc4d009c1cffd7c9f0e128/FLAG907f46804 [2019-01-12 04:29:36,968 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 04:29:36,969 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem15_label08_true-unreach-call.c [2019-01-12 04:29:36,990 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47f932a0b/f13f79a368bc4d009c1cffd7c9f0e128/FLAG907f46804 [2019-01-12 04:29:37,167 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47f932a0b/f13f79a368bc4d009c1cffd7c9f0e128 [2019-01-12 04:29:37,170 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 04:29:37,172 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 04:29:37,173 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 04:29:37,173 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 04:29:37,177 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 04:29:37,179 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:29:37" (1/1) ... [2019-01-12 04:29:37,183 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36d2d51f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:29:37, skipping insertion in model container [2019-01-12 04:29:37,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:29:37" (1/1) ... [2019-01-12 04:29:37,192 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 04:29:37,285 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 04:29:38,150 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:29:38,156 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 04:29:38,503 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:29:38,689 INFO L195 MainTranslator]: Completed translation [2019-01-12 04:29:38,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:29:38 WrapperNode [2019-01-12 04:29:38,691 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 04:29:38,692 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 04:29:38,692 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 04:29:38,692 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 04:29:38,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:29:38" (1/1) ... [2019-01-12 04:29:38,749 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:29:38" (1/1) ... [2019-01-12 04:29:38,907 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 04:29:38,908 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 04:29:38,908 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 04:29:38,908 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 04:29:38,919 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:29:38" (1/1) ... [2019-01-12 04:29:38,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:29:38" (1/1) ... [2019-01-12 04:29:38,939 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:29:38" (1/1) ... [2019-01-12 04:29:38,940 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:29:38" (1/1) ... [2019-01-12 04:29:39,014 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:29:38" (1/1) ... [2019-01-12 04:29:39,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:29:38" (1/1) ... [2019-01-12 04:29:39,090 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:29:38" (1/1) ... [2019-01-12 04:29:39,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 04:29:39,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 04:29:39,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 04:29:39,123 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 04:29:39,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:29:38" (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 04:29:39,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 04:29:39,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 04:29:46,054 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 04:29:46,054 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-12 04:29:46,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:29:46 BoogieIcfgContainer [2019-01-12 04:29:46,056 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 04:29:46,057 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 04:29:46,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 04:29:46,060 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 04:29:46,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 04:29:37" (1/3) ... [2019-01-12 04:29:46,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1424ae80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:29:46, skipping insertion in model container [2019-01-12 04:29:46,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:29:38" (2/3) ... [2019-01-12 04:29:46,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1424ae80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:29:46, skipping insertion in model container [2019-01-12 04:29:46,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:29:46" (3/3) ... [2019-01-12 04:29:46,064 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label08_true-unreach-call.c [2019-01-12 04:29:46,073 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 04:29:46,080 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 04:29:46,097 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 04:29:46,133 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 04:29:46,134 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 04:29:46,134 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 04:29:46,135 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 04:29:46,135 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 04:29:46,135 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 04:29:46,135 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 04:29:46,135 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 04:29:46,135 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 04:29:46,167 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-01-12 04:29:46,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-12 04:29:46,176 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:29:46,177 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] [2019-01-12 04:29:46,179 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:29:46,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:29:46,185 INFO L82 PathProgramCache]: Analyzing trace with hash 2122806209, now seen corresponding path program 1 times [2019-01-12 04:29:46,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:29:46,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:29:46,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:46,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:29:46,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:46,680 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 04:29:46,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:29:46,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:29:46,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:29:46,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:29:46,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:29:46,706 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-01-12 04:29:53,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:29:53,575 INFO L93 Difference]: Finished difference Result 1470 states and 2719 transitions. [2019-01-12 04:29:53,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:29:53,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-01-12 04:29:53,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:29:53,601 INFO L225 Difference]: With dead ends: 1470 [2019-01-12 04:29:53,601 INFO L226 Difference]: Without dead ends: 978 [2019-01-12 04:29:53,606 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 04:29:53,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2019-01-12 04:29:53,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 976. [2019-01-12 04:29:53,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 976 states. [2019-01-12 04:29:53,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1472 transitions. [2019-01-12 04:29:53,715 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1472 transitions. Word has length 51 [2019-01-12 04:29:53,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:29:53,716 INFO L480 AbstractCegarLoop]: Abstraction has 976 states and 1472 transitions. [2019-01-12 04:29:53,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:29:53,716 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1472 transitions. [2019-01-12 04:29:53,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-01-12 04:29:53,722 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:29:53,723 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, 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 04:29:53,723 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:29:53,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:29:53,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1389375303, now seen corresponding path program 1 times [2019-01-12 04:29:53,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:29:53,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:29:53,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:53,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:29:53,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:29:54,042 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:29:54,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:29:54,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:29:54,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:29:54,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:29:54,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:29:54,046 INFO L87 Difference]: Start difference. First operand 976 states and 1472 transitions. Second operand 4 states. [2019-01-12 04:29:59,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:29:59,903 INFO L93 Difference]: Finished difference Result 3753 states and 5688 transitions. [2019-01-12 04:29:59,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:29:59,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-01-12 04:29:59,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:29:59,920 INFO L225 Difference]: With dead ends: 3753 [2019-01-12 04:29:59,920 INFO L226 Difference]: Without dead ends: 2779 [2019-01-12 04:29:59,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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 04:29:59,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2779 states. [2019-01-12 04:29:59,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2779 to 2774. [2019-01-12 04:29:59,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2774 states. [2019-01-12 04:29:59,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2774 states and 3761 transitions. [2019-01-12 04:29:59,982 INFO L78 Accepts]: Start accepts. Automaton has 2774 states and 3761 transitions. Word has length 116 [2019-01-12 04:29:59,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:29:59,983 INFO L480 AbstractCegarLoop]: Abstraction has 2774 states and 3761 transitions. [2019-01-12 04:29:59,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:29:59,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2774 states and 3761 transitions. [2019-01-12 04:29:59,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-01-12 04:29:59,992 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:29:59,993 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:29:59,993 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:29:59,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:29:59,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1120183410, now seen corresponding path program 1 times [2019-01-12 04:29:59,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:29:59,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:29:59,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:29:59,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:29:59,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:00,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:30:00,443 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 97 proven. 3 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-01-12 04:30:00,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:30:00,444 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 04:30:00,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:30:00,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:30:00,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:30:00,714 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:30:00,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:30:00,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-01-12 04:30:00,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:30:00,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:30:00,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:30:00,745 INFO L87 Difference]: Start difference. First operand 2774 states and 3761 transitions. Second operand 4 states. [2019-01-12 04:30:05,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:30:05,707 INFO L93 Difference]: Finished difference Result 10041 states and 13676 transitions. [2019-01-12 04:30:05,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:30:05,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2019-01-12 04:30:05,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:30:05,744 INFO L225 Difference]: With dead ends: 10041 [2019-01-12 04:30:05,745 INFO L226 Difference]: Without dead ends: 7269 [2019-01-12 04:30:05,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 261 SyntacticMatches, 1 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 04:30:05,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7269 states. [2019-01-12 04:30:05,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7269 to 3073. [2019-01-12 04:30:05,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3073 states. [2019-01-12 04:30:05,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 3073 states and 4114 transitions. [2019-01-12 04:30:05,840 INFO L78 Accepts]: Start accepts. Automaton has 3073 states and 4114 transitions. Word has length 261 [2019-01-12 04:30:05,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:30:05,841 INFO L480 AbstractCegarLoop]: Abstraction has 3073 states and 4114 transitions. [2019-01-12 04:30:05,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:30:05,841 INFO L276 IsEmpty]: Start isEmpty. Operand 3073 states and 4114 transitions. [2019-01-12 04:30:05,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-01-12 04:30:05,848 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:30:05,848 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:30:05,848 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:30:05,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:30:05,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1425674656, now seen corresponding path program 1 times [2019-01-12 04:30:05,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:30:05,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:30:05,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:05,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:30:05,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:05,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:30:06,481 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2019-01-12 04:30:06,684 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2019-01-12 04:30:06,943 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-01-12 04:30:06,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:30:06,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:30:06,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:30:06,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:30:06,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:30:06,945 INFO L87 Difference]: Start difference. First operand 3073 states and 4114 transitions. Second operand 5 states. [2019-01-12 04:30:11,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:30:11,121 INFO L93 Difference]: Finished difference Result 7342 states and 9540 transitions. [2019-01-12 04:30:11,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:30:11,122 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 329 [2019-01-12 04:30:11,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:30:11,142 INFO L225 Difference]: With dead ends: 7342 [2019-01-12 04:30:11,143 INFO L226 Difference]: Without dead ends: 4271 [2019-01-12 04:30:11,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:30:11,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4271 states. [2019-01-12 04:30:11,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4271 to 3971. [2019-01-12 04:30:11,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3971 states. [2019-01-12 04:30:11,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 5078 transitions. [2019-01-12 04:30:11,218 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 5078 transitions. Word has length 329 [2019-01-12 04:30:11,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:30:11,219 INFO L480 AbstractCegarLoop]: Abstraction has 3971 states and 5078 transitions. [2019-01-12 04:30:11,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:30:11,219 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 5078 transitions. [2019-01-12 04:30:11,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-01-12 04:30:11,228 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:30:11,228 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:30:11,229 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:30:11,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:30:11,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1374004594, now seen corresponding path program 1 times [2019-01-12 04:30:11,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:30:11,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:30:11,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:11,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:30:11,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:11,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:30:11,933 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:30:11,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:30:11,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:30:11,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:30:11,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:30:11,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:30:11,935 INFO L87 Difference]: Start difference. First operand 3971 states and 5078 transitions. Second operand 4 states. [2019-01-12 04:30:16,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:30:16,748 INFO L93 Difference]: Finished difference Result 9739 states and 12737 transitions. [2019-01-12 04:30:16,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:30:16,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 403 [2019-01-12 04:30:16,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:30:16,773 INFO L225 Difference]: With dead ends: 9739 [2019-01-12 04:30:16,773 INFO L226 Difference]: Without dead ends: 5770 [2019-01-12 04:30:16,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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 04:30:16,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5770 states. [2019-01-12 04:30:16,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5770 to 5767. [2019-01-12 04:30:16,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5767 states. [2019-01-12 04:30:16,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5767 states to 5767 states and 7242 transitions. [2019-01-12 04:30:16,881 INFO L78 Accepts]: Start accepts. Automaton has 5767 states and 7242 transitions. Word has length 403 [2019-01-12 04:30:16,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:30:16,882 INFO L480 AbstractCegarLoop]: Abstraction has 5767 states and 7242 transitions. [2019-01-12 04:30:16,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:30:16,882 INFO L276 IsEmpty]: Start isEmpty. Operand 5767 states and 7242 transitions. [2019-01-12 04:30:16,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2019-01-12 04:30:16,895 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:30:16,895 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:30:16,895 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:30:16,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:30:16,897 INFO L82 PathProgramCache]: Analyzing trace with hash 967568666, now seen corresponding path program 1 times [2019-01-12 04:30:16,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:30:16,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:30:16,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:16,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:30:16,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:30:18,022 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 414 proven. 3 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-01-12 04:30:18,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:30:18,023 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 04:30:18,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:30:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:30:18,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:30:18,390 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 376 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-01-12 04:30:18,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:30:18,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-01-12 04:30:18,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 04:30:18,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 04:30:18,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:30:18,410 INFO L87 Difference]: Start difference. First operand 5767 states and 7242 transitions. Second operand 8 states. [2019-01-12 04:30:25,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:30:25,275 INFO L93 Difference]: Finished difference Result 13183 states and 16187 transitions. [2019-01-12 04:30:25,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 04:30:25,276 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 478 [2019-01-12 04:30:25,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:30:25,300 INFO L225 Difference]: With dead ends: 13183 [2019-01-12 04:30:25,301 INFO L226 Difference]: Without dead ends: 6066 [2019-01-12 04:30:25,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 481 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2019-01-12 04:30:25,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6066 states. [2019-01-12 04:30:25,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6066 to 5767. [2019-01-12 04:30:25,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5767 states. [2019-01-12 04:30:25,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5767 states to 5767 states and 6724 transitions. [2019-01-12 04:30:25,399 INFO L78 Accepts]: Start accepts. Automaton has 5767 states and 6724 transitions. Word has length 478 [2019-01-12 04:30:25,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:30:25,399 INFO L480 AbstractCegarLoop]: Abstraction has 5767 states and 6724 transitions. [2019-01-12 04:30:25,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 04:30:25,400 INFO L276 IsEmpty]: Start isEmpty. Operand 5767 states and 6724 transitions. [2019-01-12 04:30:25,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 555 [2019-01-12 04:30:25,416 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:30:25,416 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:30:25,416 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:30:25,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:30:25,418 INFO L82 PathProgramCache]: Analyzing trace with hash -488435508, now seen corresponding path program 1 times [2019-01-12 04:30:25,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:30:25,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:30:25,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:25,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:30:25,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:30:26,092 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-12 04:30:26,346 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 21 [2019-01-12 04:30:26,821 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 311 proven. 134 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-01-12 04:30:26,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:30:26,821 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 04:30:26,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:30:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:30:26,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:30:27,303 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 378 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-01-12 04:30:27,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:30:27,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-01-12 04:30:27,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 04:30:27,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 04:30:27,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 04:30:27,324 INFO L87 Difference]: Start difference. First operand 5767 states and 6724 transitions. Second operand 9 states. [2019-01-12 04:30:33,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:30:33,707 INFO L93 Difference]: Finished difference Result 12189 states and 14110 transitions. [2019-01-12 04:30:33,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 04:30:33,708 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 554 [2019-01-12 04:30:33,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:30:33,726 INFO L225 Difference]: With dead ends: 12189 [2019-01-12 04:30:33,726 INFO L226 Difference]: Without dead ends: 6424 [2019-01-12 04:30:33,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 573 GetRequests, 558 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-01-12 04:30:33,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6424 states. [2019-01-12 04:30:33,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6424 to 5764. [2019-01-12 04:30:33,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5764 states. [2019-01-12 04:30:33,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5764 states to 5764 states and 6364 transitions. [2019-01-12 04:30:33,821 INFO L78 Accepts]: Start accepts. Automaton has 5764 states and 6364 transitions. Word has length 554 [2019-01-12 04:30:33,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:30:33,822 INFO L480 AbstractCegarLoop]: Abstraction has 5764 states and 6364 transitions. [2019-01-12 04:30:33,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 04:30:33,822 INFO L276 IsEmpty]: Start isEmpty. Operand 5764 states and 6364 transitions. [2019-01-12 04:30:33,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2019-01-12 04:30:33,840 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:30:33,841 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:30:33,841 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:30:33,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:30:33,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1962882657, now seen corresponding path program 1 times [2019-01-12 04:30:33,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:30:33,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:30:33,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:33,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:30:33,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:30:34,726 WARN L181 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 7 [2019-01-12 04:30:34,961 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2019-01-12 04:30:35,664 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2019-01-12 04:30:35,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:30:35,665 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 04:30:35,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:30:35,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:30:35,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:30:36,237 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 16 [2019-01-12 04:30:37,126 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2019-01-12 04:30:37,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:30:37,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2019-01-12 04:30:37,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 04:30:37,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 04:30:37,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:30:37,146 INFO L87 Difference]: Start difference. First operand 5764 states and 6364 transitions. Second operand 7 states. [2019-01-12 04:30:46,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:30:46,305 INFO L93 Difference]: Finished difference Result 24211 states and 26844 transitions. [2019-01-12 04:30:46,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 04:30:46,305 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 592 [2019-01-12 04:30:46,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:30:46,339 INFO L225 Difference]: With dead ends: 24211 [2019-01-12 04:30:46,339 INFO L226 Difference]: Without dead ends: 18449 [2019-01-12 04:30:46,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 595 GetRequests, 590 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:30:46,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18449 states. [2019-01-12 04:30:46,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18449 to 8755. [2019-01-12 04:30:46,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8755 states. [2019-01-12 04:30:46,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8755 states to 8755 states and 9490 transitions. [2019-01-12 04:30:46,532 INFO L78 Accepts]: Start accepts. Automaton has 8755 states and 9490 transitions. Word has length 592 [2019-01-12 04:30:46,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:30:46,533 INFO L480 AbstractCegarLoop]: Abstraction has 8755 states and 9490 transitions. [2019-01-12 04:30:46,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 04:30:46,533 INFO L276 IsEmpty]: Start isEmpty. Operand 8755 states and 9490 transitions. [2019-01-12 04:30:46,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2019-01-12 04:30:46,543 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:30:46,544 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:30:46,546 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:30:46,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:30:46,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1902678979, now seen corresponding path program 1 times [2019-01-12 04:30:46,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:30:46,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:30:46,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:46,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:30:46,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:30:46,895 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2019-01-12 04:30:47,052 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 5 [2019-01-12 04:30:47,436 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 437 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-01-12 04:30:47,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:30:47,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:30:47,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:30:47,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:30:47,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:30:47,438 INFO L87 Difference]: Start difference. First operand 8755 states and 9490 transitions. Second operand 4 states. [2019-01-12 04:30:49,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:30:49,851 INFO L93 Difference]: Finished difference Result 21358 states and 22964 transitions. [2019-01-12 04:30:49,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:30:49,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 613 [2019-01-12 04:30:49,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:30:49,872 INFO L225 Difference]: With dead ends: 21358 [2019-01-12 04:30:49,872 INFO L226 Difference]: Without dead ends: 9615 [2019-01-12 04:30:49,883 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 04:30:49,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9615 states. [2019-01-12 04:30:49,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9615 to 6020. [2019-01-12 04:30:49,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6020 states. [2019-01-12 04:30:49,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6020 states to 6020 states and 6268 transitions. [2019-01-12 04:30:49,981 INFO L78 Accepts]: Start accepts. Automaton has 6020 states and 6268 transitions. Word has length 613 [2019-01-12 04:30:49,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:30:49,983 INFO L480 AbstractCegarLoop]: Abstraction has 6020 states and 6268 transitions. [2019-01-12 04:30:49,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:30:49,983 INFO L276 IsEmpty]: Start isEmpty. Operand 6020 states and 6268 transitions. [2019-01-12 04:30:49,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 724 [2019-01-12 04:30:49,995 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:30:49,996 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 04:30:49,998 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:30:49,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:30:49,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1415962773, now seen corresponding path program 1 times [2019-01-12 04:30:49,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:30:49,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:30:49,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:49,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:30:49,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:30:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:30:52,115 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 473 proven. 49 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-01-12 04:30:52,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:30:52,116 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 04:30:52,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:30:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:30:52,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:30:52,662 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 24 [2019-01-12 04:30:52,925 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-12 04:30:54,080 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 473 proven. 49 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-01-12 04:30:54,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:30:54,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 13 [2019-01-12 04:30:54,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 04:30:54,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 04:30:54,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-01-12 04:30:54,100 INFO L87 Difference]: Start difference. First operand 6020 states and 6268 transitions. Second operand 13 states. [2019-01-12 04:31:06,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:31:06,059 INFO L93 Difference]: Finished difference Result 20359 states and 21199 transitions. [2019-01-12 04:31:06,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-12 04:31:06,060 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 723 [2019-01-12 04:31:06,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:31:06,076 INFO L225 Difference]: With dead ends: 20359 [2019-01-12 04:31:06,077 INFO L226 Difference]: Without dead ends: 14042 [2019-01-12 04:31:06,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 761 GetRequests, 732 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=279, Invalid=533, Unknown=0, NotChecked=0, Total=812 [2019-01-12 04:31:06,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14042 states. [2019-01-12 04:31:06,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14042 to 8414. [2019-01-12 04:31:06,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8414 states. [2019-01-12 04:31:06,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8414 states to 8414 states and 8700 transitions. [2019-01-12 04:31:06,223 INFO L78 Accepts]: Start accepts. Automaton has 8414 states and 8700 transitions. Word has length 723 [2019-01-12 04:31:06,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:31:06,223 INFO L480 AbstractCegarLoop]: Abstraction has 8414 states and 8700 transitions. [2019-01-12 04:31:06,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 04:31:06,223 INFO L276 IsEmpty]: Start isEmpty. Operand 8414 states and 8700 transitions. [2019-01-12 04:31:06,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 821 [2019-01-12 04:31:06,240 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:31:06,241 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:31:06,241 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:31:06,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:31:06,241 INFO L82 PathProgramCache]: Analyzing trace with hash 926917019, now seen corresponding path program 1 times [2019-01-12 04:31:06,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:31:06,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:31:06,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:31:06,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:31:06,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:31:06,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:31:06,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1042 backedges. 805 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2019-01-12 04:31:06,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:31:06,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:31:06,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:31:06,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:31:06,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:31:06,768 INFO L87 Difference]: Start difference. First operand 8414 states and 8700 transitions. Second operand 4 states. [2019-01-12 04:31:08,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:31:08,684 INFO L93 Difference]: Finished difference Result 16826 states and 17398 transitions. [2019-01-12 04:31:08,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:31:08,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 820 [2019-01-12 04:31:08,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:31:08,696 INFO L225 Difference]: With dead ends: 16826 [2019-01-12 04:31:08,697 INFO L226 Difference]: Without dead ends: 8112 [2019-01-12 04:31:08,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 04:31:08,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8112 states. [2019-01-12 04:31:08,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8112 to 8112. [2019-01-12 04:31:08,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8112 states. [2019-01-12 04:31:08,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8112 states to 8112 states and 8344 transitions. [2019-01-12 04:31:08,853 INFO L78 Accepts]: Start accepts. Automaton has 8112 states and 8344 transitions. Word has length 820 [2019-01-12 04:31:08,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:31:08,855 INFO L480 AbstractCegarLoop]: Abstraction has 8112 states and 8344 transitions. [2019-01-12 04:31:08,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:31:08,855 INFO L276 IsEmpty]: Start isEmpty. Operand 8112 states and 8344 transitions. [2019-01-12 04:31:08,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 822 [2019-01-12 04:31:08,879 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:31:08,879 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:31:08,881 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:31:08,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:31:08,882 INFO L82 PathProgramCache]: Analyzing trace with hash -748444098, now seen corresponding path program 1 times [2019-01-12 04:31:08,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:31:08,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:31:08,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:31:08,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:31:08,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:31:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:31:09,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1039 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 844 trivial. 0 not checked. [2019-01-12 04:31:09,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:31:09,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:31:09,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:31:09,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:31:09,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:31:09,524 INFO L87 Difference]: Start difference. First operand 8112 states and 8344 transitions. Second operand 3 states. [2019-01-12 04:31:10,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:31:10,867 INFO L93 Difference]: Finished difference Result 18615 states and 19126 transitions. [2019-01-12 04:31:10,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:31:10,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 821 [2019-01-12 04:31:10,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:31:10,876 INFO L225 Difference]: With dead ends: 18615 [2019-01-12 04:31:10,876 INFO L226 Difference]: Without dead ends: 10206 [2019-01-12 04:31:10,883 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 04:31:10,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10206 states. [2019-01-12 04:31:11,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10206 to 8407. [2019-01-12 04:31:11,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8407 states. [2019-01-12 04:31:11,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8407 states to 8407 states and 8616 transitions. [2019-01-12 04:31:11,015 INFO L78 Accepts]: Start accepts. Automaton has 8407 states and 8616 transitions. Word has length 821 [2019-01-12 04:31:11,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:31:11,016 INFO L480 AbstractCegarLoop]: Abstraction has 8407 states and 8616 transitions. [2019-01-12 04:31:11,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:31:11,018 INFO L276 IsEmpty]: Start isEmpty. Operand 8407 states and 8616 transitions. [2019-01-12 04:31:11,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 888 [2019-01-12 04:31:11,044 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:31:11,046 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 04:31:11,047 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:31:11,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:31:11,047 INFO L82 PathProgramCache]: Analyzing trace with hash -215175952, now seen corresponding path program 1 times [2019-01-12 04:31:11,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:31:11,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:31:11,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:31:11,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:31:11,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:31:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:31:11,592 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 3 [2019-01-12 04:31:11,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 684 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2019-01-12 04:31:11,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:31:11,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:31:11,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:31:11,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:31:11,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:31:11,979 INFO L87 Difference]: Start difference. First operand 8407 states and 8616 transitions. Second operand 3 states. [2019-01-12 04:31:15,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:31:15,251 INFO L93 Difference]: Finished difference Result 20107 states and 20613 transitions. [2019-01-12 04:31:15,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:31:15,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 887 [2019-01-12 04:31:15,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:31:15,260 INFO L225 Difference]: With dead ends: 20107 [2019-01-12 04:31:15,260 INFO L226 Difference]: Without dead ends: 11702 [2019-01-12 04:31:15,267 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 04:31:15,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11702 states. [2019-01-12 04:31:15,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11702 to 9003. [2019-01-12 04:31:15,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9003 states. [2019-01-12 04:31:15,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9003 states to 9003 states and 9225 transitions. [2019-01-12 04:31:15,394 INFO L78 Accepts]: Start accepts. Automaton has 9003 states and 9225 transitions. Word has length 887 [2019-01-12 04:31:15,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:31:15,395 INFO L480 AbstractCegarLoop]: Abstraction has 9003 states and 9225 transitions. [2019-01-12 04:31:15,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:31:15,395 INFO L276 IsEmpty]: Start isEmpty. Operand 9003 states and 9225 transitions. [2019-01-12 04:31:15,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 973 [2019-01-12 04:31:15,421 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:31:15,422 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:31:15,422 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:31:15,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:31:15,422 INFO L82 PathProgramCache]: Analyzing trace with hash -410336917, now seen corresponding path program 1 times [2019-01-12 04:31:15,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:31:15,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:31:15,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:31:15,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:31:15,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:31:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:31:16,194 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-12 04:31:16,753 WARN L181 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 21 [2019-01-12 04:31:17,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 654 proven. 298 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2019-01-12 04:31:17,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:31:17,995 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 04:31:18,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:31:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:31:18,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:31:19,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 769 proven. 49 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2019-01-12 04:31:19,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:31:19,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4] total 11 [2019-01-12 04:31:19,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 04:31:19,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 04:31:19,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-01-12 04:31:19,279 INFO L87 Difference]: Start difference. First operand 9003 states and 9225 transitions. Second operand 11 states. [2019-01-12 04:31:27,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:31:27,912 INFO L93 Difference]: Finished difference Result 23218 states and 23765 transitions. [2019-01-12 04:31:27,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-12 04:31:27,913 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 972 [2019-01-12 04:31:27,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:31:27,926 INFO L225 Difference]: With dead ends: 23218 [2019-01-12 04:31:27,926 INFO L226 Difference]: Without dead ends: 13918 [2019-01-12 04:31:27,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1014 GetRequests, 985 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-01-12 04:31:27,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13918 states. [2019-01-12 04:31:28,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13918 to 9900. [2019-01-12 04:31:28,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9900 states. [2019-01-12 04:31:28,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9900 states to 9900 states and 10139 transitions. [2019-01-12 04:31:28,052 INFO L78 Accepts]: Start accepts. Automaton has 9900 states and 10139 transitions. Word has length 972 [2019-01-12 04:31:28,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:31:28,053 INFO L480 AbstractCegarLoop]: Abstraction has 9900 states and 10139 transitions. [2019-01-12 04:31:28,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 04:31:28,053 INFO L276 IsEmpty]: Start isEmpty. Operand 9900 states and 10139 transitions. [2019-01-12 04:31:28,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 989 [2019-01-12 04:31:28,067 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:31:28,068 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, 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, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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 04:31:28,068 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:31:28,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:31:28,069 INFO L82 PathProgramCache]: Analyzing trace with hash -697863412, now seen corresponding path program 1 times [2019-01-12 04:31:28,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:31:28,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:31:28,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:31:28,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:31:28,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:31:28,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:31:28,745 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-12 04:31:28,974 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-12 04:31:29,268 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-01-12 04:31:29,657 WARN L181 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 30 [2019-01-12 04:31:31,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 785 proven. 49 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2019-01-12 04:31:31,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:31:31,807 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 04:31:31,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:31:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:31:32,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:31:33,005 WARN L181 SmtUtils]: Spent 882.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2019-01-12 04:31:33,539 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 20 [2019-01-12 04:31:35,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 785 proven. 49 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2019-01-12 04:31:35,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:31:35,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4] total 14 [2019-01-12 04:31:35,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 04:31:35,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 04:31:35,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-01-12 04:31:35,155 INFO L87 Difference]: Start difference. First operand 9900 states and 10139 transitions. Second operand 14 states. [2019-01-12 04:31:37,021 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2019-01-12 04:31:42,498 WARN L181 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-01-12 04:31:44,779 WARN L181 SmtUtils]: Spent 886.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-01-12 04:31:45,685 WARN L181 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2019-01-12 04:31:46,897 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-12 04:31:47,828 WARN L181 SmtUtils]: Spent 878.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-01-12 04:31:54,076 WARN L181 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-01-12 04:31:57,295 WARN L181 SmtUtils]: Spent 398.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-12 04:31:58,442 WARN L181 SmtUtils]: Spent 872.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-01-12 04:32:00,084 WARN L181 SmtUtils]: Spent 857.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-01-12 04:32:08,051 WARN L181 SmtUtils]: Spent 444.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-12 04:32:09,235 WARN L181 SmtUtils]: Spent 863.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-01-12 04:32:23,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:32:23,677 INFO L93 Difference]: Finished difference Result 33706 states and 34482 transitions. [2019-01-12 04:32:23,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-12 04:32:23,678 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 988 [2019-01-12 04:32:23,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:32:23,701 INFO L225 Difference]: With dead ends: 33706 [2019-01-12 04:32:23,701 INFO L226 Difference]: Without dead ends: 23509 [2019-01-12 04:32:23,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1077 GetRequests, 1021 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=725, Invalid=2581, Unknown=0, NotChecked=0, Total=3306 [2019-01-12 04:32:23,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23509 states. [2019-01-12 04:32:23,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23509 to 9600. [2019-01-12 04:32:23,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9600 states. [2019-01-12 04:32:23,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9600 states to 9600 states and 9828 transitions. [2019-01-12 04:32:23,867 INFO L78 Accepts]: Start accepts. Automaton has 9600 states and 9828 transitions. Word has length 988 [2019-01-12 04:32:23,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:32:23,868 INFO L480 AbstractCegarLoop]: Abstraction has 9600 states and 9828 transitions. [2019-01-12 04:32:23,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 04:32:23,869 INFO L276 IsEmpty]: Start isEmpty. Operand 9600 states and 9828 transitions. [2019-01-12 04:32:23,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1144 [2019-01-12 04:32:23,885 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:32:23,887 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:32:23,887 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:32:23,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:32:23,887 INFO L82 PathProgramCache]: Analyzing trace with hash 130323981, now seen corresponding path program 1 times [2019-01-12 04:32:23,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:32:23,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:32:23,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:32:23,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:32:23,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:32:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:32:25,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1952 backedges. 1418 proven. 0 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-01-12 04:32:25,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:32:25,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:32:25,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:32:25,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:32:25,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:32:25,258 INFO L87 Difference]: Start difference. First operand 9600 states and 9828 transitions. Second operand 3 states. [2019-01-12 04:32:26,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:32:26,550 INFO L93 Difference]: Finished difference Result 21298 states and 21806 transitions. [2019-01-12 04:32:26,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:32:26,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1143 [2019-01-12 04:32:26,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:32:26,562 INFO L225 Difference]: With dead ends: 21298 [2019-01-12 04:32:26,562 INFO L226 Difference]: Without dead ends: 11700 [2019-01-12 04:32:26,570 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 04:32:26,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11700 states. [2019-01-12 04:32:26,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11700 to 10497. [2019-01-12 04:32:26,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10497 states. [2019-01-12 04:32:26,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10497 states to 10497 states and 10735 transitions. [2019-01-12 04:32:26,699 INFO L78 Accepts]: Start accepts. Automaton has 10497 states and 10735 transitions. Word has length 1143 [2019-01-12 04:32:26,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:32:26,700 INFO L480 AbstractCegarLoop]: Abstraction has 10497 states and 10735 transitions. [2019-01-12 04:32:26,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:32:26,700 INFO L276 IsEmpty]: Start isEmpty. Operand 10497 states and 10735 transitions. [2019-01-12 04:32:26,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1151 [2019-01-12 04:32:26,720 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:32:26,721 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 04:32:26,721 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:32:26,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:32:26,722 INFO L82 PathProgramCache]: Analyzing trace with hash -17566961, now seen corresponding path program 1 times [2019-01-12 04:32:26,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:32:26,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:32:26,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:32:26,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:32:26,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:32:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:32:29,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2207 backedges. 1565 proven. 0 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2019-01-12 04:32:29,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:32:29,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-12 04:32:29,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 04:32:29,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 04:32:29,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-12 04:32:29,726 INFO L87 Difference]: Start difference. First operand 10497 states and 10735 transitions. Second operand 11 states. [2019-01-12 04:32:41,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:32:41,018 INFO L93 Difference]: Finished difference Result 32131 states and 32894 transitions. [2019-01-12 04:32:41,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 04:32:41,019 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1150 [2019-01-12 04:32:41,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:32:41,021 INFO L225 Difference]: With dead ends: 32131 [2019-01-12 04:32:41,021 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 04:32:41,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2019-01-12 04:32:41,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 04:32:41,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 04:32:41,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 04:32:41,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 04:32:41,032 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1150 [2019-01-12 04:32:41,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:32:41,034 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 04:32:41,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 04:32:41,034 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 04:32:41,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 04:32:41,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 04:32:41,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:32:41,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:32:44,327 WARN L181 SmtUtils]: Spent 3.28 s on a formula simplification. DAG size of input: 720 DAG size of output: 661 [2019-01-12 04:32:44,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:32:45,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:32:46,519 WARN L181 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 720 DAG size of output: 661 [2019-01-12 04:32:46,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:32:46,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:32:46,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:32:46,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:32:46,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:32:46,904 WARN L181 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 451 DAG size of output: 396 [2019-01-12 04:33:30,002 WARN L181 SmtUtils]: Spent 43.09 s on a formula simplification. DAG size of input: 649 DAG size of output: 131 [2019-01-12 04:34:17,571 WARN L181 SmtUtils]: Spent 47.56 s on a formula simplification. DAG size of input: 649 DAG size of output: 131 [2019-01-12 04:34:50,002 WARN L181 SmtUtils]: Spent 32.43 s on a formula simplification. DAG size of input: 389 DAG size of output: 121 [2019-01-12 04:34:50,008 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,008 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,008 INFO L448 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,008 INFO L448 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,008 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-01-12 04:34:50,008 INFO L448 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,008 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,008 INFO L448 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,008 INFO L448 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,008 INFO L448 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,008 INFO L448 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,009 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-01-12 04:34:50,009 INFO L448 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,009 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,009 INFO L448 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,009 INFO L448 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-01-12 04:34:50,009 INFO L448 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,009 INFO L448 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,009 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-01-12 04:34:50,009 INFO L448 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,009 INFO L448 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,009 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,010 INFO L448 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,010 INFO L448 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,010 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,010 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-01-12 04:34:50,010 INFO L448 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,010 INFO L448 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,010 INFO L448 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,010 INFO L448 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,010 INFO L448 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-01-12 04:34:50,010 INFO L448 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-01-12 04:34:50,010 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,010 INFO L448 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,011 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,016 INFO L448 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,016 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-01-12 04:34:50,016 INFO L448 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-01-12 04:34:50,016 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,016 INFO L448 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,016 INFO L448 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,016 INFO L448 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,016 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,016 INFO L448 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-01-12 04:34:50,017 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,017 INFO L448 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-01-12 04:34:50,017 INFO L448 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-01-12 04:34:50,017 INFO L448 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-01-12 04:34:50,019 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-01-12 04:34:50,019 INFO L448 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,019 INFO L448 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,019 INFO L448 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,019 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,019 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,019 INFO L448 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-01-12 04:34:50,019 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,019 INFO L448 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,019 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-01-12 04:34:50,020 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,020 INFO L448 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-01-12 04:34:50,020 INFO L448 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,020 INFO L448 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,020 INFO L448 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,020 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-01-12 04:34:50,020 INFO L448 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,020 INFO L448 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-01-12 04:34:50,020 INFO L448 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-01-12 04:34:50,020 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-01-12 04:34:50,020 INFO L448 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-01-12 04:34:50,020 INFO L448 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-01-12 04:34:50,021 INFO L448 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-01-12 04:34:50,021 INFO L448 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,021 INFO L448 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,021 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,021 INFO L448 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,021 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-01-12 04:34:50,021 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-01-12 04:34:50,021 INFO L448 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,021 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-01-12 04:34:50,021 INFO L448 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,021 INFO L448 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,021 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,022 INFO L448 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,022 INFO L448 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,022 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,022 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-01-12 04:34:50,022 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 04:34:50,022 INFO L448 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,022 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,022 INFO L448 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,022 INFO L448 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,022 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,022 INFO L448 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-01-12 04:34:50,022 INFO L448 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-01-12 04:34:50,023 INFO L448 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,027 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-01-12 04:34:50,027 INFO L448 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-01-12 04:34:50,027 INFO L448 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-01-12 04:34:50,027 INFO L448 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,027 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-01-12 04:34:50,027 INFO L448 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-01-12 04:34:50,027 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,027 INFO L448 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,027 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,027 INFO L448 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,028 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-01-12 04:34:50,028 INFO L448 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-01-12 04:34:50,028 INFO L448 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,028 INFO L448 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,030 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,030 INFO L448 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-01-12 04:34:50,030 INFO L448 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-01-12 04:34:50,030 INFO L448 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,030 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-01-12 04:34:50,030 INFO L448 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,030 INFO L448 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,030 INFO L448 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,030 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,030 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,031 INFO L448 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,031 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-01-12 04:34:50,031 INFO L448 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,031 INFO L448 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,031 INFO L448 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-01-12 04:34:50,031 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,031 INFO L448 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,036 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,036 INFO L448 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,036 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-01-12 04:34:50,036 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,036 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,036 INFO L448 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,036 INFO L448 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,036 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,036 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-01-12 04:34:50,037 INFO L448 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,037 INFO L448 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,037 INFO L448 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,037 INFO L448 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,037 INFO L448 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-01-12 04:34:50,037 INFO L448 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,037 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,037 INFO L448 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,037 INFO L448 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-01-12 04:34:50,037 INFO L448 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-01-12 04:34:50,037 INFO L448 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,037 INFO L448 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,038 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-01-12 04:34:50,038 INFO L448 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,038 INFO L448 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,038 INFO L448 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,038 INFO L448 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,038 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,038 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-01-12 04:34:50,038 INFO L448 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,038 INFO L448 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,038 INFO L448 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,038 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,038 INFO L448 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,039 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-01-12 04:34:50,039 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,041 INFO L448 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,041 INFO L448 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-01-12 04:34:50,041 INFO L448 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,041 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-01-12 04:34:50,041 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-01-12 04:34:50,041 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,041 INFO L448 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,041 INFO L448 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,041 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,042 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,042 INFO L448 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-01-12 04:34:50,042 INFO L448 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-01-12 04:34:50,042 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,042 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-01-12 04:34:50,042 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 04:34:50,042 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-12 04:34:50,042 INFO L448 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,042 INFO L448 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,042 INFO L448 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,042 INFO L448 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,042 INFO L448 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,043 INFO L448 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-01-12 04:34:50,043 INFO L448 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-01-12 04:34:50,043 INFO L448 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-01-12 04:34:50,043 INFO L448 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-01-12 04:34:50,043 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,043 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,043 INFO L448 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,043 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-01-12 04:34:50,043 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-01-12 04:34:50,043 INFO L448 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,043 INFO L448 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-01-12 04:34:50,043 INFO L448 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,044 INFO L448 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,044 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,047 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,047 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-01-12 04:34:50,047 INFO L448 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-01-12 04:34:50,047 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-01-12 04:34:50,048 INFO L448 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,048 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-12 04:34:50,048 INFO L448 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,048 INFO L448 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,048 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,048 INFO L448 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,048 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,048 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,048 INFO L448 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,048 INFO L448 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,048 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-01-12 04:34:50,048 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-12 04:34:50,049 INFO L448 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-01-12 04:34:50,049 INFO L448 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-01-12 04:34:50,049 INFO L448 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,049 INFO L448 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,049 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,049 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,050 INFO L444 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse30 (+ ~a0~0 147)) (.cse19 (+ ~a0~0 98)) (.cse29 (+ ~a4~0 86))) (let ((.cse13 (<= .cse29 0)) (.cse8 (= ~a2~0 1)) (.cse26 (<= 0 (+ ~a0~0 44))) (.cse21 (+ ~a4~0 42)) (.cse7 (<= .cse19 0)) (.cse9 (< 0 .cse30)) (.cse10 (= ~a2~0 5)) (.cse23 (<= .cse30 0)) (.cse28 (+ ~a29~0 144))) (let ((.cse4 (<= .cse28 0)) (.cse3 (or .cse10 .cse23)) (.cse12 (= ~a2~0 3)) (.cse14 (and .cse7 .cse9)) (.cse15 (= ~a2~0 4)) (.cse1 (<= .cse21 0)) (.cse2 (< 0 .cse29)) (.cse18 (< 0 .cse28)) (.cse17 (< 0 (+ ~a29~0 16))) (.cse20 (<= ~a29~0 43)) (.cse6 (exists ((v_~a29~0_897 Int)) (and (<= 0 v_~a29~0_897) (<= ~a29~0 (+ (mod v_~a29~0_897 299978) 300021))))) (.cse24 (not (= 4 ~a2~0))) (.cse25 (<= 3 ~a2~0)) (.cse16 (< 43 ~a29~0)) (.cse11 (<= (+ ~a0~0 99) 0)) (.cse5 (or (and .cse13 .cse8) (and .cse8 .cse26))) (.cse22 (let ((.cse27 (not (= 3 ~a2~0)))) (or (and .cse26 .cse27) (and (<= (+ ~a4~0 89) 0) .cse27) (and .cse13 .cse9 .cse27)))) (.cse0 (= ~a2~0 2))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 (<= (+ ~a0~0 61) 0)) (and .cse1 .cse2 (and .cse6 (and .cse7 .cse8) .cse9)) (and .cse1 .cse10 .cse2 .cse11) (and .cse12 .cse4 .cse13) (and .cse11 (and .cse2 .cse12)) (and .cse1 .cse10 (not (= 2 ULTIMATE.start_calculate_output2_~input)) (not (= 2 ULTIMATE.start_calculate_output_~input)) .cse14) (and .cse1 .cse15 .cse11 .cse2 .cse16) (and (and .cse6 (and .cse17 .cse14) .cse0) .cse1) (and .cse1 (and .cse8 .cse18) .cse3) (and .cse17 .cse12 .cse13) (and (< 0 .cse19) (and .cse20 .cse18 .cse5)) (and .cse15 .cse1 .cse2 .cse3) (and .cse12 (and .cse13 .cse9)) (and .cse15 (and (< 0 .cse21) .cse14)) (and .cse22 .cse15 .cse20) (and .cse1 (and .cse8 .cse2 .cse20 .cse18)) (and (and .cse23 .cse24 .cse25) .cse16) (and .cse22 .cse17 .cse20 .cse25) (and .cse7 .cse22 .cse25) (and .cse6 (and .cse22 .cse0)) (and (<= ~a29~0 280462) .cse22 .cse24 .cse25 .cse16) (and .cse11 .cse5) (and .cse7 .cse22 .cse0))))) [2019-01-12 04:34:50,050 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-01-12 04:34:50,050 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-12 04:34:50,050 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,050 INFO L448 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,050 INFO L448 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,050 INFO L448 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,050 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,050 INFO L448 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,051 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 160) no Hoare annotation was computed. [2019-01-12 04:34:50,051 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,051 INFO L448 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-01-12 04:34:50,051 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,051 INFO L448 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-01-12 04:34:50,051 INFO L451 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-01-12 04:34:50,051 INFO L448 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,051 INFO L448 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-01-12 04:34:50,051 INFO L448 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-01-12 04:34:50,051 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-01-12 04:34:50,051 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-01-12 04:34:50,051 INFO L448 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,052 INFO L448 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,052 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,052 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,052 INFO L448 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,052 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-01-12 04:34:50,052 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-12 04:34:50,052 INFO L448 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,052 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-01-12 04:34:50,052 INFO L448 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-01-12 04:34:50,052 INFO L448 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,052 INFO L448 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,052 INFO L448 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,053 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,053 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,053 INFO L448 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,053 INFO L444 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse35 (+ ~a0~0 147)) (.cse33 (+ ~a0~0 98)) (.cse36 (+ ~a4~0 86))) (let ((.cse32 (<= 0 (+ ~a0~0 44))) (.cse9 (<= .cse36 0)) (.cse3 (<= .cse33 0)) (.cse14 (< 0 .cse36)) (.cse23 (< 0 .cse35)) (.cse17 (not (= 4 ~a2~0))) (.cse31 (not (= 3 ~a2~0))) (.cse18 (<= 3 ~a2~0))) (let ((.cse24 (+ ~a4~0 42)) (.cse21 (= ~a2~0 5)) (.cse11 (= ~a2~0 1)) (.cse5 (< 0 (+ ~a29~0 16))) (.cse30 (and .cse3 (and .cse14 .cse23 .cse17 .cse31 .cse18))) (.cse7 (= ~a2~0 3)) (.cse19 (<= .cse35 0)) (.cse15 (= ~a2~0 2)) (.cse1 (or (and .cse32 .cse31) (and (<= (+ ~a4~0 89) 0) .cse31) (and .cse9 .cse23 .cse31))) (.cse34 (+ ~a29~0 144))) (let ((.cse8 (<= .cse34 0)) (.cse6 (and .cse1 .cse17 .cse18)) (.cse20 (<= ~a29~0 280462)) (.cse4 (and .cse1 .cse15)) (.cse13 (< 43 ~a29~0)) (.cse26 (< 0 .cse34)) (.cse27 (or .cse7 .cse19 (< 0 .cse33))) (.cse22 (and .cse5 .cse30)) (.cse2 (<= ~a29~0 43)) (.cse16 (or (and .cse9 .cse11) (and .cse11 .cse32))) (.cse28 (<= (+ ~a0~0 99) 0)) (.cse0 (= ~a2~0 4)) (.cse29 (and .cse14 .cse31 .cse18)) (.cse12 (or .cse21 .cse19)) (.cse10 (<= .cse24 0)) (.cse25 (exists ((v_~a29~0_897 Int)) (and (<= 0 v_~a29~0_897) (<= ~a29~0 (+ (mod v_~a29~0_897 299978) 300021)))))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4) (and .cse5 .cse6 .cse2) (and .cse7 .cse8 .cse9) (and .cse10 .cse11 .cse12 .cse13) (and .cse10 (and .cse14 .cse15) .cse12) (and .cse9 .cse8 .cse16) (and (and (and .cse17 .cse18) .cse19) .cse13) (and (and .cse20 .cse6) .cse13) (and .cse10 .cse21 (and .cse20 .cse22)) (and (and (and .cse3 .cse23) (< 0 .cse24)) .cse0) (and .cse25 .cse4) (and .cse25 (and .cse11 .cse23) .cse3 .cse10 .cse14) (and .cse7 (and .cse9 .cse23)) (and (and .cse2 .cse26 .cse16) .cse27) (and .cse10 .cse0 .cse28 .cse29 .cse13) (and .cse3 (and .cse1 .cse18)) (and .cse10 (and (and .cse11 .cse2 .cse26) .cse27)) (and .cse5 .cse7 .cse9) (and .cse21 (and .cse10 .cse22) (not (= 2 ULTIMATE.start_calculate_output_~input))) (and .cse10 .cse21 .cse14 .cse28) (and .cse10 .cse21 (and .cse30 .cse2)) (and .cse28 .cse16) (and .cse14 .cse28 .cse7) (and .cse10 (and .cse0 .cse29) .cse12) (and .cse10 (and .cse25 (and .cse5 (and .cse3 (and .cse15 .cse23)))))))))) [2019-01-12 04:34:50,053 INFO L448 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,053 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-01-12 04:34:50,054 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-01-12 04:34:50,054 INFO L448 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,055 INFO L448 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,055 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,055 INFO L448 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,055 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,055 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,056 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-01-12 04:34:50,056 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-01-12 04:34:50,056 INFO L448 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,056 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,056 INFO L448 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-01-12 04:34:50,056 INFO L448 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,056 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,056 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,056 INFO L448 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,056 INFO L448 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,056 INFO L448 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,056 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-01-12 04:34:50,057 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-01-12 04:34:50,057 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,057 INFO L448 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,057 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,057 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,057 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,057 INFO L448 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,057 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 04:34:50,057 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-01-12 04:34:50,057 INFO L448 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,057 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-01-12 04:34:50,057 INFO L448 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,057 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,058 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,058 INFO L448 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,058 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,058 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,058 INFO L448 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,058 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-01-12 04:34:50,058 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-01-12 04:34:50,058 INFO L448 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,058 INFO L448 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,058 INFO L448 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,058 INFO L448 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,058 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,059 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,059 INFO L448 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,059 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-01-12 04:34:50,059 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-01-12 04:34:50,059 INFO L448 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,059 INFO L448 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,059 INFO L448 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,059 INFO L448 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,059 INFO L448 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,059 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,059 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,059 INFO L448 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-01-12 04:34:50,060 INFO L448 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-01-12 04:34:50,060 INFO L448 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,060 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-01-12 04:34:50,060 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-01-12 04:34:50,060 INFO L448 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,060 INFO L448 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,060 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,060 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,060 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,060 INFO L448 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,061 INFO L444 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse35 (+ ~a0~0 147)) (.cse33 (+ ~a0~0 98)) (.cse36 (+ ~a4~0 86))) (let ((.cse32 (<= 0 (+ ~a0~0 44))) (.cse9 (<= .cse36 0)) (.cse3 (<= .cse33 0)) (.cse14 (< 0 .cse36)) (.cse23 (< 0 .cse35)) (.cse17 (not (= 4 ~a2~0))) (.cse31 (not (= 3 ~a2~0))) (.cse18 (<= 3 ~a2~0))) (let ((.cse24 (+ ~a4~0 42)) (.cse21 (= ~a2~0 5)) (.cse11 (= ~a2~0 1)) (.cse5 (< 0 (+ ~a29~0 16))) (.cse30 (and .cse3 (and .cse14 .cse23 .cse17 .cse31 .cse18))) (.cse7 (= ~a2~0 3)) (.cse19 (<= .cse35 0)) (.cse15 (= ~a2~0 2)) (.cse1 (or (and .cse32 .cse31) (and (<= (+ ~a4~0 89) 0) .cse31) (and .cse9 .cse23 .cse31))) (.cse34 (+ ~a29~0 144))) (let ((.cse8 (<= .cse34 0)) (.cse6 (and .cse1 .cse17 .cse18)) (.cse20 (<= ~a29~0 280462)) (.cse4 (and .cse1 .cse15)) (.cse13 (< 43 ~a29~0)) (.cse26 (< 0 .cse34)) (.cse27 (or .cse7 .cse19 (< 0 .cse33))) (.cse22 (and .cse5 .cse30)) (.cse2 (<= ~a29~0 43)) (.cse16 (or (and .cse9 .cse11) (and .cse11 .cse32))) (.cse28 (<= (+ ~a0~0 99) 0)) (.cse0 (= ~a2~0 4)) (.cse29 (and .cse14 .cse31 .cse18)) (.cse12 (or .cse21 .cse19)) (.cse10 (<= .cse24 0)) (.cse25 (exists ((v_~a29~0_897 Int)) (and (<= 0 v_~a29~0_897) (<= ~a29~0 (+ (mod v_~a29~0_897 299978) 300021)))))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4) (and .cse5 .cse6 .cse2) (and .cse7 .cse8 .cse9) (and .cse10 .cse11 .cse12 .cse13) (and .cse10 (and .cse14 .cse15) .cse12) (and .cse9 .cse8 .cse16) (and (and (and .cse17 .cse18) .cse19) .cse13) (and (and .cse20 .cse6) .cse13) (and .cse10 .cse21 (and .cse20 .cse22)) (and (and (and .cse3 .cse23) (< 0 .cse24)) .cse0) (and .cse25 .cse4) (and .cse25 (and .cse11 .cse23) .cse3 .cse10 .cse14) (and .cse7 (and .cse9 .cse23)) (and (and .cse2 .cse26 .cse16) .cse27) (and .cse10 .cse0 .cse28 .cse29 .cse13) (and .cse3 (and .cse1 .cse18)) (and .cse10 (and (and .cse11 .cse2 .cse26) .cse27)) (and .cse5 .cse7 .cse9) (and .cse21 (and .cse10 .cse22) (not (= 2 ULTIMATE.start_calculate_output_~input))) (and .cse10 .cse21 .cse14 .cse28) (and .cse10 .cse21 (and .cse30 .cse2)) (and .cse28 .cse16) (and .cse14 .cse28 .cse7) (and .cse10 (and .cse0 .cse29) .cse12) (and .cse10 (and .cse25 (and .cse5 (and .cse3 (and .cse15 .cse23)))))))))) [2019-01-12 04:34:50,061 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-01-12 04:34:50,061 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-01-12 04:34:50,061 INFO L448 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,061 INFO L448 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,061 INFO L448 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,061 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,061 INFO L448 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,061 INFO L448 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,062 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,062 INFO L448 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,062 INFO L448 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-01-12 04:34:50,062 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-01-12 04:34:50,063 INFO L448 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,063 INFO L448 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-01-12 04:34:50,063 INFO L448 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-01-12 04:34:50,063 INFO L448 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,063 INFO L448 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,063 INFO L448 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,063 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,063 INFO L448 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,063 INFO L448 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-01-12 04:34:50,063 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-01-12 04:34:50,063 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,063 INFO L448 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,064 INFO L448 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,064 INFO L448 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,064 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-01-12 04:34:50,064 INFO L448 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-01-12 04:34:50,064 INFO L448 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-01-12 04:34:50,064 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,064 INFO L448 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-01-12 04:34:50,064 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-01-12 04:34:50,064 INFO L448 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,064 INFO L448 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,064 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,064 INFO L448 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,064 INFO L448 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,065 INFO L448 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,065 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,065 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-01-12 04:34:50,065 INFO L448 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-01-12 04:34:50,065 INFO L448 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,065 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,066 INFO L448 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,066 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-01-12 04:34:50,066 INFO L448 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,066 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 04:34:50,066 INFO L448 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,066 INFO L448 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-01-12 04:34:50,066 INFO L448 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,066 INFO L448 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,066 INFO L448 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,066 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,066 INFO L448 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,066 INFO L448 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,067 INFO L448 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,073 INFO L448 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-01-12 04:34:50,073 INFO L448 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-01-12 04:34:50,073 INFO L448 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,073 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-01-12 04:34:50,073 INFO L448 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,073 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,073 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,073 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-01-12 04:34:50,073 INFO L448 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,073 INFO L448 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,074 INFO L448 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,074 INFO L448 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,074 INFO L448 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-01-12 04:34:50,074 INFO L448 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,074 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,074 INFO L448 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-01-12 04:34:50,074 INFO L448 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-01-12 04:34:50,074 INFO L448 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,074 INFO L448 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,074 INFO L448 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,074 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-01-12 04:34:50,074 INFO L448 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,074 INFO L448 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,075 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,077 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,077 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,077 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-01-12 04:34:50,077 INFO L448 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,077 INFO L448 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,077 INFO L448 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-01-12 04:34:50,077 INFO L448 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-01-12 04:34:50,077 INFO L448 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,077 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:34:50,077 INFO L448 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-01-12 04:34:50,077 INFO L448 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,077 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-12 04:34:50,078 INFO L448 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,078 INFO L448 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-01-12 04:34:50,078 INFO L448 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-01-12 04:34:50,078 INFO L448 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,078 INFO L448 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,078 INFO L448 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-01-12 04:34:50,078 INFO L448 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-01-12 04:34:50,078 INFO L448 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-01-12 04:34:50,117 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,118 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,119 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,120 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,122 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,128 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,145 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,146 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,146 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,146 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,149 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,149 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,160 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,163 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,163 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,163 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,173 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,174 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,175 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,175 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,175 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,176 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,186 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,187 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,187 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,188 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,188 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,188 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,193 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,193 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,194 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,195 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,195 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,196 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 04:34:50 BoogieIcfgContainer [2019-01-12 04:34:50,203 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 04:34:50,204 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 04:34:50,204 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 04:34:50,204 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 04:34:50,208 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:29:46" (3/4) ... [2019-01-12 04:34:50,217 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 04:34:50,275 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 04:34:50,279 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 04:34:50,319 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((a2 == 4 && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 89 <= 0 && !(3 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 147) && !(3 == a2)))) && a29 <= 43) || (a0 + 98 <= 0 && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 89 <= 0 && !(3 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 147) && !(3 == a2))) && a2 == 2)) || ((0 < a29 + 16 && ((((0 <= a0 + 44 && !(3 == a2)) || (a4 + 89 <= 0 && !(3 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 147) && !(3 == a2))) && !(4 == a2)) && 3 <= a2) && a29 <= 43)) || ((a2 == 3 && a29 + 144 <= 0) && a4 + 86 <= 0)) || (((a4 + 42 <= 0 && a2 == 1) && (a2 == 5 || a0 + 147 <= 0)) && 43 < a29)) || ((a4 + 42 <= 0 && 0 < a4 + 86 && a2 == 2) && (a2 == 5 || a0 + 147 <= 0))) || ((a4 + 86 <= 0 && a29 + 144 <= 0) && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44)))) || (((!(4 == a2) && 3 <= a2) && a0 + 147 <= 0) && 43 < a29)) || ((a29 <= 280462 && ((((0 <= a0 + 44 && !(3 == a2)) || (a4 + 89 <= 0 && !(3 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 147) && !(3 == a2))) && !(4 == a2)) && 3 <= a2) && 43 < a29)) || ((a4 + 42 <= 0 && a2 == 5) && a29 <= 280462 && 0 < a29 + 16 && a0 + 98 <= 0 && (((0 < a4 + 86 && 0 < a0 + 147) && !(4 == a2)) && !(3 == a2)) && 3 <= a2)) || (((a0 + 98 <= 0 && 0 < a0 + 147) && 0 < a4 + 42) && a2 == 4)) || ((\exists v_~a29~0_897 : int :: 0 <= v_~a29~0_897 && a29 <= v_~a29~0_897 % 299978 + 300021) && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 89 <= 0 && !(3 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 147) && !(3 == a2))) && a2 == 2)) || (((((\exists v_~a29~0_897 : int :: 0 <= v_~a29~0_897 && a29 <= v_~a29~0_897 % 299978 + 300021) && a2 == 1 && 0 < a0 + 147) && a0 + 98 <= 0) && a4 + 42 <= 0) && 0 < a4 + 86)) || (a2 == 3 && a4 + 86 <= 0 && 0 < a0 + 147)) || (((a29 <= 43 && 0 < a29 + 144) && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44))) && ((a2 == 3 || a0 + 147 <= 0) || 0 < a0 + 98))) || ((((a4 + 42 <= 0 && a2 == 4) && a0 + 99 <= 0) && (0 < a4 + 86 && !(3 == a2)) && 3 <= a2) && 43 < a29)) || (a0 + 98 <= 0 && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 89 <= 0 && !(3 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 147) && !(3 == a2))) && 3 <= a2)) || (a4 + 42 <= 0 && ((a2 == 1 && a29 <= 43) && 0 < a29 + 144) && ((a2 == 3 || a0 + 147 <= 0) || 0 < a0 + 98))) || ((0 < a29 + 16 && a2 == 3) && a4 + 86 <= 0)) || ((a2 == 5 && a4 + 42 <= 0 && 0 < a29 + 16 && a0 + 98 <= 0 && (((0 < a4 + 86 && 0 < a0 + 147) && !(4 == a2)) && !(3 == a2)) && 3 <= a2) && !(2 == input))) || (((a4 + 42 <= 0 && a2 == 5) && 0 < a4 + 86) && a0 + 99 <= 0)) || ((a4 + 42 <= 0 && a2 == 5) && (a0 + 98 <= 0 && (((0 < a4 + 86 && 0 < a0 + 147) && !(4 == a2)) && !(3 == a2)) && 3 <= a2) && a29 <= 43)) || (a0 + 99 <= 0 && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44)))) || ((0 < a4 + 86 && a0 + 99 <= 0) && a2 == 3)) || ((a4 + 42 <= 0 && a2 == 4 && (0 < a4 + 86 && !(3 == a2)) && 3 <= a2) && (a2 == 5 || a0 + 147 <= 0))) || (a4 + 42 <= 0 && (\exists v_~a29~0_897 : int :: 0 <= v_~a29~0_897 && a29 <= v_~a29~0_897 % 299978 + 300021) && 0 < a29 + 16 && a0 + 98 <= 0 && a2 == 2 && 0 < a0 + 147) [2019-01-12 04:34:50,326 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((a2 == 4 && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 89 <= 0 && !(3 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 147) && !(3 == a2)))) && a29 <= 43) || (a0 + 98 <= 0 && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 89 <= 0 && !(3 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 147) && !(3 == a2))) && a2 == 2)) || ((0 < a29 + 16 && ((((0 <= a0 + 44 && !(3 == a2)) || (a4 + 89 <= 0 && !(3 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 147) && !(3 == a2))) && !(4 == a2)) && 3 <= a2) && a29 <= 43)) || ((a2 == 3 && a29 + 144 <= 0) && a4 + 86 <= 0)) || (((a4 + 42 <= 0 && a2 == 1) && (a2 == 5 || a0 + 147 <= 0)) && 43 < a29)) || ((a4 + 42 <= 0 && 0 < a4 + 86 && a2 == 2) && (a2 == 5 || a0 + 147 <= 0))) || ((a4 + 86 <= 0 && a29 + 144 <= 0) && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44)))) || (((!(4 == a2) && 3 <= a2) && a0 + 147 <= 0) && 43 < a29)) || ((a29 <= 280462 && ((((0 <= a0 + 44 && !(3 == a2)) || (a4 + 89 <= 0 && !(3 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 147) && !(3 == a2))) && !(4 == a2)) && 3 <= a2) && 43 < a29)) || ((a4 + 42 <= 0 && a2 == 5) && a29 <= 280462 && 0 < a29 + 16 && a0 + 98 <= 0 && (((0 < a4 + 86 && 0 < a0 + 147) && !(4 == a2)) && !(3 == a2)) && 3 <= a2)) || (((a0 + 98 <= 0 && 0 < a0 + 147) && 0 < a4 + 42) && a2 == 4)) || ((\exists v_~a29~0_897 : int :: 0 <= v_~a29~0_897 && a29 <= v_~a29~0_897 % 299978 + 300021) && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 89 <= 0 && !(3 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 147) && !(3 == a2))) && a2 == 2)) || (((((\exists v_~a29~0_897 : int :: 0 <= v_~a29~0_897 && a29 <= v_~a29~0_897 % 299978 + 300021) && a2 == 1 && 0 < a0 + 147) && a0 + 98 <= 0) && a4 + 42 <= 0) && 0 < a4 + 86)) || (a2 == 3 && a4 + 86 <= 0 && 0 < a0 + 147)) || (((a29 <= 43 && 0 < a29 + 144) && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44))) && ((a2 == 3 || a0 + 147 <= 0) || 0 < a0 + 98))) || ((((a4 + 42 <= 0 && a2 == 4) && a0 + 99 <= 0) && (0 < a4 + 86 && !(3 == a2)) && 3 <= a2) && 43 < a29)) || (a0 + 98 <= 0 && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 89 <= 0 && !(3 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 147) && !(3 == a2))) && 3 <= a2)) || (a4 + 42 <= 0 && ((a2 == 1 && a29 <= 43) && 0 < a29 + 144) && ((a2 == 3 || a0 + 147 <= 0) || 0 < a0 + 98))) || ((0 < a29 + 16 && a2 == 3) && a4 + 86 <= 0)) || ((a2 == 5 && a4 + 42 <= 0 && 0 < a29 + 16 && a0 + 98 <= 0 && (((0 < a4 + 86 && 0 < a0 + 147) && !(4 == a2)) && !(3 == a2)) && 3 <= a2) && !(2 == input))) || (((a4 + 42 <= 0 && a2 == 5) && 0 < a4 + 86) && a0 + 99 <= 0)) || ((a4 + 42 <= 0 && a2 == 5) && (a0 + 98 <= 0 && (((0 < a4 + 86 && 0 < a0 + 147) && !(4 == a2)) && !(3 == a2)) && 3 <= a2) && a29 <= 43)) || (a0 + 99 <= 0 && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44)))) || ((0 < a4 + 86 && a0 + 99 <= 0) && a2 == 3)) || ((a4 + 42 <= 0 && a2 == 4 && (0 < a4 + 86 && !(3 == a2)) && 3 <= a2) && (a2 == 5 || a0 + 147 <= 0))) || (a4 + 42 <= 0 && (\exists v_~a29~0_897 : int :: 0 <= v_~a29~0_897 && a29 <= v_~a29~0_897 % 299978 + 300021) && 0 < a29 + 16 && a0 + 98 <= 0 && a2 == 2 && 0 < a0 + 147) [2019-01-12 04:34:50,349 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((a2 == 2 && a4 + 42 <= 0) && 0 < a4 + 86) && (a2 == 5 || a0 + 147 <= 0)) || ((a29 + 144 <= 0 && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44))) && a0 + 61 <= 0)) || ((a4 + 42 <= 0 && 0 < a4 + 86) && ((\exists v_~a29~0_897 : int :: 0 <= v_~a29~0_897 && a29 <= v_~a29~0_897 % 299978 + 300021) && a0 + 98 <= 0 && a2 == 1) && 0 < a0 + 147)) || (((a4 + 42 <= 0 && a2 == 5) && 0 < a4 + 86) && a0 + 99 <= 0)) || ((a2 == 3 && a29 + 144 <= 0) && a4 + 86 <= 0)) || (a0 + 99 <= 0 && 0 < a4 + 86 && a2 == 3)) || ((((a4 + 42 <= 0 && a2 == 5) && !(2 == input)) && !(2 == input)) && a0 + 98 <= 0 && 0 < a0 + 147)) || ((((a4 + 42 <= 0 && a2 == 4) && a0 + 99 <= 0) && 0 < a4 + 86) && 43 < a29)) || ((((\exists v_~a29~0_897 : int :: 0 <= v_~a29~0_897 && a29 <= v_~a29~0_897 % 299978 + 300021) && 0 < a29 + 16 && a0 + 98 <= 0 && 0 < a0 + 147) && a2 == 2) && a4 + 42 <= 0)) || ((a4 + 42 <= 0 && a2 == 1 && 0 < a29 + 144) && (a2 == 5 || a0 + 147 <= 0))) || ((0 < a29 + 16 && a2 == 3) && a4 + 86 <= 0)) || (0 < a0 + 98 && (a29 <= 43 && 0 < a29 + 144) && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44)))) || (((a2 == 4 && a4 + 42 <= 0) && 0 < a4 + 86) && (a2 == 5 || a0 + 147 <= 0))) || (a2 == 3 && a4 + 86 <= 0 && 0 < a0 + 147)) || (a2 == 4 && 0 < a4 + 42 && a0 + 98 <= 0 && 0 < a0 + 147)) || (((((0 <= a0 + 44 && !(3 == a2)) || (a4 + 89 <= 0 && !(3 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 147) && !(3 == a2))) && a2 == 4) && a29 <= 43)) || (a4 + 42 <= 0 && ((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144)) || (((a0 + 147 <= 0 && !(4 == a2)) && 3 <= a2) && 43 < a29)) || ((((((0 <= a0 + 44 && !(3 == a2)) || (a4 + 89 <= 0 && !(3 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 147) && !(3 == a2))) && 0 < a29 + 16) && a29 <= 43) && 3 <= a2)) || ((a0 + 98 <= 0 && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 89 <= 0 && !(3 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 147) && !(3 == a2)))) && 3 <= a2)) || ((\exists v_~a29~0_897 : int :: 0 <= v_~a29~0_897 && a29 <= v_~a29~0_897 % 299978 + 300021) && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 89 <= 0 && !(3 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 147) && !(3 == a2))) && a2 == 2)) || ((((a29 <= 280462 && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 89 <= 0 && !(3 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 147) && !(3 == a2)))) && !(4 == a2)) && 3 <= a2) && 43 < a29)) || (a0 + 99 <= 0 && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44)))) || ((a0 + 98 <= 0 && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 89 <= 0 && !(3 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 147) && !(3 == a2)))) && a2 == 2) [2019-01-12 04:34:50,554 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 04:34:50,554 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 04:34:50,555 INFO L168 Benchmark]: Toolchain (without parser) took 313384.34 ms. Allocated memory was 1.0 GB in the beginning and 3.7 GB in the end (delta: 2.6 GB). Free memory was 947.3 MB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-01-12 04:34:50,557 INFO L168 Benchmark]: CDTParser took 0.16 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 04:34:50,557 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1517.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.9 MB). Free memory was 947.3 MB in the beginning and 1.2 GB in the end (delta: -207.2 MB). Peak memory consumption was 139.7 MB. Max. memory is 11.5 GB. [2019-01-12 04:34:50,558 INFO L168 Benchmark]: Boogie Procedure Inliner took 215.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. [2019-01-12 04:34:50,558 INFO L168 Benchmark]: Boogie Preprocessor took 215.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-12 04:34:50,558 INFO L168 Benchmark]: RCFGBuilder took 6932.84 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 87.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -102.8 MB). Peak memory consumption was 310.4 MB. Max. memory is 11.5 GB. [2019-01-12 04:34:50,558 INFO L168 Benchmark]: TraceAbstraction took 304146.87 ms. Allocated memory was 1.3 GB in the beginning and 3.7 GB in the end (delta: 2.4 GB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2019-01-12 04:34:50,562 INFO L168 Benchmark]: Witness Printer took 350.30 ms. Allocated memory is still 3.7 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 11.5 GB. [2019-01-12 04:34:50,564 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.16 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 1517.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.9 MB). Free memory was 947.3 MB in the beginning and 1.2 GB in the end (delta: -207.2 MB). Peak memory consumption was 139.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 215.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 215.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 6932.84 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 87.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -102.8 MB). Peak memory consumption was 310.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 304146.87 ms. Allocated memory was 1.3 GB in the beginning and 3.7 GB in the end (delta: 2.4 GB). Free memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. * Witness Printer took 350.30 ms. Allocated memory is still 3.7 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 56.3 MB). Peak memory consumption was 56.3 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_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 160]: 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: 1766]: Loop Invariant [2019-01-12 04:34:50,571 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,572 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,572 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,572 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,572 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,572 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,582 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,582 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,585 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,585 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,585 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,586 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((a2 == 4 && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 89 <= 0 && !(3 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 147) && !(3 == a2)))) && a29 <= 43) || (a0 + 98 <= 0 && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 89 <= 0 && !(3 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 147) && !(3 == a2))) && a2 == 2)) || ((0 < a29 + 16 && ((((0 <= a0 + 44 && !(3 == a2)) || (a4 + 89 <= 0 && !(3 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 147) && !(3 == a2))) && !(4 == a2)) && 3 <= a2) && a29 <= 43)) || ((a2 == 3 && a29 + 144 <= 0) && a4 + 86 <= 0)) || (((a4 + 42 <= 0 && a2 == 1) && (a2 == 5 || a0 + 147 <= 0)) && 43 < a29)) || ((a4 + 42 <= 0 && 0 < a4 + 86 && a2 == 2) && (a2 == 5 || a0 + 147 <= 0))) || ((a4 + 86 <= 0 && a29 + 144 <= 0) && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44)))) || (((!(4 == a2) && 3 <= a2) && a0 + 147 <= 0) && 43 < a29)) || ((a29 <= 280462 && ((((0 <= a0 + 44 && !(3 == a2)) || (a4 + 89 <= 0 && !(3 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 147) && !(3 == a2))) && !(4 == a2)) && 3 <= a2) && 43 < a29)) || ((a4 + 42 <= 0 && a2 == 5) && a29 <= 280462 && 0 < a29 + 16 && a0 + 98 <= 0 && (((0 < a4 + 86 && 0 < a0 + 147) && !(4 == a2)) && !(3 == a2)) && 3 <= a2)) || (((a0 + 98 <= 0 && 0 < a0 + 147) && 0 < a4 + 42) && a2 == 4)) || ((\exists v_~a29~0_897 : int :: 0 <= v_~a29~0_897 && a29 <= v_~a29~0_897 % 299978 + 300021) && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 89 <= 0 && !(3 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 147) && !(3 == a2))) && a2 == 2)) || (((((\exists v_~a29~0_897 : int :: 0 <= v_~a29~0_897 && a29 <= v_~a29~0_897 % 299978 + 300021) && a2 == 1 && 0 < a0 + 147) && a0 + 98 <= 0) && a4 + 42 <= 0) && 0 < a4 + 86)) || (a2 == 3 && a4 + 86 <= 0 && 0 < a0 + 147)) || (((a29 <= 43 && 0 < a29 + 144) && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44))) && ((a2 == 3 || a0 + 147 <= 0) || 0 < a0 + 98))) || ((((a4 + 42 <= 0 && a2 == 4) && a0 + 99 <= 0) && (0 < a4 + 86 && !(3 == a2)) && 3 <= a2) && 43 < a29)) || (a0 + 98 <= 0 && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 89 <= 0 && !(3 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 147) && !(3 == a2))) && 3 <= a2)) || (a4 + 42 <= 0 && ((a2 == 1 && a29 <= 43) && 0 < a29 + 144) && ((a2 == 3 || a0 + 147 <= 0) || 0 < a0 + 98))) || ((0 < a29 + 16 && a2 == 3) && a4 + 86 <= 0)) || ((a2 == 5 && a4 + 42 <= 0 && 0 < a29 + 16 && a0 + 98 <= 0 && (((0 < a4 + 86 && 0 < a0 + 147) && !(4 == a2)) && !(3 == a2)) && 3 <= a2) && !(2 == input))) || (((a4 + 42 <= 0 && a2 == 5) && 0 < a4 + 86) && a0 + 99 <= 0)) || ((a4 + 42 <= 0 && a2 == 5) && (a0 + 98 <= 0 && (((0 < a4 + 86 && 0 < a0 + 147) && !(4 == a2)) && !(3 == a2)) && 3 <= a2) && a29 <= 43)) || (a0 + 99 <= 0 && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44)))) || ((0 < a4 + 86 && a0 + 99 <= 0) && a2 == 3)) || ((a4 + 42 <= 0 && a2 == 4 && (0 < a4 + 86 && !(3 == a2)) && 3 <= a2) && (a2 == 5 || a0 + 147 <= 0))) || (a4 + 42 <= 0 && (\exists v_~a29~0_897 : int :: 0 <= v_~a29~0_897 && a29 <= v_~a29~0_897 % 299978 + 300021) && 0 < a29 + 16 && a0 + 98 <= 0 && a2 == 2 && 0 < a0 + 147) - InvariantResult [Line: 23]: Loop Invariant [2019-01-12 04:34:50,587 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,587 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,587 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,591 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,591 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,591 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,592 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,595 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,595 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,595 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,596 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,596 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((a2 == 4 && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 89 <= 0 && !(3 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 147) && !(3 == a2)))) && a29 <= 43) || (a0 + 98 <= 0 && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 89 <= 0 && !(3 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 147) && !(3 == a2))) && a2 == 2)) || ((0 < a29 + 16 && ((((0 <= a0 + 44 && !(3 == a2)) || (a4 + 89 <= 0 && !(3 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 147) && !(3 == a2))) && !(4 == a2)) && 3 <= a2) && a29 <= 43)) || ((a2 == 3 && a29 + 144 <= 0) && a4 + 86 <= 0)) || (((a4 + 42 <= 0 && a2 == 1) && (a2 == 5 || a0 + 147 <= 0)) && 43 < a29)) || ((a4 + 42 <= 0 && 0 < a4 + 86 && a2 == 2) && (a2 == 5 || a0 + 147 <= 0))) || ((a4 + 86 <= 0 && a29 + 144 <= 0) && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44)))) || (((!(4 == a2) && 3 <= a2) && a0 + 147 <= 0) && 43 < a29)) || ((a29 <= 280462 && ((((0 <= a0 + 44 && !(3 == a2)) || (a4 + 89 <= 0 && !(3 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 147) && !(3 == a2))) && !(4 == a2)) && 3 <= a2) && 43 < a29)) || ((a4 + 42 <= 0 && a2 == 5) && a29 <= 280462 && 0 < a29 + 16 && a0 + 98 <= 0 && (((0 < a4 + 86 && 0 < a0 + 147) && !(4 == a2)) && !(3 == a2)) && 3 <= a2)) || (((a0 + 98 <= 0 && 0 < a0 + 147) && 0 < a4 + 42) && a2 == 4)) || ((\exists v_~a29~0_897 : int :: 0 <= v_~a29~0_897 && a29 <= v_~a29~0_897 % 299978 + 300021) && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 89 <= 0 && !(3 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 147) && !(3 == a2))) && a2 == 2)) || (((((\exists v_~a29~0_897 : int :: 0 <= v_~a29~0_897 && a29 <= v_~a29~0_897 % 299978 + 300021) && a2 == 1 && 0 < a0 + 147) && a0 + 98 <= 0) && a4 + 42 <= 0) && 0 < a4 + 86)) || (a2 == 3 && a4 + 86 <= 0 && 0 < a0 + 147)) || (((a29 <= 43 && 0 < a29 + 144) && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44))) && ((a2 == 3 || a0 + 147 <= 0) || 0 < a0 + 98))) || ((((a4 + 42 <= 0 && a2 == 4) && a0 + 99 <= 0) && (0 < a4 + 86 && !(3 == a2)) && 3 <= a2) && 43 < a29)) || (a0 + 98 <= 0 && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 89 <= 0 && !(3 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 147) && !(3 == a2))) && 3 <= a2)) || (a4 + 42 <= 0 && ((a2 == 1 && a29 <= 43) && 0 < a29 + 144) && ((a2 == 3 || a0 + 147 <= 0) || 0 < a0 + 98))) || ((0 < a29 + 16 && a2 == 3) && a4 + 86 <= 0)) || ((a2 == 5 && a4 + 42 <= 0 && 0 < a29 + 16 && a0 + 98 <= 0 && (((0 < a4 + 86 && 0 < a0 + 147) && !(4 == a2)) && !(3 == a2)) && 3 <= a2) && !(2 == input))) || (((a4 + 42 <= 0 && a2 == 5) && 0 < a4 + 86) && a0 + 99 <= 0)) || ((a4 + 42 <= 0 && a2 == 5) && (a0 + 98 <= 0 && (((0 < a4 + 86 && 0 < a0 + 147) && !(4 == a2)) && !(3 == a2)) && 3 <= a2) && a29 <= 43)) || (a0 + 99 <= 0 && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44)))) || ((0 < a4 + 86 && a0 + 99 <= 0) && a2 == 3)) || ((a4 + 42 <= 0 && a2 == 4 && (0 < a4 + 86 && !(3 == a2)) && 3 <= a2) && (a2 == 5 || a0 + 147 <= 0))) || (a4 + 42 <= 0 && (\exists v_~a29~0_897 : int :: 0 <= v_~a29~0_897 && a29 <= v_~a29~0_897 % 299978 + 300021) && 0 < a29 + 16 && a0 + 98 <= 0 && a2 == 2 && 0 < a0 + 147) - InvariantResult [Line: 1658]: Loop Invariant [2019-01-12 04:34:50,597 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,597 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,598 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,604 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,604 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,604 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,605 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,606 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,606 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,606 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,607 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-01-12 04:34:50,607 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((a2 == 2 && a4 + 42 <= 0) && 0 < a4 + 86) && (a2 == 5 || a0 + 147 <= 0)) || ((a29 + 144 <= 0 && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44))) && a0 + 61 <= 0)) || ((a4 + 42 <= 0 && 0 < a4 + 86) && ((\exists v_~a29~0_897 : int :: 0 <= v_~a29~0_897 && a29 <= v_~a29~0_897 % 299978 + 300021) && a0 + 98 <= 0 && a2 == 1) && 0 < a0 + 147)) || (((a4 + 42 <= 0 && a2 == 5) && 0 < a4 + 86) && a0 + 99 <= 0)) || ((a2 == 3 && a29 + 144 <= 0) && a4 + 86 <= 0)) || (a0 + 99 <= 0 && 0 < a4 + 86 && a2 == 3)) || ((((a4 + 42 <= 0 && a2 == 5) && !(2 == input)) && !(2 == input)) && a0 + 98 <= 0 && 0 < a0 + 147)) || ((((a4 + 42 <= 0 && a2 == 4) && a0 + 99 <= 0) && 0 < a4 + 86) && 43 < a29)) || ((((\exists v_~a29~0_897 : int :: 0 <= v_~a29~0_897 && a29 <= v_~a29~0_897 % 299978 + 300021) && 0 < a29 + 16 && a0 + 98 <= 0 && 0 < a0 + 147) && a2 == 2) && a4 + 42 <= 0)) || ((a4 + 42 <= 0 && a2 == 1 && 0 < a29 + 144) && (a2 == 5 || a0 + 147 <= 0))) || ((0 < a29 + 16 && a2 == 3) && a4 + 86 <= 0)) || (0 < a0 + 98 && (a29 <= 43 && 0 < a29 + 144) && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44)))) || (((a2 == 4 && a4 + 42 <= 0) && 0 < a4 + 86) && (a2 == 5 || a0 + 147 <= 0))) || (a2 == 3 && a4 + 86 <= 0 && 0 < a0 + 147)) || (a2 == 4 && 0 < a4 + 42 && a0 + 98 <= 0 && 0 < a0 + 147)) || (((((0 <= a0 + 44 && !(3 == a2)) || (a4 + 89 <= 0 && !(3 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 147) && !(3 == a2))) && a2 == 4) && a29 <= 43)) || (a4 + 42 <= 0 && ((a2 == 1 && 0 < a4 + 86) && a29 <= 43) && 0 < a29 + 144)) || (((a0 + 147 <= 0 && !(4 == a2)) && 3 <= a2) && 43 < a29)) || ((((((0 <= a0 + 44 && !(3 == a2)) || (a4 + 89 <= 0 && !(3 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 147) && !(3 == a2))) && 0 < a29 + 16) && a29 <= 43) && 3 <= a2)) || ((a0 + 98 <= 0 && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 89 <= 0 && !(3 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 147) && !(3 == a2)))) && 3 <= a2)) || ((\exists v_~a29~0_897 : int :: 0 <= v_~a29~0_897 && a29 <= v_~a29~0_897 % 299978 + 300021) && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 89 <= 0 && !(3 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 147) && !(3 == a2))) && a2 == 2)) || ((((a29 <= 280462 && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 89 <= 0 && !(3 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 147) && !(3 == a2)))) && !(4 == a2)) && 3 <= a2) && 43 < a29)) || (a0 + 99 <= 0 && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44)))) || ((a0 + 98 <= 0 && (((0 <= a0 + 44 && !(3 == a2)) || (a4 + 89 <= 0 && !(3 == a2))) || ((a4 + 86 <= 0 && 0 < a0 + 147) && !(3 == a2)))) && a2 == 2) - InvariantResult [Line: 1760]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. SAFE Result, 303.9s OverallTime, 17 OverallIterations, 7 TraceHistogramMax, 140.2s AutomataDifference, 0.0s DeadEndRemovalTime, 128.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 3542 SDtfs, 23998 SDslu, 2230 SDs, 0 SdLazy, 72054 SolverSat, 5853 SolverUnsat, 22 SolverUnknown, 0 SolverNotchecked, 112.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4835 GetRequests, 4650 SyntacticMatches, 22 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1347 ImplicationChecksByTransitivity, 18.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10497occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 17 MinimizatonAttempts, 48010 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 260 NumberOfFragments, 2430 HoareAnnotationTreeSize, 4 FomulaSimplifications, 2442951 FormulaSimplificationTreeSizeReduction, 5.8s HoareSimplificationTime, 4 FomulaSimplificationsInter, 2357435 FormulaSimplificationTreeSizeReductionInter, 123.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 18.3s InterpolantComputationTime, 15469 NumberOfCodeBlocks, 15469 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 15445 ConstructedInterpolants, 395 QuantifiedInterpolants, 66270363 SizeOfPredicates, 9 NumberOfNonLiveVariables, 5336 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 24 InterpolantComputations, 13 PerfectInterpolantSequences, 16894/17869 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...