./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label52.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8d5ccd81-ffe4-413e-bfff-b18fd3ae0164/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8d5ccd81-ffe4-413e-bfff-b18fd3ae0164/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8d5ccd81-ffe4-413e-bfff-b18fd3ae0164/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8d5ccd81-ffe4-413e-bfff-b18fd3ae0164/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label52.c -s /tmp/vcloud-vcloud-master/worker/run_dir_8d5ccd81-ffe4-413e-bfff-b18fd3ae0164/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8d5ccd81-ffe4-413e-bfff-b18fd3ae0164/bin/uautomizer --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 5cfaf62e1cdcc975c66b2a0c66e609c8cf7f16b1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:03:03,262 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:03:03,264 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:03:03,281 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:03:03,281 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:03:03,283 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:03:03,285 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:03:03,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:03:03,301 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:03:03,305 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:03:03,308 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:03:03,309 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:03:03,310 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:03:03,311 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:03:03,311 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:03:03,312 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:03:03,313 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:03:03,314 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:03:03,316 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:03:03,318 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:03:03,319 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:03:03,320 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:03:03,321 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:03:03,322 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:03:03,325 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:03:03,325 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:03:03,325 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:03:03,326 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:03:03,327 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:03:03,328 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:03:03,328 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:03:03,329 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:03:03,329 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:03:03,330 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:03:03,331 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:03:03,331 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:03:03,332 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:03:03,332 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:03:03,333 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:03:03,333 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:03:03,334 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:03:03,335 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8d5ccd81-ffe4-413e-bfff-b18fd3ae0164/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:03:03,350 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:03:03,350 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:03:03,351 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:03:03,352 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:03:03,352 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:03:03,352 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:03:03,353 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:03:03,353 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:03:03,353 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:03:03,353 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:03:03,354 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:03:03,354 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:03:03,354 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:03:03,355 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:03:03,355 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:03:03,355 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:03:03,356 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:03:03,356 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:03:03,356 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:03:03,357 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:03:03,357 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:03:03,357 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:03:03,358 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:03:03,358 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:03:03,358 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:03:03,358 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:03:03,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:03:03,360 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:03:03,361 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_8d5ccd81-ffe4-413e-bfff-b18fd3ae0164/bin/uautomizer 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 -> 5cfaf62e1cdcc975c66b2a0c66e609c8cf7f16b1 [2019-11-15 23:03:03,391 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:03:03,403 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:03:03,407 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:03:03,408 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:03:03,409 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:03:03,410 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8d5ccd81-ffe4-413e-bfff-b18fd3ae0164/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem11_label52.c [2019-11-15 23:03:03,468 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8d5ccd81-ffe4-413e-bfff-b18fd3ae0164/bin/uautomizer/data/69d9b07af/dc70e16db67043e28b54a8d97e7c1b2f/FLAGd613de8c5 [2019-11-15 23:03:04,049 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:03:04,050 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8d5ccd81-ffe4-413e-bfff-b18fd3ae0164/sv-benchmarks/c/eca-rers2012/Problem11_label52.c [2019-11-15 23:03:04,066 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8d5ccd81-ffe4-413e-bfff-b18fd3ae0164/bin/uautomizer/data/69d9b07af/dc70e16db67043e28b54a8d97e7c1b2f/FLAGd613de8c5 [2019-11-15 23:03:04,259 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8d5ccd81-ffe4-413e-bfff-b18fd3ae0164/bin/uautomizer/data/69d9b07af/dc70e16db67043e28b54a8d97e7c1b2f [2019-11-15 23:03:04,262 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:03:04,263 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:03:04,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:03:04,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:03:04,281 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:03:04,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:03:04" (1/1) ... [2019-11-15 23:03:04,285 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6136fe7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:03:04, skipping insertion in model container [2019-11-15 23:03:04,285 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:03:04" (1/1) ... [2019-11-15 23:03:04,294 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:03:04,351 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:03:05,008 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:03:05,013 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:03:05,262 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:03:05,281 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:03:05,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:03:05 WrapperNode [2019-11-15 23:03:05,282 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:03:05,283 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:03:05,283 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:03:05,283 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:03:05,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:03:05" (1/1) ... [2019-11-15 23:03:05,328 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:03:05" (1/1) ... [2019-11-15 23:03:05,452 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:03:05,454 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:03:05,454 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:03:05,454 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:03:05,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:03:05" (1/1) ... [2019-11-15 23:03:05,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:03:05" (1/1) ... [2019-11-15 23:03:05,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:03:05" (1/1) ... [2019-11-15 23:03:05,479 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:03:05" (1/1) ... [2019-11-15 23:03:05,542 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:03:05" (1/1) ... [2019-11-15 23:03:05,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:03:05" (1/1) ... [2019-11-15 23:03:05,597 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:03:05" (1/1) ... [2019-11-15 23:03:05,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:03:05,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:03:05,618 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:03:05,618 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:03:05,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:03:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d5ccd81-ffe4-413e-bfff-b18fd3ae0164/bin/uautomizer/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-11-15 23:03:05,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:03:05,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:03:07,964 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:03:07,964 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 23:03:07,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:03:07 BoogieIcfgContainer [2019-11-15 23:03:07,966 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:03:07,967 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:03:07,967 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:03:07,973 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:03:07,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:03:04" (1/3) ... [2019-11-15 23:03:07,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be9e192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:03:07, skipping insertion in model container [2019-11-15 23:03:07,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:03:05" (2/3) ... [2019-11-15 23:03:07,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be9e192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:03:07, skipping insertion in model container [2019-11-15 23:03:07,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:03:07" (3/3) ... [2019-11-15 23:03:07,979 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label52.c [2019-11-15 23:03:07,991 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:03:08,004 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:03:08,016 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:03:08,060 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:03:08,060 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:03:08,060 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:03:08,061 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:03:08,061 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:03:08,061 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:03:08,061 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:03:08,061 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:03:08,084 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-11-15 23:03:08,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 23:03:08,092 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:03:08,093 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:03:08,095 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:03:08,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:08,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1382487458, now seen corresponding path program 1 times [2019-11-15 23:03:08,112 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:08,113 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365600527] [2019-11-15 23:03:08,113 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:08,113 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:08,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:08,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:03:08,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:03:08,518 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365600527] [2019-11-15 23:03:08,519 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:03:08,519 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:03:08,519 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135795277] [2019-11-15 23:03:08,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:03:08,525 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:03:08,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:03:08,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:03:08,544 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-11-15 23:03:11,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:03:11,222 INFO L93 Difference]: Finished difference Result 966 states and 1746 transitions. [2019-11-15 23:03:11,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:03:11,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-15 23:03:11,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:03:11,266 INFO L225 Difference]: With dead ends: 966 [2019-11-15 23:03:11,266 INFO L226 Difference]: Without dead ends: 616 [2019-11-15 23:03:11,276 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:03:11,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-11-15 23:03:11,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 600. [2019-11-15 23:03:11,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-11-15 23:03:11,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 910 transitions. [2019-11-15 23:03:11,374 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 910 transitions. Word has length 52 [2019-11-15 23:03:11,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:03:11,375 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 910 transitions. [2019-11-15 23:03:11,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:03:11,376 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 910 transitions. [2019-11-15 23:03:11,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-15 23:03:11,383 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:03:11,384 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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-11-15 23:03:11,384 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:03:11,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:11,385 INFO L82 PathProgramCache]: Analyzing trace with hash 2042685591, now seen corresponding path program 1 times [2019-11-15 23:03:11,385 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:11,385 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954129566] [2019-11-15 23:03:11,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:11,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:11,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:11,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:03:11,659 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:03:11,660 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954129566] [2019-11-15 23:03:11,660 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:03:11,660 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:03:11,661 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144023390] [2019-11-15 23:03:11,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:03:11,663 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:03:11,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:03:11,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:03:11,664 INFO L87 Difference]: Start difference. First operand 600 states and 910 transitions. Second operand 4 states. [2019-11-15 23:03:13,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:03:13,471 INFO L93 Difference]: Finished difference Result 2309 states and 3522 transitions. [2019-11-15 23:03:13,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:03:13,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-11-15 23:03:13,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:03:13,485 INFO L225 Difference]: With dead ends: 2309 [2019-11-15 23:03:13,485 INFO L226 Difference]: Without dead ends: 1711 [2019-11-15 23:03:13,489 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:03:13,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2019-11-15 23:03:13,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 1527. [2019-11-15 23:03:13,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1527 states. [2019-11-15 23:03:13,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 2032 transitions. [2019-11-15 23:03:13,572 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 2032 transitions. Word has length 123 [2019-11-15 23:03:13,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:03:13,575 INFO L462 AbstractCegarLoop]: Abstraction has 1527 states and 2032 transitions. [2019-11-15 23:03:13,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:03:13,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 2032 transitions. [2019-11-15 23:03:13,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-15 23:03:13,593 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:03:13,593 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:03:13,594 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:03:13,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:13,595 INFO L82 PathProgramCache]: Analyzing trace with hash -222846350, now seen corresponding path program 1 times [2019-11-15 23:03:13,595 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:13,596 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121505559] [2019-11-15 23:03:13,596 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:13,597 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:13,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:03:13,854 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:03:13,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121505559] [2019-11-15 23:03:13,856 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:03:13,856 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:03:13,857 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962616860] [2019-11-15 23:03:13,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:03:13,860 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:03:13,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:03:13,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:03:13,865 INFO L87 Difference]: Start difference. First operand 1527 states and 2032 transitions. Second operand 4 states. [2019-11-15 23:03:15,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:03:15,994 INFO L93 Difference]: Finished difference Result 5088 states and 6913 transitions. [2019-11-15 23:03:15,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:03:15,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-11-15 23:03:15,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:03:16,020 INFO L225 Difference]: With dead ends: 5088 [2019-11-15 23:03:16,021 INFO L226 Difference]: Without dead ends: 3563 [2019-11-15 23:03:16,025 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:03:16,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3563 states. [2019-11-15 23:03:16,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3563 to 2447. [2019-11-15 23:03:16,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2447 states. [2019-11-15 23:03:16,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 3065 transitions. [2019-11-15 23:03:16,111 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 3065 transitions. Word has length 136 [2019-11-15 23:03:16,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:03:16,113 INFO L462 AbstractCegarLoop]: Abstraction has 2447 states and 3065 transitions. [2019-11-15 23:03:16,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:03:16,113 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 3065 transitions. [2019-11-15 23:03:16,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-11-15 23:03:16,116 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:03:16,116 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:03:16,116 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:03:16,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:16,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1804040649, now seen corresponding path program 1 times [2019-11-15 23:03:16,117 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:16,117 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930116263] [2019-11-15 23:03:16,118 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:16,118 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:16,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:03:16,384 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:03:16,385 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930116263] [2019-11-15 23:03:16,385 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:03:16,385 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:03:16,386 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712324501] [2019-11-15 23:03:16,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:03:16,388 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:03:16,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:03:16,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:03:16,389 INFO L87 Difference]: Start difference. First operand 2447 states and 3065 transitions. Second operand 4 states. [2019-11-15 23:03:18,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:03:18,063 INFO L93 Difference]: Finished difference Result 6938 states and 9010 transitions. [2019-11-15 23:03:18,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:03:18,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-11-15 23:03:18,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:03:18,092 INFO L225 Difference]: With dead ends: 6938 [2019-11-15 23:03:18,092 INFO L226 Difference]: Without dead ends: 4677 [2019-11-15 23:03:18,096 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:03:18,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4677 states. [2019-11-15 23:03:18,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4677 to 3548. [2019-11-15 23:03:18,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3548 states. [2019-11-15 23:03:18,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3548 states to 3548 states and 4409 transitions. [2019-11-15 23:03:18,192 INFO L78 Accepts]: Start accepts. Automaton has 3548 states and 4409 transitions. Word has length 179 [2019-11-15 23:03:18,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:03:18,193 INFO L462 AbstractCegarLoop]: Abstraction has 3548 states and 4409 transitions. [2019-11-15 23:03:18,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:03:18,194 INFO L276 IsEmpty]: Start isEmpty. Operand 3548 states and 4409 transitions. [2019-11-15 23:03:18,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-11-15 23:03:18,203 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:03:18,204 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:03:18,204 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:03:18,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:18,205 INFO L82 PathProgramCache]: Analyzing trace with hash -686623931, now seen corresponding path program 1 times [2019-11-15 23:03:18,205 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:18,205 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045294922] [2019-11-15 23:03:18,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:18,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:18,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:03:18,562 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 316 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-11-15 23:03:18,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045294922] [2019-11-15 23:03:18,563 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:03:18,563 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:03:18,563 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642915900] [2019-11-15 23:03:18,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:03:18,564 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:03:18,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:03:18,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:03:18,566 INFO L87 Difference]: Start difference. First operand 3548 states and 4409 transitions. Second operand 4 states. [2019-11-15 23:03:20,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:03:20,370 INFO L93 Difference]: Finished difference Result 8578 states and 10723 transitions. [2019-11-15 23:03:20,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:03:20,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 315 [2019-11-15 23:03:20,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:03:20,402 INFO L225 Difference]: With dead ends: 8578 [2019-11-15 23:03:20,402 INFO L226 Difference]: Without dead ends: 5216 [2019-11-15 23:03:20,407 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:03:20,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5216 states. [2019-11-15 23:03:20,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5216 to 5020. [2019-11-15 23:03:20,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5020 states. [2019-11-15 23:03:20,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5020 states to 5020 states and 6043 transitions. [2019-11-15 23:03:20,534 INFO L78 Accepts]: Start accepts. Automaton has 5020 states and 6043 transitions. Word has length 315 [2019-11-15 23:03:20,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:03:20,535 INFO L462 AbstractCegarLoop]: Abstraction has 5020 states and 6043 transitions. [2019-11-15 23:03:20,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:03:20,536 INFO L276 IsEmpty]: Start isEmpty. Operand 5020 states and 6043 transitions. [2019-11-15 23:03:20,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-11-15 23:03:20,546 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:03:20,547 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:03:20,547 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:03:20,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:20,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1959018245, now seen corresponding path program 1 times [2019-11-15 23:03:20,548 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:20,548 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409282797] [2019-11-15 23:03:20,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:20,549 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:20,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:03:20,913 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2019-11-15 23:03:20,914 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409282797] [2019-11-15 23:03:20,915 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:03:20,915 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:03:20,915 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035382412] [2019-11-15 23:03:20,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:03:20,916 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:03:20,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:03:20,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:03:20,917 INFO L87 Difference]: Start difference. First operand 5020 states and 6043 transitions. Second operand 3 states. [2019-11-15 23:03:21,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:03:21,973 INFO L93 Difference]: Finished difference Result 10957 states and 13202 transitions. [2019-11-15 23:03:21,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:03:21,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2019-11-15 23:03:21,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:03:22,007 INFO L225 Difference]: With dead ends: 10957 [2019-11-15 23:03:22,008 INFO L226 Difference]: Without dead ends: 6123 [2019-11-15 23:03:22,014 INFO L600 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-11-15 23:03:22,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6123 states. [2019-11-15 23:03:22,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6123 to 4095. [2019-11-15 23:03:22,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4095 states. [2019-11-15 23:03:22,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4095 states to 4095 states and 4972 transitions. [2019-11-15 23:03:22,139 INFO L78 Accepts]: Start accepts. Automaton has 4095 states and 4972 transitions. Word has length 316 [2019-11-15 23:03:22,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:03:22,140 INFO L462 AbstractCegarLoop]: Abstraction has 4095 states and 4972 transitions. [2019-11-15 23:03:22,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:03:22,140 INFO L276 IsEmpty]: Start isEmpty. Operand 4095 states and 4972 transitions. [2019-11-15 23:03:22,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-11-15 23:03:22,151 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:03:22,152 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:03:22,152 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:03:22,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:22,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1398734134, now seen corresponding path program 1 times [2019-11-15 23:03:22,153 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:22,153 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983159478] [2019-11-15 23:03:22,154 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:22,154 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:22,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:03:22,566 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:03:22,567 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983159478] [2019-11-15 23:03:22,567 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:03:22,568 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:03:22,568 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535312845] [2019-11-15 23:03:22,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:03:22,569 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:03:22,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:03:22,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:03:22,570 INFO L87 Difference]: Start difference. First operand 4095 states and 4972 transitions. Second operand 5 states. [2019-11-15 23:03:24,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:03:24,951 INFO L93 Difference]: Finished difference Result 12988 states and 15982 transitions. [2019-11-15 23:03:24,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:03:24,952 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 357 [2019-11-15 23:03:24,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:03:25,017 INFO L225 Difference]: With dead ends: 12988 [2019-11-15 23:03:25,017 INFO L226 Difference]: Without dead ends: 9079 [2019-11-15 23:03:25,025 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:03:25,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9079 states. [2019-11-15 23:03:25,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9079 to 7042. [2019-11-15 23:03:25,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7042 states. [2019-11-15 23:03:25,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7042 states to 7042 states and 8610 transitions. [2019-11-15 23:03:25,222 INFO L78 Accepts]: Start accepts. Automaton has 7042 states and 8610 transitions. Word has length 357 [2019-11-15 23:03:25,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:03:25,223 INFO L462 AbstractCegarLoop]: Abstraction has 7042 states and 8610 transitions. [2019-11-15 23:03:25,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:03:25,223 INFO L276 IsEmpty]: Start isEmpty. Operand 7042 states and 8610 transitions. [2019-11-15 23:03:25,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2019-11-15 23:03:25,244 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:03:25,244 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:03:25,245 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:03:25,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:25,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1353131440, now seen corresponding path program 1 times [2019-11-15 23:03:25,245 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:25,246 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101558873] [2019-11-15 23:03:25,246 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:25,246 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:25,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:03:25,833 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 375 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-11-15 23:03:25,834 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101558873] [2019-11-15 23:03:25,834 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:03:25,834 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:03:25,834 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486111656] [2019-11-15 23:03:25,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:03:25,835 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:03:25,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:03:25,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:03:25,836 INFO L87 Difference]: Start difference. First operand 7042 states and 8610 transitions. Second operand 5 states. [2019-11-15 23:03:27,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:03:27,989 INFO L93 Difference]: Finished difference Result 16119 states and 19726 transitions. [2019-11-15 23:03:27,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:03:27,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 441 [2019-11-15 23:03:27,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:03:28,009 INFO L225 Difference]: With dead ends: 16119 [2019-11-15 23:03:28,009 INFO L226 Difference]: Without dead ends: 9263 [2019-11-15 23:03:28,019 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:03:28,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9263 states. [2019-11-15 23:03:28,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9263 to 7042. [2019-11-15 23:03:28,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7042 states. [2019-11-15 23:03:28,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7042 states to 7042 states and 8610 transitions. [2019-11-15 23:03:28,167 INFO L78 Accepts]: Start accepts. Automaton has 7042 states and 8610 transitions. Word has length 441 [2019-11-15 23:03:28,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:03:28,168 INFO L462 AbstractCegarLoop]: Abstraction has 7042 states and 8610 transitions. [2019-11-15 23:03:28,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:03:28,168 INFO L276 IsEmpty]: Start isEmpty. Operand 7042 states and 8610 transitions. [2019-11-15 23:03:28,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-11-15 23:03:28,192 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:03:28,193 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:03:28,193 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:03:28,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:28,194 INFO L82 PathProgramCache]: Analyzing trace with hash -877017006, now seen corresponding path program 1 times [2019-11-15 23:03:28,194 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:28,194 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912820151] [2019-11-15 23:03:28,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:28,195 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:28,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:03:28,924 INFO L134 CoverageAnalysis]: Checked inductivity of 538 backedges. 364 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-11-15 23:03:28,924 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912820151] [2019-11-15 23:03:28,925 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:03:28,925 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:03:28,926 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11969228] [2019-11-15 23:03:28,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:03:28,927 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:03:28,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:03:28,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:03:28,927 INFO L87 Difference]: Start difference. First operand 7042 states and 8610 transitions. Second operand 3 states. [2019-11-15 23:03:29,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:03:29,567 INFO L93 Difference]: Finished difference Result 13893 states and 17023 transitions. [2019-11-15 23:03:29,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:03:29,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 493 [2019-11-15 23:03:29,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:03:29,583 INFO L225 Difference]: With dead ends: 13893 [2019-11-15 23:03:29,584 INFO L226 Difference]: Without dead ends: 7037 [2019-11-15 23:03:29,593 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:03:29,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7037 states. [2019-11-15 23:03:29,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7037 to 7037. [2019-11-15 23:03:29,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7037 states. [2019-11-15 23:03:29,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7037 states to 7037 states and 8599 transitions. [2019-11-15 23:03:29,718 INFO L78 Accepts]: Start accepts. Automaton has 7037 states and 8599 transitions. Word has length 493 [2019-11-15 23:03:29,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:03:29,727 INFO L462 AbstractCegarLoop]: Abstraction has 7037 states and 8599 transitions. [2019-11-15 23:03:29,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:03:29,727 INFO L276 IsEmpty]: Start isEmpty. Operand 7037 states and 8599 transitions. [2019-11-15 23:03:29,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2019-11-15 23:03:29,751 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:03:29,753 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-15 23:03:29,753 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:03:29,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:29,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1125740758, now seen corresponding path program 1 times [2019-11-15 23:03:29,754 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:29,755 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151450403] [2019-11-15 23:03:29,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:29,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:29,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:29,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:03:30,335 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 647 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-11-15 23:03:30,336 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151450403] [2019-11-15 23:03:30,336 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:03:30,337 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:03:30,337 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197026678] [2019-11-15 23:03:30,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:03:30,338 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:03:30,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:03:30,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:03:30,339 INFO L87 Difference]: Start difference. First operand 7037 states and 8599 transitions. Second operand 3 states. [2019-11-15 23:03:31,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:03:31,284 INFO L93 Difference]: Finished difference Result 12408 states and 15152 transitions. [2019-11-15 23:03:31,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:03:31,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 535 [2019-11-15 23:03:31,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:03:31,300 INFO L225 Difference]: With dead ends: 12408 [2019-11-15 23:03:31,300 INFO L226 Difference]: Without dead ends: 5557 [2019-11-15 23:03:31,313 INFO L600 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-11-15 23:03:31,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5557 states. [2019-11-15 23:03:31,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5557 to 3900. [2019-11-15 23:03:31,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3900 states. [2019-11-15 23:03:31,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3900 states to 3900 states and 4517 transitions. [2019-11-15 23:03:31,385 INFO L78 Accepts]: Start accepts. Automaton has 3900 states and 4517 transitions. Word has length 535 [2019-11-15 23:03:31,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:03:31,386 INFO L462 AbstractCegarLoop]: Abstraction has 3900 states and 4517 transitions. [2019-11-15 23:03:31,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:03:31,387 INFO L276 IsEmpty]: Start isEmpty. Operand 3900 states and 4517 transitions. [2019-11-15 23:03:31,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 615 [2019-11-15 23:03:31,398 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:03:31,400 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:03:31,401 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:03:31,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:03:31,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1667602872, now seen corresponding path program 1 times [2019-11-15 23:03:31,401 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:03:31,402 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725850502] [2019-11-15 23:03:31,402 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:31,402 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:03:31,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:03:31,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:03:32,222 INFO L134 CoverageAnalysis]: Checked inductivity of 971 backedges. 733 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2019-11-15 23:03:32,223 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725850502] [2019-11-15 23:03:32,223 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:03:32,224 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:03:32,224 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585942236] [2019-11-15 23:03:32,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:03:32,225 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:03:32,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:03:32,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:03:32,225 INFO L87 Difference]: Start difference. First operand 3900 states and 4517 transitions. Second operand 5 states. [2019-11-15 23:03:34,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:03:34,512 INFO L93 Difference]: Finished difference Result 12778 states and 14723 transitions. [2019-11-15 23:03:34,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:03:34,514 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 614 [2019-11-15 23:03:34,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:03:34,515 INFO L225 Difference]: With dead ends: 12778 [2019-11-15 23:03:34,515 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:03:34,527 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:03:34,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:03:34,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:03:34,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:03:34,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:03:34,529 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 614 [2019-11-15 23:03:34,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:03:34,529 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:03:34,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:03:34,529 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:03:34,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:03:34,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 23:03:34,850 WARN L191 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 178 [2019-11-15 23:03:35,073 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 178 [2019-11-15 23:03:36,138 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 176 DAG size of output: 67 [2019-11-15 23:03:37,284 WARN L191 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 176 DAG size of output: 67 [2019-11-15 23:03:37,286 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-11-15 23:03:37,286 INFO L443 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-11-15 23:03:37,286 INFO L443 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-11-15 23:03:37,286 INFO L446 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-11-15 23:03:37,287 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,287 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,287 INFO L443 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,287 INFO L443 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,287 INFO L443 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,287 INFO L443 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,287 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,287 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-15 23:03:37,287 INFO L443 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-11-15 23:03:37,288 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-15 23:03:37,288 INFO L443 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,288 INFO L443 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,288 INFO L443 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,288 INFO L443 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,288 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,288 INFO L443 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,288 INFO L443 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,288 INFO L443 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,288 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,288 INFO L443 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-11-15 23:03:37,289 INFO L443 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-11-15 23:03:37,289 INFO L443 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-11-15 23:03:37,289 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,293 INFO L439 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse3 (= 12 ~a25~0))) (let ((.cse4 (not .cse3)) (.cse11 (not (= ~a4~0 1)))) (let ((.cse9 (< 138 ~a23~0)) (.cse6 (<= ~a29~0 599999)) (.cse5 (= 1 ~a4~0)) (.cse8 (<= (+ ~a29~0 21) 0)) (.cse0 (<= ~a29~0 140)) (.cse7 (not (= ~a25~0 13))) (.cse10 (and .cse4 .cse11)) (.cse2 (<= ~a29~0 599998)) (.cse1 (= 15 ~a8~0))) (or (and (and (= 10 ~a25~0) .cse0) .cse1) (and .cse2 .cse1 (and .cse3 (< 306 ~a23~0))) (and .cse4 .cse1 (<= ~a29~0 245) .cse5) (and .cse3 (<= (+ ~a29~0 22) 0) .cse1) (and .cse4 .cse6 .cse7 .cse1 .cse5) (and (and .cse8 .cse9) .cse1 .cse5) (and .cse2 .cse1 (and .cse4 .cse9) .cse5) (and (and .cse6 (and .cse7 (<= 312 ~a23~0))) .cse1 .cse5) (and (or (and .cse8 .cse10) (and .cse7 (and .cse0 .cse11))) (<= ~a23~0 312) .cse1) (and .cse7 .cse2 .cse1 .cse10 (<= (+ ~a23~0 43) 0)) (and .cse3 .cse11 .cse2 .cse1))))) [2019-11-15 23:03:37,293 INFO L443 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,294 INFO L443 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,294 INFO L443 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,294 INFO L443 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,294 INFO L443 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,294 INFO L443 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,294 INFO L443 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,295 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,295 INFO L443 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-11-15 23:03:37,295 INFO L443 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-11-15 23:03:37,295 INFO L443 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-11-15 23:03:37,295 INFO L443 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-11-15 23:03:37,295 INFO L443 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-11-15 23:03:37,296 INFO L443 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-11-15 23:03:37,296 INFO L443 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-11-15 23:03:37,296 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,296 INFO L443 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,296 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,296 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,297 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,297 INFO L443 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,297 INFO L443 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,297 INFO L443 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,297 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,297 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,298 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-11-15 23:03:37,298 INFO L443 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-11-15 23:03:37,298 INFO L443 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-11-15 23:03:37,298 INFO L443 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-11-15 23:03:37,298 INFO L443 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,298 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,299 INFO L443 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,299 INFO L443 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,299 INFO L443 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,299 INFO L443 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-11-15 23:03:37,299 INFO L443 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-11-15 23:03:37,299 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-15 23:03:37,300 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,300 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,300 INFO L443 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,300 INFO L443 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,300 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-11-15 23:03:37,300 INFO L443 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-11-15 23:03:37,301 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,301 INFO L443 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,301 INFO L443 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,301 INFO L443 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,301 INFO L443 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,301 INFO L443 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,302 INFO L443 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-11-15 23:03:37,302 INFO L443 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-11-15 23:03:37,302 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,302 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,302 INFO L443 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-11-15 23:03:37,302 INFO L443 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-11-15 23:03:37,303 INFO L443 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-11-15 23:03:37,303 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,303 INFO L443 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,303 INFO L443 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,303 INFO L443 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,303 INFO L443 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,304 INFO L443 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,304 INFO L443 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,304 INFO L443 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-11-15 23:03:37,304 INFO L443 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-11-15 23:03:37,304 INFO L443 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-11-15 23:03:37,304 INFO L443 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-11-15 23:03:37,305 INFO L443 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-11-15 23:03:37,305 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-11-15 23:03:37,305 INFO L443 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-11-15 23:03:37,305 INFO L443 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,305 INFO L443 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,305 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 23:03:37,306 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-11-15 23:03:37,306 INFO L443 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-11-15 23:03:37,306 INFO L443 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,306 INFO L443 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,306 INFO L443 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,306 INFO L443 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,307 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,307 INFO L443 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-11-15 23:03:37,307 INFO L443 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-11-15 23:03:37,307 INFO L443 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-11-15 23:03:37,307 INFO L443 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,307 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,307 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,308 INFO L443 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,308 INFO L443 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,308 INFO L443 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,308 INFO L443 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-11-15 23:03:37,309 INFO L443 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-11-15 23:03:37,309 INFO L443 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-11-15 23:03:37,309 INFO L443 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,309 INFO L443 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,309 INFO L443 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,309 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,310 INFO L443 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,310 INFO L443 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,310 INFO L443 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,310 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 23:03:37,310 INFO L443 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,310 INFO L443 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-11-15 23:03:37,311 INFO L443 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-11-15 23:03:37,311 INFO L443 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-11-15 23:03:37,311 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,311 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,311 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,311 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,312 INFO L443 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,312 INFO L443 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,312 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,312 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,312 INFO L443 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,312 INFO L443 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,312 INFO L443 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,313 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-11-15 23:03:37,313 INFO L443 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-11-15 23:03:37,313 INFO L443 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-15 23:03:37,313 INFO L443 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-11-15 23:03:37,313 INFO L443 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-11-15 23:03:37,314 INFO L443 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,314 INFO L443 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,314 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,314 INFO L443 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,314 INFO L443 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,314 INFO L443 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,315 INFO L443 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,315 INFO L443 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-11-15 23:03:37,315 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-11-15 23:03:37,315 INFO L443 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-11-15 23:03:37,315 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,315 INFO L443 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,316 INFO L443 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,316 INFO L443 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-11-15 23:03:37,316 INFO L443 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-11-15 23:03:37,316 INFO L443 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,316 INFO L443 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,316 INFO L443 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,316 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,317 INFO L443 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,317 INFO L443 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-11-15 23:03:37,317 INFO L443 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-11-15 23:03:37,317 INFO L443 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,317 INFO L443 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,317 INFO L443 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-11-15 23:03:37,318 INFO L443 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-11-15 23:03:37,318 INFO L443 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,318 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,318 INFO L443 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,318 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,318 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,319 INFO L443 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,319 INFO L443 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-11-15 23:03:37,319 INFO L443 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-11-15 23:03:37,319 INFO L443 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-11-15 23:03:37,319 INFO L443 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-11-15 23:03:37,319 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,320 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 162) no Hoare annotation was computed. [2019-11-15 23:03:37,320 INFO L443 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,320 INFO L443 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,320 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,320 INFO L443 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,320 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,321 INFO L443 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,321 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,321 INFO L443 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-11-15 23:03:37,321 INFO L443 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-11-15 23:03:37,321 INFO L443 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-11-15 23:03:37,321 INFO L443 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-11-15 23:03:37,322 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-11-15 23:03:37,322 INFO L443 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-11-15 23:03:37,322 INFO L443 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,322 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,322 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,322 INFO L443 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,323 INFO L443 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,323 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,323 INFO L443 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,323 INFO L443 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-15 23:03:37,323 INFO L443 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-11-15 23:03:37,323 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 23:03:37,324 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,324 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,324 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,324 INFO L443 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,324 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,324 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,324 INFO L443 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-11-15 23:03:37,325 INFO L443 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-11-15 23:03:37,325 INFO L443 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,325 INFO L443 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,325 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,325 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,325 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,326 INFO L443 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,326 INFO L443 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,326 INFO L443 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-11-15 23:03:37,326 INFO L443 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,326 INFO L443 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,326 INFO L443 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,327 INFO L443 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-11-15 23:03:37,327 INFO L443 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-11-15 23:03:37,327 INFO L443 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-11-15 23:03:37,327 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,327 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-11-15 23:03:37,327 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,327 INFO L443 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-11-15 23:03:37,328 INFO L443 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,328 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,328 INFO L443 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,328 INFO L443 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,328 INFO L443 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,328 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,329 INFO L443 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-11-15 23:03:37,329 INFO L443 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-11-15 23:03:37,329 INFO L443 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-11-15 23:03:37,329 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,330 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,330 INFO L443 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,331 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 23:03:37,331 INFO L443 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,331 INFO L443 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,331 INFO L443 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,331 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,332 INFO L443 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,332 INFO L443 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,332 INFO L443 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,334 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-11-15 23:03:37,334 INFO L443 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-11-15 23:03:37,334 INFO L443 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-11-15 23:03:37,334 INFO L443 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,334 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-11-15 23:03:37,334 INFO L443 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-11-15 23:03:37,335 INFO L443 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,335 INFO L443 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,335 INFO L443 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,335 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,335 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,335 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,335 INFO L443 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-11-15 23:03:37,336 INFO L443 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-15 23:03:37,336 INFO L443 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-11-15 23:03:37,336 INFO L443 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,336 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,336 INFO L443 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,337 INFO L439 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse3 (= 12 ~a25~0))) (let ((.cse4 (not .cse3)) (.cse11 (not (= ~a4~0 1)))) (let ((.cse9 (< 138 ~a23~0)) (.cse6 (<= ~a29~0 599999)) (.cse5 (= 1 ~a4~0)) (.cse8 (<= (+ ~a29~0 21) 0)) (.cse0 (<= ~a29~0 140)) (.cse7 (not (= ~a25~0 13))) (.cse10 (and .cse4 .cse11)) (.cse2 (<= ~a29~0 599998)) (.cse1 (= 15 ~a8~0))) (or (and (and (= 10 ~a25~0) .cse0) .cse1) (and .cse2 .cse1 (and .cse3 (< 306 ~a23~0))) (and .cse4 .cse1 (<= ~a29~0 245) .cse5) (and .cse3 (<= (+ ~a29~0 22) 0) .cse1) (and .cse4 .cse6 .cse7 .cse1 .cse5) (and (and .cse8 .cse9) .cse1 .cse5) (and .cse2 .cse1 (and .cse4 .cse9) .cse5) (and (and .cse6 (and .cse7 (<= 312 ~a23~0))) .cse1 .cse5) (and (or (and .cse8 .cse10) (and .cse7 (and .cse0 .cse11))) (<= ~a23~0 312) .cse1) (and .cse7 .cse2 .cse1 .cse10 (<= (+ ~a23~0 43) 0)) (and .cse3 .cse11 .cse2 .cse1))))) [2019-11-15 23:03:37,337 INFO L443 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,337 INFO L443 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-11-15 23:03:37,337 INFO L443 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-11-15 23:03:37,337 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,337 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,337 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-11-15 23:03:37,338 INFO L443 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,338 INFO L443 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,338 INFO L443 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-11-15 23:03:37,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:03:37 BoogieIcfgContainer [2019-11-15 23:03:37,386 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:03:37,386 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:03:37,386 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:03:37,387 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:03:37,387 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:03:07" (3/4) ... [2019-11-15 23:03:37,391 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:03:37,426 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 23:03:37,428 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 23:03:37,690 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8d5ccd81-ffe4-413e-bfff-b18fd3ae0164/bin/uautomizer/witness.graphml [2019-11-15 23:03:37,690 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:03:37,692 INFO L168 Benchmark]: Toolchain (without parser) took 33428.83 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 893.4 MB). Free memory was 944.7 MB in the beginning and 1.7 GB in the end (delta: -797.1 MB). Peak memory consumption was 96.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:03:37,692 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:03:37,693 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1018.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:03:37,693 INFO L168 Benchmark]: Boogie Procedure Inliner took 171.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:03:37,693 INFO L168 Benchmark]: Boogie Preprocessor took 163.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:03:37,694 INFO L168 Benchmark]: RCFGBuilder took 2347.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 905.8 MB in the end (delta: 173.7 MB). Peak memory consumption was 173.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:03:37,694 INFO L168 Benchmark]: TraceAbstraction took 29418.74 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 736.6 MB). Free memory was 905.8 MB in the beginning and 1.8 GB in the end (delta: -862.9 MB). Peak memory consumption was 579.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:03:37,695 INFO L168 Benchmark]: Witness Printer took 304.38 ms. Allocated memory is still 1.9 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:03:37,697 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1018.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 171.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 163.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2347.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 905.8 MB in the end (delta: 173.7 MB). Peak memory consumption was 173.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29418.74 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 736.6 MB). Free memory was 905.8 MB in the beginning and 1.8 GB in the end (delta: -862.9 MB). Peak memory consumption was 579.9 MB. Max. memory is 11.5 GB. * Witness Printer took 304.38 ms. Allocated memory is still 1.9 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 162]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant Derived loop invariant: (((((((((((10 == a25 && a29 <= 140) && 15 == a8) || ((a29 <= 599998 && 15 == a8) && 12 == a25 && 306 < a23)) || (((!(12 == a25) && 15 == a8) && a29 <= 245) && 1 == a4)) || ((12 == a25 && a29 + 22 <= 0) && 15 == a8)) || ((((!(12 == a25) && a29 <= 599999) && !(a25 == 13)) && 15 == a8) && 1 == a4)) || (((a29 + 21 <= 0 && 138 < a23) && 15 == a8) && 1 == a4)) || (((a29 <= 599998 && 15 == a8) && !(12 == a25) && 138 < a23) && 1 == a4)) || (((a29 <= 599999 && !(a25 == 13) && 312 <= a23) && 15 == a8) && 1 == a4)) || ((((a29 + 21 <= 0 && !(12 == a25) && !(a4 == 1)) || (!(a25 == 13) && a29 <= 140 && !(a4 == 1))) && a23 <= 312) && 15 == a8)) || ((((!(a25 == 13) && a29 <= 599998) && 15 == a8) && !(12 == a25) && !(a4 == 1)) && a23 + 43 <= 0)) || (((12 == a25 && !(a4 == 1)) && a29 <= 599998) && 15 == a8) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((((((((((10 == a25 && a29 <= 140) && 15 == a8) || ((a29 <= 599998 && 15 == a8) && 12 == a25 && 306 < a23)) || (((!(12 == a25) && 15 == a8) && a29 <= 245) && 1 == a4)) || ((12 == a25 && a29 + 22 <= 0) && 15 == a8)) || ((((!(12 == a25) && a29 <= 599999) && !(a25 == 13)) && 15 == a8) && 1 == a4)) || (((a29 + 21 <= 0 && 138 < a23) && 15 == a8) && 1 == a4)) || (((a29 <= 599998 && 15 == a8) && !(12 == a25) && 138 < a23) && 1 == a4)) || (((a29 <= 599999 && !(a25 == 13) && 312 <= a23) && 15 == a8) && 1 == a4)) || ((((a29 + 21 <= 0 && !(12 == a25) && !(a4 == 1)) || (!(a25 == 13) && a29 <= 140 && !(a4 == 1))) && a23 <= 312) && 15 == a8)) || ((((!(a25 == 13) && a29 <= 599998) && 15 == a8) && !(12 == a25) && !(a4 == 1)) && a23 + 43 <= 0)) || (((12 == a25 && !(a4 == 1)) && a29 <= 599998) && 15 == a8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Result: SAFE, OverallTime: 29.2s, OverallIterations: 11, TraceHistogramMax: 5, AutomataDifference: 19.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.7s, HoareTripleCheckerStatistics: 1122 SDtfs, 3612 SDslu, 410 SDs, 0 SdLazy, 10557 SolverSat, 2451 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7042occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 10584 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 102 NumberOfFragments, 397 HoareAnnotationTreeSize, 3 FomulaSimplifications, 5932 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 3 FomulaSimplificationsInter, 9168 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 3561 NumberOfCodeBlocks, 3561 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 3550 ConstructedInterpolants, 0 QuantifiedInterpolants, 2917425 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 3875/3875 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...