./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label35.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_820437e4-2887-45ef-b6be-cfa751e7ab74/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_820437e4-2887-45ef-b6be-cfa751e7ab74/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_820437e4-2887-45ef-b6be-cfa751e7ab74/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_820437e4-2887-45ef-b6be-cfa751e7ab74/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label35.c -s /tmp/vcloud-vcloud-master/worker/run_dir_820437e4-2887-45ef-b6be-cfa751e7ab74/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_820437e4-2887-45ef-b6be-cfa751e7ab74/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 8337eb1f63d7c636385adcfc171aa1b64a009941 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 03:00:02,890 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 03:00:02,892 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 03:00:02,907 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 03:00:02,907 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 03:00:02,909 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 03:00:02,911 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 03:00:02,921 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 03:00:02,922 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 03:00:02,923 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 03:00:02,929 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 03:00:02,930 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 03:00:02,931 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 03:00:02,934 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 03:00:02,935 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 03:00:02,936 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 03:00:02,937 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 03:00:02,939 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 03:00:02,942 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 03:00:02,946 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 03:00:02,950 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 03:00:02,952 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 03:00:02,955 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 03:00:02,956 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 03:00:02,959 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 03:00:02,960 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 03:00:02,960 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 03:00:02,961 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 03:00:02,962 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 03:00:02,963 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 03:00:02,963 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 03:00:02,964 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 03:00:02,965 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 03:00:02,966 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 03:00:02,966 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 03:00:02,967 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 03:00:02,967 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 03:00:02,968 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 03:00:02,968 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 03:00:02,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 03:00:02,970 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 03:00:02,971 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_820437e4-2887-45ef-b6be-cfa751e7ab74/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 03:00:02,995 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 03:00:03,000 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 03:00:03,002 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 03:00:03,002 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 03:00:03,002 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 03:00:03,002 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 03:00:03,002 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 03:00:03,003 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 03:00:03,003 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 03:00:03,003 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 03:00:03,003 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 03:00:03,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 03:00:03,004 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 03:00:03,004 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 03:00:03,004 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 03:00:03,004 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 03:00:03,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 03:00:03,005 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 03:00:03,005 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 03:00:03,005 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 03:00:03,005 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 03:00:03,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:00:03,006 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 03:00:03,006 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 03:00:03,006 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 03:00:03,006 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 03:00:03,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 03:00:03,007 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 03:00:03,007 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_820437e4-2887-45ef-b6be-cfa751e7ab74/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 -> 8337eb1f63d7c636385adcfc171aa1b64a009941 [2019-11-20 03:00:03,147 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 03:00:03,157 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 03:00:03,161 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 03:00:03,162 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 03:00:03,162 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 03:00:03,163 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_820437e4-2887-45ef-b6be-cfa751e7ab74/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem11_label35.c [2019-11-20 03:00:03,214 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_820437e4-2887-45ef-b6be-cfa751e7ab74/bin/uautomizer/data/e7ff8ae24/76a2b9c4a5d74b52a155a2089406d297/FLAGd04d2dbbc [2019-11-20 03:00:03,747 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 03:00:03,748 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_820437e4-2887-45ef-b6be-cfa751e7ab74/sv-benchmarks/c/eca-rers2012/Problem11_label35.c [2019-11-20 03:00:03,761 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_820437e4-2887-45ef-b6be-cfa751e7ab74/bin/uautomizer/data/e7ff8ae24/76a2b9c4a5d74b52a155a2089406d297/FLAGd04d2dbbc [2019-11-20 03:00:04,234 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_820437e4-2887-45ef-b6be-cfa751e7ab74/bin/uautomizer/data/e7ff8ae24/76a2b9c4a5d74b52a155a2089406d297 [2019-11-20 03:00:04,236 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 03:00:04,240 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 03:00:04,250 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 03:00:04,251 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 03:00:04,254 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 03:00:04,255 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:00:04" (1/1) ... [2019-11-20 03:00:04,259 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e744f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:00:04, skipping insertion in model container [2019-11-20 03:00:04,259 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:00:04" (1/1) ... [2019-11-20 03:00:04,266 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 03:00:04,333 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 03:00:04,956 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:00:04,960 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 03:00:05,107 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:00:05,122 INFO L192 MainTranslator]: Completed translation [2019-11-20 03:00:05,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:00:05 WrapperNode [2019-11-20 03:00:05,123 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 03:00:05,123 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 03:00:05,123 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 03:00:05,124 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 03:00:05,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:00:05" (1/1) ... [2019-11-20 03:00:05,150 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:00:05" (1/1) ... [2019-11-20 03:00:05,229 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 03:00:05,230 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 03:00:05,230 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 03:00:05,231 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 03:00:05,239 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:00:05" (1/1) ... [2019-11-20 03:00:05,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:00:05" (1/1) ... [2019-11-20 03:00:05,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:00:05" (1/1) ... [2019-11-20 03:00:05,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:00:05" (1/1) ... [2019-11-20 03:00:05,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:00:05" (1/1) ... [2019-11-20 03:00:05,296 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:00:05" (1/1) ... [2019-11-20 03:00:05,315 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:00:05" (1/1) ... [2019-11-20 03:00:05,330 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 03:00:05,330 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 03:00:05,330 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 03:00:05,331 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 03:00:05,331 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:00:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_820437e4-2887-45ef-b6be-cfa751e7ab74/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-20 03:00:05,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 03:00:05,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 03:00:07,446 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 03:00:07,446 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 03:00:07,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:00:07 BoogieIcfgContainer [2019-11-20 03:00:07,449 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 03:00:07,450 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 03:00:07,450 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 03:00:07,453 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 03:00:07,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:00:04" (1/3) ... [2019-11-20 03:00:07,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cfe4059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:00:07, skipping insertion in model container [2019-11-20 03:00:07,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:00:05" (2/3) ... [2019-11-20 03:00:07,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cfe4059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:00:07, skipping insertion in model container [2019-11-20 03:00:07,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:00:07" (3/3) ... [2019-11-20 03:00:07,456 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label35.c [2019-11-20 03:00:07,467 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 03:00:07,475 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 03:00:07,486 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 03:00:07,522 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 03:00:07,523 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 03:00:07,523 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 03:00:07,523 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 03:00:07,523 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 03:00:07,523 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 03:00:07,524 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 03:00:07,524 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 03:00:07,553 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-11-20 03:00:07,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-20 03:00:07,601 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:00:07,602 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:00:07,603 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:00:07,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:00:07,621 INFO L82 PathProgramCache]: Analyzing trace with hash -2074400678, now seen corresponding path program 1 times [2019-11-20 03:00:07,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:00:07,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020488525] [2019-11-20 03:00:07,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:00:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:00:07,964 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-20 03:00:07,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020488525] [2019-11-20 03:00:07,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:00:07,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:00:07,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748574226] [2019-11-20 03:00:07,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:00:07,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:00:07,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:00:07,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:00:07,987 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-11-20 03:00:10,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:00:10,233 INFO L93 Difference]: Finished difference Result 954 states and 1721 transitions. [2019-11-20 03:00:10,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:00:10,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-20 03:00:10,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:00:10,262 INFO L225 Difference]: With dead ends: 954 [2019-11-20 03:00:10,265 INFO L226 Difference]: Without dead ends: 603 [2019-11-20 03:00:10,269 INFO L630 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-20 03:00:10,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-11-20 03:00:10,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2019-11-20 03:00:10,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-11-20 03:00:10,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 837 transitions. [2019-11-20 03:00:10,348 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 837 transitions. Word has length 58 [2019-11-20 03:00:10,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:00:10,348 INFO L462 AbstractCegarLoop]: Abstraction has 603 states and 837 transitions. [2019-11-20 03:00:10,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:00:10,349 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 837 transitions. [2019-11-20 03:00:10,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-20 03:00:10,355 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:00:10,355 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:00:10,356 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:00:10,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:00:10,356 INFO L82 PathProgramCache]: Analyzing trace with hash 720217396, now seen corresponding path program 1 times [2019-11-20 03:00:10,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:00:10,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580487949] [2019-11-20 03:00:10,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:00:10,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:00:10,607 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:00:10,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580487949] [2019-11-20 03:00:10,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:00:10,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:00:10,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341490558] [2019-11-20 03:00:10,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:00:10,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:00:10,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:00:10,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:00:10,611 INFO L87 Difference]: Start difference. First operand 603 states and 837 transitions. Second operand 4 states. [2019-11-20 03:00:12,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:00:12,175 INFO L93 Difference]: Finished difference Result 2330 states and 3249 transitions. [2019-11-20 03:00:12,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:00:12,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-11-20 03:00:12,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:00:12,186 INFO L225 Difference]: With dead ends: 2330 [2019-11-20 03:00:12,186 INFO L226 Difference]: Without dead ends: 1729 [2019-11-20 03:00:12,189 INFO L630 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-20 03:00:12,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states. [2019-11-20 03:00:12,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1343. [2019-11-20 03:00:12,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1343 states. [2019-11-20 03:00:12,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1799 transitions. [2019-11-20 03:00:12,238 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1799 transitions. Word has length 127 [2019-11-20 03:00:12,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:00:12,238 INFO L462 AbstractCegarLoop]: Abstraction has 1343 states and 1799 transitions. [2019-11-20 03:00:12,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:00:12,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1799 transitions. [2019-11-20 03:00:12,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-20 03:00:12,248 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:00:12,248 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:00:12,248 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:00:12,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:00:12,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1117470811, now seen corresponding path program 1 times [2019-11-20 03:00:12,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:00:12,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121319349] [2019-11-20 03:00:12,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:00:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:00:12,546 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:00:12,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121319349] [2019-11-20 03:00:12,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:00:12,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:00:12,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369299754] [2019-11-20 03:00:12,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 03:00:12,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:00:12,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 03:00:12,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:00:12,549 INFO L87 Difference]: Start difference. First operand 1343 states and 1799 transitions. Second operand 5 states. [2019-11-20 03:00:14,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:00:14,808 INFO L93 Difference]: Finished difference Result 5086 states and 6859 transitions. [2019-11-20 03:00:14,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 03:00:14,808 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-11-20 03:00:14,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:00:14,825 INFO L225 Difference]: With dead ends: 5086 [2019-11-20 03:00:14,826 INFO L226 Difference]: Without dead ends: 3561 [2019-11-20 03:00:14,828 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-20 03:00:14,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3561 states. [2019-11-20 03:00:14,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3561 to 3188. [2019-11-20 03:00:14,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3188 states. [2019-11-20 03:00:14,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3188 states to 3188 states and 3880 transitions. [2019-11-20 03:00:14,901 INFO L78 Accepts]: Start accepts. Automaton has 3188 states and 3880 transitions. Word has length 148 [2019-11-20 03:00:14,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:00:14,901 INFO L462 AbstractCegarLoop]: Abstraction has 3188 states and 3880 transitions. [2019-11-20 03:00:14,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 03:00:14,902 INFO L276 IsEmpty]: Start isEmpty. Operand 3188 states and 3880 transitions. [2019-11-20 03:00:14,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-11-20 03:00:14,908 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:00:14,908 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 03:00:14,908 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:00:14,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:00:14,909 INFO L82 PathProgramCache]: Analyzing trace with hash -226709585, now seen corresponding path program 1 times [2019-11-20 03:00:14,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:00:14,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89454687] [2019-11-20 03:00:14,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:00:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:00:15,090 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-20 03:00:15,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89454687] [2019-11-20 03:00:15,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:00:15,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:00:15,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171729596] [2019-11-20 03:00:15,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:00:15,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:00:15,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:00:15,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:00:15,093 INFO L87 Difference]: Start difference. First operand 3188 states and 3880 transitions. Second operand 4 states. [2019-11-20 03:00:16,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:00:16,636 INFO L93 Difference]: Finished difference Result 8784 states and 10747 transitions. [2019-11-20 03:00:16,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:00:16,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 263 [2019-11-20 03:00:16,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:00:16,666 INFO L225 Difference]: With dead ends: 8784 [2019-11-20 03:00:16,666 INFO L226 Difference]: Without dead ends: 5598 [2019-11-20 03:00:16,671 INFO L630 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-20 03:00:16,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5598 states. [2019-11-20 03:00:16,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5598 to 5396. [2019-11-20 03:00:16,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5396 states. [2019-11-20 03:00:16,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5396 states to 5396 states and 6405 transitions. [2019-11-20 03:00:16,806 INFO L78 Accepts]: Start accepts. Automaton has 5396 states and 6405 transitions. Word has length 263 [2019-11-20 03:00:16,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:00:16,807 INFO L462 AbstractCegarLoop]: Abstraction has 5396 states and 6405 transitions. [2019-11-20 03:00:16,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:00:16,807 INFO L276 IsEmpty]: Start isEmpty. Operand 5396 states and 6405 transitions. [2019-11-20 03:00:16,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-11-20 03:00:16,815 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:00:16,815 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 03:00:16,816 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:00:16,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:00:16,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1038105358, now seen corresponding path program 1 times [2019-11-20 03:00:16,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:00:16,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365950583] [2019-11-20 03:00:16,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:00:16,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:00:17,107 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-20 03:00:17,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365950583] [2019-11-20 03:00:17,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:00:17,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:00:17,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398612478] [2019-11-20 03:00:17,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:00:17,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:00:17,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:00:17,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:00:17,110 INFO L87 Difference]: Start difference. First operand 5396 states and 6405 transitions. Second operand 3 states. [2019-11-20 03:00:18,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:00:18,120 INFO L93 Difference]: Finished difference Result 11525 states and 13880 transitions. [2019-11-20 03:00:18,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:00:18,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 272 [2019-11-20 03:00:18,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:00:18,151 INFO L225 Difference]: With dead ends: 11525 [2019-11-20 03:00:18,151 INFO L226 Difference]: Without dead ends: 6131 [2019-11-20 03:00:18,159 INFO L630 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-20 03:00:18,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6131 states. [2019-11-20 03:00:18,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6131 to 6131. [2019-11-20 03:00:18,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6131 states. [2019-11-20 03:00:18,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6131 states to 6131 states and 7295 transitions. [2019-11-20 03:00:18,281 INFO L78 Accepts]: Start accepts. Automaton has 6131 states and 7295 transitions. Word has length 272 [2019-11-20 03:00:18,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:00:18,282 INFO L462 AbstractCegarLoop]: Abstraction has 6131 states and 7295 transitions. [2019-11-20 03:00:18,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:00:18,282 INFO L276 IsEmpty]: Start isEmpty. Operand 6131 states and 7295 transitions. [2019-11-20 03:00:18,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-11-20 03:00:18,289 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:00:18,289 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 03:00:18,290 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:00:18,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:00:18,290 INFO L82 PathProgramCache]: Analyzing trace with hash -782853808, now seen corresponding path program 1 times [2019-11-20 03:00:18,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:00:18,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351616001] [2019-11-20 03:00:18,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:00:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:00:18,708 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:00:18,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351616001] [2019-11-20 03:00:18,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:00:18,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 03:00:18,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896512658] [2019-11-20 03:00:18,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 03:00:18,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:00:18,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 03:00:18,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:00:18,712 INFO L87 Difference]: Start difference. First operand 6131 states and 7295 transitions. Second operand 5 states. [2019-11-20 03:00:20,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:00:20,536 INFO L93 Difference]: Finished difference Result 14493 states and 17627 transitions. [2019-11-20 03:00:20,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 03:00:20,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 275 [2019-11-20 03:00:20,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:00:20,568 INFO L225 Difference]: With dead ends: 14493 [2019-11-20 03:00:20,568 INFO L226 Difference]: Without dead ends: 8364 [2019-11-20 03:00:20,574 INFO L630 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-20 03:00:20,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8364 states. [2019-11-20 03:00:20,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8364 to 7979. [2019-11-20 03:00:20,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7979 states. [2019-11-20 03:00:20,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7979 states to 7979 states and 9488 transitions. [2019-11-20 03:00:20,725 INFO L78 Accepts]: Start accepts. Automaton has 7979 states and 9488 transitions. Word has length 275 [2019-11-20 03:00:20,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:00:20,727 INFO L462 AbstractCegarLoop]: Abstraction has 7979 states and 9488 transitions. [2019-11-20 03:00:20,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 03:00:20,727 INFO L276 IsEmpty]: Start isEmpty. Operand 7979 states and 9488 transitions. [2019-11-20 03:00:20,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-11-20 03:00:20,736 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:00:20,736 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:00:20,737 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:00:20,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:00:20,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1481290674, now seen corresponding path program 1 times [2019-11-20 03:00:20,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:00:20,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462704158] [2019-11-20 03:00:20,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:00:20,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:00:21,183 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 197 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:00:21,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462704158] [2019-11-20 03:00:21,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72783211] [2019-11-20 03:00:21,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_820437e4-2887-45ef-b6be-cfa751e7ab74/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:00:21,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:00:21,307 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 03:00:21,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:00:21,512 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:00:21,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 03:00:21,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-20 03:00:21,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810225533] [2019-11-20 03:00:21,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:00:21,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:00:21,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:00:21,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 03:00:21,514 INFO L87 Difference]: Start difference. First operand 7979 states and 9488 transitions. Second operand 4 states. [2019-11-20 03:00:22,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:00:22,949 INFO L93 Difference]: Finished difference Result 17062 states and 20370 transitions. [2019-11-20 03:00:22,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:00:22,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 291 [2019-11-20 03:00:22,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:00:22,998 INFO L225 Difference]: With dead ends: 17062 [2019-11-20 03:00:22,999 INFO L226 Difference]: Without dead ends: 8716 [2019-11-20 03:00:23,010 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 03:00:23,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8716 states. [2019-11-20 03:00:23,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8716 to 7790. [2019-11-20 03:00:23,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7790 states. [2019-11-20 03:00:23,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7790 states to 7790 states and 9036 transitions. [2019-11-20 03:00:23,162 INFO L78 Accepts]: Start accepts. Automaton has 7790 states and 9036 transitions. Word has length 291 [2019-11-20 03:00:23,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:00:23,163 INFO L462 AbstractCegarLoop]: Abstraction has 7790 states and 9036 transitions. [2019-11-20 03:00:23,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:00:23,163 INFO L276 IsEmpty]: Start isEmpty. Operand 7790 states and 9036 transitions. [2019-11-20 03:00:23,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-11-20 03:00:23,174 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:00:23,174 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:00:23,379 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:00:23,379 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:00:23,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:00:23,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1258174705, now seen corresponding path program 1 times [2019-11-20 03:00:23,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:00:23,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398832198] [2019-11-20 03:00:23,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:00:23,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:00:23,803 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-20 03:00:23,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398832198] [2019-11-20 03:00:23,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:00:23,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:00:23,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29516483] [2019-11-20 03:00:23,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:00:23,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:00:23,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:00:23,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:00:23,807 INFO L87 Difference]: Start difference. First operand 7790 states and 9036 transitions. Second operand 4 states. [2019-11-20 03:00:25,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:00:25,224 INFO L93 Difference]: Finished difference Result 16516 states and 19129 transitions. [2019-11-20 03:00:25,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:00:25,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 340 [2019-11-20 03:00:25,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:00:25,241 INFO L225 Difference]: With dead ends: 16516 [2019-11-20 03:00:25,241 INFO L226 Difference]: Without dead ends: 8728 [2019-11-20 03:00:25,249 INFO L630 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-20 03:00:25,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8728 states. [2019-11-20 03:00:25,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8728 to 8158. [2019-11-20 03:00:25,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8158 states. [2019-11-20 03:00:25,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8158 states to 8158 states and 9307 transitions. [2019-11-20 03:00:25,374 INFO L78 Accepts]: Start accepts. Automaton has 8158 states and 9307 transitions. Word has length 340 [2019-11-20 03:00:25,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:00:25,374 INFO L462 AbstractCegarLoop]: Abstraction has 8158 states and 9307 transitions. [2019-11-20 03:00:25,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:00:25,375 INFO L276 IsEmpty]: Start isEmpty. Operand 8158 states and 9307 transitions. [2019-11-20 03:00:25,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-11-20 03:00:25,388 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:00:25,388 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 03:00:25,389 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:00:25,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:00:25,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1242905813, now seen corresponding path program 1 times [2019-11-20 03:00:25,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:00:25,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222502241] [2019-11-20 03:00:25,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:00:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:00:25,839 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:00:25,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222502241] [2019-11-20 03:00:25,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770170351] [2019-11-20 03:00:25,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_820437e4-2887-45ef-b6be-cfa751e7ab74/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:00:26,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:00:26,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 03:00:26,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:00:26,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:00:26,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:00:26,574 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 179 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:00:26,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:00:26,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-11-20 03:00:26,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939047081] [2019-11-20 03:00:26,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 03:00:26,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:00:26,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 03:00:26,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-20 03:00:26,576 INFO L87 Difference]: Start difference. First operand 8158 states and 9307 transitions. Second operand 9 states. [2019-11-20 03:00:36,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:00:36,527 INFO L93 Difference]: Finished difference Result 40539 states and 46181 transitions. [2019-11-20 03:00:36,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-20 03:00:36,527 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 356 [2019-11-20 03:00:36,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:00:36,585 INFO L225 Difference]: With dead ends: 40539 [2019-11-20 03:00:36,585 INFO L226 Difference]: Without dead ends: 32199 [2019-11-20 03:00:36,595 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=735, Unknown=0, NotChecked=0, Total=992 [2019-11-20 03:00:36,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32199 states. [2019-11-20 03:00:36,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32199 to 18323. [2019-11-20 03:00:36,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18323 states. [2019-11-20 03:00:36,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18323 states to 18323 states and 20426 transitions. [2019-11-20 03:00:36,915 INFO L78 Accepts]: Start accepts. Automaton has 18323 states and 20426 transitions. Word has length 356 [2019-11-20 03:00:36,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:00:36,915 INFO L462 AbstractCegarLoop]: Abstraction has 18323 states and 20426 transitions. [2019-11-20 03:00:36,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 03:00:36,916 INFO L276 IsEmpty]: Start isEmpty. Operand 18323 states and 20426 transitions. [2019-11-20 03:00:36,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-11-20 03:00:36,932 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:00:36,933 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:00:37,137 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:00:37,141 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:00:37,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:00:37,141 INFO L82 PathProgramCache]: Analyzing trace with hash -503808845, now seen corresponding path program 1 times [2019-11-20 03:00:37,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:00:37,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875159363] [2019-11-20 03:00:37,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:00:37,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:00:37,736 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 240 proven. 202 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:00:37,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875159363] [2019-11-20 03:00:37,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427834758] [2019-11-20 03:00:37,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_820437e4-2887-45ef-b6be-cfa751e7ab74/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:00:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:00:37,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 03:00:37,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:00:37,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:00:37,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:00:37,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:00:37,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:00:37,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:00:37,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:00:37,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:00:37,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:00:37,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:00:37,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:00:37,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:00:37,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:00:37,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:00:37,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:00:37,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:00:37,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:00:37,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:00:37,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:00:37,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:00:37,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:00:37,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:00:37,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:00:37,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:00:37,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:00:37,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:00:37,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:00:38,266 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 28 [2019-11-20 03:00:38,842 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 167 proven. 179 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-20 03:00:38,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:00:38,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 3] total 11 [2019-11-20 03:00:38,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48857589] [2019-11-20 03:00:38,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 03:00:38,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:00:38,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 03:00:38,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-20 03:00:38,845 INFO L87 Difference]: Start difference. First operand 18323 states and 20426 transitions. Second operand 11 states. [2019-11-20 03:00:49,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:00:49,282 INFO L93 Difference]: Finished difference Result 47923 states and 53415 transitions. [2019-11-20 03:00:49,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 03:00:49,283 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 357 [2019-11-20 03:00:49,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:00:49,337 INFO L225 Difference]: With dead ends: 47923 [2019-11-20 03:00:49,337 INFO L226 Difference]: Without dead ends: 28498 [2019-11-20 03:00:49,356 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2019-11-20 03:00:49,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28498 states. [2019-11-20 03:00:49,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28498 to 20169. [2019-11-20 03:00:49,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20169 states. [2019-11-20 03:00:49,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20169 states to 20169 states and 22202 transitions. [2019-11-20 03:00:49,657 INFO L78 Accepts]: Start accepts. Automaton has 20169 states and 22202 transitions. Word has length 357 [2019-11-20 03:00:49,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:00:49,657 INFO L462 AbstractCegarLoop]: Abstraction has 20169 states and 22202 transitions. [2019-11-20 03:00:49,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 03:00:49,658 INFO L276 IsEmpty]: Start isEmpty. Operand 20169 states and 22202 transitions. [2019-11-20 03:00:49,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2019-11-20 03:00:49,676 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:00:49,677 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 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-20 03:00:49,977 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:00:49,977 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:00:49,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:00:49,977 INFO L82 PathProgramCache]: Analyzing trace with hash -209708669, now seen corresponding path program 1 times [2019-11-20 03:00:49,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:00:49,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775689572] [2019-11-20 03:00:49,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:00:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:00:50,470 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 432 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:00:50,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775689572] [2019-11-20 03:00:50,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353499009] [2019-11-20 03:00:50,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_820437e4-2887-45ef-b6be-cfa751e7ab74/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:00:50,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:00:50,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 03:00:50,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:00:50,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:00:50,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:00:51,562 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 257 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:00:51,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:00:51,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 10 [2019-11-20 03:00:51,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302230651] [2019-11-20 03:00:51,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 03:00:51,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:00:51,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 03:00:51,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-20 03:00:51,565 INFO L87 Difference]: Start difference. First operand 20169 states and 22202 transitions. Second operand 10 states. [2019-11-20 03:00:56,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:00:56,863 INFO L93 Difference]: Finished difference Result 48275 states and 53158 transitions. [2019-11-20 03:00:56,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-20 03:00:56,864 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 453 [2019-11-20 03:00:56,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:00:56,894 INFO L225 Difference]: With dead ends: 48275 [2019-11-20 03:00:56,894 INFO L226 Difference]: Without dead ends: 27740 [2019-11-20 03:00:56,904 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 460 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2019-11-20 03:00:56,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27740 states. [2019-11-20 03:00:57,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27740 to 16276. [2019-11-20 03:00:57,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16276 states. [2019-11-20 03:00:57,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16276 states to 16276 states and 17771 transitions. [2019-11-20 03:00:57,191 INFO L78 Accepts]: Start accepts. Automaton has 16276 states and 17771 transitions. Word has length 453 [2019-11-20 03:00:57,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:00:57,192 INFO L462 AbstractCegarLoop]: Abstraction has 16276 states and 17771 transitions. [2019-11-20 03:00:57,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 03:00:57,192 INFO L276 IsEmpty]: Start isEmpty. Operand 16276 states and 17771 transitions. [2019-11-20 03:00:57,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2019-11-20 03:00:57,208 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:00:57,208 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:00:57,411 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:00:57,412 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:00:57,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:00:57,412 INFO L82 PathProgramCache]: Analyzing trace with hash 602582262, now seen corresponding path program 1 times [2019-11-20 03:00:57,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:00:57,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432531927] [2019-11-20 03:00:57,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:00:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:00:58,017 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 692 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-11-20 03:00:58,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432531927] [2019-11-20 03:00:58,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:00:58,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:00:58,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331461745] [2019-11-20 03:00:58,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 03:00:58,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:00:58,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 03:00:58,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:00:58,020 INFO L87 Difference]: Start difference. First operand 16276 states and 17771 transitions. Second operand 5 states. [2019-11-20 03:00:59,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:00:59,730 INFO L93 Difference]: Finished difference Result 40671 states and 44356 transitions. [2019-11-20 03:00:59,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 03:00:59,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 528 [2019-11-20 03:00:59,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:00:59,757 INFO L225 Difference]: With dead ends: 40671 [2019-11-20 03:00:59,758 INFO L226 Difference]: Without dead ends: 23476 [2019-11-20 03:00:59,769 INFO L630 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-20 03:00:59,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23476 states. [2019-11-20 03:00:59,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23476 to 20883. [2019-11-20 03:00:59,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20883 states. [2019-11-20 03:01:00,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20883 states to 20883 states and 22756 transitions. [2019-11-20 03:01:00,021 INFO L78 Accepts]: Start accepts. Automaton has 20883 states and 22756 transitions. Word has length 528 [2019-11-20 03:01:00,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:01:00,021 INFO L462 AbstractCegarLoop]: Abstraction has 20883 states and 22756 transitions. [2019-11-20 03:01:00,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 03:01:00,022 INFO L276 IsEmpty]: Start isEmpty. Operand 20883 states and 22756 transitions. [2019-11-20 03:01:00,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 709 [2019-11-20 03:01:00,049 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:01:00,050 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:01:00,050 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:01:00,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:01:00,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1722003640, now seen corresponding path program 1 times [2019-11-20 03:01:00,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:01:00,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337648216] [2019-11-20 03:01:00,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:01:00,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:01:00,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 1293 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2019-11-20 03:01:00,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337648216] [2019-11-20 03:01:00,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:01:00,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:01:00,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883079677] [2019-11-20 03:01:00,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:01:00,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:01:00,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:01:00,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:01:00,615 INFO L87 Difference]: Start difference. First operand 20883 states and 22756 transitions. Second operand 4 states. [2019-11-20 03:01:01,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:01:01,786 INFO L93 Difference]: Finished difference Result 41781 states and 45535 transitions. [2019-11-20 03:01:01,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:01:01,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 708 [2019-11-20 03:01:01,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:01:01,806 INFO L225 Difference]: With dead ends: 41781 [2019-11-20 03:01:01,806 INFO L226 Difference]: Without dead ends: 21084 [2019-11-20 03:01:01,818 INFO L630 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-20 03:01:01,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21084 states. [2019-11-20 03:01:02,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21084 to 20331. [2019-11-20 03:01:02,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20331 states. [2019-11-20 03:01:02,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20331 states to 20331 states and 21878 transitions. [2019-11-20 03:01:02,154 INFO L78 Accepts]: Start accepts. Automaton has 20331 states and 21878 transitions. Word has length 708 [2019-11-20 03:01:02,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:01:02,155 INFO L462 AbstractCegarLoop]: Abstraction has 20331 states and 21878 transitions. [2019-11-20 03:01:02,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:01:02,155 INFO L276 IsEmpty]: Start isEmpty. Operand 20331 states and 21878 transitions. [2019-11-20 03:01:02,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2019-11-20 03:01:02,173 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:01:02,173 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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, 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-20 03:01:02,173 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:01:02,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:01:02,174 INFO L82 PathProgramCache]: Analyzing trace with hash -472132574, now seen corresponding path program 1 times [2019-11-20 03:01:02,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:01:02,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903016574] [2019-11-20 03:01:02,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:01:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:01:02,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1755 backedges. 792 proven. 0 refuted. 0 times theorem prover too weak. 963 trivial. 0 not checked. [2019-11-20 03:01:02,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903016574] [2019-11-20 03:01:02,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:01:02,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:01:02,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961406638] [2019-11-20 03:01:02,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:01:02,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:01:02,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:01:02,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:01:02,772 INFO L87 Difference]: Start difference. First operand 20331 states and 21878 transitions. Second operand 3 states. [2019-11-20 03:01:03,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:01:03,651 INFO L93 Difference]: Finished difference Result 41763 states and 44921 transitions. [2019-11-20 03:01:03,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:01:03,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 732 [2019-11-20 03:01:03,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:01:03,653 INFO L225 Difference]: With dead ends: 41763 [2019-11-20 03:01:03,653 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 03:01:03,663 INFO L630 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-20 03:01:03,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 03:01:03,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 03:01:03,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 03:01:03,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 03:01:03,664 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 732 [2019-11-20 03:01:03,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:01:03,664 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 03:01:03,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:01:03,665 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 03:01:03,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 03:01:03,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 03:01:05,046 WARN L191 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 726 DAG size of output: 485 [2019-11-20 03:01:06,258 WARN L191 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 726 DAG size of output: 485 [2019-11-20 03:01:09,104 WARN L191 SmtUtils]: Spent 2.84 s on a formula simplification. DAG size of input: 440 DAG size of output: 109 [2019-11-20 03:01:11,664 WARN L191 SmtUtils]: Spent 2.56 s on a formula simplification. DAG size of input: 440 DAG size of output: 109 [2019-11-20 03:01:11,667 INFO L444 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-11-20 03:01:11,667 INFO L444 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-11-20 03:01:11,667 INFO L444 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-11-20 03:01:11,667 INFO L447 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-11-20 03:01:11,667 INFO L444 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,667 INFO L444 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,667 INFO L444 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,667 INFO L444 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,667 INFO L444 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,667 INFO L444 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,667 INFO L444 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,668 INFO L444 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-20 03:01:11,668 INFO L444 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-11-20 03:01:11,668 INFO L444 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-20 03:01:11,668 INFO L444 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,668 INFO L444 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,668 INFO L444 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,668 INFO L444 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,668 INFO L444 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,668 INFO L444 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,668 INFO L444 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,668 INFO L444 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,668 INFO L444 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,668 INFO L444 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-11-20 03:01:11,668 INFO L444 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-11-20 03:01:11,668 INFO L444 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-11-20 03:01:11,668 INFO L444 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,669 INFO L440 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse8 (<= ~a29~0 130)) (.cse6 (<= ~a29~0 599998)) (.cse13 (= ~a25~0 11)) (.cse1 (= ~a25~0 9)) (.cse2 (<= ~a29~0 140)) (.cse5 (not (= ~a4~0 1))) (.cse12 (= 10 ~a25~0)) (.cse7 (<= (+ ~a23~0 43) 0)) (.cse0 (<= ~a23~0 312)) (.cse14 (= 12 ~a25~0)) (.cse16 (= ~a25~0 12)) (.cse4 (<= ~a29~0 277)) (.cse10 (<= 130 ~a29~0)) (.cse3 (= ~a25~0 13)) (.cse9 (= 1 ~a4~0)) (.cse11 (< 138 ~a23~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse4 .cse5) (and .cse1 .cse6 .cse7) (and .cse3 .cse4 .cse7) (and .cse1 .cse8) (and .cse3 (and (and (<= ~a29~0 245) .cse9) .cse10)) (and (or .cse4 .cse11) .cse12 .cse9) (and (<= 0 (+ ~a23~0 599772)) (and .cse9 .cse13)) (and .cse14 .cse4 .cse7) (let ((.cse15 (<= 312 ~a23~0))) (or (and .cse8 .cse9 .cse10 .cse15) (and (<= (+ ~a29~0 276403) 0) (<= ~a25~0 12) .cse9 .cse15))) (and .cse6 .cse13 .cse7) (and .cse1 .cse9) (and .cse12 .cse2) (and .cse16 .cse0 .cse9 .cse11) (and .cse4 (and .cse14 .cse5)) (and .cse3 (exists ((v_~a29~0_502 Int)) (let ((.cse17 (+ v_~a29~0_502 69157))) (and (<= 130 v_~a29~0_502) (<= ~a29~0 (+ (mod .cse17 299861) 300138)) (<= 0 .cse17)))) .cse9 .cse11) (and .cse12 .cse9 .cse7) (and .cse0 (and .cse14 (<= (+ ~a29~0 22) 0))) (and (and .cse16 .cse4) .cse10) (and .cse3 (exists ((v_~a23~0_473 Int)) (let ((.cse18 (div v_~a23~0_473 5))) (let ((.cse19 (* 4 .cse18))) (and (<= 0 v_~a23~0_473) (<= 312 v_~a23~0_473) (<= ~a23~0 (+ (mod (* .cse18 4) 83) 180)) (<= 0 .cse19) (<= 0 (+ .cse19 4)))))) .cse9 .cse11))) [2019-11-20 03:01:11,669 INFO L444 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,669 INFO L444 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,669 INFO L444 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,669 INFO L444 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,669 INFO L444 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,669 INFO L444 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,669 INFO L444 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,669 INFO L444 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,669 INFO L444 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-11-20 03:01:11,669 INFO L444 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-11-20 03:01:11,670 INFO L444 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-11-20 03:01:11,670 INFO L444 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-11-20 03:01:11,670 INFO L444 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-11-20 03:01:11,670 INFO L444 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-11-20 03:01:11,670 INFO L444 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-11-20 03:01:11,670 INFO L444 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,670 INFO L444 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,670 INFO L444 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,670 INFO L444 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,670 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,670 INFO L444 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,670 INFO L444 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,670 INFO L444 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,670 INFO L444 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,670 INFO L444 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,670 INFO L444 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-11-20 03:01:11,671 INFO L444 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-11-20 03:01:11,671 INFO L444 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-11-20 03:01:11,671 INFO L444 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-11-20 03:01:11,671 INFO L444 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,671 INFO L444 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,671 INFO L444 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,671 INFO L444 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,672 INFO L444 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,672 INFO L444 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-11-20 03:01:11,672 INFO L444 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-11-20 03:01:11,672 INFO L444 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-20 03:01:11,672 INFO L444 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,672 INFO L444 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,673 INFO L444 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,673 INFO L444 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,674 INFO L444 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-11-20 03:01:11,674 INFO L444 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-11-20 03:01:11,674 INFO L444 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,674 INFO L444 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,674 INFO L444 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,674 INFO L444 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,674 INFO L444 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,674 INFO L444 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,674 INFO L444 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-11-20 03:01:11,674 INFO L444 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-11-20 03:01:11,674 INFO L444 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,674 INFO L444 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,674 INFO L444 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-11-20 03:01:11,674 INFO L444 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-11-20 03:01:11,674 INFO L444 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-11-20 03:01:11,674 INFO L444 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,675 INFO L444 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,675 INFO L444 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,675 INFO L444 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,675 INFO L444 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,675 INFO L444 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,675 INFO L444 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,675 INFO L444 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-11-20 03:01:11,675 INFO L444 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-11-20 03:01:11,675 INFO L444 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-11-20 03:01:11,676 INFO L444 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-11-20 03:01:11,676 INFO L444 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-11-20 03:01:11,676 INFO L444 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-11-20 03:01:11,676 INFO L444 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-11-20 03:01:11,676 INFO L444 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,676 INFO L444 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,676 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 03:01:11,676 INFO L444 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-11-20 03:01:11,676 INFO L444 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-11-20 03:01:11,677 INFO L444 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,677 INFO L444 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,677 INFO L444 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,677 INFO L444 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,677 INFO L444 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,677 INFO L444 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-11-20 03:01:11,677 INFO L444 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-11-20 03:01:11,677 INFO L444 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-11-20 03:01:11,677 INFO L444 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,677 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,677 INFO L444 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,677 INFO L444 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,677 INFO L444 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,677 INFO L444 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,678 INFO L444 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-11-20 03:01:11,678 INFO L444 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-11-20 03:01:11,678 INFO L444 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-11-20 03:01:11,678 INFO L444 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,678 INFO L444 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,678 INFO L444 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,678 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,678 INFO L444 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,678 INFO L444 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,679 INFO L444 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,679 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 03:01:11,679 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 180) no Hoare annotation was computed. [2019-11-20 03:01:11,679 INFO L444 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,679 INFO L444 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-11-20 03:01:11,679 INFO L444 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-11-20 03:01:11,679 INFO L444 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-11-20 03:01:11,679 INFO L444 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,680 INFO L444 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,681 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,681 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,681 INFO L444 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,681 INFO L444 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,681 INFO L444 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,681 INFO L444 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,681 INFO L444 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,682 INFO L444 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,682 INFO L444 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,682 INFO L444 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-11-20 03:01:11,682 INFO L444 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-11-20 03:01:11,682 INFO L444 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-20 03:01:11,682 INFO L444 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-11-20 03:01:11,682 INFO L444 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-11-20 03:01:11,682 INFO L444 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,683 INFO L444 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,683 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,683 INFO L444 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,683 INFO L444 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,683 INFO L444 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,683 INFO L444 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,683 INFO L444 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-11-20 03:01:11,683 INFO L444 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-11-20 03:01:11,683 INFO L444 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-11-20 03:01:11,683 INFO L444 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,684 INFO L444 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,684 INFO L444 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,684 INFO L444 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-11-20 03:01:11,684 INFO L444 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-11-20 03:01:11,684 INFO L444 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,684 INFO L444 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,684 INFO L444 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,684 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,684 INFO L444 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,684 INFO L444 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-11-20 03:01:11,684 INFO L444 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-11-20 03:01:11,684 INFO L444 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,684 INFO L444 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,684 INFO L444 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-11-20 03:01:11,684 INFO L444 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-11-20 03:01:11,684 INFO L444 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,685 INFO L444 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,685 INFO L444 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,685 INFO L444 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,685 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,685 INFO L444 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,685 INFO L444 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-11-20 03:01:11,685 INFO L444 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-11-20 03:01:11,685 INFO L444 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-11-20 03:01:11,685 INFO L444 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-11-20 03:01:11,685 INFO L444 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,685 INFO L444 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,685 INFO L444 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,685 INFO L444 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,685 INFO L444 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,685 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,685 INFO L444 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,686 INFO L444 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,686 INFO L444 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-11-20 03:01:11,686 INFO L444 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-11-20 03:01:11,686 INFO L444 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-11-20 03:01:11,686 INFO L444 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-11-20 03:01:11,686 INFO L444 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-11-20 03:01:11,686 INFO L444 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-11-20 03:01:11,686 INFO L444 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,686 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,686 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,686 INFO L444 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,686 INFO L444 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,686 INFO L444 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,686 INFO L444 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,686 INFO L444 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-20 03:01:11,687 INFO L444 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-11-20 03:01:11,687 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 03:01:11,687 INFO L444 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,687 INFO L444 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,687 INFO L444 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,687 INFO L444 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,687 INFO L444 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,687 INFO L444 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,688 INFO L444 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-11-20 03:01:11,688 INFO L444 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-11-20 03:01:11,688 INFO L444 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,688 INFO L444 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,688 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,688 INFO L444 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,688 INFO L444 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,688 INFO L444 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,689 INFO L444 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,689 INFO L444 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-11-20 03:01:11,689 INFO L444 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,689 INFO L444 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,689 INFO L444 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,689 INFO L444 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-11-20 03:01:11,689 INFO L444 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-11-20 03:01:11,690 INFO L444 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-11-20 03:01:11,690 INFO L444 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,690 INFO L444 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-11-20 03:01:11,690 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,690 INFO L444 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-11-20 03:01:11,690 INFO L444 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,690 INFO L444 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,690 INFO L444 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,691 INFO L444 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,691 INFO L444 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,691 INFO L444 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,691 INFO L444 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-11-20 03:01:11,691 INFO L444 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-11-20 03:01:11,691 INFO L444 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-11-20 03:01:11,691 INFO L444 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,692 INFO L444 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,692 INFO L444 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,692 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 03:01:11,692 INFO L444 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,692 INFO L444 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,692 INFO L444 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,692 INFO L444 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,692 INFO L444 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,693 INFO L444 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,693 INFO L444 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,693 INFO L444 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-11-20 03:01:11,693 INFO L444 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-11-20 03:01:11,693 INFO L444 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-11-20 03:01:11,693 INFO L444 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,693 INFO L444 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-11-20 03:01:11,694 INFO L444 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-11-20 03:01:11,694 INFO L444 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,694 INFO L444 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,694 INFO L444 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,694 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,694 INFO L444 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,694 INFO L444 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,694 INFO L444 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-11-20 03:01:11,695 INFO L444 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-20 03:01:11,695 INFO L444 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-11-20 03:01:11,695 INFO L444 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,695 INFO L444 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,695 INFO L444 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,696 INFO L440 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse8 (<= ~a29~0 130)) (.cse6 (<= ~a29~0 599998)) (.cse13 (= ~a25~0 11)) (.cse1 (= ~a25~0 9)) (.cse2 (<= ~a29~0 140)) (.cse5 (not (= ~a4~0 1))) (.cse12 (= 10 ~a25~0)) (.cse7 (<= (+ ~a23~0 43) 0)) (.cse0 (<= ~a23~0 312)) (.cse14 (= 12 ~a25~0)) (.cse16 (= ~a25~0 12)) (.cse4 (<= ~a29~0 277)) (.cse10 (<= 130 ~a29~0)) (.cse3 (= ~a25~0 13)) (.cse9 (= 1 ~a4~0)) (.cse11 (< 138 ~a23~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse4 .cse5) (and .cse1 .cse6 .cse7) (and .cse3 .cse4 .cse7) (and .cse1 .cse8) (and .cse3 (and (and (<= ~a29~0 245) .cse9) .cse10)) (and (or .cse4 .cse11) .cse12 .cse9) (and (<= 0 (+ ~a23~0 599772)) (and .cse9 .cse13)) (and .cse14 .cse4 .cse7) (let ((.cse15 (<= 312 ~a23~0))) (or (and .cse8 .cse9 .cse10 .cse15) (and (<= (+ ~a29~0 276403) 0) (<= ~a25~0 12) .cse9 .cse15))) (and .cse6 .cse13 .cse7) (and .cse1 .cse9) (and .cse12 .cse2) (and .cse16 .cse0 .cse9 .cse11) (and .cse4 (and .cse14 .cse5)) (and .cse3 (exists ((v_~a29~0_502 Int)) (let ((.cse17 (+ v_~a29~0_502 69157))) (and (<= 130 v_~a29~0_502) (<= ~a29~0 (+ (mod .cse17 299861) 300138)) (<= 0 .cse17)))) .cse9 .cse11) (and .cse12 .cse9 .cse7) (and .cse0 (and .cse14 (<= (+ ~a29~0 22) 0))) (and (and .cse16 .cse4) .cse10) (and .cse3 (exists ((v_~a23~0_473 Int)) (let ((.cse18 (div v_~a23~0_473 5))) (let ((.cse19 (* 4 .cse18))) (and (<= 0 v_~a23~0_473) (<= 312 v_~a23~0_473) (<= ~a23~0 (+ (mod (* .cse18 4) 83) 180)) (<= 0 .cse19) (<= 0 (+ .cse19 4)))))) .cse9 .cse11))) [2019-11-20 03:01:11,696 INFO L444 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,696 INFO L444 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-11-20 03:01:11,696 INFO L444 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-11-20 03:01:11,696 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,696 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,696 INFO L444 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-11-20 03:01:11,696 INFO L444 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,696 INFO L444 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,696 INFO L444 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:01:11,705 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 03:01:11,706 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 03:01:11,707 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 03:01:11,707 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-20 03:01:11,707 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-20 03:01:11,708 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-20 03:01:11,708 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-20 03:01:11,708 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-20 03:01:11,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 03:01:11,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 03:01:11,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 03:01:11,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-20 03:01:11,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-20 03:01:11,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-20 03:01:11,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-20 03:01:11,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-20 03:01:11,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 03:01:11,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 03:01:11,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 03:01:11,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-20 03:01:11,724 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-20 03:01:11,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-20 03:01:11,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-20 03:01:11,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-20 03:01:11,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 03:01:11,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 03:01:11,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 03:01:11,729 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-20 03:01:11,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-20 03:01:11,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-20 03:01:11,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-20 03:01:11,730 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-20 03:01:11,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 03:01:11 BoogieIcfgContainer [2019-11-20 03:01:11,735 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 03:01:11,736 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 03:01:11,736 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 03:01:11,736 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 03:01:11,736 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:00:07" (3/4) ... [2019-11-20 03:01:11,739 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 03:01:11,766 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 03:01:11,768 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 03:01:11,796 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((a23 <= 312 && a25 == 9) && a29 <= 140) || (((a25 == 13 && a23 <= 312) && a29 <= 277) && !(a4 == 1))) || ((a25 == 9 && a29 <= 599998) && a23 + 43 <= 0)) || ((a25 == 13 && a29 <= 277) && a23 + 43 <= 0)) || (a25 == 9 && a29 <= 130)) || (a25 == 13 && (a29 <= 245 && 1 == a4) && 130 <= a29)) || (((a29 <= 277 || 138 < a23) && 10 == a25) && 1 == a4)) || (0 <= a23 + 599772 && 1 == a4 && a25 == 11)) || ((12 == a25 && a29 <= 277) && a23 + 43 <= 0)) || (((a29 <= 130 && 1 == a4) && 130 <= a29) && 312 <= a23) || (((a29 + 276403 <= 0 && a25 <= 12) && 1 == a4) && 312 <= a23)) || ((a29 <= 599998 && a25 == 11) && a23 + 43 <= 0)) || (a25 == 9 && 1 == a4)) || (10 == a25 && a29 <= 140)) || (((a25 == 12 && a23 <= 312) && 1 == a4) && 138 < a23)) || (a29 <= 277 && 12 == a25 && !(a4 == 1))) || (((a25 == 13 && (\exists v_~a29~0_502 : int :: (130 <= v_~a29~0_502 && a29 <= (v_~a29~0_502 + 69157) % 299861 + 300138) && 0 <= v_~a29~0_502 + 69157)) && 1 == a4) && 138 < a23)) || ((10 == a25 && 1 == a4) && a23 + 43 <= 0)) || (a23 <= 312 && 12 == a25 && a29 + 22 <= 0)) || ((a25 == 12 && a29 <= 277) && 130 <= a29)) || (((a25 == 13 && (\exists v_~a23~0_473 : int :: (((0 <= v_~a23~0_473 && 312 <= v_~a23~0_473) && a23 <= v_~a23~0_473 / 5 * 4 % 83 + 180) && 0 <= 4 * (v_~a23~0_473 / 5)) && 0 <= 4 * (v_~a23~0_473 / 5) + 4)) && 1 == a4) && 138 < a23) [2019-11-20 03:01:11,800 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((a23 <= 312 && a25 == 9) && a29 <= 140) || (((a25 == 13 && a23 <= 312) && a29 <= 277) && !(a4 == 1))) || ((a25 == 9 && a29 <= 599998) && a23 + 43 <= 0)) || ((a25 == 13 && a29 <= 277) && a23 + 43 <= 0)) || (a25 == 9 && a29 <= 130)) || (a25 == 13 && (a29 <= 245 && 1 == a4) && 130 <= a29)) || (((a29 <= 277 || 138 < a23) && 10 == a25) && 1 == a4)) || (0 <= a23 + 599772 && 1 == a4 && a25 == 11)) || ((12 == a25 && a29 <= 277) && a23 + 43 <= 0)) || (((a29 <= 130 && 1 == a4) && 130 <= a29) && 312 <= a23) || (((a29 + 276403 <= 0 && a25 <= 12) && 1 == a4) && 312 <= a23)) || ((a29 <= 599998 && a25 == 11) && a23 + 43 <= 0)) || (a25 == 9 && 1 == a4)) || (10 == a25 && a29 <= 140)) || (((a25 == 12 && a23 <= 312) && 1 == a4) && 138 < a23)) || (a29 <= 277 && 12 == a25 && !(a4 == 1))) || (((a25 == 13 && (\exists v_~a29~0_502 : int :: (130 <= v_~a29~0_502 && a29 <= (v_~a29~0_502 + 69157) % 299861 + 300138) && 0 <= v_~a29~0_502 + 69157)) && 1 == a4) && 138 < a23)) || ((10 == a25 && 1 == a4) && a23 + 43 <= 0)) || (a23 <= 312 && 12 == a25 && a29 + 22 <= 0)) || ((a25 == 12 && a29 <= 277) && 130 <= a29)) || (((a25 == 13 && (\exists v_~a23~0_473 : int :: (((0 <= v_~a23~0_473 && 312 <= v_~a23~0_473) && a23 <= v_~a23~0_473 / 5 * 4 % 83 + 180) && 0 <= 4 * (v_~a23~0_473 / 5)) && 0 <= 4 * (v_~a23~0_473 / 5) + 4)) && 1 == a4) && 138 < a23) [2019-11-20 03:01:11,931 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_820437e4-2887-45ef-b6be-cfa751e7ab74/bin/uautomizer/witness.graphml [2019-11-20 03:01:11,931 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 03:01:11,932 INFO L168 Benchmark]: Toolchain (without parser) took 67694.86 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.8 GB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -125.9 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-11-20 03:01:11,933 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 959.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:01:11,933 INFO L168 Benchmark]: CACSL2BoogieTranslator took 872.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -162.4 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-11-20 03:01:11,933 INFO L168 Benchmark]: Boogie Procedure Inliner took 106.68 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: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2019-11-20 03:01:11,934 INFO L168 Benchmark]: Boogie Preprocessor took 99.85 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.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2019-11-20 03:01:11,934 INFO L168 Benchmark]: RCFGBuilder took 2118.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 899.3 MB in the end (delta: 175.5 MB). Peak memory consumption was 175.5 MB. Max. memory is 11.5 GB. [2019-11-20 03:01:11,934 INFO L168 Benchmark]: TraceAbstraction took 64285.23 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 899.3 MB in the beginning and 1.1 GB in the end (delta: -179.4 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-11-20 03:01:11,935 INFO L168 Benchmark]: Witness Printer took 195.72 ms. Allocated memory is still 2.8 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. [2019-11-20 03:01:11,937 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 959.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 872.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -162.4 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 106.68 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: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 99.85 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.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2118.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 899.3 MB in the end (delta: 175.5 MB). Peak memory consumption was 175.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 64285.23 ms. Allocated memory was 1.2 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 899.3 MB in the beginning and 1.1 GB in the end (delta: -179.4 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 195.72 ms. Allocated memory is still 2.8 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 180]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant [2019-11-20 03:01:11,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 03:01:11,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 03:01:11,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 03:01:11,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-20 03:01:11,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-20 03:01:11,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-20 03:01:11,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-20 03:01:11,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-20 03:01:11,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 03:01:11,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 03:01:11,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 03:01:11,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-20 03:01:11,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-20 03:01:11,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-20 03:01:11,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-20 03:01:11,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((a23 <= 312 && a25 == 9) && a29 <= 140) || (((a25 == 13 && a23 <= 312) && a29 <= 277) && !(a4 == 1))) || ((a25 == 9 && a29 <= 599998) && a23 + 43 <= 0)) || ((a25 == 13 && a29 <= 277) && a23 + 43 <= 0)) || (a25 == 9 && a29 <= 130)) || (a25 == 13 && (a29 <= 245 && 1 == a4) && 130 <= a29)) || (((a29 <= 277 || 138 < a23) && 10 == a25) && 1 == a4)) || (0 <= a23 + 599772 && 1 == a4 && a25 == 11)) || ((12 == a25 && a29 <= 277) && a23 + 43 <= 0)) || (((a29 <= 130 && 1 == a4) && 130 <= a29) && 312 <= a23) || (((a29 + 276403 <= 0 && a25 <= 12) && 1 == a4) && 312 <= a23)) || ((a29 <= 599998 && a25 == 11) && a23 + 43 <= 0)) || (a25 == 9 && 1 == a4)) || (10 == a25 && a29 <= 140)) || (((a25 == 12 && a23 <= 312) && 1 == a4) && 138 < a23)) || (a29 <= 277 && 12 == a25 && !(a4 == 1))) || (((a25 == 13 && (\exists v_~a29~0_502 : int :: (130 <= v_~a29~0_502 && a29 <= (v_~a29~0_502 + 69157) % 299861 + 300138) && 0 <= v_~a29~0_502 + 69157)) && 1 == a4) && 138 < a23)) || ((10 == a25 && 1 == a4) && a23 + 43 <= 0)) || (a23 <= 312 && 12 == a25 && a29 + 22 <= 0)) || ((a25 == 12 && a29 <= 277) && 130 <= a29)) || (((a25 == 13 && (\exists v_~a23~0_473 : int :: (((0 <= v_~a23~0_473 && 312 <= v_~a23~0_473) && a23 <= v_~a23~0_473 / 5 * 4 % 83 + 180) && 0 <= 4 * (v_~a23~0_473 / 5)) && 0 <= 4 * (v_~a23~0_473 / 5) + 4)) && 1 == a4) && 138 < a23) - InvariantResult [Line: 22]: Loop Invariant [2019-11-20 03:01:11,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 03:01:11,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 03:01:11,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 03:01:11,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-20 03:01:11,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-20 03:01:11,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-20 03:01:11,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-20 03:01:11,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-20 03:01:11,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 03:01:11,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 03:01:11,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 03:01:11,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-20 03:01:11,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-20 03:01:11,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-20 03:01:11,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-20 03:01:11,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((a23 <= 312 && a25 == 9) && a29 <= 140) || (((a25 == 13 && a23 <= 312) && a29 <= 277) && !(a4 == 1))) || ((a25 == 9 && a29 <= 599998) && a23 + 43 <= 0)) || ((a25 == 13 && a29 <= 277) && a23 + 43 <= 0)) || (a25 == 9 && a29 <= 130)) || (a25 == 13 && (a29 <= 245 && 1 == a4) && 130 <= a29)) || (((a29 <= 277 || 138 < a23) && 10 == a25) && 1 == a4)) || (0 <= a23 + 599772 && 1 == a4 && a25 == 11)) || ((12 == a25 && a29 <= 277) && a23 + 43 <= 0)) || (((a29 <= 130 && 1 == a4) && 130 <= a29) && 312 <= a23) || (((a29 + 276403 <= 0 && a25 <= 12) && 1 == a4) && 312 <= a23)) || ((a29 <= 599998 && a25 == 11) && a23 + 43 <= 0)) || (a25 == 9 && 1 == a4)) || (10 == a25 && a29 <= 140)) || (((a25 == 12 && a23 <= 312) && 1 == a4) && 138 < a23)) || (a29 <= 277 && 12 == a25 && !(a4 == 1))) || (((a25 == 13 && (\exists v_~a29~0_502 : int :: (130 <= v_~a29~0_502 && a29 <= (v_~a29~0_502 + 69157) % 299861 + 300138) && 0 <= v_~a29~0_502 + 69157)) && 1 == a4) && 138 < a23)) || ((10 == a25 && 1 == a4) && a23 + 43 <= 0)) || (a23 <= 312 && 12 == a25 && a29 + 22 <= 0)) || ((a25 == 12 && a29 <= 277) && 130 <= a29)) || (((a25 == 13 && (\exists v_~a23~0_473 : int :: (((0 <= v_~a23~0_473 && 312 <= v_~a23~0_473) && a23 <= v_~a23~0_473 / 5 * 4 % 83 + 180) && 0 <= 4 * (v_~a23~0_473 / 5)) && 0 <= 4 * (v_~a23~0_473 / 5) + 4)) && 1 == a4) && 138 < a23) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Result: SAFE, OverallTime: 64.1s, OverallIterations: 14, TraceHistogramMax: 7, AutomataDifference: 43.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.9s, HoareTripleCheckerStatistics: 2145 SDtfs, 12865 SDslu, 1250 SDs, 0 SdLazy, 38970 SolverSat, 4909 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 33.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1609 GetRequests, 1510 SyntacticMatches, 2 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20883occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 39857 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 276 NumberOfFragments, 601 HoareAnnotationTreeSize, 3 FomulaSimplifications, 79332 FormulaSimplificationTreeSizeReduction, 2.5s HoareSimplificationTime, 3 FomulaSimplificationsInter, 35630 FormulaSimplificationTreeSizeReductionInter, 5.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 6365 NumberOfCodeBlocks, 6365 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 6347 ConstructedInterpolants, 399 QuantifiedInterpolants, 11758340 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1899 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 18 InterpolantComputations, 11 PerfectInterpolantSequences, 7233/8195 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...