./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem15_label28_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_label28_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 135f975c9db1c9341bb4a70ce00cbfa1e1ef94a6 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:34:43,136 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 04:34:43,137 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 04:34:43,154 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 04:34:43,155 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 04:34:43,156 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 04:34:43,158 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 04:34:43,160 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 04:34:43,162 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 04:34:43,163 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 04:34:43,163 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 04:34:43,164 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 04:34:43,165 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 04:34:43,165 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 04:34:43,167 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 04:34:43,168 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 04:34:43,169 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 04:34:43,170 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 04:34:43,172 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 04:34:43,174 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 04:34:43,175 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 04:34:43,176 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 04:34:43,179 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 04:34:43,179 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 04:34:43,179 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 04:34:43,181 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 04:34:43,182 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 04:34:43,182 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 04:34:43,183 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 04:34:43,184 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 04:34:43,185 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 04:34:43,185 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 04:34:43,186 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 04:34:43,186 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 04:34:43,187 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 04:34:43,187 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 04:34:43,188 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:34:43,202 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 04:34:43,203 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 04:34:43,204 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 04:34:43,204 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 04:34:43,204 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 04:34:43,204 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 04:34:43,205 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 04:34:43,205 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 04:34:43,205 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 04:34:43,205 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 04:34:43,205 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 04:34:43,205 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 04:34:43,206 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 04:34:43,206 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 04:34:43,206 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 04:34:43,206 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 04:34:43,206 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 04:34:43,206 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 04:34:43,207 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 04:34:43,207 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 04:34:43,207 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 04:34:43,207 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 04:34:43,207 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 04:34:43,208 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 04:34:43,208 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 04:34:43,208 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 04:34:43,208 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 04:34:43,208 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 04:34:43,208 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 -> 135f975c9db1c9341bb4a70ce00cbfa1e1ef94a6 [2019-01-12 04:34:43,245 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 04:34:43,262 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 04:34:43,268 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 04:34:43,269 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 04:34:43,270 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 04:34:43,271 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem15_label28_true-unreach-call.c [2019-01-12 04:34:43,335 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1089a6fc/7d4e9e7c89d34ddba3394bd4e0c3e38b/FLAGf53c0995c [2019-01-12 04:34:43,944 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 04:34:43,945 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem15_label28_true-unreach-call.c [2019-01-12 04:34:43,963 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1089a6fc/7d4e9e7c89d34ddba3394bd4e0c3e38b/FLAGf53c0995c [2019-01-12 04:34:44,111 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1089a6fc/7d4e9e7c89d34ddba3394bd4e0c3e38b [2019-01-12 04:34:44,115 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 04:34:44,117 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 04:34:44,120 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 04:34:44,120 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 04:34:44,125 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 04:34:44,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:34:44" (1/1) ... [2019-01-12 04:34:44,129 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f0e8c39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:34:44, skipping insertion in model container [2019-01-12 04:34:44,130 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:34:44" (1/1) ... [2019-01-12 04:34:44,137 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 04:34:44,221 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 04:34:45,124 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:34:45,130 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 04:34:45,536 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:34:45,564 INFO L195 MainTranslator]: Completed translation [2019-01-12 04:34:45,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:34:45 WrapperNode [2019-01-12 04:34:45,565 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 04:34:45,567 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 04:34:45,567 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 04:34:45,567 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 04:34:45,713 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:34:45" (1/1) ... [2019-01-12 04:34:45,774 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:34:45" (1/1) ... [2019-01-12 04:34:45,926 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 04:34:45,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 04:34:45,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 04:34:45,927 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 04:34:45,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:34:45" (1/1) ... [2019-01-12 04:34:45,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:34:45" (1/1) ... [2019-01-12 04:34:45,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:34:45" (1/1) ... [2019-01-12 04:34:45,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:34:45" (1/1) ... [2019-01-12 04:34:46,027 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:34:45" (1/1) ... [2019-01-12 04:34:46,053 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:34:45" (1/1) ... [2019-01-12 04:34:46,095 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:34:45" (1/1) ... [2019-01-12 04:34:46,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 04:34:46,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 04:34:46,128 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 04:34:46,128 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 04:34:46,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:34:45" (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:34:46,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 04:34:46,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 04:34:52,501 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 04:34:52,502 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-12 04:34:52,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:34:52 BoogieIcfgContainer [2019-01-12 04:34:52,503 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 04:34:52,573 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 04:34:52,574 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 04:34:52,577 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 04:34:52,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 04:34:44" (1/3) ... [2019-01-12 04:34:52,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e956fad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:34:52, skipping insertion in model container [2019-01-12 04:34:52,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:34:45" (2/3) ... [2019-01-12 04:34:52,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e956fad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:34:52, skipping insertion in model container [2019-01-12 04:34:52,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:34:52" (3/3) ... [2019-01-12 04:34:52,580 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label28_true-unreach-call.c [2019-01-12 04:34:52,596 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 04:34:52,607 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 04:34:52,625 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 04:34:52,671 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 04:34:52,672 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 04:34:52,673 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 04:34:52,673 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 04:34:52,673 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 04:34:52,673 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 04:34:52,673 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 04:34:52,673 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 04:34:52,674 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 04:34:52,716 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-01-12 04:34:52,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-12 04:34:52,722 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:34:52,723 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] [2019-01-12 04:34:52,725 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:34:52,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:34:52,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1317301102, now seen corresponding path program 1 times [2019-01-12 04:34:52,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:34:52,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:34:52,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:52,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:34:52,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:34:53,211 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:34:53,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:34:53,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:34:53,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:34:53,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:34:53,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:34:53,236 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-01-12 04:34:59,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:34:59,162 INFO L93 Difference]: Finished difference Result 1468 states and 2718 transitions. [2019-01-12 04:34:59,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:34:59,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-01-12 04:34:59,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:34:59,193 INFO L225 Difference]: With dead ends: 1468 [2019-01-12 04:34:59,193 INFO L226 Difference]: Without dead ends: 977 [2019-01-12 04:34:59,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:34:59,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2019-01-12 04:34:59,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 973. [2019-01-12 04:34:59,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2019-01-12 04:34:59,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1487 transitions. [2019-01-12 04:34:59,309 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1487 transitions. Word has length 32 [2019-01-12 04:34:59,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:34:59,310 INFO L480 AbstractCegarLoop]: Abstraction has 973 states and 1487 transitions. [2019-01-12 04:34:59,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:34:59,310 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1487 transitions. [2019-01-12 04:34:59,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-01-12 04:34:59,318 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:34:59,319 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:59,319 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:34:59,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:34:59,321 INFO L82 PathProgramCache]: Analyzing trace with hash 2019188173, now seen corresponding path program 1 times [2019-01-12 04:34:59,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:34:59,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:34:59,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:59,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:34:59,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:34:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:34:59,857 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:34:59,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:34:59,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:34:59,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:34:59,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:34:59,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:34:59,861 INFO L87 Difference]: Start difference. First operand 973 states and 1487 transitions. Second operand 4 states. [2019-01-12 04:35:04,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:35:04,760 INFO L93 Difference]: Finished difference Result 3746 states and 5750 transitions. [2019-01-12 04:35:04,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:35:04,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-01-12 04:35:04,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:35:04,776 INFO L225 Difference]: With dead ends: 3746 [2019-01-12 04:35:04,776 INFO L226 Difference]: Without dead ends: 2775 [2019-01-12 04:35:04,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:35:04,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2775 states. [2019-01-12 04:35:04,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2775 to 1872. [2019-01-12 04:35:04,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1872 states. [2019-01-12 04:35:04,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 2495 transitions. [2019-01-12 04:35:04,838 INFO L78 Accepts]: Start accepts. Automaton has 1872 states and 2495 transitions. Word has length 151 [2019-01-12 04:35:04,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:35:04,844 INFO L480 AbstractCegarLoop]: Abstraction has 1872 states and 2495 transitions. [2019-01-12 04:35:04,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:35:04,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 2495 transitions. [2019-01-12 04:35:04,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-01-12 04:35:04,858 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:35:04,858 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:04,858 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:35:04,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:35:04,859 INFO L82 PathProgramCache]: Analyzing trace with hash 516991842, now seen corresponding path program 1 times [2019-01-12 04:35:04,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:35:04,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:35:04,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:04,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:04,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:05,480 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-01-12 04:35:05,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:35:05,483 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:35:05,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:05,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:35:05,764 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-12 04:35:05,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:35:05,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-01-12 04:35:05,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:35:05,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:35:05,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:35:05,798 INFO L87 Difference]: Start difference. First operand 1872 states and 2495 transitions. Second operand 4 states. [2019-01-12 04:35:13,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:35:13,005 INFO L93 Difference]: Finished difference Result 7037 states and 9243 transitions. [2019-01-12 04:35:13,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:35:13,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 228 [2019-01-12 04:35:13,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:35:13,031 INFO L225 Difference]: With dead ends: 7037 [2019-01-12 04:35:13,032 INFO L226 Difference]: Without dead ends: 5167 [2019-01-12 04:35:13,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 228 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:35:13,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5167 states. [2019-01-12 04:35:13,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5167 to 3070. [2019-01-12 04:35:13,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3070 states. [2019-01-12 04:35:13,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3070 states to 3070 states and 3984 transitions. [2019-01-12 04:35:13,113 INFO L78 Accepts]: Start accepts. Automaton has 3070 states and 3984 transitions. Word has length 228 [2019-01-12 04:35:13,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:35:13,114 INFO L480 AbstractCegarLoop]: Abstraction has 3070 states and 3984 transitions. [2019-01-12 04:35:13,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:35:13,114 INFO L276 IsEmpty]: Start isEmpty. Operand 3070 states and 3984 transitions. [2019-01-12 04:35:13,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-01-12 04:35:13,121 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:35:13,122 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:35:13,122 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:35:13,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:35:13,122 INFO L82 PathProgramCache]: Analyzing trace with hash 78183249, now seen corresponding path program 1 times [2019-01-12 04:35:13,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:35:13,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:35:13,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:13,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:13,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:13,750 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2019-01-12 04:35:14,106 WARN L181 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2019-01-12 04:35:14,483 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-01-12 04:35:14,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:35:14,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:35:14,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:35:14,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:35:14,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:35:14,486 INFO L87 Difference]: Start difference. First operand 3070 states and 3984 transitions. Second operand 5 states. [2019-01-12 04:35:19,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:35:19,011 INFO L93 Difference]: Finished difference Result 7037 states and 8945 transitions. [2019-01-12 04:35:19,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:35:19,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 310 [2019-01-12 04:35:19,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:35:19,031 INFO L225 Difference]: With dead ends: 7037 [2019-01-12 04:35:19,031 INFO L226 Difference]: Without dead ends: 3969 [2019-01-12 04:35:19,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:35:19,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3969 states. [2019-01-12 04:35:19,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3969 to 3669. [2019-01-12 04:35:19,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3669 states. [2019-01-12 04:35:19,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3669 states to 3669 states and 4613 transitions. [2019-01-12 04:35:19,100 INFO L78 Accepts]: Start accepts. Automaton has 3669 states and 4613 transitions. Word has length 310 [2019-01-12 04:35:19,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:35:19,101 INFO L480 AbstractCegarLoop]: Abstraction has 3669 states and 4613 transitions. [2019-01-12 04:35:19,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:35:19,102 INFO L276 IsEmpty]: Start isEmpty. Operand 3669 states and 4613 transitions. [2019-01-12 04:35:19,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2019-01-12 04:35:19,109 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:35:19,110 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:35:19,110 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:35:19,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:35:19,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1647724765, now seen corresponding path program 1 times [2019-01-12 04:35:19,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:35:19,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:35:19,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:19,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:19,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:19,662 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:35:19,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:35:19,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:35:19,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:35:19,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:35:19,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:35:19,664 INFO L87 Difference]: Start difference. First operand 3669 states and 4613 transitions. Second operand 4 states. [2019-01-12 04:35:23,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:35:23,190 INFO L93 Difference]: Finished difference Result 9136 states and 11700 transitions. [2019-01-12 04:35:23,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:35:23,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 384 [2019-01-12 04:35:23,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:35:23,213 INFO L225 Difference]: With dead ends: 9136 [2019-01-12 04:35:23,214 INFO L226 Difference]: Without dead ends: 5469 [2019-01-12 04:35:23,220 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:35:23,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5469 states. [2019-01-12 04:35:23,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5469 to 5466. [2019-01-12 04:35:23,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5466 states. [2019-01-12 04:35:23,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5466 states to 5466 states and 6724 transitions. [2019-01-12 04:35:23,319 INFO L78 Accepts]: Start accepts. Automaton has 5466 states and 6724 transitions. Word has length 384 [2019-01-12 04:35:23,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:35:23,319 INFO L480 AbstractCegarLoop]: Abstraction has 5466 states and 6724 transitions. [2019-01-12 04:35:23,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:35:23,320 INFO L276 IsEmpty]: Start isEmpty. Operand 5466 states and 6724 transitions. [2019-01-12 04:35:23,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-01-12 04:35:23,328 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:35:23,329 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 04:35:23,329 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:35:23,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:35:23,330 INFO L82 PathProgramCache]: Analyzing trace with hash 624859565, now seen corresponding path program 1 times [2019-01-12 04:35:23,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:35:23,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:35:23,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:23,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:23,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:24,008 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 7 [2019-01-12 04:35:24,256 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-01-12 04:35:24,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:35:24,257 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:35:24,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:24,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:35:24,829 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 17 [2019-01-12 04:35:25,247 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 135 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:35:25,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:35:25,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-01-12 04:35:25,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 04:35:25,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 04:35:25,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:35:25,277 INFO L87 Difference]: Start difference. First operand 5466 states and 6724 transitions. Second operand 7 states. [2019-01-12 04:35:39,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:35:39,282 INFO L93 Difference]: Finished difference Result 22985 states and 29147 transitions. [2019-01-12 04:35:39,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 04:35:39,283 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 409 [2019-01-12 04:35:39,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:35:39,339 INFO L225 Difference]: With dead ends: 22985 [2019-01-12 04:35:39,339 INFO L226 Difference]: Without dead ends: 17521 [2019-01-12 04:35:39,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 415 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-01-12 04:35:39,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17521 states. [2019-01-12 04:35:39,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17521 to 12358. [2019-01-12 04:35:39,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12358 states. [2019-01-12 04:35:39,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12358 states to 12358 states and 14670 transitions. [2019-01-12 04:35:39,594 INFO L78 Accepts]: Start accepts. Automaton has 12358 states and 14670 transitions. Word has length 409 [2019-01-12 04:35:39,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:35:39,595 INFO L480 AbstractCegarLoop]: Abstraction has 12358 states and 14670 transitions. [2019-01-12 04:35:39,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 04:35:39,595 INFO L276 IsEmpty]: Start isEmpty. Operand 12358 states and 14670 transitions. [2019-01-12 04:35:39,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2019-01-12 04:35:39,611 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:35:39,612 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 04:35:39,612 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:35:39,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:35:39,612 INFO L82 PathProgramCache]: Analyzing trace with hash -700133404, now seen corresponding path program 1 times [2019-01-12 04:35:39,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:35:39,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:35:39,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:39,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:39,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:39,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:40,295 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 411 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2019-01-12 04:35:40,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:35:40,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 04:35:40,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 04:35:40,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 04:35:40,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:35:40,297 INFO L87 Difference]: Start difference. First operand 12358 states and 14670 transitions. Second operand 6 states. [2019-01-12 04:35:45,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:35:45,234 INFO L93 Difference]: Finished difference Result 25171 states and 29819 transitions. [2019-01-12 04:35:45,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:35:45,238 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 521 [2019-01-12 04:35:45,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:35:45,263 INFO L225 Difference]: With dead ends: 25171 [2019-01-12 04:35:45,263 INFO L226 Difference]: Without dead ends: 12815 [2019-01-12 04:35:45,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:35:45,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12815 states. [2019-01-12 04:35:45,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12815 to 12657. [2019-01-12 04:35:45,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12657 states. [2019-01-12 04:35:45,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12657 states to 12657 states and 14459 transitions. [2019-01-12 04:35:45,484 INFO L78 Accepts]: Start accepts. Automaton has 12657 states and 14459 transitions. Word has length 521 [2019-01-12 04:35:45,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:35:45,486 INFO L480 AbstractCegarLoop]: Abstraction has 12657 states and 14459 transitions. [2019-01-12 04:35:45,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 04:35:45,487 INFO L276 IsEmpty]: Start isEmpty. Operand 12657 states and 14459 transitions. [2019-01-12 04:35:45,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2019-01-12 04:35:45,504 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:35:45,505 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 04:35:45,505 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:35:45,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:35:45,506 INFO L82 PathProgramCache]: Analyzing trace with hash -440448350, now seen corresponding path program 1 times [2019-01-12 04:35:45,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:35:45,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:35:45,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:45,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:45,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:46,209 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-12 04:35:46,878 WARN L181 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 19 [2019-01-12 04:35:47,450 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 523 proven. 3 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-12 04:35:47,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:35:47,451 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:35:47,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:47,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:35:47,864 INFO L134 CoverageAnalysis]: Checked inductivity of 662 backedges. 542 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-01-12 04:35:47,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:35:47,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-01-12 04:35:47,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 04:35:47,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 04:35:47,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:35:47,904 INFO L87 Difference]: Start difference. First operand 12657 states and 14459 transitions. Second operand 8 states. [2019-01-12 04:35:48,792 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 17 [2019-01-12 04:35:54,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:35:54,030 INFO L93 Difference]: Finished difference Result 28263 states and 31969 transitions. [2019-01-12 04:35:54,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 04:35:54,037 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 533 [2019-01-12 04:35:54,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:35:54,058 INFO L225 Difference]: With dead ends: 28263 [2019-01-12 04:35:54,058 INFO L226 Difference]: Without dead ends: 12956 [2019-01-12 04:35:54,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 536 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2019-01-12 04:35:54,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12956 states. [2019-01-12 04:35:54,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12956 to 12657. [2019-01-12 04:35:54,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12657 states. [2019-01-12 04:35:54,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12657 states to 12657 states and 13848 transitions. [2019-01-12 04:35:54,274 INFO L78 Accepts]: Start accepts. Automaton has 12657 states and 13848 transitions. Word has length 533 [2019-01-12 04:35:54,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:35:54,274 INFO L480 AbstractCegarLoop]: Abstraction has 12657 states and 13848 transitions. [2019-01-12 04:35:54,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 04:35:54,275 INFO L276 IsEmpty]: Start isEmpty. Operand 12657 states and 13848 transitions. [2019-01-12 04:35:54,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2019-01-12 04:35:54,284 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:35:54,285 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:54,286 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:35:54,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:35:54,286 INFO L82 PathProgramCache]: Analyzing trace with hash -214644711, now seen corresponding path program 1 times [2019-01-12 04:35:54,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:35:54,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:35:54,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:54,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:54,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:35:55,015 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 5 [2019-01-12 04:35:55,340 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 347 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-01-12 04:35:55,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:35:55,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 04:35:55,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:35:55,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:35:55,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:35:55,343 INFO L87 Difference]: Start difference. First operand 12657 states and 13848 transitions. Second operand 5 states. [2019-01-12 04:35:59,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:35:59,494 INFO L93 Difference]: Finished difference Result 31290 states and 34444 transitions. [2019-01-12 04:35:59,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:35:59,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 561 [2019-01-12 04:35:59,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:35:59,525 INFO L225 Difference]: With dead ends: 31290 [2019-01-12 04:35:59,526 INFO L226 Difference]: Without dead ends: 20432 [2019-01-12 04:35:59,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:35:59,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20432 states. [2019-01-12 04:35:59,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20432 to 16246. [2019-01-12 04:35:59,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16246 states. [2019-01-12 04:35:59,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16246 states to 16246 states and 17901 transitions. [2019-01-12 04:35:59,784 INFO L78 Accepts]: Start accepts. Automaton has 16246 states and 17901 transitions. Word has length 561 [2019-01-12 04:35:59,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:35:59,786 INFO L480 AbstractCegarLoop]: Abstraction has 16246 states and 17901 transitions. [2019-01-12 04:35:59,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:35:59,786 INFO L276 IsEmpty]: Start isEmpty. Operand 16246 states and 17901 transitions. [2019-01-12 04:35:59,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2019-01-12 04:35:59,799 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:35:59,800 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:35:59,801 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:35:59,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:35:59,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1840183349, now seen corresponding path program 1 times [2019-01-12 04:35:59,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:35:59,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:35:59,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:59,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:35:59,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:35:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:00,394 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 397 trivial. 0 not checked. [2019-01-12 04:36:00,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:36:00,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:36:00,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:36:00,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:36:00,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:36:00,396 INFO L87 Difference]: Start difference. First operand 16246 states and 17901 transitions. Second operand 4 states. [2019-01-12 04:36:03,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:36:03,605 INFO L93 Difference]: Finished difference Result 41470 states and 45768 transitions. [2019-01-12 04:36:03,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:36:03,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 594 [2019-01-12 04:36:03,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:36:03,641 INFO L225 Difference]: With dead ends: 41470 [2019-01-12 04:36:03,642 INFO L226 Difference]: Without dead ends: 20143 [2019-01-12 04:36:03,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:36:03,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20143 states. [2019-01-12 04:36:03,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20143 to 15643. [2019-01-12 04:36:03,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15643 states. [2019-01-12 04:36:03,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15643 states to 15643 states and 16900 transitions. [2019-01-12 04:36:03,879 INFO L78 Accepts]: Start accepts. Automaton has 15643 states and 16900 transitions. Word has length 594 [2019-01-12 04:36:03,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:36:03,880 INFO L480 AbstractCegarLoop]: Abstraction has 15643 states and 16900 transitions. [2019-01-12 04:36:03,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:36:03,880 INFO L276 IsEmpty]: Start isEmpty. Operand 15643 states and 16900 transitions. [2019-01-12 04:36:03,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2019-01-12 04:36:03,898 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:36:03,900 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-01-12 04:36:03,901 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:36:03,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:36:03,902 INFO L82 PathProgramCache]: Analyzing trace with hash -2001897810, now seen corresponding path program 1 times [2019-01-12 04:36:03,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:36:03,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:36:03,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:03,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:03,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:04,306 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-01-12 04:36:04,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:36:04,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:36:04,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:36:04,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:36:04,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:36:04,307 INFO L87 Difference]: Start difference. First operand 15643 states and 16900 transitions. Second operand 3 states. [2019-01-12 04:36:05,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:36:05,848 INFO L93 Difference]: Finished difference Result 30982 states and 33488 transitions. [2019-01-12 04:36:05,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:36:05,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 672 [2019-01-12 04:36:05,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:36:05,863 INFO L225 Difference]: With dead ends: 30982 [2019-01-12 04:36:05,864 INFO L226 Difference]: Without dead ends: 15341 [2019-01-12 04:36:05,872 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:36:05,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15341 states. [2019-01-12 04:36:06,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15341 to 15340. [2019-01-12 04:36:06,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15340 states. [2019-01-12 04:36:06,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15340 states to 15340 states and 16586 transitions. [2019-01-12 04:36:06,023 INFO L78 Accepts]: Start accepts. Automaton has 15340 states and 16586 transitions. Word has length 672 [2019-01-12 04:36:06,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:36:06,024 INFO L480 AbstractCegarLoop]: Abstraction has 15340 states and 16586 transitions. [2019-01-12 04:36:06,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:36:06,024 INFO L276 IsEmpty]: Start isEmpty. Operand 15340 states and 16586 transitions. [2019-01-12 04:36:06,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 713 [2019-01-12 04:36:06,041 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:36:06,042 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:06,042 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:36:06,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:36:06,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1063089744, now seen corresponding path program 1 times [2019-01-12 04:36:06,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:36:06,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:36:06,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:06,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:06,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:06,698 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2019-01-12 04:36:07,114 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 476 proven. 0 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2019-01-12 04:36:07,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:36:07,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 04:36:07,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 04:36:07,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 04:36:07,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:36:07,115 INFO L87 Difference]: Start difference. First operand 15340 states and 16586 transitions. Second operand 6 states. [2019-01-12 04:36:09,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:36:09,318 INFO L93 Difference]: Finished difference Result 30824 states and 33319 transitions. [2019-01-12 04:36:09,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:36:09,320 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 712 [2019-01-12 04:36:09,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:36:09,333 INFO L225 Difference]: With dead ends: 30824 [2019-01-12 04:36:09,333 INFO L226 Difference]: Without dead ends: 15486 [2019-01-12 04:36:09,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:36:09,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15486 states. [2019-01-12 04:36:09,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15486 to 15339. [2019-01-12 04:36:09,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15339 states. [2019-01-12 04:36:09,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15339 states to 15339 states and 16356 transitions. [2019-01-12 04:36:09,517 INFO L78 Accepts]: Start accepts. Automaton has 15339 states and 16356 transitions. Word has length 712 [2019-01-12 04:36:09,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:36:09,518 INFO L480 AbstractCegarLoop]: Abstraction has 15339 states and 16356 transitions. [2019-01-12 04:36:09,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 04:36:09,518 INFO L276 IsEmpty]: Start isEmpty. Operand 15339 states and 16356 transitions. [2019-01-12 04:36:09,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 720 [2019-01-12 04:36:09,529 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:36:09,530 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 04:36:09,530 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:36:09,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:36:09,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1173180747, now seen corresponding path program 1 times [2019-01-12 04:36:09,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:36:09,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:36:09,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:09,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:09,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:10,400 WARN L181 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 26 [2019-01-12 04:36:11,045 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 468 proven. 30 refuted. 0 times theorem prover too weak. 339 trivial. 0 not checked. [2019-01-12 04:36:11,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:36:11,046 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:36:11,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:11,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:36:11,715 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 17 [2019-01-12 04:36:12,556 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 647 proven. 2 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-01-12 04:36:12,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:36:12,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-01-12 04:36:12,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 04:36:12,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 04:36:12,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-12 04:36:12,577 INFO L87 Difference]: Start difference. First operand 15339 states and 16356 transitions. Second operand 9 states. [2019-01-12 04:36:15,839 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2019-01-12 04:36:23,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:36:23,643 INFO L93 Difference]: Finished difference Result 35357 states and 37628 transitions. [2019-01-12 04:36:23,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-12 04:36:23,644 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 719 [2019-01-12 04:36:23,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:36:23,661 INFO L225 Difference]: With dead ends: 35357 [2019-01-12 04:36:23,661 INFO L226 Difference]: Without dead ends: 20020 [2019-01-12 04:36:23,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 754 GetRequests, 731 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=177, Invalid=423, Unknown=0, NotChecked=0, Total=600 [2019-01-12 04:36:23,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20020 states. [2019-01-12 04:36:23,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20020 to 18038. [2019-01-12 04:36:23,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18038 states. [2019-01-12 04:36:23,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18038 states to 18038 states and 19146 transitions. [2019-01-12 04:36:23,871 INFO L78 Accepts]: Start accepts. Automaton has 18038 states and 19146 transitions. Word has length 719 [2019-01-12 04:36:23,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:36:23,871 INFO L480 AbstractCegarLoop]: Abstraction has 18038 states and 19146 transitions. [2019-01-12 04:36:23,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 04:36:23,872 INFO L276 IsEmpty]: Start isEmpty. Operand 18038 states and 19146 transitions. [2019-01-12 04:36:23,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 760 [2019-01-12 04:36:23,885 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:36:23,886 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 04:36:23,887 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:36:23,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:36:23,887 INFO L82 PathProgramCache]: Analyzing trace with hash 2091321449, now seen corresponding path program 1 times [2019-01-12 04:36:23,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:36:23,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:36:23,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:23,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:23,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:24,445 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 516 proven. 0 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2019-01-12 04:36:24,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:36:24,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:36:24,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:36:24,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:36:24,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:36:24,447 INFO L87 Difference]: Start difference. First operand 18038 states and 19146 transitions. Second operand 4 states. [2019-01-12 04:36:27,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:36:27,420 INFO L93 Difference]: Finished difference Result 45062 states and 47681 transitions. [2019-01-12 04:36:27,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:36:27,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 759 [2019-01-12 04:36:27,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:36:27,450 INFO L225 Difference]: With dead ends: 45062 [2019-01-12 04:36:27,450 INFO L226 Difference]: Without dead ends: 27026 [2019-01-12 04:36:27,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:36:27,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27026 states. [2019-01-12 04:36:27,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27026 to 20419. [2019-01-12 04:36:27,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20419 states. [2019-01-12 04:36:27,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20419 states to 20419 states and 21497 transitions. [2019-01-12 04:36:27,684 INFO L78 Accepts]: Start accepts. Automaton has 20419 states and 21497 transitions. Word has length 759 [2019-01-12 04:36:27,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:36:27,685 INFO L480 AbstractCegarLoop]: Abstraction has 20419 states and 21497 transitions. [2019-01-12 04:36:27,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:36:27,685 INFO L276 IsEmpty]: Start isEmpty. Operand 20419 states and 21497 transitions. [2019-01-12 04:36:27,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 792 [2019-01-12 04:36:27,696 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:36:27,697 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:27,697 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:36:27,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:36:27,698 INFO L82 PathProgramCache]: Analyzing trace with hash 2128214642, now seen corresponding path program 1 times [2019-01-12 04:36:27,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:36:27,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:36:27,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:27,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:36:27,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:36:27,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:36:28,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1307 backedges. 943 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-01-12 04:36:28,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:36:28,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 04:36:28,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:36:28,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:36:28,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:36:28,891 INFO L87 Difference]: Start difference. First operand 20419 states and 21497 transitions. Second operand 5 states. [2019-01-12 04:36:32,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:36:32,086 INFO L93 Difference]: Finished difference Result 38101 states and 39888 transitions. [2019-01-12 04:36:32,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:36:32,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 791 [2019-01-12 04:36:32,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:36:32,088 INFO L225 Difference]: With dead ends: 38101 [2019-01-12 04:36:32,088 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 04:36:32,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:36:32,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 04:36:32,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 04:36:32,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 04:36:32,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 04:36:32,099 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 791 [2019-01-12 04:36:32,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:36:32,099 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 04:36:32,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:36:32,100 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 04:36:32,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 04:36:32,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 04:36:32,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:36:32,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:36:32,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:36:32,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:36:32,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:36:33,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:36:33,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:36:33,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:36:33,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:36:33,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:36:33,859 WARN L181 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 650 DAG size of output: 563 [2019-01-12 04:36:33,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:36:33,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:36:33,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:36:34,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:36:34,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:36:34,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:36:34,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:36:34,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:36:34,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:36:34,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:36:35,091 WARN L181 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 649 DAG size of output: 562 [2019-01-12 04:36:35,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:36:35,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:36:35,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:36:35,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:36:35,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:36:35,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:36:35,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:36:35,593 WARN L181 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 408 DAG size of output: 363 [2019-01-12 04:36:40,753 WARN L181 SmtUtils]: Spent 5.16 s on a formula simplification. DAG size of input: 549 DAG size of output: 87 [2019-01-12 04:36:45,432 WARN L181 SmtUtils]: Spent 4.67 s on a formula simplification. DAG size of input: 548 DAG size of output: 87 [2019-01-12 04:36:47,920 WARN L181 SmtUtils]: Spent 2.48 s on a formula simplification. DAG size of input: 352 DAG size of output: 92 [2019-01-12 04:36:47,924 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,924 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,924 INFO L448 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,924 INFO L448 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,924 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-01-12 04:36:47,924 INFO L448 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,924 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,924 INFO L448 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,924 INFO L448 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,925 INFO L448 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,925 INFO L448 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,925 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-01-12 04:36:47,925 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 103) no Hoare annotation was computed. [2019-01-12 04:36:47,925 INFO L448 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,925 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,925 INFO L448 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,925 INFO L448 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-01-12 04:36:47,925 INFO L448 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,925 INFO L448 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,925 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-01-12 04:36:47,926 INFO L448 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,926 INFO L448 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,926 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,926 INFO L448 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,926 INFO L448 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,926 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,926 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-01-12 04:36:47,926 INFO L448 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,926 INFO L448 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,926 INFO L448 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,926 INFO L448 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,926 INFO L448 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-01-12 04:36:47,927 INFO L448 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-01-12 04:36:47,927 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,927 INFO L448 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,927 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,927 INFO L448 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,927 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-01-12 04:36:47,927 INFO L448 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-01-12 04:36:47,927 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,927 INFO L448 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,927 INFO L448 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,927 INFO L448 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,927 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,928 INFO L448 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-01-12 04:36:47,928 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,928 INFO L448 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-01-12 04:36:47,928 INFO L448 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-01-12 04:36:47,928 INFO L448 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-01-12 04:36:47,928 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-01-12 04:36:47,928 INFO L448 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,928 INFO L448 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,928 INFO L448 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,928 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,928 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,928 INFO L448 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-01-12 04:36:47,929 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,929 INFO L448 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,929 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-01-12 04:36:47,929 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,929 INFO L448 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-01-12 04:36:47,929 INFO L448 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,929 INFO L448 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,929 INFO L448 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,929 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-01-12 04:36:47,929 INFO L448 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,929 INFO L448 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-01-12 04:36:47,930 INFO L448 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-01-12 04:36:47,930 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-01-12 04:36:47,930 INFO L448 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-01-12 04:36:47,930 INFO L448 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-01-12 04:36:47,930 INFO L448 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-01-12 04:36:47,930 INFO L448 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,930 INFO L448 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,930 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,930 INFO L448 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,930 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-01-12 04:36:47,930 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-01-12 04:36:47,931 INFO L448 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,931 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-01-12 04:36:47,931 INFO L448 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,931 INFO L448 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,931 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,931 INFO L448 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,931 INFO L448 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,931 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,931 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-01-12 04:36:47,931 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 04:36:47,931 INFO L448 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,932 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,932 INFO L448 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,932 INFO L448 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,932 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,932 INFO L448 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-01-12 04:36:47,932 INFO L448 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-01-12 04:36:47,932 INFO L448 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,932 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-01-12 04:36:47,932 INFO L448 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-01-12 04:36:47,932 INFO L448 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-01-12 04:36:47,932 INFO L448 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,932 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-01-12 04:36:47,933 INFO L448 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-01-12 04:36:47,933 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,933 INFO L448 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,933 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,933 INFO L448 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,933 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-01-12 04:36:47,933 INFO L448 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-01-12 04:36:47,933 INFO L448 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,933 INFO L448 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,933 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,934 INFO L448 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-01-12 04:36:47,934 INFO L448 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-01-12 04:36:47,934 INFO L448 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,934 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-01-12 04:36:47,934 INFO L448 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,934 INFO L448 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,934 INFO L448 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,934 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,934 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,934 INFO L448 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,934 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-01-12 04:36:47,935 INFO L448 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,935 INFO L448 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,935 INFO L448 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-01-12 04:36:47,935 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,935 INFO L448 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,935 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,935 INFO L448 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,935 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-01-12 04:36:47,935 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,935 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,935 INFO L448 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,935 INFO L448 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,936 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,936 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-01-12 04:36:47,936 INFO L448 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,936 INFO L448 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,936 INFO L448 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,936 INFO L448 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,936 INFO L448 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-01-12 04:36:47,936 INFO L448 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,936 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,936 INFO L448 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,936 INFO L448 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-01-12 04:36:47,936 INFO L448 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-01-12 04:36:47,937 INFO L448 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,937 INFO L448 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,937 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-01-12 04:36:47,937 INFO L448 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,937 INFO L448 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,937 INFO L448 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,937 INFO L448 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,937 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,937 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-01-12 04:36:47,937 INFO L448 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,937 INFO L448 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,937 INFO L448 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,938 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,938 INFO L448 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,938 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-01-12 04:36:47,938 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,938 INFO L448 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,938 INFO L448 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-01-12 04:36:47,938 INFO L448 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,938 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-01-12 04:36:47,938 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-01-12 04:36:47,938 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,938 INFO L448 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,939 INFO L448 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,939 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,939 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,939 INFO L448 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-01-12 04:36:47,939 INFO L448 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-01-12 04:36:47,939 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,939 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-01-12 04:36:47,939 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 04:36:47,939 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-12 04:36:47,939 INFO L448 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,939 INFO L448 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,939 INFO L448 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,940 INFO L448 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,940 INFO L448 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,940 INFO L448 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-01-12 04:36:47,940 INFO L448 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-01-12 04:36:47,940 INFO L448 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-01-12 04:36:47,940 INFO L448 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-01-12 04:36:47,940 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,940 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,940 INFO L448 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,940 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-01-12 04:36:47,940 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-01-12 04:36:47,940 INFO L448 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,940 INFO L448 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-01-12 04:36:47,941 INFO L448 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,941 INFO L448 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,941 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,941 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,941 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-01-12 04:36:47,941 INFO L448 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-01-12 04:36:47,941 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-01-12 04:36:47,941 INFO L448 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,941 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-12 04:36:47,941 INFO L448 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,941 INFO L448 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,941 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,942 INFO L448 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,942 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,942 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,942 INFO L448 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,942 INFO L448 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,942 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-01-12 04:36:47,942 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-12 04:36:47,942 INFO L448 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-01-12 04:36:47,942 INFO L448 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-01-12 04:36:47,942 INFO L448 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,942 INFO L448 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,942 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,943 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,943 INFO L444 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse14 (= ~a2~0 3)) (.cse23 (+ ~a4~0 86))) (let ((.cse20 (<= 0 (+ ~a0~0 44))) (.cse13 (<= .cse23 0)) (.cse22 (not .cse14))) (let ((.cse15 (+ ~a0~0 98)) (.cse8 (or (and .cse22 .cse20) (and .cse13 .cse22))) (.cse12 (+ ~a0~0 147)) (.cse19 (+ ~a4~0 42)) (.cse9 (= ~a2~0 1)) (.cse17 (< 0 (+ ~a29~0 144))) (.cse18 (< 0 .cse23)) (.cse21 (not (= 4 ~a2~0)))) (let ((.cse1 (<= (+ ~a0~0 104) 0)) (.cse7 (and .cse18 .cse22 .cse21)) (.cse11 (and .cse9 (<= ~a29~0 43) .cse17)) (.cse4 (or .cse13 (< 0 .cse12) (< 0 .cse19) (not (= 1 ULTIMATE.start_calculate_output_~input)))) (.cse0 (and .cse8 .cse21)) (.cse10 (<= (+ ~a0~0 61) 0)) (.cse16 (or (and .cse13 .cse9) (and .cse9 .cse20))) (.cse3 (<= (+ ~a29~0 145) 0)) (.cse6 (< 0 (+ ~a29~0 16))) (.cse5 (<= .cse15 0)) (.cse2 (<= .cse19 0))) (or (and .cse0 .cse1) (and .cse2 .cse3 (<= 0 (+ ~a0~0 146)) .cse1) (and (and .cse2 .cse4 (< 43 ~a29~0)) .cse1) (and .cse5 .cse2 .cse6 .cse7) (and .cse2 (and .cse8 (= ~a2~0 4))) (and .cse5 .cse2 .cse9) (and .cse2 .cse1 .cse7) (and .cse2 .cse10 .cse11) (and .cse2 (and .cse8 (= ~a2~0 2))) (and .cse2 .cse6 .cse11) (and .cse2 .cse4 (<= .cse12 0)) (and .cse13 .cse14 (< 0 .cse15) .cse10) (and .cse2 .cse6 .cse0) (and .cse16 .cse10) (and .cse2 (and .cse16 .cse17)) (and .cse3 .cse14 .cse13) (and .cse6 .cse13) (and .cse18 .cse5 .cse2 .cse14)))))) [2019-01-12 04:36:47,943 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-01-12 04:36:47,943 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-12 04:36:47,943 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,944 INFO L448 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,944 INFO L448 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,944 INFO L448 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,944 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,944 INFO L448 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,944 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,944 INFO L448 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-01-12 04:36:47,944 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,944 INFO L448 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-01-12 04:36:47,944 INFO L451 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-01-12 04:36:47,944 INFO L448 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,944 INFO L448 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-01-12 04:36:47,945 INFO L448 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-01-12 04:36:47,945 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-01-12 04:36:47,945 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-01-12 04:36:47,945 INFO L448 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,945 INFO L448 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,945 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,945 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,945 INFO L448 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,945 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-01-12 04:36:47,945 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-12 04:36:47,945 INFO L448 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,946 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-01-12 04:36:47,946 INFO L448 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-01-12 04:36:47,946 INFO L448 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,946 INFO L448 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,946 INFO L448 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,946 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,946 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,946 INFO L448 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,947 INFO L444 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse11 (= ~a2~0 3)) (.cse19 (+ ~a4~0 86))) (let ((.cse18 (<= 0 (+ ~a0~0 44))) (.cse3 (<= .cse19 0)) (.cse17 (not .cse11))) (let ((.cse12 (+ ~a0~0 98)) (.cse15 (< 0 .cse19)) (.cse16 (= ~a2~0 1)) (.cse13 (< 0 (+ ~a29~0 144))) (.cse7 (<= (+ ~a4~0 42) 0)) (.cse10 (or (and .cse17 .cse18) (and .cse3 .cse17)))) (let ((.cse5 (and .cse7 .cse10)) (.cse1 (< 0 (+ ~a29~0 16))) (.cse8 (and .cse16 (<= ~a29~0 43) .cse13)) (.cse9 (<= (+ ~a0~0 61) 0)) (.cse6 (or (and .cse3 .cse16) (and .cse16 .cse18))) (.cse2 (and (and .cse15 .cse17 (not (= 4 ~a2~0))) .cse7)) (.cse4 (<= (+ ~a0~0 104) 0)) (.cse0 (<= .cse12 0)) (.cse14 (<= (+ ~a29~0 145) 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1) (and .cse4 .cse5) (and .cse1 .cse5) (and .cse3 .cse6) (and (and .cse7 .cse8) .cse9) (and .cse7 .cse1 .cse8) (and .cse7 (and .cse10 (= ~a2~0 4))) (and .cse7 (and .cse10 (= ~a2~0 2))) (and .cse3 .cse11 (< 0 .cse12) .cse9) (and .cse7 (<= (+ ~a0~0 147) 0)) (and .cse7 (and .cse6 .cse13)) (and .cse4 .cse2) (and .cse7 .cse14 .cse4) (and (and .cse7 (< 43 ~a29~0)) .cse4) (and .cse0 (and .cse15 .cse7 .cse11)) (and (and .cse7 .cse16) .cse0) (and .cse14 .cse11 .cse3)))))) [2019-01-12 04:36:47,947 INFO L448 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,947 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-01-12 04:36:47,947 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-01-12 04:36:47,947 INFO L448 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,947 INFO L448 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,947 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,947 INFO L448 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,947 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,947 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,948 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-01-12 04:36:47,948 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-01-12 04:36:47,948 INFO L448 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,948 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,948 INFO L448 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-01-12 04:36:47,948 INFO L448 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,948 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,948 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,948 INFO L448 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,948 INFO L448 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,948 INFO L448 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,948 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-01-12 04:36:47,949 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-01-12 04:36:47,949 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,949 INFO L448 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,949 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,949 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,949 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,949 INFO L448 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,949 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 04:36:47,949 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-01-12 04:36:47,949 INFO L448 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,949 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-01-12 04:36:47,950 INFO L448 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,950 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,950 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,950 INFO L448 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,950 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,950 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,950 INFO L448 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,950 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-01-12 04:36:47,950 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-01-12 04:36:47,950 INFO L448 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,950 INFO L448 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,950 INFO L448 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,951 INFO L448 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,951 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,951 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,951 INFO L448 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,951 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-01-12 04:36:47,951 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-01-12 04:36:47,951 INFO L448 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,951 INFO L448 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,951 INFO L448 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,951 INFO L448 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,951 INFO L448 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,952 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,952 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,952 INFO L448 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-01-12 04:36:47,952 INFO L448 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-01-12 04:36:47,952 INFO L448 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,952 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-01-12 04:36:47,952 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-01-12 04:36:47,952 INFO L448 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,952 INFO L448 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,952 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,952 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,952 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,952 INFO L448 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,953 INFO L444 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse11 (= ~a2~0 3)) (.cse19 (+ ~a4~0 86))) (let ((.cse17 (<= 0 (+ ~a0~0 44))) (.cse3 (<= .cse19 0)) (.cse18 (not .cse11))) (let ((.cse12 (+ ~a0~0 98)) (.cse14 (< 0 .cse19)) (.cse16 (= ~a2~0 1)) (.cse15 (< 0 (+ ~a29~0 144))) (.cse7 (<= (+ ~a4~0 42) 0)) (.cse10 (or (and .cse18 .cse17) (and .cse3 .cse18)))) (let ((.cse5 (and .cse7 .cse10)) (.cse1 (< 0 (+ ~a29~0 16))) (.cse8 (and .cse16 (<= ~a29~0 43) .cse15)) (.cse9 (<= (+ ~a0~0 61) 0)) (.cse2 (and (and .cse14 .cse18 (not (= 4 ~a2~0))) .cse7)) (.cse4 (<= (+ ~a0~0 104) 0)) (.cse6 (or (and .cse3 .cse16) (and .cse16 .cse17))) (.cse0 (<= .cse12 0)) (.cse13 (<= (+ ~a29~0 145) 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1) (and .cse4 .cse5) (and .cse1 .cse5) (and .cse3 .cse6) (and (and .cse7 .cse8) .cse9) (and .cse7 .cse1 .cse8) (and .cse7 (and .cse10 (= ~a2~0 4))) (and .cse7 (and .cse10 (= ~a2~0 2))) (and .cse3 .cse11 (< 0 .cse12) .cse9) (and .cse7 (<= (+ ~a0~0 147) 0)) (and .cse4 .cse2) (and .cse7 .cse13 .cse4) (and (and .cse7 (< 43 ~a29~0)) .cse4) (and .cse0 (and .cse14 .cse7 .cse11)) (and (and .cse6 .cse15) .cse7) (and (and .cse7 .cse16) .cse0) (and .cse13 .cse11 .cse3)))))) [2019-01-12 04:36:47,953 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-01-12 04:36:47,953 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-01-12 04:36:47,953 INFO L448 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,953 INFO L448 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,953 INFO L448 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,953 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,954 INFO L448 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,954 INFO L448 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,954 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,954 INFO L448 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,954 INFO L448 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-01-12 04:36:47,954 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-01-12 04:36:47,954 INFO L448 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,954 INFO L448 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-01-12 04:36:47,954 INFO L448 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-01-12 04:36:47,954 INFO L448 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,954 INFO L448 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,954 INFO L448 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,954 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,955 INFO L448 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,955 INFO L448 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-01-12 04:36:47,955 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-01-12 04:36:47,955 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,955 INFO L448 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,955 INFO L448 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,955 INFO L448 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,955 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-01-12 04:36:47,955 INFO L448 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-01-12 04:36:47,955 INFO L448 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-01-12 04:36:47,955 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,955 INFO L448 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-01-12 04:36:47,956 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-01-12 04:36:47,956 INFO L448 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,956 INFO L448 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,956 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,956 INFO L448 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,956 INFO L448 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,956 INFO L448 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,956 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,956 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-01-12 04:36:47,956 INFO L448 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-01-12 04:36:47,956 INFO L448 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,956 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,957 INFO L448 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,957 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-01-12 04:36:47,957 INFO L448 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,957 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 04:36:47,957 INFO L448 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,957 INFO L448 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-01-12 04:36:47,957 INFO L448 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,957 INFO L448 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,957 INFO L448 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,957 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,957 INFO L448 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,957 INFO L448 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,957 INFO L448 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,958 INFO L448 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-01-12 04:36:47,958 INFO L448 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-01-12 04:36:47,958 INFO L448 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,958 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-01-12 04:36:47,958 INFO L448 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,958 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,958 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,958 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-01-12 04:36:47,958 INFO L448 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,958 INFO L448 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,958 INFO L448 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,958 INFO L448 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,959 INFO L448 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-01-12 04:36:47,959 INFO L448 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,959 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,959 INFO L448 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-01-12 04:36:47,959 INFO L448 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-01-12 04:36:47,959 INFO L448 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,959 INFO L448 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,959 INFO L448 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,959 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-01-12 04:36:47,959 INFO L448 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,959 INFO L448 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,959 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,960 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,960 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,960 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-01-12 04:36:47,960 INFO L448 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,960 INFO L448 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,960 INFO L448 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-01-12 04:36:47,960 INFO L448 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-01-12 04:36:47,960 INFO L448 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,960 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:36:47,960 INFO L448 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-01-12 04:36:47,960 INFO L448 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,960 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-12 04:36:47,960 INFO L448 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,961 INFO L448 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-01-12 04:36:47,961 INFO L448 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-01-12 04:36:47,961 INFO L448 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,961 INFO L448 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-01-12 04:36:47,961 INFO L448 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-01-12 04:36:47,961 INFO L448 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-01-12 04:36:47,961 INFO L448 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-01-12 04:36:48,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 04:36:48 BoogieIcfgContainer [2019-01-12 04:36:48,015 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 04:36:48,015 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 04:36:48,015 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 04:36:48,016 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 04:36:48,018 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:34:52" (3/4) ... [2019-01-12 04:36:48,026 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 04:36:48,120 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 04:36:48,124 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 04:36:48,450 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 04:36:48,451 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 04:36:48,452 INFO L168 Benchmark]: Toolchain (without parser) took 124336.32 ms. Allocated memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: 2.0 GB). Free memory was 945.8 MB in the beginning and 1.9 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2019-01-12 04:36:48,453 INFO L168 Benchmark]: CDTParser took 0.19 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:36:48,453 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1445.85 ms. Allocated memory is still 1.0 GB. Free memory was 945.8 MB in the beginning and 849.2 MB in the end (delta: 96.6 MB). Peak memory consumption was 96.6 MB. Max. memory is 11.5 GB. [2019-01-12 04:36:48,454 INFO L168 Benchmark]: Boogie Procedure Inliner took 359.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.2 MB). Free memory was 849.2 MB in the beginning and 1.0 GB in the end (delta: -193.3 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. [2019-01-12 04:36:48,454 INFO L168 Benchmark]: Boogie Preprocessor took 200.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-12 04:36:48,454 INFO L168 Benchmark]: RCFGBuilder took 6444.50 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -152.2 MB). Peak memory consumption was 325.0 MB. Max. memory is 11.5 GB. [2019-01-12 04:36:48,455 INFO L168 Benchmark]: TraceAbstraction took 115441.38 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 1.8 GB). Free memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: -815.7 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2019-01-12 04:36:48,457 INFO L168 Benchmark]: Witness Printer took 435.93 ms. Allocated memory is still 3.1 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 11.5 GB. [2019-01-12 04:36:48,461 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.19 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 1445.85 ms. Allocated memory is still 1.0 GB. Free memory was 945.8 MB in the beginning and 849.2 MB in the end (delta: 96.6 MB). Peak memory consumption was 96.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 359.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.2 MB). Free memory was 849.2 MB in the beginning and 1.0 GB in the end (delta: -193.3 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 200.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 6444.50 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -152.2 MB). Peak memory consumption was 325.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 115441.38 ms. Allocated memory was 1.2 GB in the beginning and 3.1 GB in the end (delta: 1.8 GB). Free memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: -815.7 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. * Witness Printer took 435.93 ms. Allocated memory is still 3.1 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 103]: 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 Derived loop invariant: ((((((((((((((((((a0 + 98 <= 0 && 0 < a29 + 16) && ((0 < a4 + 86 && !(a2 == 3)) && !(4 == a2)) && a4 + 42 <= 0) || (a4 + 86 <= 0 && 0 < a29 + 16)) || (a0 + 104 <= 0 && a4 + 42 <= 0 && ((!(a2 == 3) && 0 <= a0 + 44) || (a4 + 86 <= 0 && !(a2 == 3))))) || (0 < a29 + 16 && a4 + 42 <= 0 && ((!(a2 == 3) && 0 <= a0 + 44) || (a4 + 86 <= 0 && !(a2 == 3))))) || (a4 + 86 <= 0 && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44)))) || ((a4 + 42 <= 0 && (a2 == 1 && a29 <= 43) && 0 < a29 + 144) && a0 + 61 <= 0)) || ((a4 + 42 <= 0 && 0 < a29 + 16) && (a2 == 1 && a29 <= 43) && 0 < a29 + 144)) || (a4 + 42 <= 0 && ((!(a2 == 3) && 0 <= a0 + 44) || (a4 + 86 <= 0 && !(a2 == 3))) && a2 == 4)) || (a4 + 42 <= 0 && ((!(a2 == 3) && 0 <= a0 + 44) || (a4 + 86 <= 0 && !(a2 == 3))) && a2 == 2)) || (((a4 + 86 <= 0 && a2 == 3) && 0 < a0 + 98) && a0 + 61 <= 0)) || (a4 + 42 <= 0 && a0 + 147 <= 0)) || (a4 + 42 <= 0 && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44)) && 0 < a29 + 144)) || (a0 + 104 <= 0 && ((0 < a4 + 86 && !(a2 == 3)) && !(4 == a2)) && a4 + 42 <= 0)) || ((a4 + 42 <= 0 && a29 + 145 <= 0) && a0 + 104 <= 0)) || ((a4 + 42 <= 0 && 43 < a29) && a0 + 104 <= 0)) || (a0 + 98 <= 0 && (0 < a4 + 86 && a4 + 42 <= 0) && a2 == 3)) || ((a4 + 42 <= 0 && a2 == 1) && a0 + 98 <= 0)) || ((a29 + 145 <= 0 && a2 == 3) && a4 + 86 <= 0) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((((((((((((((((((a0 + 98 <= 0 && 0 < a29 + 16) && ((0 < a4 + 86 && !(a2 == 3)) && !(4 == a2)) && a4 + 42 <= 0) || (a4 + 86 <= 0 && 0 < a29 + 16)) || (a0 + 104 <= 0 && a4 + 42 <= 0 && ((!(a2 == 3) && 0 <= a0 + 44) || (a4 + 86 <= 0 && !(a2 == 3))))) || (0 < a29 + 16 && a4 + 42 <= 0 && ((!(a2 == 3) && 0 <= a0 + 44) || (a4 + 86 <= 0 && !(a2 == 3))))) || (a4 + 86 <= 0 && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44)))) || ((a4 + 42 <= 0 && (a2 == 1 && a29 <= 43) && 0 < a29 + 144) && a0 + 61 <= 0)) || ((a4 + 42 <= 0 && 0 < a29 + 16) && (a2 == 1 && a29 <= 43) && 0 < a29 + 144)) || (a4 + 42 <= 0 && ((!(a2 == 3) && 0 <= a0 + 44) || (a4 + 86 <= 0 && !(a2 == 3))) && a2 == 4)) || (a4 + 42 <= 0 && ((!(a2 == 3) && 0 <= a0 + 44) || (a4 + 86 <= 0 && !(a2 == 3))) && a2 == 2)) || (((a4 + 86 <= 0 && a2 == 3) && 0 < a0 + 98) && a0 + 61 <= 0)) || (a4 + 42 <= 0 && a0 + 147 <= 0)) || (a0 + 104 <= 0 && ((0 < a4 + 86 && !(a2 == 3)) && !(4 == a2)) && a4 + 42 <= 0)) || ((a4 + 42 <= 0 && a29 + 145 <= 0) && a0 + 104 <= 0)) || ((a4 + 42 <= 0 && 43 < a29) && a0 + 104 <= 0)) || (a0 + 98 <= 0 && (0 < a4 + 86 && a4 + 42 <= 0) && a2 == 3)) || ((((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44)) && 0 < a29 + 144) && a4 + 42 <= 0)) || ((a4 + 42 <= 0 && a2 == 1) && a0 + 98 <= 0)) || ((a29 + 145 <= 0 && a2 == 3) && a4 + 86 <= 0) - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(a2 == 3) && 0 <= a0 + 44) || (a4 + 86 <= 0 && !(a2 == 3))) && !(4 == a2)) && a0 + 104 <= 0) || (((a4 + 42 <= 0 && a29 + 145 <= 0) && 0 <= a0 + 146) && a0 + 104 <= 0)) || (((a4 + 42 <= 0 && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(1 == input))) && 43 < a29) && a0 + 104 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a29 + 16) && (0 < a4 + 86 && !(a2 == 3)) && !(4 == a2))) || (a4 + 42 <= 0 && ((!(a2 == 3) && 0 <= a0 + 44) || (a4 + 86 <= 0 && !(a2 == 3))) && a2 == 4)) || ((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1)) || ((a4 + 42 <= 0 && a0 + 104 <= 0) && (0 < a4 + 86 && !(a2 == 3)) && !(4 == a2))) || ((a4 + 42 <= 0 && a0 + 61 <= 0) && (a2 == 1 && a29 <= 43) && 0 < a29 + 144)) || (a4 + 42 <= 0 && ((!(a2 == 3) && 0 <= a0 + 44) || (a4 + 86 <= 0 && !(a2 == 3))) && a2 == 2)) || ((a4 + 42 <= 0 && 0 < a29 + 16) && (a2 == 1 && a29 <= 43) && 0 < a29 + 144)) || ((a4 + 42 <= 0 && (((a4 + 86 <= 0 || 0 < a0 + 147) || 0 < a4 + 42) || !(1 == input))) && a0 + 147 <= 0)) || (((a4 + 86 <= 0 && a2 == 3) && 0 < a0 + 98) && a0 + 61 <= 0)) || ((a4 + 42 <= 0 && 0 < a29 + 16) && ((!(a2 == 3) && 0 <= a0 + 44) || (a4 + 86 <= 0 && !(a2 == 3))) && !(4 == a2))) || (((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44)) && a0 + 61 <= 0)) || (a4 + 42 <= 0 && ((a4 + 86 <= 0 && a2 == 1) || (a2 == 1 && 0 <= a0 + 44)) && 0 < a29 + 144)) || ((a29 + 145 <= 0 && a2 == 3) && a4 + 86 <= 0)) || (0 < a29 + 16 && a4 + 86 <= 0)) || (((0 < a4 + 86 && a0 + 98 <= 0) && a4 + 42 <= 0) && a2 == 3) - 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, 115.2s OverallTime, 15 OverallIterations, 6 TraceHistogramMax, 80.0s AutomataDifference, 0.0s DeadEndRemovalTime, 15.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 4279 SDtfs, 15366 SDslu, 1512 SDs, 0 SdLazy, 39927 SolverSat, 5971 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 66.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2019 GetRequests, 1931 SyntacticMatches, 12 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20419occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 26350 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 269 NumberOfFragments, 1274 HoareAnnotationTreeSize, 4 FomulaSimplifications, 381621 FormulaSimplificationTreeSizeReduction, 3.4s HoareSimplificationTime, 4 FomulaSimplificationsInter, 529104 FormulaSimplificationTreeSizeReductionInter, 12.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 9265 NumberOfCodeBlocks, 9265 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 9246 ConstructedInterpolants, 104 QuantifiedInterpolants, 17264720 SizeOfPredicates, 5 NumberOfNonLiveVariables, 2279 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 19 InterpolantComputations, 13 PerfectInterpolantSequences, 9052/9182 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...