./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem17_label41.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_bf2dd792-7c33-4b94-b123-5ef092f34f93/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_bf2dd792-7c33-4b94-b123-5ef092f34f93/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bf2dd792-7c33-4b94-b123-5ef092f34f93/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bf2dd792-7c33-4b94-b123-5ef092f34f93/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem17_label41.c -s /tmp/vcloud-vcloud-master/worker/run_dir_bf2dd792-7c33-4b94-b123-5ef092f34f93/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bf2dd792-7c33-4b94-b123-5ef092f34f93/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 629a9f5a301d91765ef653fcbff1dcb4386e9722 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:38:06,313 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:38:06,314 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:38:06,322 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:38:06,322 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:38:06,323 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:38:06,324 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:38:06,325 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:38:06,326 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:38:06,327 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:38:06,328 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:38:06,328 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:38:06,329 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:38:06,329 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:38:06,330 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:38:06,331 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:38:06,331 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:38:06,332 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:38:06,333 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:38:06,335 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:38:06,336 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:38:06,336 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:38:06,337 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:38:06,337 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:38:06,339 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:38:06,339 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:38:06,339 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:38:06,340 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:38:06,340 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:38:06,341 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:38:06,341 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:38:06,341 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:38:06,342 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:38:06,342 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:38:06,343 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:38:06,343 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:38:06,343 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:38:06,343 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:38:06,343 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:38:06,344 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:38:06,344 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:38:06,345 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bf2dd792-7c33-4b94-b123-5ef092f34f93/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:38:06,354 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:38:06,354 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:38:06,355 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:38:06,355 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:38:06,355 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:38:06,356 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:38:06,356 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:38:06,356 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:38:06,356 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:38:06,356 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:38:06,356 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:38:06,356 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:38:06,356 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:38:06,357 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:38:06,357 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:38:06,357 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:38:06,357 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:38:06,357 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:38:06,357 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:38:06,357 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:38:06,357 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:38:06,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:38:06,358 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:38:06,358 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:38:06,358 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:38:06,358 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:38:06,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:38:06,358 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:38:06,358 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:38:06,359 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_bf2dd792-7c33-4b94-b123-5ef092f34f93/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 -> 629a9f5a301d91765ef653fcbff1dcb4386e9722 [2019-12-07 17:38:06,456 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:38:06,465 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:38:06,467 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:38:06,468 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:38:06,468 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:38:06,469 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bf2dd792-7c33-4b94-b123-5ef092f34f93/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem17_label41.c [2019-12-07 17:38:06,508 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bf2dd792-7c33-4b94-b123-5ef092f34f93/bin/uautomizer/data/7016532fe/e21d8c83adfb440bb7ab546e74d4668a/FLAG774d8cbb0 [2019-12-07 17:38:06,952 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:38:06,952 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bf2dd792-7c33-4b94-b123-5ef092f34f93/sv-benchmarks/c/eca-rers2012/Problem17_label41.c [2019-12-07 17:38:06,968 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bf2dd792-7c33-4b94-b123-5ef092f34f93/bin/uautomizer/data/7016532fe/e21d8c83adfb440bb7ab546e74d4668a/FLAG774d8cbb0 [2019-12-07 17:38:06,976 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bf2dd792-7c33-4b94-b123-5ef092f34f93/bin/uautomizer/data/7016532fe/e21d8c83adfb440bb7ab546e74d4668a [2019-12-07 17:38:06,978 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:38:06,979 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:38:06,980 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:38:06,980 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:38:06,982 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:38:06,983 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:38:06" (1/1) ... [2019-12-07 17:38:06,985 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e3d67c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:38:06, skipping insertion in model container [2019-12-07 17:38:06,985 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:38:06" (1/1) ... [2019-12-07 17:38:06,990 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:38:07,054 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:38:07,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:38:07,576 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:38:07,807 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:38:07,820 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:38:07,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:38:07 WrapperNode [2019-12-07 17:38:07,820 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:38:07,821 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:38:07,821 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:38:07,821 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:38:07,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:38:07" (1/1) ... [2019-12-07 17:38:07,855 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:38:07" (1/1) ... [2019-12-07 17:38:08,019 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:38:08,020 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:38:08,020 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:38:08,020 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:38:08,032 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:38:07" (1/1) ... [2019-12-07 17:38:08,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:38:07" (1/1) ... [2019-12-07 17:38:08,053 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:38:07" (1/1) ... [2019-12-07 17:38:08,053 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:38:07" (1/1) ... [2019-12-07 17:38:08,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:38:07" (1/1) ... [2019-12-07 17:38:08,144 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:38:07" (1/1) ... [2019-12-07 17:38:08,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:38:07" (1/1) ... [2019-12-07 17:38:08,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:38:08,216 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:38:08,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:38:08,216 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:38:08,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:38:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bf2dd792-7c33-4b94-b123-5ef092f34f93/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-12-07 17:38:08,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:38:08,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:38:10,926 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:38:10,926 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 17:38:10,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:38:10 BoogieIcfgContainer [2019-12-07 17:38:10,927 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:38:10,928 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:38:10,928 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:38:10,930 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:38:10,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:38:06" (1/3) ... [2019-12-07 17:38:10,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e220a3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:38:10, skipping insertion in model container [2019-12-07 17:38:10,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:38:07" (2/3) ... [2019-12-07 17:38:10,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e220a3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:38:10, skipping insertion in model container [2019-12-07 17:38:10,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:38:10" (3/3) ... [2019-12-07 17:38:10,932 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem17_label41.c [2019-12-07 17:38:10,938 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:38:10,943 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 17:38:10,950 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 17:38:10,970 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:38:10,970 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:38:10,971 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:38:10,971 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:38:10,971 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:38:10,971 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:38:10,971 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:38:10,971 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:38:10,990 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states. [2019-12-07 17:38:10,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 17:38:10,994 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:38:10,995 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] [2019-12-07 17:38:10,995 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:38:10,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:38:10,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1089129850, now seen corresponding path program 1 times [2019-12-07 17:38:11,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:38:11,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527205270] [2019-12-07 17:38:11,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:38:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:38:11,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:38:11,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527205270] [2019-12-07 17:38:11,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:38:11,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:38:11,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331301420] [2019-12-07 17:38:11,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:38:11,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:38:11,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:38:11,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:38:11,164 INFO L87 Difference]: Start difference. First operand 590 states. Second operand 4 states. [2019-12-07 17:38:14,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:38:14,998 INFO L93 Difference]: Finished difference Result 2122 states and 3952 transitions. [2019-12-07 17:38:14,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:38:15,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-07 17:38:15,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:38:15,032 INFO L225 Difference]: With dead ends: 2122 [2019-12-07 17:38:15,032 INFO L226 Difference]: Without dead ends: 1450 [2019-12-07 17:38:15,036 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-12-07 17:38:15,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2019-12-07 17:38:15,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 986. [2019-12-07 17:38:15,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2019-12-07 17:38:15,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1673 transitions. [2019-12-07 17:38:15,105 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1673 transitions. Word has length 34 [2019-12-07 17:38:15,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:38:15,106 INFO L462 AbstractCegarLoop]: Abstraction has 986 states and 1673 transitions. [2019-12-07 17:38:15,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:38:15,106 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1673 transitions. [2019-12-07 17:38:15,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-07 17:38:15,109 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:38:15,109 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:38:15,110 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:38:15,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:38:15,110 INFO L82 PathProgramCache]: Analyzing trace with hash -279207896, now seen corresponding path program 1 times [2019-12-07 17:38:15,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:38:15,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85006059] [2019-12-07 17:38:15,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:38:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:38:15,234 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:38:15,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85006059] [2019-12-07 17:38:15,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:38:15,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:38:15,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790914150] [2019-12-07 17:38:15,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:38:15,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:38:15,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:38:15,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:38:15,237 INFO L87 Difference]: Start difference. First operand 986 states and 1673 transitions. Second operand 4 states. [2019-12-07 17:38:18,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:38:18,666 INFO L93 Difference]: Finished difference Result 3682 states and 6330 transitions. [2019-12-07 17:38:18,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:38:18,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-12-07 17:38:18,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:38:18,678 INFO L225 Difference]: With dead ends: 3682 [2019-12-07 17:38:18,678 INFO L226 Difference]: Without dead ends: 2698 [2019-12-07 17:38:18,680 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-12-07 17:38:18,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2019-12-07 17:38:18,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2698. [2019-12-07 17:38:18,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2698 states. [2019-12-07 17:38:18,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2698 states to 2698 states and 3704 transitions. [2019-12-07 17:38:18,719 INFO L78 Accepts]: Start accepts. Automaton has 2698 states and 3704 transitions. Word has length 105 [2019-12-07 17:38:18,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:38:18,719 INFO L462 AbstractCegarLoop]: Abstraction has 2698 states and 3704 transitions. [2019-12-07 17:38:18,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:38:18,719 INFO L276 IsEmpty]: Start isEmpty. Operand 2698 states and 3704 transitions. [2019-12-07 17:38:18,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-12-07 17:38:18,724 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:38:18,724 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 17:38:18,724 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:38:18,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:38:18,725 INFO L82 PathProgramCache]: Analyzing trace with hash -449786728, now seen corresponding path program 1 times [2019-12-07 17:38:18,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:38:18,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532371451] [2019-12-07 17:38:18,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:38:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:38:18,856 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-12-07 17:38:18,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532371451] [2019-12-07 17:38:18,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:38:18,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:38:18,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615692043] [2019-12-07 17:38:18,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:38:18,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:38:18,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:38:18,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:38:18,858 INFO L87 Difference]: Start difference. First operand 2698 states and 3704 transitions. Second operand 3 states. [2019-12-07 17:38:22,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:38:22,350 INFO L93 Difference]: Finished difference Result 7942 states and 10911 transitions. [2019-12-07 17:38:22,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:38:22,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-12-07 17:38:22,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:38:22,375 INFO L225 Difference]: With dead ends: 7942 [2019-12-07 17:38:22,375 INFO L226 Difference]: Without dead ends: 5246 [2019-12-07 17:38:22,379 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-12-07 17:38:22,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5246 states. [2019-12-07 17:38:22,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5246 to 4820. [2019-12-07 17:38:22,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4820 states. [2019-12-07 17:38:22,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4820 states to 4820 states and 6035 transitions. [2019-12-07 17:38:22,449 INFO L78 Accepts]: Start accepts. Automaton has 4820 states and 6035 transitions. Word has length 188 [2019-12-07 17:38:22,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:38:22,449 INFO L462 AbstractCegarLoop]: Abstraction has 4820 states and 6035 transitions. [2019-12-07 17:38:22,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:38:22,450 INFO L276 IsEmpty]: Start isEmpty. Operand 4820 states and 6035 transitions. [2019-12-07 17:38:22,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-12-07 17:38:22,452 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:38:22,452 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:38:22,452 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:38:22,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:38:22,452 INFO L82 PathProgramCache]: Analyzing trace with hash -2099311771, now seen corresponding path program 1 times [2019-12-07 17:38:22,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:38:22,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265525354] [2019-12-07 17:38:22,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:38:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:38:22,544 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:38:22,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265525354] [2019-12-07 17:38:22,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:38:22,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:38:22,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080401402] [2019-12-07 17:38:22,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:38:22,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:38:22,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:38:22,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:38:22,545 INFO L87 Difference]: Start difference. First operand 4820 states and 6035 transitions. Second operand 3 states. [2019-12-07 17:38:24,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:38:24,364 INFO L93 Difference]: Finished difference Result 9637 states and 12067 transitions. [2019-12-07 17:38:24,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:38:24,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-12-07 17:38:24,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:38:24,387 INFO L225 Difference]: With dead ends: 9637 [2019-12-07 17:38:24,387 INFO L226 Difference]: Without dead ends: 4819 [2019-12-07 17:38:24,393 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-12-07 17:38:24,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4819 states. [2019-12-07 17:38:24,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4819 to 4819. [2019-12-07 17:38:24,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4819 states. [2019-12-07 17:38:24,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4819 states to 4819 states and 5684 transitions. [2019-12-07 17:38:24,447 INFO L78 Accepts]: Start accepts. Automaton has 4819 states and 5684 transitions. Word has length 195 [2019-12-07 17:38:24,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:38:24,447 INFO L462 AbstractCegarLoop]: Abstraction has 4819 states and 5684 transitions. [2019-12-07 17:38:24,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:38:24,447 INFO L276 IsEmpty]: Start isEmpty. Operand 4819 states and 5684 transitions. [2019-12-07 17:38:24,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-12-07 17:38:24,450 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:38:24,450 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:38:24,450 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:38:24,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:38:24,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1367873502, now seen corresponding path program 1 times [2019-12-07 17:38:24,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:38:24,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035663722] [2019-12-07 17:38:24,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:38:24,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:38:24,561 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-12-07 17:38:24,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035663722] [2019-12-07 17:38:24,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:38:24,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:38:24,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788437171] [2019-12-07 17:38:24,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:38:24,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:38:24,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:38:24,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:38:24,563 INFO L87 Difference]: Start difference. First operand 4819 states and 5684 transitions. Second operand 4 states. [2019-12-07 17:38:29,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:38:29,047 INFO L93 Difference]: Finished difference Result 12637 states and 15016 transitions. [2019-12-07 17:38:29,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:38:29,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 254 [2019-12-07 17:38:29,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:38:29,071 INFO L225 Difference]: With dead ends: 12637 [2019-12-07 17:38:29,071 INFO L226 Difference]: Without dead ends: 7820 [2019-12-07 17:38:29,075 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-12-07 17:38:29,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7820 states. [2019-12-07 17:38:29,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7820 to 6102. [2019-12-07 17:38:29,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6102 states. [2019-12-07 17:38:29,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6102 states to 6102 states and 7185 transitions. [2019-12-07 17:38:29,140 INFO L78 Accepts]: Start accepts. Automaton has 6102 states and 7185 transitions. Word has length 254 [2019-12-07 17:38:29,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:38:29,141 INFO L462 AbstractCegarLoop]: Abstraction has 6102 states and 7185 transitions. [2019-12-07 17:38:29,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:38:29,141 INFO L276 IsEmpty]: Start isEmpty. Operand 6102 states and 7185 transitions. [2019-12-07 17:38:29,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-12-07 17:38:29,144 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:38:29,145 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:38:29,145 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:38:29,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:38:29,145 INFO L82 PathProgramCache]: Analyzing trace with hash 2020673444, now seen corresponding path program 1 times [2019-12-07 17:38:29,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:38:29,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937984493] [2019-12-07 17:38:29,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:38:29,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:38:29,405 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 0 proven. 304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:38:29,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937984493] [2019-12-07 17:38:29,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805978926] [2019-12-07 17:38:29,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bf2dd792-7c33-4b94-b123-5ef092f34f93/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-12-07 17:38:29,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:38:29,481 INFO L264 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:38:29,489 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:38:29,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:38:29,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:38:29,601 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 202 proven. 70 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 17:38:29,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:38:29,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 3] total 10 [2019-12-07 17:38:29,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845699895] [2019-12-07 17:38:29,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:38:29,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:38:29,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:38:29,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:38:29,603 INFO L87 Difference]: Start difference. First operand 6102 states and 7185 transitions. Second operand 11 states. [2019-12-07 17:38:49,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:38:49,649 INFO L93 Difference]: Finished difference Result 47929 states and 57900 transitions. [2019-12-07 17:38:49,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 17:38:49,649 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 258 [2019-12-07 17:38:49,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:38:49,700 INFO L225 Difference]: With dead ends: 47929 [2019-12-07 17:38:49,701 INFO L226 Difference]: Without dead ends: 31602 [2019-12-07 17:38:49,712 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 256 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2019-12-07 17:38:49,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31602 states. [2019-12-07 17:38:49,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31602 to 25637. [2019-12-07 17:38:49,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25637 states. [2019-12-07 17:38:50,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25637 states to 25637 states and 28133 transitions. [2019-12-07 17:38:50,001 INFO L78 Accepts]: Start accepts. Automaton has 25637 states and 28133 transitions. Word has length 258 [2019-12-07 17:38:50,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:38:50,001 INFO L462 AbstractCegarLoop]: Abstraction has 25637 states and 28133 transitions. [2019-12-07 17:38:50,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:38:50,001 INFO L276 IsEmpty]: Start isEmpty. Operand 25637 states and 28133 transitions. [2019-12-07 17:38:50,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2019-12-07 17:38:50,010 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:38:50,011 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:38:50,211 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:38:50,211 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:38:50,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:38:50,212 INFO L82 PathProgramCache]: Analyzing trace with hash -356377686, now seen corresponding path program 1 times [2019-12-07 17:38:50,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:38:50,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32097407] [2019-12-07 17:38:50,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:38:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:38:50,473 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-12-07 17:38:50,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32097407] [2019-12-07 17:38:50,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:38:50,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:38:50,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149916799] [2019-12-07 17:38:50,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:38:50,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:38:50,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:38:50,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:38:50,475 INFO L87 Difference]: Start difference. First operand 25637 states and 28133 transitions. Second operand 3 states. [2019-12-07 17:38:52,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:38:52,286 INFO L93 Difference]: Finished difference Result 53397 states and 58615 transitions. [2019-12-07 17:38:52,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:38:52,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 405 [2019-12-07 17:38:52,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:38:52,317 INFO L225 Difference]: With dead ends: 53397 [2019-12-07 17:38:52,317 INFO L226 Difference]: Without dead ends: 28187 [2019-12-07 17:38:52,335 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-12-07 17:38:52,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28187 states. [2019-12-07 17:38:52,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28187 to 26062. [2019-12-07 17:38:52,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26062 states. [2019-12-07 17:38:52,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26062 states to 26062 states and 28641 transitions. [2019-12-07 17:38:52,537 INFO L78 Accepts]: Start accepts. Automaton has 26062 states and 28641 transitions. Word has length 405 [2019-12-07 17:38:52,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:38:52,538 INFO L462 AbstractCegarLoop]: Abstraction has 26062 states and 28641 transitions. [2019-12-07 17:38:52,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:38:52,538 INFO L276 IsEmpty]: Start isEmpty. Operand 26062 states and 28641 transitions. [2019-12-07 17:38:52,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-12-07 17:38:52,544 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:38:52,544 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:38:52,545 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:38:52,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:38:52,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1820651612, now seen corresponding path program 1 times [2019-12-07 17:38:52,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:38:52,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003479155] [2019-12-07 17:38:52,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:38:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:38:52,728 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-07 17:38:52,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003479155] [2019-12-07 17:38:52,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:38:52,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:38:52,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979641680] [2019-12-07 17:38:52,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:38:52,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:38:52,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:38:52,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:38:52,730 INFO L87 Difference]: Start difference. First operand 26062 states and 28641 transitions. Second operand 3 states. [2019-12-07 17:38:54,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:38:54,981 INFO L93 Difference]: Finished difference Result 63175 states and 69454 transitions. [2019-12-07 17:38:54,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:38:54,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 420 [2019-12-07 17:38:54,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:38:55,011 INFO L225 Difference]: With dead ends: 63175 [2019-12-07 17:38:55,011 INFO L226 Difference]: Without dead ends: 37540 [2019-12-07 17:38:55,026 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-12-07 17:38:55,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37540 states. [2019-12-07 17:38:55,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37540 to 34985. [2019-12-07 17:38:55,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34985 states. [2019-12-07 17:38:55,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34985 states to 34985 states and 37773 transitions. [2019-12-07 17:38:55,289 INFO L78 Accepts]: Start accepts. Automaton has 34985 states and 37773 transitions. Word has length 420 [2019-12-07 17:38:55,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:38:55,290 INFO L462 AbstractCegarLoop]: Abstraction has 34985 states and 37773 transitions. [2019-12-07 17:38:55,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:38:55,290 INFO L276 IsEmpty]: Start isEmpty. Operand 34985 states and 37773 transitions. [2019-12-07 17:38:55,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2019-12-07 17:38:55,300 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:38:55,301 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:38:55,301 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:38:55,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:38:55,301 INFO L82 PathProgramCache]: Analyzing trace with hash -2018829380, now seen corresponding path program 1 times [2019-12-07 17:38:55,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:38:55,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483911190] [2019-12-07 17:38:55,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:38:55,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:38:55,661 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 305 proven. 310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:38:55,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483911190] [2019-12-07 17:38:55,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138942663] [2019-12-07 17:38:55,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bf2dd792-7c33-4b94-b123-5ef092f34f93/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-12-07 17:38:55,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:38:55,824 INFO L264 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:38:55,830 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:38:55,994 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 386 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2019-12-07 17:38:55,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:38:55,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-12-07 17:38:55,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299058848] [2019-12-07 17:38:55,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:38:55,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:38:55,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:38:55,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:38:55,995 INFO L87 Difference]: Start difference. First operand 34985 states and 37773 transitions. Second operand 4 states. [2019-12-07 17:38:59,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:38:59,095 INFO L93 Difference]: Finished difference Result 92115 states and 99479 transitions. [2019-12-07 17:38:59,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:38:59,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 500 [2019-12-07 17:38:59,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:38:59,162 INFO L225 Difference]: With dead ends: 92115 [2019-12-07 17:38:59,162 INFO L226 Difference]: Without dead ends: 56282 [2019-12-07 17:38:59,181 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 499 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:38:59,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56282 states. [2019-12-07 17:38:59,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56282 to 46066. [2019-12-07 17:38:59,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46066 states. [2019-12-07 17:38:59,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46066 states to 46066 states and 49443 transitions. [2019-12-07 17:38:59,608 INFO L78 Accepts]: Start accepts. Automaton has 46066 states and 49443 transitions. Word has length 500 [2019-12-07 17:38:59,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:38:59,608 INFO L462 AbstractCegarLoop]: Abstraction has 46066 states and 49443 transitions. [2019-12-07 17:38:59,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:38:59,609 INFO L276 IsEmpty]: Start isEmpty. Operand 46066 states and 49443 transitions. [2019-12-07 17:38:59,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2019-12-07 17:38:59,621 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:38:59,621 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:38:59,822 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:38:59,822 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:38:59,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:38:59,823 INFO L82 PathProgramCache]: Analyzing trace with hash 153680514, now seen corresponding path program 1 times [2019-12-07 17:38:59,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:38:59,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943714891] [2019-12-07 17:38:59,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:38:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:39:00,072 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 521 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-12-07 17:39:00,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943714891] [2019-12-07 17:39:00,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:39:00,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:39:00,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402489863] [2019-12-07 17:39:00,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:39:00,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:39:00,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:39:00,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:39:00,073 INFO L87 Difference]: Start difference. First operand 46066 states and 49443 transitions. Second operand 4 states. [2019-12-07 17:39:03,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:39:03,151 INFO L93 Difference]: Finished difference Result 98958 states and 105970 transitions. [2019-12-07 17:39:03,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:39:03,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 503 [2019-12-07 17:39:03,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:39:03,205 INFO L225 Difference]: With dead ends: 98958 [2019-12-07 17:39:03,206 INFO L226 Difference]: Without dead ends: 53319 [2019-12-07 17:39:03,222 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-12-07 17:39:03,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53319 states. [2019-12-07 17:39:03,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53319 to 46066. [2019-12-07 17:39:03,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46066 states. [2019-12-07 17:39:03,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46066 states to 46066 states and 49424 transitions. [2019-12-07 17:39:03,560 INFO L78 Accepts]: Start accepts. Automaton has 46066 states and 49424 transitions. Word has length 503 [2019-12-07 17:39:03,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:39:03,560 INFO L462 AbstractCegarLoop]: Abstraction has 46066 states and 49424 transitions. [2019-12-07 17:39:03,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:39:03,560 INFO L276 IsEmpty]: Start isEmpty. Operand 46066 states and 49424 transitions. [2019-12-07 17:39:03,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2019-12-07 17:39:03,571 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:39:03,572 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:39:03,572 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:39:03,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:39:03,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1023396058, now seen corresponding path program 1 times [2019-12-07 17:39:03,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:39:03,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354231295] [2019-12-07 17:39:03,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:39:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:39:03,927 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 305 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:39:03,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354231295] [2019-12-07 17:39:03,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838979695] [2019-12-07 17:39:03,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bf2dd792-7c33-4b94-b123-5ef092f34f93/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-12-07 17:39:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:39:04,036 INFO L264 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:39:04,041 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:39:04,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:39:04,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:39:04,721 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2019-12-07 17:39:04,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:39:04,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2019-12-07 17:39:04,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862557372] [2019-12-07 17:39:04,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:39:04,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:39:04,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:39:04,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:39:04,723 INFO L87 Difference]: Start difference. First operand 46066 states and 49424 transitions. Second operand 4 states. [2019-12-07 17:39:10,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:39:10,254 INFO L93 Difference]: Finished difference Result 112574 states and 121075 transitions. [2019-12-07 17:39:10,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:39:10,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 505 [2019-12-07 17:39:10,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:39:10,304 INFO L225 Difference]: With dead ends: 112574 [2019-12-07 17:39:10,304 INFO L226 Difference]: Without dead ends: 65660 [2019-12-07 17:39:10,327 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 504 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:39:10,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65660 states. [2019-12-07 17:39:10,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65660 to 46066. [2019-12-07 17:39:10,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46066 states. [2019-12-07 17:39:10,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46066 states to 46066 states and 49428 transitions. [2019-12-07 17:39:10,824 INFO L78 Accepts]: Start accepts. Automaton has 46066 states and 49428 transitions. Word has length 505 [2019-12-07 17:39:10,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:39:10,824 INFO L462 AbstractCegarLoop]: Abstraction has 46066 states and 49428 transitions. [2019-12-07 17:39:10,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:39:10,824 INFO L276 IsEmpty]: Start isEmpty. Operand 46066 states and 49428 transitions. [2019-12-07 17:39:10,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559 [2019-12-07 17:39:10,837 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:39:10,838 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 17:39:11,038 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:39:11,039 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:39:11,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:39:11,039 INFO L82 PathProgramCache]: Analyzing trace with hash -5548667, now seen corresponding path program 1 times [2019-12-07 17:39:11,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:39:11,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527656773] [2019-12-07 17:39:11,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:39:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:39:12,316 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 3 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:39:12,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527656773] [2019-12-07 17:39:12,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331128084] [2019-12-07 17:39:12,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bf2dd792-7c33-4b94-b123-5ef092f34f93/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-12-07 17:39:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:39:12,497 INFO L264 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:39:12,501 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:39:12,669 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 539 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-12-07 17:39:12,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:39:12,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2019-12-07 17:39:12,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673185272] [2019-12-07 17:39:12,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:39:12,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:39:12,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:39:12,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:39:12,670 INFO L87 Difference]: Start difference. First operand 46066 states and 49428 transitions. Second operand 3 states. [2019-12-07 17:39:14,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:39:14,638 INFO L93 Difference]: Finished difference Result 94264 states and 101130 transitions. [2019-12-07 17:39:14,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:39:14,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 558 [2019-12-07 17:39:14,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:39:14,679 INFO L225 Difference]: With dead ends: 94264 [2019-12-07 17:39:14,679 INFO L226 Difference]: Without dead ends: 48200 [2019-12-07 17:39:14,702 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 557 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:39:14,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48200 states. [2019-12-07 17:39:15,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48200 to 48189. [2019-12-07 17:39:15,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48189 states. [2019-12-07 17:39:15,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48189 states to 48189 states and 51635 transitions. [2019-12-07 17:39:15,062 INFO L78 Accepts]: Start accepts. Automaton has 48189 states and 51635 transitions. Word has length 558 [2019-12-07 17:39:15,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:39:15,063 INFO L462 AbstractCegarLoop]: Abstraction has 48189 states and 51635 transitions. [2019-12-07 17:39:15,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:39:15,063 INFO L276 IsEmpty]: Start isEmpty. Operand 48189 states and 51635 transitions. [2019-12-07 17:39:15,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2019-12-07 17:39:15,078 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:39:15,078 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:39:15,279 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:39:15,280 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:39:15,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:39:15,281 INFO L82 PathProgramCache]: Analyzing trace with hash 658202556, now seen corresponding path program 1 times [2019-12-07 17:39:15,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:39:15,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249357968] [2019-12-07 17:39:15,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:39:15,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:39:15,671 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 411 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-12-07 17:39:15,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249357968] [2019-12-07 17:39:15,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:39:15,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:39:15,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442124035] [2019-12-07 17:39:15,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:39:15,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:39:15,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:39:15,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:39:15,673 INFO L87 Difference]: Start difference. First operand 48189 states and 51635 transitions. Second operand 3 states. [2019-12-07 17:39:16,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:39:16,681 INFO L93 Difference]: Finished difference Result 94241 states and 100983 transitions. [2019-12-07 17:39:16,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:39:16,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 559 [2019-12-07 17:39:16,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:39:16,720 INFO L225 Difference]: With dead ends: 94241 [2019-12-07 17:39:16,720 INFO L226 Difference]: Without dead ends: 46053 [2019-12-07 17:39:16,742 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:39:16,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46053 states. [2019-12-07 17:39:17,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46053 to 46050. [2019-12-07 17:39:17,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46050 states. [2019-12-07 17:39:17,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46050 states to 46050 states and 49335 transitions. [2019-12-07 17:39:17,094 INFO L78 Accepts]: Start accepts. Automaton has 46050 states and 49335 transitions. Word has length 559 [2019-12-07 17:39:17,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:39:17,095 INFO L462 AbstractCegarLoop]: Abstraction has 46050 states and 49335 transitions. [2019-12-07 17:39:17,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:39:17,095 INFO L276 IsEmpty]: Start isEmpty. Operand 46050 states and 49335 transitions. [2019-12-07 17:39:17,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2019-12-07 17:39:17,106 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:39:17,107 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:39:17,107 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:39:17,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:39:17,107 INFO L82 PathProgramCache]: Analyzing trace with hash 258696126, now seen corresponding path program 1 times [2019-12-07 17:39:17,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:39:17,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665494698] [2019-12-07 17:39:17,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:39:17,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:39:18,007 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 309 proven. 403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:39:18,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665494698] [2019-12-07 17:39:18,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153642707] [2019-12-07 17:39:18,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bf2dd792-7c33-4b94-b123-5ef092f34f93/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:39:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:39:18,116 INFO L264 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:39:18,120 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:39:18,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:39:18,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:39:18,910 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 443 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2019-12-07 17:39:18,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:39:18,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-12-07 17:39:18,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420978434] [2019-12-07 17:39:18,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:39:18,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:39:18,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:39:18,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:39:18,912 INFO L87 Difference]: Start difference. First operand 46050 states and 49335 transitions. Second operand 5 states. [2019-12-07 17:39:24,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:39:24,566 INFO L93 Difference]: Finished difference Result 108269 states and 115888 transitions. [2019-12-07 17:39:24,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:39:24,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 559 [2019-12-07 17:39:24,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:39:24,715 INFO L225 Difference]: With dead ends: 108269 [2019-12-07 17:39:24,715 INFO L226 Difference]: Without dead ends: 62221 [2019-12-07 17:39:24,731 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 557 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:39:24,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62221 states. [2019-12-07 17:39:25,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62221 to 55412. [2019-12-07 17:39:25,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55412 states. [2019-12-07 17:39:25,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55412 states to 55412 states and 58843 transitions. [2019-12-07 17:39:25,167 INFO L78 Accepts]: Start accepts. Automaton has 55412 states and 58843 transitions. Word has length 559 [2019-12-07 17:39:25,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:39:25,168 INFO L462 AbstractCegarLoop]: Abstraction has 55412 states and 58843 transitions. [2019-12-07 17:39:25,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:39:25,168 INFO L276 IsEmpty]: Start isEmpty. Operand 55412 states and 58843 transitions. [2019-12-07 17:39:25,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2019-12-07 17:39:25,179 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:39:25,179 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:39:25,380 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:39:25,380 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:39:25,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:39:25,381 INFO L82 PathProgramCache]: Analyzing trace with hash 754787691, now seen corresponding path program 1 times [2019-12-07 17:39:25,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:39:25,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194169217] [2019-12-07 17:39:25,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:39:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:39:25,753 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 479 proven. 5 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2019-12-07 17:39:25,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194169217] [2019-12-07 17:39:25,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530648052] [2019-12-07 17:39:25,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bf2dd792-7c33-4b94-b123-5ef092f34f93/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:39:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:39:25,868 INFO L264 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:39:25,873 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:39:26,243 INFO L134 CoverageAnalysis]: Checked inductivity of 764 backedges. 475 proven. 0 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-12-07 17:39:26,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:39:26,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2019-12-07 17:39:26,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865965048] [2019-12-07 17:39:26,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:39:26,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:39:26,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:39:26,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:39:26,245 INFO L87 Difference]: Start difference. First operand 55412 states and 58843 transitions. Second operand 5 states. [2019-12-07 17:39:37,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:39:37,724 INFO L93 Difference]: Finished difference Result 130377 states and 139100 transitions. [2019-12-07 17:39:37,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:39:37,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 591 [2019-12-07 17:39:37,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:39:37,781 INFO L225 Difference]: With dead ends: 130377 [2019-12-07 17:39:37,781 INFO L226 Difference]: Without dead ends: 73688 [2019-12-07 17:39:37,808 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 590 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:39:37,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73688 states. [2019-12-07 17:39:38,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73688 to 54533. [2019-12-07 17:39:38,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54533 states. [2019-12-07 17:39:38,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54533 states to 54533 states and 57745 transitions. [2019-12-07 17:39:38,315 INFO L78 Accepts]: Start accepts. Automaton has 54533 states and 57745 transitions. Word has length 591 [2019-12-07 17:39:38,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:39:38,316 INFO L462 AbstractCegarLoop]: Abstraction has 54533 states and 57745 transitions. [2019-12-07 17:39:38,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:39:38,316 INFO L276 IsEmpty]: Start isEmpty. Operand 54533 states and 57745 transitions. [2019-12-07 17:39:38,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2019-12-07 17:39:38,326 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:39:38,326 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:39:38,526 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:39:38,527 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:39:38,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:39:38,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1483920962, now seen corresponding path program 1 times [2019-12-07 17:39:38,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:39:38,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700796622] [2019-12-07 17:39:38,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:39:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:39:38,755 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 382 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-12-07 17:39:38,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700796622] [2019-12-07 17:39:38,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:39:38,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:39:38,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024941835] [2019-12-07 17:39:38,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:39:38,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:39:38,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:39:38,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:39:38,757 INFO L87 Difference]: Start difference. First operand 54533 states and 57745 transitions. Second operand 3 states. [2019-12-07 17:39:40,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:39:40,672 INFO L93 Difference]: Finished difference Result 109494 states and 115996 transitions. [2019-12-07 17:39:40,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:39:40,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 595 [2019-12-07 17:39:40,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:39:40,717 INFO L225 Difference]: With dead ends: 109494 [2019-12-07 17:39:40,717 INFO L226 Difference]: Without dead ends: 55388 [2019-12-07 17:39:40,742 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-12-07 17:39:40,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55388 states. [2019-12-07 17:39:41,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55388 to 51982. [2019-12-07 17:39:41,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51982 states. [2019-12-07 17:39:41,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51982 states to 51982 states and 54835 transitions. [2019-12-07 17:39:41,256 INFO L78 Accepts]: Start accepts. Automaton has 51982 states and 54835 transitions. Word has length 595 [2019-12-07 17:39:41,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:39:41,257 INFO L462 AbstractCegarLoop]: Abstraction has 51982 states and 54835 transitions. [2019-12-07 17:39:41,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:39:41,257 INFO L276 IsEmpty]: Start isEmpty. Operand 51982 states and 54835 transitions. [2019-12-07 17:39:41,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 639 [2019-12-07 17:39:41,270 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:39:41,270 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:39:41,270 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:39:41,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:39:41,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1216128928, now seen corresponding path program 1 times [2019-12-07 17:39:41,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:39:41,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185819609] [2019-12-07 17:39:41,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:39:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:39:41,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1019 backedges. 718 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-12-07 17:39:41,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185819609] [2019-12-07 17:39:41,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:39:41,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:39:41,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873740292] [2019-12-07 17:39:41,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:39:41,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:39:41,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:39:41,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:39:41,559 INFO L87 Difference]: Start difference. First operand 51982 states and 54835 transitions. Second operand 3 states. [2019-12-07 17:39:43,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:39:43,658 INFO L93 Difference]: Finished difference Result 112469 states and 118642 transitions. [2019-12-07 17:39:43,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:39:43,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 638 [2019-12-07 17:39:43,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:39:43,707 INFO L225 Difference]: With dead ends: 112469 [2019-12-07 17:39:43,707 INFO L226 Difference]: Without dead ends: 60914 [2019-12-07 17:39:43,730 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-12-07 17:39:43,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60914 states. [2019-12-07 17:39:44,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60914 to 59206. [2019-12-07 17:39:44,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59206 states. [2019-12-07 17:39:44,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59206 states to 59206 states and 62268 transitions. [2019-12-07 17:39:44,216 INFO L78 Accepts]: Start accepts. Automaton has 59206 states and 62268 transitions. Word has length 638 [2019-12-07 17:39:44,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:39:44,217 INFO L462 AbstractCegarLoop]: Abstraction has 59206 states and 62268 transitions. [2019-12-07 17:39:44,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:39:44,217 INFO L276 IsEmpty]: Start isEmpty. Operand 59206 states and 62268 transitions. [2019-12-07 17:39:44,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 797 [2019-12-07 17:39:44,239 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:39:44,239 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:39:44,239 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:39:44,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:39:44,240 INFO L82 PathProgramCache]: Analyzing trace with hash -236923992, now seen corresponding path program 1 times [2019-12-07 17:39:44,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:39:44,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076637740] [2019-12-07 17:39:44,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:39:44,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:39:44,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1316 backedges. 995 proven. 0 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2019-12-07 17:39:44,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076637740] [2019-12-07 17:39:44,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:39:44,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:39:44,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071652047] [2019-12-07 17:39:44,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:39:44,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:39:44,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:39:44,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:39:44,825 INFO L87 Difference]: Start difference. First operand 59206 states and 62268 transitions. Second operand 3 states. [2019-12-07 17:39:46,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:39:46,789 INFO L93 Difference]: Finished difference Result 124785 states and 131219 transitions. [2019-12-07 17:39:46,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:39:46,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 796 [2019-12-07 17:39:46,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:39:46,841 INFO L225 Difference]: With dead ends: 124785 [2019-12-07 17:39:46,841 INFO L226 Difference]: Without dead ends: 66006 [2019-12-07 17:39:46,867 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-12-07 17:39:46,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66006 states. [2019-12-07 17:39:47,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66006 to 57074. [2019-12-07 17:39:47,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57074 states. [2019-12-07 17:39:47,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57074 states to 57074 states and 59972 transitions. [2019-12-07 17:39:47,368 INFO L78 Accepts]: Start accepts. Automaton has 57074 states and 59972 transitions. Word has length 796 [2019-12-07 17:39:47,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:39:47,369 INFO L462 AbstractCegarLoop]: Abstraction has 57074 states and 59972 transitions. [2019-12-07 17:39:47,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:39:47,369 INFO L276 IsEmpty]: Start isEmpty. Operand 57074 states and 59972 transitions. [2019-12-07 17:39:47,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 810 [2019-12-07 17:39:47,391 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:39:47,391 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:39:47,392 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:39:47,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:39:47,392 INFO L82 PathProgramCache]: Analyzing trace with hash -195082119, now seen corresponding path program 1 times [2019-12-07 17:39:47,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:39:47,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034538297] [2019-12-07 17:39:47,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:39:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:39:48,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 663 proven. 335 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-12-07 17:39:48,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034538297] [2019-12-07 17:39:48,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981066756] [2019-12-07 17:39:48,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bf2dd792-7c33-4b94-b123-5ef092f34f93/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:39:48,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:39:48,779 INFO L264 TraceCheckSpWp]: Trace formula consists of 981 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 17:39:48,785 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:39:49,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 566 proven. 82 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2019-12-07 17:39:49,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:39:49,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 3] total 10 [2019-12-07 17:39:49,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037921556] [2019-12-07 17:39:49,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:39:49,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:39:49,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:39:49,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:39:49,207 INFO L87 Difference]: Start difference. First operand 57074 states and 59972 transitions. Second operand 10 states. [2019-12-07 17:40:05,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:40:05,866 INFO L93 Difference]: Finished difference Result 137579 states and 144567 transitions. [2019-12-07 17:40:05,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 17:40:05,866 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 809 [2019-12-07 17:40:05,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:40:05,926 INFO L225 Difference]: With dead ends: 137579 [2019-12-07 17:40:05,926 INFO L226 Difference]: Without dead ends: 80507 [2019-12-07 17:40:05,955 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 832 GetRequests, 816 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2019-12-07 17:40:06,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80507 states. [2019-12-07 17:40:06,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80507 to 71546. [2019-12-07 17:40:06,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71546 states. [2019-12-07 17:40:06,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71546 states to 71546 states and 75028 transitions. [2019-12-07 17:40:06,586 INFO L78 Accepts]: Start accepts. Automaton has 71546 states and 75028 transitions. Word has length 809 [2019-12-07 17:40:06,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:40:06,586 INFO L462 AbstractCegarLoop]: Abstraction has 71546 states and 75028 transitions. [2019-12-07 17:40:06,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:40:06,586 INFO L276 IsEmpty]: Start isEmpty. Operand 71546 states and 75028 transitions. [2019-12-07 17:40:06,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 904 [2019-12-07 17:40:06,610 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:40:06,611 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:40:06,811 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:40:06,812 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:40:06,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:40:06,812 INFO L82 PathProgramCache]: Analyzing trace with hash 749095286, now seen corresponding path program 1 times [2019-12-07 17:40:06,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:40:06,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540481553] [2019-12-07 17:40:06,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:40:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:40:07,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2273 backedges. 1351 proven. 65 refuted. 0 times theorem prover too weak. 857 trivial. 0 not checked. [2019-12-07 17:40:07,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540481553] [2019-12-07 17:40:07,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804767711] [2019-12-07 17:40:07,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bf2dd792-7c33-4b94-b123-5ef092f34f93/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:40:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:40:07,786 INFO L264 TraceCheckSpWp]: Trace formula consists of 1114 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:40:07,791 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:40:08,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2273 backedges. 1416 proven. 0 refuted. 0 times theorem prover too weak. 857 trivial. 0 not checked. [2019-12-07 17:40:08,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:40:08,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-12-07 17:40:08,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114535399] [2019-12-07 17:40:08,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:40:08,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:40:08,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:40:08,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:40:08,268 INFO L87 Difference]: Start difference. First operand 71546 states and 75028 transitions. Second operand 4 states. [2019-12-07 17:40:10,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:40:10,582 INFO L93 Difference]: Finished difference Result 144365 states and 151418 transitions. [2019-12-07 17:40:10,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:40:10,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 903 [2019-12-07 17:40:10,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:40:10,636 INFO L225 Difference]: With dead ends: 144365 [2019-12-07 17:40:10,636 INFO L226 Difference]: Without dead ends: 73671 [2019-12-07 17:40:10,665 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 910 GetRequests, 902 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:40:10,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73671 states. [2019-12-07 17:40:11,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73671 to 73671. [2019-12-07 17:40:11,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73671 states. [2019-12-07 17:40:11,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73671 states to 73671 states and 77143 transitions. [2019-12-07 17:40:11,279 INFO L78 Accepts]: Start accepts. Automaton has 73671 states and 77143 transitions. Word has length 903 [2019-12-07 17:40:11,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:40:11,280 INFO L462 AbstractCegarLoop]: Abstraction has 73671 states and 77143 transitions. [2019-12-07 17:40:11,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:40:11,280 INFO L276 IsEmpty]: Start isEmpty. Operand 73671 states and 77143 transitions. [2019-12-07 17:40:11,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 956 [2019-12-07 17:40:11,305 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:40:11,306 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:40:11,506 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:40:11,507 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:40:11,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:40:11,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1201664773, now seen corresponding path program 1 times [2019-12-07 17:40:11,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:40:11,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048044750] [2019-12-07 17:40:11,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:40:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:40:12,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2396 backedges. 1451 proven. 0 refuted. 0 times theorem prover too weak. 945 trivial. 0 not checked. [2019-12-07 17:40:12,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048044750] [2019-12-07 17:40:12,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:40:12,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:40:12,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655253891] [2019-12-07 17:40:12,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:40:12,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:40:12,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:40:12,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:40:12,180 INFO L87 Difference]: Start difference. First operand 73671 states and 77143 transitions. Second operand 4 states. [2019-12-07 17:40:15,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:40:15,250 INFO L93 Difference]: Finished difference Result 152879 states and 160023 transitions. [2019-12-07 17:40:15,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:40:15,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 955 [2019-12-07 17:40:15,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:40:15,312 INFO L225 Difference]: With dead ends: 152879 [2019-12-07 17:40:15,312 INFO L226 Difference]: Without dead ends: 79210 [2019-12-07 17:40:15,345 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-12-07 17:40:15,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79210 states. [2019-12-07 17:40:15,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79210 to 73670. [2019-12-07 17:40:15,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73670 states. [2019-12-07 17:40:16,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73670 states to 73670 states and 77009 transitions. [2019-12-07 17:40:16,056 INFO L78 Accepts]: Start accepts. Automaton has 73670 states and 77009 transitions. Word has length 955 [2019-12-07 17:40:16,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:40:16,056 INFO L462 AbstractCegarLoop]: Abstraction has 73670 states and 77009 transitions. [2019-12-07 17:40:16,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:40:16,056 INFO L276 IsEmpty]: Start isEmpty. Operand 73670 states and 77009 transitions. [2019-12-07 17:40:16,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1032 [2019-12-07 17:40:16,086 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:40:16,087 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:40:16,087 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:40:16,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:40:16,087 INFO L82 PathProgramCache]: Analyzing trace with hash -115299208, now seen corresponding path program 1 times [2019-12-07 17:40:16,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:40:16,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638583282] [2019-12-07 17:40:16,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:40:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:40:16,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2384 backedges. 963 proven. 0 refuted. 0 times theorem prover too weak. 1421 trivial. 0 not checked. [2019-12-07 17:40:16,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638583282] [2019-12-07 17:40:16,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:40:16,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:40:16,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510701180] [2019-12-07 17:40:16,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:40:16,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:40:16,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:40:16,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:40:16,825 INFO L87 Difference]: Start difference. First operand 73670 states and 77009 transitions. Second operand 5 states. [2019-12-07 17:40:20,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:40:20,034 INFO L93 Difference]: Finished difference Result 163107 states and 170773 transitions. [2019-12-07 17:40:20,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:40:20,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1031 [2019-12-07 17:40:20,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:40:20,103 INFO L225 Difference]: With dead ends: 163107 [2019-12-07 17:40:20,104 INFO L226 Difference]: Without dead ends: 89864 [2019-12-07 17:40:20,135 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-12-07 17:40:20,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89864 states. [2019-12-07 17:40:20,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89864 to 72395. [2019-12-07 17:40:20,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72395 states. [2019-12-07 17:40:20,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72395 states to 72395 states and 75699 transitions. [2019-12-07 17:40:20,932 INFO L78 Accepts]: Start accepts. Automaton has 72395 states and 75699 transitions. Word has length 1031 [2019-12-07 17:40:20,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:40:20,933 INFO L462 AbstractCegarLoop]: Abstraction has 72395 states and 75699 transitions. [2019-12-07 17:40:20,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:40:20,933 INFO L276 IsEmpty]: Start isEmpty. Operand 72395 states and 75699 transitions. [2019-12-07 17:40:20,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1104 [2019-12-07 17:40:20,965 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:40:20,966 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:40:20,966 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:40:20,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:40:20,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1807092396, now seen corresponding path program 1 times [2019-12-07 17:40:20,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:40:20,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702019463] [2019-12-07 17:40:20,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:40:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:40:22,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1802 backedges. 1243 proven. 0 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2019-12-07 17:40:22,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702019463] [2019-12-07 17:40:22,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:40:22,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:40:22,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38113749] [2019-12-07 17:40:22,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:40:22,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:40:22,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:40:22,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:40:22,491 INFO L87 Difference]: Start difference. First operand 72395 states and 75699 transitions. Second operand 3 states. [2019-12-07 17:40:26,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:40:26,518 INFO L93 Difference]: Finished difference Result 145219 states and 151855 transitions. [2019-12-07 17:40:26,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:40:26,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1103 [2019-12-07 17:40:26,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:40:26,576 INFO L225 Difference]: With dead ends: 145219 [2019-12-07 17:40:26,577 INFO L226 Difference]: Without dead ends: 73676 [2019-12-07 17:40:26,606 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:40:26,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73676 states. [2019-12-07 17:40:27,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73676 to 72393. [2019-12-07 17:40:27,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72393 states. [2019-12-07 17:40:27,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72393 states to 72393 states and 75450 transitions. [2019-12-07 17:40:27,333 INFO L78 Accepts]: Start accepts. Automaton has 72393 states and 75450 transitions. Word has length 1103 [2019-12-07 17:40:27,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:40:27,334 INFO L462 AbstractCegarLoop]: Abstraction has 72393 states and 75450 transitions. [2019-12-07 17:40:27,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:40:27,334 INFO L276 IsEmpty]: Start isEmpty. Operand 72393 states and 75450 transitions. [2019-12-07 17:40:27,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1111 [2019-12-07 17:40:27,363 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:40:27,364 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:40:27,364 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:40:27,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:40:27,365 INFO L82 PathProgramCache]: Analyzing trace with hash -881943503, now seen corresponding path program 1 times [2019-12-07 17:40:27,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:40:27,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448285326] [2019-12-07 17:40:27,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:40:27,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:40:28,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2385 backedges. 1698 proven. 143 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-12-07 17:40:28,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448285326] [2019-12-07 17:40:28,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509288359] [2019-12-07 17:40:28,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bf2dd792-7c33-4b94-b123-5ef092f34f93/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:40:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:40:28,941 INFO L264 TraceCheckSpWp]: Trace formula consists of 1330 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 17:40:28,948 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:40:28,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:40:28,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:40:29,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:40:31,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2385 backedges. 1841 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-12-07 17:40:31,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:40:31,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-12-07 17:40:31,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346264361] [2019-12-07 17:40:31,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:40:31,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:40:31,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:40:31,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:40:31,754 INFO L87 Difference]: Start difference. First operand 72393 states and 75450 transitions. Second operand 4 states. [2019-12-07 17:40:40,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:40:40,652 INFO L93 Difference]: Finished difference Result 164372 states and 171206 transitions. [2019-12-07 17:40:40,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:40:40,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1110 [2019-12-07 17:40:40,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:40:40,735 INFO L225 Difference]: With dead ends: 164372 [2019-12-07 17:40:40,735 INFO L226 Difference]: Without dead ends: 92831 [2019-12-07 17:40:40,773 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1116 GetRequests, 1109 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:40:40,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92831 states. [2019-12-07 17:40:41,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92831 to 78362. [2019-12-07 17:40:41,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78362 states. [2019-12-07 17:40:41,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78362 states to 78362 states and 81661 transitions. [2019-12-07 17:40:41,537 INFO L78 Accepts]: Start accepts. Automaton has 78362 states and 81661 transitions. Word has length 1110 [2019-12-07 17:40:41,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:40:41,538 INFO L462 AbstractCegarLoop]: Abstraction has 78362 states and 81661 transitions. [2019-12-07 17:40:41,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:40:41,538 INFO L276 IsEmpty]: Start isEmpty. Operand 78362 states and 81661 transitions. [2019-12-07 17:40:41,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1122 [2019-12-07 17:40:41,580 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:40:41,580 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:40:41,781 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:40:41,782 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:40:41,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:40:41,783 INFO L82 PathProgramCache]: Analyzing trace with hash -204436311, now seen corresponding path program 1 times [2019-12-07 17:40:41,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:40:41,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790896663] [2019-12-07 17:40:41,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:40:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:40:42,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 744 proven. 6 refuted. 0 times theorem prover too weak. 724 trivial. 0 not checked. [2019-12-07 17:40:42,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790896663] [2019-12-07 17:40:42,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744966006] [2019-12-07 17:40:42,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bf2dd792-7c33-4b94-b123-5ef092f34f93/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:40:42,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:40:42,876 INFO L264 TraceCheckSpWp]: Trace formula consists of 1302 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:40:42,882 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:40:43,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 736 proven. 0 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2019-12-07 17:40:43,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:40:43,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-12-07 17:40:43,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887075951] [2019-12-07 17:40:43,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:40:43,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:40:43,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:40:43,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:40:43,841 INFO L87 Difference]: Start difference. First operand 78362 states and 81661 transitions. Second operand 4 states. [2019-12-07 17:41:19,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:41:19,861 INFO L93 Difference]: Finished difference Result 192925 states and 201331 transitions. [2019-12-07 17:41:19,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:41:19,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1121 [2019-12-07 17:41:19,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:41:19,958 INFO L225 Difference]: With dead ends: 192925 [2019-12-07 17:41:19,958 INFO L226 Difference]: Without dead ends: 114140 [2019-12-07 17:41:19,996 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1127 GetRequests, 1120 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:41:20,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114140 states. [2019-12-07 17:41:20,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114140 to 95830. [2019-12-07 17:41:20,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95830 states. [2019-12-07 17:41:20,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95830 states to 95830 states and 100008 transitions. [2019-12-07 17:41:20,876 INFO L78 Accepts]: Start accepts. Automaton has 95830 states and 100008 transitions. Word has length 1121 [2019-12-07 17:41:20,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:41:20,877 INFO L462 AbstractCegarLoop]: Abstraction has 95830 states and 100008 transitions. [2019-12-07 17:41:20,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:41:20,877 INFO L276 IsEmpty]: Start isEmpty. Operand 95830 states and 100008 transitions. [2019-12-07 17:41:20,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1156 [2019-12-07 17:41:20,923 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:41:20,923 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:41:21,124 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:41:21,125 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:41:21,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:41:21,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1008432611, now seen corresponding path program 1 times [2019-12-07 17:41:21,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:41:21,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212107365] [2019-12-07 17:41:21,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:41:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:41:22,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2861 backedges. 1057 proven. 0 refuted. 0 times theorem prover too weak. 1804 trivial. 0 not checked. [2019-12-07 17:41:22,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212107365] [2019-12-07 17:41:22,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:41:22,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:41:22,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52797236] [2019-12-07 17:41:22,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:41:22,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:41:22,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:41:22,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:41:22,264 INFO L87 Difference]: Start difference. First operand 95830 states and 100008 transitions. Second operand 3 states. [2019-12-07 17:41:24,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:41:24,499 INFO L93 Difference]: Finished difference Result 200571 states and 209218 transitions. [2019-12-07 17:41:24,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:41:24,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1155 [2019-12-07 17:41:24,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:41:24,591 INFO L225 Difference]: With dead ends: 200571 [2019-12-07 17:41:24,591 INFO L226 Difference]: Without dead ends: 105593 [2019-12-07 17:41:24,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-12-07 17:41:24,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105593 states. [2019-12-07 17:41:25,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105593 to 92812. [2019-12-07 17:41:25,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92812 states. [2019-12-07 17:41:25,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92812 states to 92812 states and 96184 transitions. [2019-12-07 17:41:25,472 INFO L78 Accepts]: Start accepts. Automaton has 92812 states and 96184 transitions. Word has length 1155 [2019-12-07 17:41:25,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:41:25,473 INFO L462 AbstractCegarLoop]: Abstraction has 92812 states and 96184 transitions. [2019-12-07 17:41:25,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:41:25,473 INFO L276 IsEmpty]: Start isEmpty. Operand 92812 states and 96184 transitions. [2019-12-07 17:41:25,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1196 [2019-12-07 17:41:25,504 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:41:25,505 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:41:25,505 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:41:25,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:41:25,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1621241508, now seen corresponding path program 1 times [2019-12-07 17:41:25,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:41:25,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603279816] [2019-12-07 17:41:25,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:41:25,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:41:27,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2602 backedges. 1917 proven. 143 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2019-12-07 17:41:27,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603279816] [2019-12-07 17:41:27,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356535642] [2019-12-07 17:41:27,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bf2dd792-7c33-4b94-b123-5ef092f34f93/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:41:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:41:28,111 INFO L264 TraceCheckSpWp]: Trace formula consists of 1411 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 17:41:28,118 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:41:28,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:28,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2602 backedges. 2060 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2019-12-07 17:41:28,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:41:28,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-12-07 17:41:28,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512746165] [2019-12-07 17:41:28,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:41:28,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:41:28,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:41:28,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:41:28,974 INFO L87 Difference]: Start difference. First operand 92812 states and 96184 transitions. Second operand 4 states. [2019-12-07 17:41:32,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:41:32,748 INFO L93 Difference]: Finished difference Result 211159 states and 218678 transitions. [2019-12-07 17:41:32,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:41:32,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1195 [2019-12-07 17:41:32,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:41:32,848 INFO L225 Difference]: With dead ends: 211159 [2019-12-07 17:41:32,848 INFO L226 Difference]: Without dead ends: 118774 [2019-12-07 17:41:32,891 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1202 GetRequests, 1194 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:41:32,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118774 states. [2019-12-07 17:41:33,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118774 to 101320. [2019-12-07 17:41:33,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101320 states. [2019-12-07 17:41:33,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101320 states to 101320 states and 104986 transitions. [2019-12-07 17:41:33,855 INFO L78 Accepts]: Start accepts. Automaton has 101320 states and 104986 transitions. Word has length 1195 [2019-12-07 17:41:33,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:41:33,856 INFO L462 AbstractCegarLoop]: Abstraction has 101320 states and 104986 transitions. [2019-12-07 17:41:33,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:41:33,856 INFO L276 IsEmpty]: Start isEmpty. Operand 101320 states and 104986 transitions. [2019-12-07 17:41:33,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1359 [2019-12-07 17:41:33,907 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:41:33,908 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 17:41:34,109 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:41:34,110 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:41:34,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:41:34,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1366747237, now seen corresponding path program 1 times [2019-12-07 17:41:34,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:41:34,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624043313] [2019-12-07 17:41:34,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:41:34,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:41:35,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3285 backedges. 1991 proven. 0 refuted. 0 times theorem prover too weak. 1294 trivial. 0 not checked. [2019-12-07 17:41:35,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624043313] [2019-12-07 17:41:35,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:41:35,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:41:35,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117892600] [2019-12-07 17:41:35,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:41:35,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:41:35,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:41:35,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:41:35,981 INFO L87 Difference]: Start difference. First operand 101320 states and 104986 transitions. Second operand 6 states. [2019-12-07 17:41:40,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:41:40,558 INFO L93 Difference]: Finished difference Result 198375 states and 205588 transitions. [2019-12-07 17:41:40,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:41:40,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1358 [2019-12-07 17:41:40,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:41:40,638 INFO L225 Difference]: With dead ends: 198375 [2019-12-07 17:41:40,638 INFO L226 Difference]: Without dead ends: 97482 [2019-12-07 17:41:40,679 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:41:40,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97482 states. [2019-12-07 17:41:41,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97482 to 86411. [2019-12-07 17:41:41,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86411 states. [2019-12-07 17:41:41,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86411 states to 86411 states and 89389 transitions. [2019-12-07 17:41:41,549 INFO L78 Accepts]: Start accepts. Automaton has 86411 states and 89389 transitions. Word has length 1358 [2019-12-07 17:41:41,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:41:41,550 INFO L462 AbstractCegarLoop]: Abstraction has 86411 states and 89389 transitions. [2019-12-07 17:41:41,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:41:41,550 INFO L276 IsEmpty]: Start isEmpty. Operand 86411 states and 89389 transitions. [2019-12-07 17:41:41,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1493 [2019-12-07 17:41:41,599 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:41:41,600 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:41:41,600 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:41:41,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:41:41,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1113059779, now seen corresponding path program 1 times [2019-12-07 17:41:41,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:41:41,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003898297] [2019-12-07 17:41:41,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:41:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:41:43,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3255 backedges. 2428 proven. 550 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2019-12-07 17:41:43,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003898297] [2019-12-07 17:41:43,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596706184] [2019-12-07 17:41:43,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bf2dd792-7c33-4b94-b123-5ef092f34f93/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:41:43,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:41:43,909 INFO L264 TraceCheckSpWp]: Trace formula consists of 1720 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 17:41:43,921 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:41:43,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:41:43,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:43,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:43,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:43,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:43,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:41:43,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:41:43,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:43,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:43,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:41:43,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:41:43,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:43,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:43,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:41:43,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:41:44,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:44,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:41:48,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3255 backedges. 1624 proven. 1336 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2019-12-07 17:41:48,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:41:48,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2019-12-07 17:41:48,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965740981] [2019-12-07 17:41:48,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 17:41:48,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:41:48,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 17:41:48,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:41:48,544 INFO L87 Difference]: Start difference. First operand 86411 states and 89389 transitions. Second operand 13 states. [2019-12-07 17:42:32,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:32,177 INFO L93 Difference]: Finished difference Result 210493 states and 217710 transitions. [2019-12-07 17:42:32,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-12-07 17:42:32,179 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 1492 [2019-12-07 17:42:32,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:32,295 INFO L225 Difference]: With dead ends: 210493 [2019-12-07 17:42:32,295 INFO L226 Difference]: Without dead ends: 123653 [2019-12-07 17:42:32,341 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1655 GetRequests, 1563 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3486 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1620, Invalid=7122, Unknown=0, NotChecked=0, Total=8742 [2019-12-07 17:42:32,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123653 states. [2019-12-07 17:42:33,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123653 to 95346. [2019-12-07 17:42:33,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95346 states. [2019-12-07 17:42:33,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95346 states to 95346 states and 98568 transitions. [2019-12-07 17:42:33,306 INFO L78 Accepts]: Start accepts. Automaton has 95346 states and 98568 transitions. Word has length 1492 [2019-12-07 17:42:33,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:33,307 INFO L462 AbstractCegarLoop]: Abstraction has 95346 states and 98568 transitions. [2019-12-07 17:42:33,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 17:42:33,307 INFO L276 IsEmpty]: Start isEmpty. Operand 95346 states and 98568 transitions. [2019-12-07 17:42:33,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1893 [2019-12-07 17:42:33,374 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:33,375 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:33,575 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:42:33,575 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:33,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:33,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1060407296, now seen corresponding path program 1 times [2019-12-07 17:42:33,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:33,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467434613] [2019-12-07 17:42:33,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:37,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4623 backedges. 3750 proven. 0 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2019-12-07 17:42:37,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467434613] [2019-12-07 17:42:37,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:37,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:42:37,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562195361] [2019-12-07 17:42:37,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:42:37,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:37,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:42:37,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:42:37,179 INFO L87 Difference]: Start difference. First operand 95346 states and 98568 transitions. Second operand 6 states. [2019-12-07 17:42:44,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:44,037 INFO L93 Difference]: Finished difference Result 208998 states and 215891 transitions. [2019-12-07 17:42:44,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:42:44,038 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1892 [2019-12-07 17:42:44,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:44,134 INFO L225 Difference]: With dead ends: 208998 [2019-12-07 17:42:44,135 INFO L226 Difference]: Without dead ends: 114079 [2019-12-07 17:42:44,251 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:42:44,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114079 states. [2019-12-07 17:42:45,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114079 to 96202. [2019-12-07 17:42:45,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96202 states. [2019-12-07 17:42:45,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96202 states to 96202 states and 99361 transitions. [2019-12-07 17:42:45,079 INFO L78 Accepts]: Start accepts. Automaton has 96202 states and 99361 transitions. Word has length 1892 [2019-12-07 17:42:45,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:45,080 INFO L462 AbstractCegarLoop]: Abstraction has 96202 states and 99361 transitions. [2019-12-07 17:42:45,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:42:45,081 INFO L276 IsEmpty]: Start isEmpty. Operand 96202 states and 99361 transitions. [2019-12-07 17:42:45,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1980 [2019-12-07 17:42:45,149 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:45,150 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:45,150 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:45,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:45,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1099028230, now seen corresponding path program 1 times [2019-12-07 17:42:45,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:45,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833251222] [2019-12-07 17:42:45,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:45,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:48,036 INFO L134 CoverageAnalysis]: Checked inductivity of 5114 backedges. 3733 proven. 0 refuted. 0 times theorem prover too weak. 1381 trivial. 0 not checked. [2019-12-07 17:42:48,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833251222] [2019-12-07 17:42:48,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:48,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:42:48,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447526848] [2019-12-07 17:42:48,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:42:48,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:48,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:42:48,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:42:48,038 INFO L87 Difference]: Start difference. First operand 96202 states and 99361 transitions. Second operand 5 states. [2019-12-07 17:42:51,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:42:51,025 INFO L93 Difference]: Finished difference Result 204342 states and 210976 transitions. [2019-12-07 17:42:51,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:42:51,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1979 [2019-12-07 17:42:51,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:42:51,119 INFO L225 Difference]: With dead ends: 204342 [2019-12-07 17:42:51,119 INFO L226 Difference]: Without dead ends: 108567 [2019-12-07 17:42:51,150 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-12-07 17:42:51,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108567 states. [2019-12-07 17:42:51,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108567 to 96629. [2019-12-07 17:42:51,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96629 states. [2019-12-07 17:42:52,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96629 states to 96629 states and 99770 transitions. [2019-12-07 17:42:52,017 INFO L78 Accepts]: Start accepts. Automaton has 96629 states and 99770 transitions. Word has length 1979 [2019-12-07 17:42:52,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:42:52,018 INFO L462 AbstractCegarLoop]: Abstraction has 96629 states and 99770 transitions. [2019-12-07 17:42:52,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:42:52,018 INFO L276 IsEmpty]: Start isEmpty. Operand 96629 states and 99770 transitions. [2019-12-07 17:42:52,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2063 [2019-12-07 17:42:52,088 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:42:52,089 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:42:52,089 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:42:52,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:42:52,090 INFO L82 PathProgramCache]: Analyzing trace with hash 604683623, now seen corresponding path program 1 times [2019-12-07 17:42:52,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:42:52,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141542252] [2019-12-07 17:42:52,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:42:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:42:54,914 INFO L134 CoverageAnalysis]: Checked inductivity of 6200 backedges. 4247 proven. 0 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-12-07 17:42:54,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141542252] [2019-12-07 17:42:54,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:42:54,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:42:54,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895973688] [2019-12-07 17:42:54,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:42:54,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:42:54,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:42:54,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:42:54,917 INFO L87 Difference]: Start difference. First operand 96629 states and 99770 transitions. Second operand 5 states. [2019-12-07 17:43:02,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:43:02,015 INFO L93 Difference]: Finished difference Result 204770 states and 211343 transitions. [2019-12-07 17:43:02,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:43:02,015 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 2062 [2019-12-07 17:43:02,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:43:02,106 INFO L225 Difference]: With dead ends: 204770 [2019-12-07 17:43:02,106 INFO L226 Difference]: Without dead ends: 108568 [2019-12-07 17:43:02,149 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-12-07 17:43:02,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108568 states. [2019-12-07 17:43:02,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108568 to 96202. [2019-12-07 17:43:02,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96202 states. [2019-12-07 17:43:03,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96202 states to 96202 states and 99318 transitions. [2019-12-07 17:43:03,022 INFO L78 Accepts]: Start accepts. Automaton has 96202 states and 99318 transitions. Word has length 2062 [2019-12-07 17:43:03,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:43:03,023 INFO L462 AbstractCegarLoop]: Abstraction has 96202 states and 99318 transitions. [2019-12-07 17:43:03,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:43:03,023 INFO L276 IsEmpty]: Start isEmpty. Operand 96202 states and 99318 transitions. [2019-12-07 17:43:03,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2280 [2019-12-07 17:43:03,098 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:43:03,099 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:43:03,100 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:43:03,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:43:03,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1562803815, now seen corresponding path program 1 times [2019-12-07 17:43:03,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:43:03,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127936326] [2019-12-07 17:43:03,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:43:03,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:43:22,928 INFO L134 CoverageAnalysis]: Checked inductivity of 6680 backedges. 2321 proven. 4277 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-12-07 17:43:22,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127936326] [2019-12-07 17:43:22,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865105938] [2019-12-07 17:43:22,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bf2dd792-7c33-4b94-b123-5ef092f34f93/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:43:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:43:23,321 INFO L264 TraceCheckSpWp]: Trace formula consists of 2577 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:43:23,332 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:43:28,147 INFO L134 CoverageAnalysis]: Checked inductivity of 6680 backedges. 5323 proven. 0 refuted. 0 times theorem prover too weak. 1357 trivial. 0 not checked. [2019-12-07 17:43:28,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:43:28,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [22] total 25 [2019-12-07 17:43:28,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125301325] [2019-12-07 17:43:28,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:43:28,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:43:28,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:43:28,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2019-12-07 17:43:28,150 INFO L87 Difference]: Start difference. First operand 96202 states and 99318 transitions. Second operand 4 states. [2019-12-07 17:43:42,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:43:42,798 INFO L93 Difference]: Finished difference Result 208160 states and 214931 transitions. [2019-12-07 17:43:42,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:43:42,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2279 [2019-12-07 17:43:42,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:43:42,892 INFO L225 Difference]: With dead ends: 208160 [2019-12-07 17:43:42,893 INFO L226 Difference]: Without dead ends: 112385 [2019-12-07 17:43:42,931 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2302 GetRequests, 2277 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2019-12-07 17:43:43,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112385 states. [2019-12-07 17:43:43,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112385 to 83432. [2019-12-07 17:43:43,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83432 states. [2019-12-07 17:43:43,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83432 states to 83432 states and 86037 transitions. [2019-12-07 17:43:43,781 INFO L78 Accepts]: Start accepts. Automaton has 83432 states and 86037 transitions. Word has length 2279 [2019-12-07 17:43:43,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:43:43,783 INFO L462 AbstractCegarLoop]: Abstraction has 83432 states and 86037 transitions. [2019-12-07 17:43:43,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:43:43,783 INFO L276 IsEmpty]: Start isEmpty. Operand 83432 states and 86037 transitions. [2019-12-07 17:43:43,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2308 [2019-12-07 17:43:43,852 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:43:43,853 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 17:43:44,053 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:43:44,053 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:43:44,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:43:44,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1001039699, now seen corresponding path program 1 times [2019-12-07 17:43:44,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:43:44,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443774833] [2019-12-07 17:43:44,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:43:44,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:43:49,732 INFO L134 CoverageAnalysis]: Checked inductivity of 8982 backedges. 6129 proven. 1117 refuted. 0 times theorem prover too weak. 1736 trivial. 0 not checked. [2019-12-07 17:43:49,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443774833] [2019-12-07 17:43:49,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308562197] [2019-12-07 17:43:49,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bf2dd792-7c33-4b94-b123-5ef092f34f93/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:43:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:43:50,121 INFO L264 TraceCheckSpWp]: Trace formula consists of 2660 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:43:50,131 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:43:50,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:43:54,216 INFO L134 CoverageAnalysis]: Checked inductivity of 8982 backedges. 3537 proven. 0 refuted. 0 times theorem prover too weak. 5445 trivial. 0 not checked. [2019-12-07 17:43:54,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:43:54,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-12-07 17:43:54,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309607367] [2019-12-07 17:43:54,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:43:54,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:43:54,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:43:54,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:43:54,218 INFO L87 Difference]: Start difference. First operand 83432 states and 86037 transitions. Second operand 3 states. [2019-12-07 17:44:01,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:01,533 INFO L93 Difference]: Finished difference Result 168139 states and 173255 transitions. [2019-12-07 17:44:01,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:44:01,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2307 [2019-12-07 17:44:01,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:01,599 INFO L225 Difference]: With dead ends: 168139 [2019-12-07 17:44:01,599 INFO L226 Difference]: Without dead ends: 85134 [2019-12-07 17:44:01,635 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2317 GetRequests, 2307 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:44:01,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85134 states. [2019-12-07 17:44:02,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85134 to 80866. [2019-12-07 17:44:02,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80866 states. [2019-12-07 17:44:02,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80866 states to 80866 states and 83172 transitions. [2019-12-07 17:44:02,375 INFO L78 Accepts]: Start accepts. Automaton has 80866 states and 83172 transitions. Word has length 2307 [2019-12-07 17:44:02,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:02,377 INFO L462 AbstractCegarLoop]: Abstraction has 80866 states and 83172 transitions. [2019-12-07 17:44:02,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:44:02,377 INFO L276 IsEmpty]: Start isEmpty. Operand 80866 states and 83172 transitions. [2019-12-07 17:44:02,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2454 [2019-12-07 17:44:02,451 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:02,452 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 17:44:02,653 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:44:02,653 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:44:02,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:02,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1238893721, now seen corresponding path program 1 times [2019-12-07 17:44:02,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:02,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996444856] [2019-12-07 17:44:02,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:06,466 INFO L134 CoverageAnalysis]: Checked inductivity of 8525 backedges. 6035 proven. 0 refuted. 0 times theorem prover too weak. 2490 trivial. 0 not checked. [2019-12-07 17:44:06,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996444856] [2019-12-07 17:44:06,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:44:06,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:44:06,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672376827] [2019-12-07 17:44:06,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:44:06,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:06,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:44:06,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:44:06,468 INFO L87 Difference]: Start difference. First operand 80866 states and 83172 transitions. Second operand 6 states. [2019-12-07 17:44:11,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:11,783 INFO L93 Difference]: Finished difference Result 169814 states and 174558 transitions. [2019-12-07 17:44:11,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:44:11,784 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 2453 [2019-12-07 17:44:11,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:11,854 INFO L225 Difference]: With dead ends: 169814 [2019-12-07 17:44:11,854 INFO L226 Difference]: Without dead ends: 89375 [2019-12-07 17:44:11,887 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:44:11,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89375 states. [2019-12-07 17:44:12,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89375 to 72349. [2019-12-07 17:44:12,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72349 states. [2019-12-07 17:44:12,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72349 states to 72349 states and 74218 transitions. [2019-12-07 17:44:12,685 INFO L78 Accepts]: Start accepts. Automaton has 72349 states and 74218 transitions. Word has length 2453 [2019-12-07 17:44:12,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:12,686 INFO L462 AbstractCegarLoop]: Abstraction has 72349 states and 74218 transitions. [2019-12-07 17:44:12,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:44:12,686 INFO L276 IsEmpty]: Start isEmpty. Operand 72349 states and 74218 transitions. [2019-12-07 17:44:12,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2510 [2019-12-07 17:44:12,769 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:44:12,770 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:44:12,770 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:44:12,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:44:12,771 INFO L82 PathProgramCache]: Analyzing trace with hash -690805896, now seen corresponding path program 1 times [2019-12-07 17:44:12,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:44:12,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340019603] [2019-12-07 17:44:12,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:44:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:44:18,318 INFO L134 CoverageAnalysis]: Checked inductivity of 7594 backedges. 6083 proven. 0 refuted. 0 times theorem prover too weak. 1511 trivial. 0 not checked. [2019-12-07 17:44:18,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340019603] [2019-12-07 17:44:18,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:44:18,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:44:18,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370741762] [2019-12-07 17:44:18,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:44:18,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:44:18,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:44:18,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:44:18,320 INFO L87 Difference]: Start difference. First operand 72349 states and 74218 transitions. Second operand 7 states. [2019-12-07 17:44:23,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:44:23,515 INFO L93 Difference]: Finished difference Result 154916 states and 158880 transitions. [2019-12-07 17:44:23,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:44:23,515 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 2509 [2019-12-07 17:44:23,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:44:23,516 INFO L225 Difference]: With dead ends: 154916 [2019-12-07 17:44:23,516 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 17:44:23,553 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:44:23,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 17:44:23,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 17:44:23,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 17:44:23,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 17:44:23,554 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2509 [2019-12-07 17:44:23,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:44:23,554 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 17:44:23,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:44:23,555 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 17:44:23,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 17:44:23,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 17:44:30,980 WARN L192 SmtUtils]: Spent 7.41 s on a formula simplification. DAG size of input: 2343 DAG size of output: 1840 [2019-12-07 17:44:38,103 WARN L192 SmtUtils]: Spent 7.11 s on a formula simplification. DAG size of input: 2293 DAG size of output: 1819 [2019-12-07 17:44:45,340 WARN L192 SmtUtils]: Spent 7.23 s on a formula simplification. DAG size of input: 2343 DAG size of output: 1840 [2019-12-07 17:45:15,985 WARN L192 SmtUtils]: Spent 30.63 s on a formula simplification. DAG size of input: 1738 DAG size of output: 221 [2019-12-07 17:45:44,973 WARN L192 SmtUtils]: Spent 28.98 s on a formula simplification. DAG size of input: 1723 DAG size of output: 237 [2019-12-07 17:46:15,364 WARN L192 SmtUtils]: Spent 30.38 s on a formula simplification. DAG size of input: 1738 DAG size of output: 221 [2019-12-07 17:46:15,367 INFO L246 CegarLoopResult]: For program point L1819(lines 1819 1830) no Hoare annotation was computed. [2019-12-07 17:46:15,367 INFO L246 CegarLoopResult]: For program point L762(lines 762 770) no Hoare annotation was computed. [2019-12-07 17:46:15,367 INFO L246 CegarLoopResult]: For program point L1819-2(lines 1819 1830) no Hoare annotation was computed. [2019-12-07 17:46:15,367 INFO L246 CegarLoopResult]: For program point L762-2(lines 762 770) no Hoare annotation was computed. [2019-12-07 17:46:15,367 INFO L246 CegarLoopResult]: For program point L1291(lines 1291 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,368 INFO L246 CegarLoopResult]: For program point L1159(lines 1159 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,368 INFO L246 CegarLoopResult]: For program point L1556(lines 1556 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,368 INFO L246 CegarLoopResult]: For program point L1424(lines 1424 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,368 INFO L246 CegarLoopResult]: For program point L367(lines 367 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,368 INFO L246 CegarLoopResult]: For program point L103-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,368 INFO L246 CegarLoopResult]: For program point L1028(lines 1028 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,368 INFO L246 CegarLoopResult]: For program point L368(lines 368 377) no Hoare annotation was computed. [2019-12-07 17:46:15,368 INFO L246 CegarLoopResult]: For program point L368-2(lines 368 377) no Hoare annotation was computed. [2019-12-07 17:46:15,368 INFO L246 CegarLoopResult]: For program point L104(line 104) no Hoare annotation was computed. [2019-12-07 17:46:15,368 INFO L246 CegarLoopResult]: For program point L2086(lines 2086 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,368 INFO L246 CegarLoopResult]: For program point L2351(lines 2351 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,368 INFO L246 CegarLoopResult]: For program point L898(lines 898 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,368 INFO L246 CegarLoopResult]: For program point L634(lines 634 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,368 INFO L246 CegarLoopResult]: For program point L502(lines 502 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,368 INFO L246 CegarLoopResult]: For program point L238(lines 238 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,368 INFO L246 CegarLoopResult]: For program point L2220(lines 2220 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,368 INFO L246 CegarLoopResult]: For program point L106-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,368 INFO L246 CegarLoopResult]: For program point L1956(lines 1956 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,368 INFO L246 CegarLoopResult]: For program point L899(lines 899 908) no Hoare annotation was computed. [2019-12-07 17:46:15,368 INFO L246 CegarLoopResult]: For program point L899-2(lines 899 908) no Hoare annotation was computed. [2019-12-07 17:46:15,369 INFO L246 CegarLoopResult]: For program point L1428(lines 1428 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,369 INFO L246 CegarLoopResult]: For program point L107(line 107) no Hoare annotation was computed. [2019-12-07 17:46:15,369 INFO L246 CegarLoopResult]: For program point L2486(lines 2486 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,369 INFO L246 CegarLoopResult]: For program point L1429(lines 1429 1439) no Hoare annotation was computed. [2019-12-07 17:46:15,369 INFO L246 CegarLoopResult]: For program point L1429-2(lines 1429 1439) no Hoare annotation was computed. [2019-12-07 17:46:15,369 INFO L246 CegarLoopResult]: For program point L1297(lines 1297 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,369 INFO L246 CegarLoopResult]: For program point L1694(lines 1694 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,369 INFO L246 CegarLoopResult]: For program point L1166(lines 1166 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,369 INFO L246 CegarLoopResult]: For program point L109-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,369 INFO L246 CegarLoopResult]: For program point L1034(lines 1034 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,369 INFO L246 CegarLoopResult]: For program point L1563(lines 1563 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,369 INFO L246 CegarLoopResult]: For program point L2224(lines 2224 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,369 INFO L246 CegarLoopResult]: For program point L110(line 110) no Hoare annotation was computed. [2019-12-07 17:46:15,369 INFO L246 CegarLoopResult]: For program point L2092(lines 2092 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,369 INFO L246 CegarLoopResult]: For program point L771(lines 771 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,369 INFO L246 CegarLoopResult]: For program point L507(lines 507 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,369 INFO L246 CegarLoopResult]: For program point L243(lines 243 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,369 INFO L246 CegarLoopResult]: For program point L640(lines 640 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,369 INFO L246 CegarLoopResult]: For program point L2358(lines 2358 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,369 INFO L246 CegarLoopResult]: For program point L112-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,369 INFO L246 CegarLoopResult]: For program point L2491(lines 2491 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,370 INFO L246 CegarLoopResult]: For program point L113(line 113) no Hoare annotation was computed. [2019-12-07 17:46:15,370 INFO L246 CegarLoopResult]: For program point L2095(lines 2095 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,370 INFO L246 CegarLoopResult]: For program point L1963(lines 1963 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,370 INFO L246 CegarLoopResult]: For program point L1831(lines 1831 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,370 INFO L246 CegarLoopResult]: For program point L378(lines 378 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,370 INFO L246 CegarLoopResult]: For program point L1303(lines 1303 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,370 INFO L246 CegarLoopResult]: For program point L1964(lines 1964 1974) no Hoare annotation was computed. [2019-12-07 17:46:15,370 INFO L246 CegarLoopResult]: For program point L1964-2(lines 1964 1974) no Hoare annotation was computed. [2019-12-07 17:46:15,370 INFO L246 CegarLoopResult]: For program point L1700(lines 1700 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,370 INFO L246 CegarLoopResult]: For program point L1172(lines 1172 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,370 INFO L246 CegarLoopResult]: For program point L115-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,370 INFO L246 CegarLoopResult]: For program point L1040(lines 1040 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,370 INFO L246 CegarLoopResult]: For program point L776(lines 776 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,370 INFO L246 CegarLoopResult]: For program point L116(line 116) no Hoare annotation was computed. [2019-12-07 17:46:15,370 INFO L246 CegarLoopResult]: For program point L909(lines 909 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,370 INFO L246 CegarLoopResult]: For program point L1570(lines 1570 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,370 INFO L246 CegarLoopResult]: For program point L1306(lines 1306 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,370 INFO L246 CegarLoopResult]: For program point L249(lines 249 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,370 INFO L246 CegarLoopResult]: For program point L2231(lines 2231 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,370 INFO L246 CegarLoopResult]: For program point L514(lines 514 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,370 INFO L246 CegarLoopResult]: For program point L2496(lines 2496 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,371 INFO L246 CegarLoopResult]: For program point L2232(lines 2232 2243) no Hoare annotation was computed. [2019-12-07 17:46:15,371 INFO L246 CegarLoopResult]: For program point L2232-2(lines 2232 2243) no Hoare annotation was computed. [2019-12-07 17:46:15,371 INFO L246 CegarLoopResult]: For program point L118-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,371 INFO L246 CegarLoopResult]: For program point L647(lines 647 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,371 INFO L246 CegarLoopResult]: For program point L1440(lines 1440 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,371 INFO L246 CegarLoopResult]: For program point L2365(lines 2365 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,371 INFO L246 CegarLoopResult]: For program point L119(line 119) no Hoare annotation was computed. [2019-12-07 17:46:15,371 INFO L246 CegarLoopResult]: For program point L1044(lines 1044 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,371 INFO L246 CegarLoopResult]: For program point L2101(lines 2101 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,371 INFO L246 CegarLoopResult]: For program point L1837(lines 1837 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,371 INFO L246 CegarLoopResult]: For program point L913(lines 913 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,371 INFO L246 CegarLoopResult]: For program point L781(lines 781 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,371 INFO L246 CegarLoopResult]: For program point L1574(lines 1574 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,371 INFO L246 CegarLoopResult]: For program point L385(lines 385 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,371 INFO L246 CegarLoopResult]: For program point L121-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,371 INFO L246 CegarLoopResult]: For program point L1707(lines 1707 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,371 INFO L246 CegarLoopResult]: For program point L1575(lines 1575 1581) no Hoare annotation was computed. [2019-12-07 17:46:15,371 INFO L246 CegarLoopResult]: For program point L1575-2(lines 1575 1581) no Hoare annotation was computed. [2019-12-07 17:46:15,371 INFO L246 CegarLoopResult]: For program point L1179(lines 1179 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,371 INFO L246 CegarLoopResult]: For program point L122(line 122) no Hoare annotation was computed. [2019-12-07 17:46:15,371 INFO L246 CegarLoopResult]: For program point L1708(lines 1708 1717) no Hoare annotation was computed. [2019-12-07 17:46:15,372 INFO L246 CegarLoopResult]: For program point L1708-2(lines 1708 1717) no Hoare annotation was computed. [2019-12-07 17:46:15,372 INFO L246 CegarLoopResult]: For program point L1444(lines 1444 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,372 INFO L246 CegarLoopResult]: For program point L2105(lines 2105 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,372 INFO L246 CegarLoopResult]: For program point L2502(lines 2502 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,372 INFO L246 CegarLoopResult]: For program point L1313(lines 1313 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,372 INFO L246 CegarLoopResult]: For program point L256(lines 256 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,372 INFO L246 CegarLoopResult]: For program point L124-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,372 INFO L246 CegarLoopResult]: For program point L2106(lines 2106 2112) no Hoare annotation was computed. [2019-12-07 17:46:15,372 INFO L246 CegarLoopResult]: For program point L2106-2(lines 2106 2112) no Hoare annotation was computed. [2019-12-07 17:46:15,372 INFO L246 CegarLoopResult]: For program point L1842(lines 1842 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,372 INFO L246 CegarLoopResult]: For program point L653(lines 653 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,372 INFO L246 CegarLoopResult]: For program point L521(lines 521 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,372 INFO L246 CegarLoopResult]: For program point L2371(lines 2371 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,372 INFO L246 CegarLoopResult]: For program point L125(line 125) no Hoare annotation was computed. [2019-12-07 17:46:15,372 INFO L246 CegarLoopResult]: For program point L1050(lines 1050 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,372 INFO L246 CegarLoopResult]: For program point L1975(lines 1975 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,372 INFO L246 CegarLoopResult]: For program point L522(lines 522 531) no Hoare annotation was computed. [2019-12-07 17:46:15,372 INFO L246 CegarLoopResult]: For program point L522-2(lines 522 531) no Hoare annotation was computed. [2019-12-07 17:46:15,372 INFO L246 CegarLoopResult]: For program point L919(lines 919 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,372 INFO L246 CegarLoopResult]: For program point L787(lines 787 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,373 INFO L246 CegarLoopResult]: For program point L1184(lines 1184 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,373 INFO L246 CegarLoopResult]: For program point L127-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,373 INFO L246 CegarLoopResult]: For program point L920(lines 920 929) no Hoare annotation was computed. [2019-12-07 17:46:15,373 INFO L246 CegarLoopResult]: For program point L920-2(lines 920 929) no Hoare annotation was computed. [2019-12-07 17:46:15,373 INFO L246 CegarLoopResult]: For program point L1845(lines 1845 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,373 INFO L246 CegarLoopResult]: For program point L392(lines 392 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,373 INFO L246 CegarLoopResult]: For program point L1317(lines 1317 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,373 INFO L246 CegarLoopResult]: For program point L1185(lines 1185 1196) no Hoare annotation was computed. [2019-12-07 17:46:15,373 INFO L246 CegarLoopResult]: For program point L128(line 128) no Hoare annotation was computed. [2019-12-07 17:46:15,373 INFO L246 CegarLoopResult]: For program point L1185-2(lines 1185 1196) no Hoare annotation was computed. [2019-12-07 17:46:15,373 INFO L246 CegarLoopResult]: For program point L1582(lines 1582 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,373 INFO L246 CegarLoopResult]: For program point L1979(lines 1979 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,373 INFO L246 CegarLoopResult]: For program point L1451(lines 1451 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,373 INFO L246 CegarLoopResult]: For program point L262(lines 262 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,373 INFO L246 CegarLoopResult]: For program point L2244(lines 2244 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,373 INFO L246 CegarLoopResult]: For program point L130-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,373 INFO L246 CegarLoopResult]: For program point L2509(lines 2509 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,373 INFO L246 CegarLoopResult]: For program point L2377(lines 2377 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,373 INFO L246 CegarLoopResult]: For program point L2245(lines 2245 2255) no Hoare annotation was computed. [2019-12-07 17:46:15,373 INFO L246 CegarLoopResult]: For program point L131(line 131) no Hoare annotation was computed. [2019-12-07 17:46:15,374 INFO L246 CegarLoopResult]: For program point L2245-2(lines 2245 2255) no Hoare annotation was computed. [2019-12-07 17:46:15,374 INFO L246 CegarLoopResult]: For program point L1056(lines 1056 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,374 INFO L246 CegarLoopResult]: For program point L2113(lines 2113 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,374 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 17:46:15,374 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2019-12-07 17:46:15,374 INFO L246 CegarLoopResult]: For program point L660(lines 660 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,374 INFO L246 CegarLoopResult]: For program point L793(lines 793 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,374 INFO L246 CegarLoopResult]: For program point L1718(lines 1718 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,374 INFO L246 CegarLoopResult]: For program point L1322(lines 1322 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,374 INFO L246 CegarLoopResult]: For program point L133-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,374 INFO L246 CegarLoopResult]: For program point L1587(lines 1587 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,374 INFO L246 CegarLoopResult]: For program point L266(lines 266 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,374 INFO L246 CegarLoopResult]: For program point L134(line 134) no Hoare annotation was computed. [2019-12-07 17:46:15,374 INFO L246 CegarLoopResult]: For program point L1984(lines 1984 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,374 INFO L246 CegarLoopResult]: For program point L1852(lines 1852 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,374 INFO L246 CegarLoopResult]: For program point L399(lines 399 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,374 INFO L246 CegarLoopResult]: For program point L532(lines 532 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,374 INFO L246 CegarLoopResult]: For program point L2514(lines 2514 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,374 INFO L246 CegarLoopResult]: For program point L1457(lines 1457 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,374 INFO L246 CegarLoopResult]: For program point L2382(lines 2382 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,374 INFO L246 CegarLoopResult]: For program point L136-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,375 INFO L246 CegarLoopResult]: For program point L2118(lines 2118 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,375 INFO L246 CegarLoopResult]: For program point L1590(lines 1590 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,375 INFO L246 CegarLoopResult]: For program point L137(line 137) no Hoare annotation was computed. [2019-12-07 17:46:15,375 INFO L246 CegarLoopResult]: For program point L930(lines 930 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,375 INFO L246 CegarLoopResult]: For program point L1723(lines 1723 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,375 INFO L246 CegarLoopResult]: For program point L1063(lines 1063 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,375 INFO L246 CegarLoopResult]: For program point L667(lines 667 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,375 INFO L246 CegarLoopResult]: For program point L535(lines 535 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,375 INFO L246 CegarLoopResult]: For program point L2517(lines 2517 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,375 INFO L246 CegarLoopResult]: For program point L1328(lines 1328 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,375 INFO L246 CegarLoopResult]: For program point L139-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,375 INFO L246 CegarLoopResult]: For program point L800(lines 800 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,375 INFO L246 CegarLoopResult]: For program point L1329(lines 1329 1338) no Hoare annotation was computed. [2019-12-07 17:46:15,375 INFO L246 CegarLoopResult]: For program point L1329-2(lines 1329 1338) no Hoare annotation was computed. [2019-12-07 17:46:15,375 INFO L246 CegarLoopResult]: For program point L1197(lines 1197 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,375 INFO L246 CegarLoopResult]: For program point L140(line 140) no Hoare annotation was computed. [2019-12-07 17:46:15,375 INFO L246 CegarLoopResult]: For program point L1858(lines 1858 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,375 INFO L246 CegarLoopResult]: For program point L1462(lines 1462 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,375 INFO L246 CegarLoopResult]: For program point L405(lines 405 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,375 INFO L246 CegarLoopResult]: For program point L273(lines 273 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,375 INFO L246 CegarLoopResult]: For program point L1991(lines 1991 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,376 INFO L246 CegarLoopResult]: For program point L1859(lines 1859 1867) no Hoare annotation was computed. [2019-12-07 17:46:15,376 INFO L246 CegarLoopResult]: For program point L1859-2(lines 1859 1867) no Hoare annotation was computed. [2019-12-07 17:46:15,376 INFO L246 CegarLoopResult]: For program point L1595(lines 1595 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,376 INFO L246 CegarLoopResult]: For program point L406(lines 406 415) no Hoare annotation was computed. [2019-12-07 17:46:15,376 INFO L246 CegarLoopResult]: For program point L406-2(lines 406 415) no Hoare annotation was computed. [2019-12-07 17:46:15,376 INFO L246 CegarLoopResult]: For program point L274(lines 274 286) no Hoare annotation was computed. [2019-12-07 17:46:15,376 INFO L246 CegarLoopResult]: For program point L2256(lines 2256 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,376 INFO L246 CegarLoopResult]: For program point L274-2(lines 274 286) no Hoare annotation was computed. [2019-12-07 17:46:15,376 INFO L246 CegarLoopResult]: For program point L142-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,376 INFO L246 CegarLoopResult]: For program point L935(lines 935 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,376 INFO L246 CegarLoopResult]: For program point L1596(lines 1596 1607) no Hoare annotation was computed. [2019-12-07 17:46:15,376 INFO L246 CegarLoopResult]: For program point L1596-2(lines 1596 1607) no Hoare annotation was computed. [2019-12-07 17:46:15,376 INFO L246 CegarLoopResult]: For program point L2389(lines 2389 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,376 INFO L246 CegarLoopResult]: For program point L143(line 143) no Hoare annotation was computed. [2019-12-07 17:46:15,376 INFO L246 CegarLoopResult]: For program point L2125(lines 2125 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,376 INFO L246 CegarLoopResult]: For program point L2522(lines 2522 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,376 INFO L246 CegarLoopResult]: For program point L2390(lines 2390 2402) no Hoare annotation was computed. [2019-12-07 17:46:15,376 INFO L246 CegarLoopResult]: For program point L2390-2(lines 2390 2402) no Hoare annotation was computed. [2019-12-07 17:46:15,376 INFO L246 CegarLoopResult]: For program point L1069(lines 1069 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,376 INFO L246 CegarLoopResult]: For program point L1730(lines 1730 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,376 INFO L246 CegarLoopResult]: For program point L673(lines 673 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,376 INFO L246 CegarLoopResult]: For program point L541(lines 541 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,377 INFO L246 CegarLoopResult]: For program point L1202(lines 1202 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,377 INFO L246 CegarLoopResult]: For program point L145-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,377 INFO L246 CegarLoopResult]: For program point L1995(lines 1995 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,377 INFO L246 CegarLoopResult]: For program point L1467(lines 1467 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,377 INFO L246 CegarLoopResult]: For program point L146(line 146) no Hoare annotation was computed. [2019-12-07 17:46:15,377 INFO L246 CegarLoopResult]: For program point L939(lines 939 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,377 INFO L246 CegarLoopResult]: For program point L807(lines 807 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,377 INFO L246 CegarLoopResult]: For program point L2129(lines 2129 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,377 INFO L246 CegarLoopResult]: For program point L148-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,377 INFO L246 CegarLoopResult]: For program point L2527(lines 2527 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,377 INFO L246 CegarLoopResult]: For program point L2263(lines 2263 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,377 INFO L246 CegarLoopResult]: For program point L149(line 149) no Hoare annotation was computed. [2019-12-07 17:46:15,377 INFO L246 CegarLoopResult]: For program point L1735(lines 1735 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,377 INFO L246 CegarLoopResult]: For program point L2528(lines 2528 2538) no Hoare annotation was computed. [2019-12-07 17:46:15,377 INFO L246 CegarLoopResult]: For program point L2528-2(lines 2528 2538) no Hoare annotation was computed. [2019-12-07 17:46:15,377 INFO L246 CegarLoopResult]: For program point L1339(lines 1339 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,377 INFO L246 CegarLoopResult]: For program point L1868(lines 1868 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,377 INFO L246 CegarLoopResult]: For program point L679(lines 679 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,377 INFO L246 CegarLoopResult]: For program point L547(lines 547 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,377 INFO L246 CegarLoopResult]: For program point L151-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,377 INFO L246 CegarLoopResult]: For program point L1076(lines 1076 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,378 INFO L246 CegarLoopResult]: For program point L548(lines 548 557) no Hoare annotation was computed. [2019-12-07 17:46:15,378 INFO L246 CegarLoopResult]: For program point L548-2(lines 548 557) no Hoare annotation was computed. [2019-12-07 17:46:15,378 INFO L246 CegarLoopResult]: For program point L416(lines 416 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,378 INFO L246 CegarLoopResult]: For program point L1209(lines 1209 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,378 INFO L246 CegarLoopResult]: For program point L152(line 152) no Hoare annotation was computed. [2019-12-07 17:46:15,378 INFO L246 CegarLoopResult]: For program point L2002(lines 2002 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,378 INFO L246 CegarLoopResult]: For program point L1474(lines 1474 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,378 INFO L246 CegarLoopResult]: For program point L2135(lines 2135 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,378 INFO L246 CegarLoopResult]: For program point L946(lines 946 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,378 INFO L246 CegarLoopResult]: For program point L814(lines 814 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,378 INFO L246 CegarLoopResult]: For program point L2268(lines 2268 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,378 INFO L246 CegarLoopResult]: For program point L154-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,378 INFO L246 CegarLoopResult]: For program point L1608(lines 1608 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,378 INFO L246 CegarLoopResult]: For program point L287(lines 287 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,378 INFO L246 CegarLoopResult]: For program point L155(line 155) no Hoare annotation was computed. [2019-12-07 17:46:15,378 INFO L246 CegarLoopResult]: For program point L1741(lines 1741 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,378 INFO L246 CegarLoopResult]: For program point L1081(lines 1081 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,378 INFO L246 CegarLoopResult]: For program point L1346(lines 1346 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,378 INFO L246 CegarLoopResult]: For program point L2403(lines 2403 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,378 INFO L246 CegarLoopResult]: For program point L157-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,378 INFO L246 CegarLoopResult]: For program point L25(lines 25 27) no Hoare annotation was computed. [2019-12-07 17:46:15,379 INFO L246 CegarLoopResult]: For program point L25-2(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,379 INFO L246 CegarLoopResult]: For program point L2007(lines 2007 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,379 INFO L246 CegarLoopResult]: For program point L1875(lines 1875 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,379 INFO L246 CegarLoopResult]: For program point L686(lines 686 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,379 INFO L246 CegarLoopResult]: For program point L2404(lines 2404 2415) no Hoare annotation was computed. [2019-12-07 17:46:15,379 INFO L246 CegarLoopResult]: For program point L2404-2(lines 2404 2415) no Hoare annotation was computed. [2019-12-07 17:46:15,379 INFO L246 CegarLoopResult]: For program point L158(line 158) no Hoare annotation was computed. [2019-12-07 17:46:15,379 INFO L246 CegarLoopResult]: For program point L2140(lines 2140 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,379 INFO L246 CegarLoopResult]: For program point L26(line 26) no Hoare annotation was computed. [2019-12-07 17:46:15,379 INFO L246 CegarLoopResult]: For program point L687(lines 687 697) no Hoare annotation was computed. [2019-12-07 17:46:15,379 INFO L246 CegarLoopResult]: For program point L687-2(lines 687 697) no Hoare annotation was computed. [2019-12-07 17:46:15,379 INFO L246 CegarLoopResult]: For program point L423(lines 423 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,379 INFO L246 CegarLoopResult]: For program point L1216(lines 1216 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,379 INFO L246 CegarLoopResult]: For program point L952(lines 952 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,379 INFO L246 CegarLoopResult]: For program point L820(lines 820 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,379 INFO L246 CegarLoopResult]: For program point L1745(lines 1745 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,379 INFO L246 CegarLoopResult]: For program point L1613(lines 1613 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,379 INFO L246 CegarLoopResult]: For program point L1481(lines 1481 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,379 INFO L246 CegarLoopResult]: For program point L160-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,379 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 17:46:15,379 INFO L246 CegarLoopResult]: For program point L28-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,380 INFO L246 CegarLoopResult]: For program point L2010(lines 2010 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,380 INFO L246 CegarLoopResult]: For program point L2539(lines 2539 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,380 INFO L246 CegarLoopResult]: For program point L2275(lines 2275 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,380 INFO L246 CegarLoopResult]: For program point L161(line 161) no Hoare annotation was computed. [2019-12-07 17:46:15,380 INFO L246 CegarLoopResult]: For program point L29(line 29) no Hoare annotation was computed. [2019-12-07 17:46:15,380 INFO L246 CegarLoopResult]: For program point L558(lines 558 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,380 INFO L246 CegarLoopResult]: For program point L294(lines 294 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,380 INFO L246 CegarLoopResult]: For program point L1352(lines 1352 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,380 INFO L246 CegarLoopResult]: For program point L1220(lines 1220 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,380 INFO L246 CegarLoopResult]: For program point L163-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,380 INFO L246 CegarLoopResult]: For program point L1088(lines 1088 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,380 INFO L246 CegarLoopResult]: For program point L2145(lines 2145 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,380 INFO L246 CegarLoopResult]: For program point L31-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,380 INFO L246 CegarLoopResult]: For program point L1881(lines 1881 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,380 INFO L246 CegarLoopResult]: For program point L1749(lines 1749 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,380 INFO L246 CegarLoopResult]: For program point L428(lines 428 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,380 INFO L246 CegarLoopResult]: For program point L1221(lines 1221 1230) no Hoare annotation was computed. [2019-12-07 17:46:15,380 INFO L246 CegarLoopResult]: For program point L164(line 164) no Hoare annotation was computed. [2019-12-07 17:46:15,380 INFO L246 CegarLoopResult]: For program point L1221-2(lines 1221 1230) no Hoare annotation was computed. [2019-12-07 17:46:15,380 INFO L246 CegarLoopResult]: For program point L32(line 32) no Hoare annotation was computed. [2019-12-07 17:46:15,381 INFO L246 CegarLoopResult]: For program point L826(lines 826 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,381 INFO L246 CegarLoopResult]: For program point L2544(lines 2544 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,381 INFO L246 CegarLoopResult]: For program point L1487(lines 1487 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,381 INFO L246 CegarLoopResult]: For program point L166-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,381 INFO L246 CegarLoopResult]: For program point L34-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,381 INFO L246 CegarLoopResult]: For program point L2016(lines 2016 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,381 INFO L246 CegarLoopResult]: For program point L959(lines 959 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,381 INFO L246 CegarLoopResult]: For program point L1620(lines 1620 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,381 INFO L246 CegarLoopResult]: For program point L2281(lines 2281 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,381 INFO L246 CegarLoopResult]: For program point L167(line 167) no Hoare annotation was computed. [2019-12-07 17:46:15,381 INFO L246 CegarLoopResult]: For program point L35(line 35) no Hoare annotation was computed. [2019-12-07 17:46:15,381 INFO L246 CegarLoopResult]: For program point L565(lines 565 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,381 INFO L246 CegarLoopResult]: For program point L1490(lines 1490 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,381 INFO L246 CegarLoopResult]: For program point L433(lines 433 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,381 INFO L246 CegarLoopResult]: For program point L301(lines 301 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,381 INFO L246 CegarLoopResult]: For program point L169-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,381 INFO L246 CegarLoopResult]: For program point L1094(lines 1094 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,381 INFO L246 CegarLoopResult]: For program point L37-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,382 INFO L246 CegarLoopResult]: For program point L698(lines 698 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,382 INFO L246 CegarLoopResult]: For program point L2416(lines 2416 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,382 INFO L246 CegarLoopResult]: For program point L1359(lines 1359 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,382 INFO L246 CegarLoopResult]: For program point L170(line 170) no Hoare annotation was computed. [2019-12-07 17:46:15,382 INFO L246 CegarLoopResult]: For program point L2152(lines 2152 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,382 INFO L246 CegarLoopResult]: For program point L38(line 38) no Hoare annotation was computed. [2019-12-07 17:46:15,382 INFO L246 CegarLoopResult]: For program point L2020(lines 2020 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,382 INFO L246 CegarLoopResult]: For program point L1888(lines 1888 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,382 INFO L246 CegarLoopResult]: For program point L831(lines 831 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,382 INFO L246 CegarLoopResult]: For program point L1756(lines 1756 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,382 INFO L246 CegarLoopResult]: For program point L2021(lines 2021 2030) no Hoare annotation was computed. [2019-12-07 17:46:15,382 INFO L246 CegarLoopResult]: For program point L2021-2(lines 2021 2030) no Hoare annotation was computed. [2019-12-07 17:46:15,382 INFO L246 CegarLoopResult]: For program point L172-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,382 INFO L246 CegarLoopResult]: For program point L40-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,382 INFO L246 CegarLoopResult]: For program point L1626(lines 1626 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,382 INFO L246 CegarLoopResult]: For program point L2551(lines 2551 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,382 INFO L246 CegarLoopResult]: For program point L2287(lines 2287 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,382 INFO L246 CegarLoopResult]: For program point L173(line 173) no Hoare annotation was computed. [2019-12-07 17:46:15,382 INFO L246 CegarLoopResult]: For program point L41(line 41) no Hoare annotation was computed. [2019-12-07 17:46:15,382 INFO L246 CegarLoopResult]: For program point L966(lines 966 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,382 INFO L246 CegarLoopResult]: For program point L570(lines 570 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,382 INFO L246 CegarLoopResult]: For program point L306(lines 306 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,383 INFO L246 CegarLoopResult]: For program point L1231(lines 1231 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,383 INFO L246 CegarLoopResult]: For program point L703(lines 703 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,383 INFO L246 CegarLoopResult]: For program point L439(lines 439 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,383 INFO L246 CegarLoopResult]: For program point L1364(lines 1364 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,383 INFO L246 CegarLoopResult]: For program point L175-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,383 INFO L246 CegarLoopResult]: For program point L1100(lines 1100 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,383 INFO L246 CegarLoopResult]: For program point L2157(lines 2157 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,383 INFO L246 CegarLoopResult]: For program point L43-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,383 INFO L246 CegarLoopResult]: For program point L1497(lines 1497 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,383 INFO L246 CegarLoopResult]: For program point L2422(lines 2422 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,383 INFO L246 CegarLoopResult]: For program point L1365(lines 1365 1376) no Hoare annotation was computed. [2019-12-07 17:46:15,383 INFO L246 CegarLoopResult]: For program point L1365-2(lines 1365 1376) no Hoare annotation was computed. [2019-12-07 17:46:15,383 INFO L246 CegarLoopResult]: For program point L176(line 176) no Hoare annotation was computed. [2019-12-07 17:46:15,383 INFO L246 CegarLoopResult]: For program point L44(line 44) no Hoare annotation was computed. [2019-12-07 17:46:15,383 INFO L246 CegarLoopResult]: For program point L837(lines 837 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,383 INFO L246 CegarLoopResult]: For program point L1895(lines 1895 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,383 INFO L246 CegarLoopResult]: For program point L838(lines 838 846) no Hoare annotation was computed. [2019-12-07 17:46:15,383 INFO L246 CegarLoopResult]: For program point L838-2(lines 838 846) no Hoare annotation was computed. [2019-12-07 17:46:15,383 INFO L246 CegarLoopResult]: For program point L1763(lines 1763 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,383 INFO L246 CegarLoopResult]: For program point L178-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,383 INFO L246 CegarLoopResult]: For program point L46-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,383 INFO L246 CegarLoopResult]: For program point L1632(lines 1632 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,384 INFO L246 CegarLoopResult]: For program point L2557(lines 2557 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,384 INFO L246 CegarLoopResult]: For program point L2293(lines 2293 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,384 INFO L246 CegarLoopResult]: For program point L179(line 179) no Hoare annotation was computed. [2019-12-07 17:46:15,384 INFO L246 CegarLoopResult]: For program point L47(line 47) no Hoare annotation was computed. [2019-12-07 17:46:15,384 INFO L246 CegarLoopResult]: For program point L972(lines 972 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,384 INFO L246 CegarLoopResult]: For program point L576(lines 576 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,384 INFO L246 CegarLoopResult]: For program point L1237(lines 1237 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,384 INFO L246 CegarLoopResult]: For program point L709(lines 709 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,384 INFO L246 CegarLoopResult]: For program point L313(lines 313 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,384 INFO L246 CegarLoopResult]: For program point L181-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,384 INFO L246 CegarLoopResult]: For program point L1106(lines 1106 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,384 INFO L246 CegarLoopResult]: For program point L2163(lines 2163 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,384 INFO L246 CegarLoopResult]: For program point L49-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,384 INFO L246 CegarLoopResult]: For program point L2031(lines 2031 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,384 INFO L246 CegarLoopResult]: For program point L710(lines 710 718) no Hoare annotation was computed. [2019-12-07 17:46:15,384 INFO L246 CegarLoopResult]: For program point L710-2(lines 710 718) no Hoare annotation was computed. [2019-12-07 17:46:15,384 INFO L246 CegarLoopResult]: For program point L446(lines 446 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,384 INFO L246 CegarLoopResult]: For program point L182(line 182) no Hoare annotation was computed. [2019-12-07 17:46:15,384 INFO L246 CegarLoopResult]: For program point L50(line 50) no Hoare annotation was computed. [2019-12-07 17:46:15,384 INFO L246 CegarLoopResult]: For program point L975(lines 975 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,384 INFO L246 CegarLoopResult]: For program point L1900(lines 1900 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,384 INFO L246 CegarLoopResult]: For program point L1636(lines 1636 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,385 INFO L246 CegarLoopResult]: For program point L1504(lines 1504 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,385 INFO L246 CegarLoopResult]: For program point L2429(lines 2429 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,385 INFO L246 CegarLoopResult]: For program point L2297(lines 2297 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,385 INFO L246 CegarLoopResult]: For program point L2430(lines 2430 2439) no Hoare annotation was computed. [2019-12-07 17:46:15,385 INFO L246 CegarLoopResult]: For program point L2430-2(lines 2430 2439) no Hoare annotation was computed. [2019-12-07 17:46:15,385 INFO L246 CegarLoopResult]: For program point L184-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,385 INFO L246 CegarLoopResult]: For program point L52-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,385 INFO L246 CegarLoopResult]: For program point L1770(lines 1770 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,385 INFO L246 CegarLoopResult]: For program point L2563(lines 2563 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,385 INFO L246 CegarLoopResult]: For program point L185(line 185) no Hoare annotation was computed. [2019-12-07 17:46:15,385 INFO L246 CegarLoopResult]: For program point L53(line 53) no Hoare annotation was computed. [2019-12-07 17:46:15,385 INFO L246 CegarLoopResult]: For program point L582(lines 582 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,385 INFO L246 CegarLoopResult]: For program point L2168(lines 2168 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,385 INFO L246 CegarLoopResult]: For program point L847(lines 847 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,385 INFO L246 CegarLoopResult]: For program point L451(lines 451 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,385 INFO L246 CegarLoopResult]: For program point L319(lines 319 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,385 INFO L246 CegarLoopResult]: For program point L1244(lines 1244 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,385 INFO L246 CegarLoopResult]: For program point L187-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,385 INFO L246 CegarLoopResult]: For program point L55-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,385 INFO L246 CegarLoopResult]: For program point L848(lines 848 858) no Hoare annotation was computed. [2019-12-07 17:46:15,385 INFO L246 CegarLoopResult]: For program point L848-2(lines 848 858) no Hoare annotation was computed. [2019-12-07 17:46:15,385 INFO L246 CegarLoopResult]: For program point L1377(lines 1377 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,386 INFO L246 CegarLoopResult]: For program point L2302(lines 2302 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,386 INFO L246 CegarLoopResult]: For program point L188(line 188) no Hoare annotation was computed. [2019-12-07 17:46:15,386 INFO L246 CegarLoopResult]: For program point L1113(lines 1113 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,386 INFO L246 CegarLoopResult]: For program point L56(line 56) no Hoare annotation was computed. [2019-12-07 17:46:15,386 INFO L246 CegarLoopResult]: For program point L2038(lines 2038 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,386 INFO L246 CegarLoopResult]: For program point L981(lines 981 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,386 INFO L246 CegarLoopResult]: For program point L1906(lines 1906 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,386 INFO L246 CegarLoopResult]: For program point L1510(lines 1510 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,386 INFO L246 CegarLoopResult]: For program point L1907(lines 1907 1915) no Hoare annotation was computed. [2019-12-07 17:46:15,386 INFO L246 CegarLoopResult]: For program point L1907-2(lines 1907 1915) no Hoare annotation was computed. [2019-12-07 17:46:15,387 INFO L242 CegarLoopResult]: At program point L1643(lines 24 1644) the Hoare annotation is: (let ((.cse10 (< 300 ~a28~0)) (.cse0 (< 217 ~a26~0)) (.cse1 (= ~a24~0 1)) (.cse6 (= ~a24~0 2)) (.cse33 (+ ~a26~0 68)) (.cse34 (+ ~a14~0 182)) (.cse31 (+ ~a14~0 84)) (.cse32 (+ ~a14~0 114))) (let ((.cse17 (<= ~a28~0 279)) (.cse14 (<= (div (+ (* ~a26~0 (- 1)) 596057) (- 5)) 124)) (.cse22 (<= (+ ~a14~0 4163) 0)) (.cse28 (<= ~a26~0 215)) (.cse20 (<= .cse32 0)) (.cse4 (< 124 ~a26~0)) (.cse29 (< 0 .cse31)) (.cse9 (<= ~a26~0 217)) (.cse25 (<= (+ ~a26~0 10118) 0)) (.cse11 (exists ((v_~a26~0_1234 Int)) (and (<= v_~a26~0_1234 217) (<= ~a26~0 (div (+ v_~a26~0_1234 308146) 5)) (< 124 v_~a26~0_1234) (= 0 (mod (+ v_~a26~0_1234 1) 5))))) (.cse5 (<= ~a28~0 300)) (.cse2 (exists ((v_~a28~0_1307 Int)) (let ((.cse35 (mod (+ v_~a28~0_1307 6) 82))) (and (not (= .cse35 0)) (<= (+ .cse35 137) ~a28~0) (< v_~a28~0_1307 89948))))) (.cse16 (<= ~a28~0 134)) (.cse12 (<= .cse34 0)) (.cse8 (< 37 ~a28~0)) (.cse27 (exists ((v_~a28~0_1305 Int)) (and (< 37 v_~a28~0_1305) (<= 0 v_~a28~0_1305) (<= (+ (mod v_~a28~0_1305 299849) 18943) ~a28~0)))) (.cse24 (<= .cse33 0)) (.cse23 (not .cse6)) (.cse7 (< 0 .cse34)) (.cse21 (< 0 .cse33)) (.cse19 (<= ~a26~0 124)) (.cse26 (<= ~a26~0 599998)) (.cse18 (<= 0 (+ ~a14~0 82))) (.cse13 (< 0 .cse32)) (.cse3 (<= ~a21~0 124)) (.cse30 (or (and .cse10 .cse1) (and .cse0 .cse1))) (.cse15 (<= .cse31 0))) (or (and (<= ~a26~0 460652) .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse3) (and .cse4 .cse10 .cse6 .cse11 .cse12 .cse3) (and .cse4 .cse6 .cse13 .cse14 .cse3 .cse15) (and .cse16 .cse1 .cse9) (and .cse6 .cse16 .cse8 .cse14 .cse3) (and .cse6 .cse17 .cse9 .cse2 .cse12 .cse3) (and .cse6 .cse18 .cse19 .cse3) (and .cse0 .cse6 .cse5 .cse14 .cse8 .cse12 .cse3) (and .cse0 .cse6 .cse7 .cse14 (<= (+ ~a14~0 85) 0) .cse3) (and .cse20 .cse7 .cse21 .cse19 .cse3) (and .cse10 .cse6 .cse13 .cse19 .cse3 (<= 0 (+ ~a26~0 12))) (and .cse10 (<= (+ ~a26~0 139421) 0) .cse12 .cse3) (and .cse17 .cse2 .cse21 .cse19 .cse22 .cse3) (and .cse6 .cse16 .cse14 .cse22 .cse3) (and .cse23 .cse16 .cse20 .cse7 .cse8 .cse3) (and .cse24 .cse25 .cse6 .cse13 .cse3 .cse15) (and .cse26 .cse0 .cse6 .cse13 .cse15 .cse3) (and .cse24 (<= (+ ~a28~0 599901) 0) .cse22 .cse3) (and .cse6 .cse27 (<= ~a26~0 590083) .cse12 .cse3) (and .cse23 .cse16 .cse20 .cse7 .cse9 .cse3) (and .cse4 .cse6 .cse28 .cse13 .cse8 .cse3) (and .cse10 .cse23 .cse20 .cse28 .cse7 .cse3) (and .cse10 (exists ((v_~a26~0_1243 Int)) (and (<= (div (+ (* v_~a26~0_1243 (- 1)) 596057) (- 5)) 124) (<= (+ ~a26~0 600073) v_~a26~0_1243))) .cse22 .cse3) (and .cse1 .cse29 .cse9 .cse3) (and .cse6 .cse16 .cse9 .cse12 .cse3) (and .cse24 .cse27 (<= (+ ~a26~0 150557) ~a28~0) .cse3) (and .cse4 .cse6 .cse5 .cse28 .cse2 .cse3) (and .cse1 (or .cse20 .cse19)) (and (<= ~a26~0 321684) .cse0 .cse6 .cse8 .cse12 .cse3) (and .cse4 .cse6 .cse5 (<= ~a26~0 449816) .cse29 .cse8 .cse3) (and .cse30 .cse9) (and .cse25 .cse5 .cse6 .cse8 .cse3) (and .cse11 .cse18 .cse1 (= ~a28~0 111) .cse3) (and .cse10 .cse24 .cse6 .cse12 .cse3) (and .cse24 .cse5 .cse6 .cse2 .cse3) (and .cse26 .cse6 .cse16 .cse8 .cse12 .cse3) (and .cse24 .cse6 .cse13 .cse8 .cse3 .cse15) (and .cse10 .cse6 .cse27 (exists ((v_~a26~0_1226 Int)) (and (<= ~a26~0 (+ (div v_~a26~0_1226 5) 460627)) (<= v_~a26~0_1226 124) (<= 0 v_~a26~0_1226))) .cse3) (and .cse24 .cse23 .cse7 .cse3) (and .cse6 .cse13 .cse21 .cse19 .cse3 .cse15) (and .cse26 .cse0 .cse6 .cse18 .cse13 .cse3) (and .cse30 .cse15)))) [2019-12-07 17:46:15,387 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 17:46:15,387 INFO L246 CegarLoopResult]: For program point L190-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,387 INFO L246 CegarLoopResult]: For program point L2172(lines 2172 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,387 INFO L246 CegarLoopResult]: For program point L58-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,387 INFO L246 CegarLoopResult]: For program point L719(lines 719 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,387 INFO L246 CegarLoopResult]: For program point L587(lines 587 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,387 INFO L246 CegarLoopResult]: For program point L323(lines 323 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,387 INFO L246 CegarLoopResult]: For program point L191(line 191) no Hoare annotation was computed. [2019-12-07 17:46:15,387 INFO L246 CegarLoopResult]: For program point L59(line 59) no Hoare annotation was computed. [2019-12-07 17:46:15,387 INFO L246 CegarLoopResult]: For program point L1777(lines 1777 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,387 INFO L246 CegarLoopResult]: For program point L1249(lines 1249 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,388 INFO L242 CegarLoopResult]: At program point L2571(lines 1646 2572) the Hoare annotation is: (let ((.cse36 (+ ~a26~0 68)) (.cse38 (+ ~a14~0 84)) (.cse34 (+ ~a14~0 114))) (let ((.cse5 (<= ~a28~0 300)) (.cse19 (<= .cse34 0)) (.cse30 (< 0 .cse38)) (.cse8 (< 37 ~a28~0)) (.cse15 (<= .cse38 0)) (.cse20 (< 0 .cse36)) (.cse10 (< 300 ~a28~0)) (.cse0 (< 217 ~a26~0)) (.cse1 (= ~a24~0 1)) (.cse6 (= ~a24~0 2)) (.cse35 (+ ~a14~0 182))) (let ((.cse14 (<= (div (+ (* ~a26~0 (- 1)) 596057) (- 5)) 124)) (.cse23 (<= ~a28~0 279)) (.cse24 (<= (+ ~a14~0 4163) 0)) (.cse18 (<= (+ ~a14~0 85) 0)) (.cse22 (exists ((v_~a28~0_1305 Int)) (and (< 37 v_~a28~0_1305) (<= 0 v_~a28~0_1305) (<= (+ (mod v_~a28~0_1305 299849) 18943) ~a28~0)))) (.cse29 (<= ~a26~0 215)) (.cse4 (< 124 ~a26~0)) (.cse9 (<= ~a26~0 217)) (.cse27 (<= (+ ~a26~0 10118) 0)) (.cse11 (exists ((v_~a26~0_1234 Int)) (and (<= v_~a26~0_1234 217) (<= ~a26~0 (div (+ v_~a26~0_1234 308146) 5)) (< 124 v_~a26~0_1234) (= 0 (mod (+ v_~a26~0_1234 1) 5))))) (.cse2 (exists ((v_~a28~0_1307 Int)) (let ((.cse37 (mod (+ v_~a28~0_1307 6) 82))) (and (not (= .cse37 0)) (<= (+ .cse37 137) ~a28~0) (< v_~a28~0_1307 89948))))) (.cse16 (<= ~a28~0 134)) (.cse12 (<= .cse35 0)) (.cse17 (<= .cse36 0)) (.cse26 (not .cse6)) (.cse7 (< 0 .cse35)) (.cse21 (<= ~a26~0 124)) (.cse28 (<= ~a26~0 599998)) (.cse32 (<= 0 (+ ~a14~0 82))) (.cse33 (or (and .cse10 .cse1) (and .cse0 .cse1))) (.cse25 (<= ~a26~0 449816)) (.cse31 (or (and (or .cse5 .cse19 .cse30) (or .cse8 .cse15)) (not (= 5 ULTIMATE.start_calculate_output_~input)) .cse20)) (.cse13 (< 0 .cse34)) (.cse3 (<= ~a21~0 124))) (or (and (<= ~a26~0 460652) .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse3) (and .cse4 .cse10 .cse6 .cse11 .cse12 .cse3) (and .cse4 .cse6 .cse13 .cse14 .cse3 .cse15) (and .cse16 .cse1 .cse9) (and .cse6 .cse16 .cse8 .cse14 .cse3) (and .cse17 .cse5 .cse6 .cse13 .cse8 .cse3 .cse15) (and .cse0 .cse6 .cse5 .cse14 .cse8 .cse12 .cse3) (and .cse0 .cse6 .cse7 .cse14 .cse18 .cse3) (and .cse19 .cse7 .cse20 .cse21 .cse3) (and .cse17 .cse22 (<= (+ ~a26~0 150557) ~a28~0) .cse12 .cse3) (and .cse10 (<= (+ ~a26~0 139421) 0) .cse12 .cse3) (and .cse23 .cse2 .cse20 .cse21 .cse24 .cse3) (and .cse6 .cse16 .cse14 .cse24 .cse3) (and .cse6 .cse25 .cse23 .cse2 .cse12 .cse3) (and .cse26 .cse16 .cse19 .cse7 .cse8 .cse3) (and .cse17 .cse27 .cse6 .cse13 .cse3 .cse15) (and .cse28 .cse0 .cse6 .cse13 .cse15 .cse3) (and .cse17 (<= (+ ~a28~0 599901) 0) .cse24 .cse3) (and .cse6 .cse22 (<= ~a26~0 590083) .cse12 .cse3) (and .cse26 .cse16 .cse19 .cse7 .cse9 .cse3) (and .cse4 .cse6 .cse29 .cse13 .cse8 .cse3) (and .cse10 .cse26 .cse19 .cse29 .cse7 .cse3) (and .cse10 .cse6 .cse30 .cse21 .cse3 (<= 0 (+ ~a26~0 12))) (and .cse10 (exists ((v_~a26~0_1243 Int)) (and (<= (div (+ (* v_~a26~0_1243 (- 1)) 596057) (- 5)) 124) (<= (+ ~a26~0 600073) v_~a26~0_1243))) .cse24 .cse3) (and .cse1 .cse30 .cse9 .cse3) (and .cse10 .cse17 .cse6 .cse13 .cse18 .cse3) (and .cse10 (or .cse19 .cse30) .cse6 .cse22 (exists ((v_~a26~0_1226 Int)) (and (<= ~a26~0 (+ (div v_~a26~0_1226 5) 460627)) (<= v_~a26~0_1226 124) (<= 0 v_~a26~0_1226))) .cse3) (and .cse6 .cse16 .cse9 .cse12 .cse3) (and .cse4 .cse6 .cse5 .cse29 .cse2 .cse3) (and .cse1 (or .cse19 .cse21)) (and (<= ~a26~0 321684) .cse0 .cse6 .cse8 .cse12 .cse3) (and .cse4 .cse6 .cse5 .cse25 .cse30 .cse8 .cse3) (and .cse17 .cse31 .cse32 .cse3) (and .cse33 .cse9) (and .cse27 .cse5 .cse6 .cse8 .cse3) (and .cse11 .cse32 .cse1 (= ~a28~0 111) .cse3) (and .cse6 .cse32 .cse20 .cse21 .cse3) (and .cse10 .cse17 .cse6 .cse12 .cse3) (and .cse17 .cse5 .cse6 .cse2 .cse3) (and .cse28 .cse6 .cse16 .cse8 .cse12 .cse3) (and .cse17 .cse26 .cse7 .cse3) (and .cse6 .cse13 .cse20 .cse21 .cse3 .cse15) (and .cse28 .cse0 .cse6 .cse32 .cse13 .cse3) (and .cse33 .cse15) (and .cse10 .cse6 .cse25 .cse31 .cse13 .cse3 .cse15))))) [2019-12-07 17:46:15,388 INFO L246 CegarLoopResult]: For program point L2307(lines 2307 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,388 INFO L246 CegarLoopResult]: For program point L193-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,388 INFO L246 CegarLoopResult]: For program point L61-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,388 INFO L246 CegarLoopResult]: For program point L2043(lines 2043 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,388 INFO L246 CegarLoopResult]: For program point L1515(lines 1515 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,388 INFO L246 CegarLoopResult]: For program point L458(lines 458 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,388 INFO L246 CegarLoopResult]: For program point L2440(lines 2440 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,388 INFO L246 CegarLoopResult]: For program point L1383(lines 1383 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,388 INFO L246 CegarLoopResult]: For program point L194(line 194) no Hoare annotation was computed. [2019-12-07 17:46:15,388 INFO L246 CegarLoopResult]: For program point L1119(lines 1119 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,388 INFO L246 CegarLoopResult]: For program point L62(line 62) no Hoare annotation was computed. [2019-12-07 17:46:15,388 INFO L246 CegarLoopResult]: For program point L988(lines 988 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,388 INFO L246 CegarLoopResult]: For program point L1649(lines 1649 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,388 INFO L249 CegarLoopResult]: At program point L2574(lines 2574 2590) the Hoare annotation is: true [2019-12-07 17:46:15,388 INFO L246 CegarLoopResult]: For program point L196-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,388 INFO L246 CegarLoopResult]: For program point L2178(lines 2178 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,388 INFO L246 CegarLoopResult]: For program point L64-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,388 INFO L246 CegarLoopResult]: For program point L725(lines 725 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,388 INFO L246 CegarLoopResult]: For program point L197(line 197) no Hoare annotation was computed. [2019-12-07 17:46:15,389 INFO L246 CegarLoopResult]: For program point L65(line 65) no Hoare annotation was computed. [2019-12-07 17:46:15,389 INFO L246 CegarLoopResult]: For program point L726(lines 726 736) no Hoare annotation was computed. [2019-12-07 17:46:15,389 INFO L246 CegarLoopResult]: For program point L726-2(lines 726 736) no Hoare annotation was computed. [2019-12-07 17:46:15,389 INFO L246 CegarLoopResult]: For program point L594(lines 594 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,389 INFO L246 CegarLoopResult]: For program point L330(lines 330 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,389 INFO L246 CegarLoopResult]: For program point L1255(lines 1255 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,389 INFO L246 CegarLoopResult]: For program point L1916(lines 1916 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,389 INFO L246 CegarLoopResult]: For program point L859(lines 859 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,389 INFO L246 CegarLoopResult]: For program point L1784(lines 1784 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,389 INFO L246 CegarLoopResult]: For program point L463(lines 463 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,389 INFO L246 CegarLoopResult]: For program point L2313(lines 2313 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,389 INFO L246 CegarLoopResult]: For program point L199-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,389 INFO L246 CegarLoopResult]: For program point L67-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,389 INFO L246 CegarLoopResult]: For program point L1521(lines 1521 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,389 INFO L246 CegarLoopResult]: For program point L2446(lines 2446 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,389 INFO L246 CegarLoopResult]: For program point L1389(lines 1389 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,389 INFO L246 CegarLoopResult]: For program point L200(line 200) no Hoare annotation was computed. [2019-12-07 17:46:15,389 INFO L246 CegarLoopResult]: For program point L1125(lines 1125 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,389 INFO L246 CegarLoopResult]: For program point L68(line 68) no Hoare annotation was computed. [2019-12-07 17:46:15,389 INFO L246 CegarLoopResult]: For program point L2050(lines 2050 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,389 INFO L246 CegarLoopResult]: For program point L1654(lines 1654 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,390 INFO L242 CegarLoopResult]: At program point L2580-2(lines 2580 2589) the Hoare annotation is: (let ((.cse10 (< 300 ~a28~0)) (.cse0 (< 217 ~a26~0)) (.cse1 (= ~a24~0 1)) (.cse6 (= ~a24~0 2)) (.cse33 (+ ~a26~0 68)) (.cse34 (+ ~a14~0 182)) (.cse31 (+ ~a14~0 84)) (.cse32 (+ ~a14~0 114))) (let ((.cse17 (<= ~a28~0 279)) (.cse14 (<= (div (+ (* ~a26~0 (- 1)) 596057) (- 5)) 124)) (.cse22 (<= (+ ~a14~0 4163) 0)) (.cse28 (<= ~a26~0 215)) (.cse20 (<= .cse32 0)) (.cse4 (< 124 ~a26~0)) (.cse29 (< 0 .cse31)) (.cse9 (<= ~a26~0 217)) (.cse25 (<= (+ ~a26~0 10118) 0)) (.cse11 (exists ((v_~a26~0_1234 Int)) (and (<= v_~a26~0_1234 217) (<= ~a26~0 (div (+ v_~a26~0_1234 308146) 5)) (< 124 v_~a26~0_1234) (= 0 (mod (+ v_~a26~0_1234 1) 5))))) (.cse5 (<= ~a28~0 300)) (.cse2 (exists ((v_~a28~0_1307 Int)) (let ((.cse35 (mod (+ v_~a28~0_1307 6) 82))) (and (not (= .cse35 0)) (<= (+ .cse35 137) ~a28~0) (< v_~a28~0_1307 89948))))) (.cse16 (<= ~a28~0 134)) (.cse12 (<= .cse34 0)) (.cse8 (< 37 ~a28~0)) (.cse27 (exists ((v_~a28~0_1305 Int)) (and (< 37 v_~a28~0_1305) (<= 0 v_~a28~0_1305) (<= (+ (mod v_~a28~0_1305 299849) 18943) ~a28~0)))) (.cse24 (<= .cse33 0)) (.cse23 (not .cse6)) (.cse7 (< 0 .cse34)) (.cse21 (< 0 .cse33)) (.cse19 (<= ~a26~0 124)) (.cse26 (<= ~a26~0 599998)) (.cse18 (<= 0 (+ ~a14~0 82))) (.cse13 (< 0 .cse32)) (.cse3 (<= ~a21~0 124)) (.cse30 (or (and .cse10 .cse1) (and .cse0 .cse1))) (.cse15 (<= .cse31 0))) (or (and (<= ~a26~0 460652) .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse3) (and .cse4 .cse10 .cse6 .cse11 .cse12 .cse3) (and .cse4 .cse6 .cse13 .cse14 .cse3 .cse15) (and .cse16 .cse1 .cse9) (and .cse6 .cse16 .cse8 .cse14 .cse3) (and .cse6 .cse17 .cse9 .cse2 .cse12 .cse3) (and .cse6 .cse18 .cse19 .cse3) (and .cse0 .cse6 .cse5 .cse14 .cse8 .cse12 .cse3) (and .cse0 .cse6 .cse7 .cse14 (<= (+ ~a14~0 85) 0) .cse3) (and .cse20 .cse7 .cse21 .cse19 .cse3) (and .cse10 .cse6 .cse13 .cse19 .cse3 (<= 0 (+ ~a26~0 12))) (and .cse10 (<= (+ ~a26~0 139421) 0) .cse12 .cse3) (and .cse17 .cse2 .cse21 .cse19 .cse22 .cse3) (and .cse6 .cse16 .cse14 .cse22 .cse3) (and .cse23 .cse16 .cse20 .cse7 .cse8 .cse3) (and .cse24 .cse25 .cse6 .cse13 .cse3 .cse15) (and .cse26 .cse0 .cse6 .cse13 .cse15 .cse3) (and .cse24 (<= (+ ~a28~0 599901) 0) .cse22 .cse3) (and .cse6 .cse27 (<= ~a26~0 590083) .cse12 .cse3) (and .cse23 .cse16 .cse20 .cse7 .cse9 .cse3) (and .cse4 .cse6 .cse28 .cse13 .cse8 .cse3) (and .cse10 .cse23 .cse20 .cse28 .cse7 .cse3) (and .cse10 (exists ((v_~a26~0_1243 Int)) (and (<= (div (+ (* v_~a26~0_1243 (- 1)) 596057) (- 5)) 124) (<= (+ ~a26~0 600073) v_~a26~0_1243))) .cse22 .cse3) (and .cse1 .cse29 .cse9 .cse3) (and .cse6 .cse16 .cse9 .cse12 .cse3) (and .cse24 .cse27 (<= (+ ~a26~0 150557) ~a28~0) .cse3) (and .cse4 .cse6 .cse5 .cse28 .cse2 .cse3) (and .cse1 (or .cse20 .cse19)) (and (<= ~a26~0 321684) .cse0 .cse6 .cse8 .cse12 .cse3) (and .cse4 .cse6 .cse5 (<= ~a26~0 449816) .cse29 .cse8 .cse3) (and .cse30 .cse9) (and .cse25 .cse5 .cse6 .cse8 .cse3) (and .cse11 .cse18 .cse1 (= ~a28~0 111) .cse3) (and .cse10 .cse24 .cse6 .cse12 .cse3) (and .cse24 .cse5 .cse6 .cse2 .cse3) (and .cse26 .cse6 .cse16 .cse8 .cse12 .cse3) (and .cse24 .cse6 .cse13 .cse8 .cse3 .cse15) (and .cse10 .cse6 .cse27 (exists ((v_~a26~0_1226 Int)) (and (<= ~a26~0 (+ (div v_~a26~0_1226 5) 460627)) (<= v_~a26~0_1226 124) (<= 0 v_~a26~0_1226))) .cse3) (and .cse24 .cse23 .cse7 .cse3) (and .cse6 .cse13 .cse21 .cse19 .cse3 .cse15) (and .cse26 .cse0 .cse6 .cse18 .cse13 .cse3) (and .cse30 .cse15)))) [2019-12-07 17:46:15,390 INFO L246 CegarLoopResult]: For program point L202-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,390 INFO L246 CegarLoopResult]: For program point L70-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,390 INFO L246 CegarLoopResult]: For program point L995(lines 995 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,390 INFO L246 CegarLoopResult]: For program point L599(lines 599 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,390 INFO L246 CegarLoopResult]: For program point L335(lines 335 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,390 INFO L246 CegarLoopResult]: For program point L2317(lines 2317 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,390 INFO L246 CegarLoopResult]: For program point L203(line 203) no Hoare annotation was computed. [2019-12-07 17:46:15,390 INFO L246 CegarLoopResult]: For program point L2185(lines 2185 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,390 INFO L246 CegarLoopResult]: For program point L71(line 71) no Hoare annotation was computed. [2019-12-07 17:46:15,390 INFO L246 CegarLoopResult]: For program point L600(lines 600 605) no Hoare annotation was computed. [2019-12-07 17:46:15,390 INFO L246 CegarLoopResult]: For program point L600-2(lines 600 605) no Hoare annotation was computed. [2019-12-07 17:46:15,390 INFO L246 CegarLoopResult]: For program point L1525(lines 1525 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,391 INFO L246 CegarLoopResult]: For program point L468(lines 468 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,391 INFO L246 CegarLoopResult]: For program point L2318(lines 2318 2329) no Hoare annotation was computed. [2019-12-07 17:46:15,391 INFO L246 CegarLoopResult]: For program point L2318-2(lines 2318 2329) no Hoare annotation was computed. [2019-12-07 17:46:15,391 INFO L246 CegarLoopResult]: For program point L2186(lines 2186 2196) no Hoare annotation was computed. [2019-12-07 17:46:15,391 INFO L246 CegarLoopResult]: For program point L2186-2(lines 2186 2196) no Hoare annotation was computed. [2019-12-07 17:46:15,391 INFO L246 CegarLoopResult]: For program point L1922(lines 1922 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,391 INFO L246 CegarLoopResult]: For program point L865(lines 865 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,391 INFO L246 CegarLoopResult]: For program point L1262(lines 1262 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,391 INFO L246 CegarLoopResult]: For program point L205-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,391 INFO L246 CegarLoopResult]: For program point L1130(lines 1130 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,391 INFO L246 CegarLoopResult]: For program point L73-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,391 INFO L246 CegarLoopResult]: For program point L1791(lines 1791 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,391 INFO L246 CegarLoopResult]: For program point L1659(lines 1659 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,391 INFO L246 CegarLoopResult]: For program point L1395(lines 1395 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,391 INFO L246 CegarLoopResult]: For program point L206(line 206) no Hoare annotation was computed. [2019-12-07 17:46:15,391 INFO L246 CegarLoopResult]: For program point L74(line 74) no Hoare annotation was computed. [2019-12-07 17:46:15,391 INFO L246 CegarLoopResult]: For program point L999(lines 999 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,391 INFO L246 CegarLoopResult]: For program point L1792(lines 1792 1800) no Hoare annotation was computed. [2019-12-07 17:46:15,391 INFO L246 CegarLoopResult]: For program point L1792-2(lines 1792 1800) no Hoare annotation was computed. [2019-12-07 17:46:15,391 INFO L246 CegarLoopResult]: For program point L2585(line 2585) no Hoare annotation was computed. [2019-12-07 17:46:15,391 INFO L246 CegarLoopResult]: For program point L1396(lines 1396 1405) no Hoare annotation was computed. [2019-12-07 17:46:15,391 INFO L246 CegarLoopResult]: For program point L2453(lines 2453 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,391 INFO L246 CegarLoopResult]: For program point L1396-2(lines 1396 1405) no Hoare annotation was computed. [2019-12-07 17:46:15,392 INFO L246 CegarLoopResult]: For program point L2057(lines 2057 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,392 INFO L246 CegarLoopResult]: For program point L76-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,392 INFO L246 CegarLoopResult]: For program point L737(lines 737 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,392 INFO L246 CegarLoopResult]: For program point L77(line 77) no Hoare annotation was computed. [2019-12-07 17:46:15,392 INFO L246 CegarLoopResult]: For program point L1927(lines 1927 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,392 INFO L246 CegarLoopResult]: For program point L1663(lines 1663 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,392 INFO L246 CegarLoopResult]: For program point L606(lines 606 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,392 INFO L246 CegarLoopResult]: For program point L1531(lines 1531 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,392 INFO L246 CegarLoopResult]: For program point L342(lines 342 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,392 INFO L246 CegarLoopResult]: For program point L1267(lines 1267 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,392 INFO L246 CegarLoopResult]: For program point L1135(lines 1135 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,392 INFO L246 CegarLoopResult]: For program point L871(lines 871 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,392 INFO L246 CegarLoopResult]: For program point L607(lines 607 617) no Hoare annotation was computed. [2019-12-07 17:46:15,392 INFO L246 CegarLoopResult]: For program point L607-2(lines 607 617) no Hoare annotation was computed. [2019-12-07 17:46:15,392 INFO L246 CegarLoopResult]: For program point L475(lines 475 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,392 INFO L246 CegarLoopResult]: For program point L79-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,392 INFO L246 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2019-12-07 17:46:15,392 INFO L246 CegarLoopResult]: For program point L1005(lines 1005 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,392 INFO L246 CegarLoopResult]: For program point L2063(lines 2063 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,392 INFO L246 CegarLoopResult]: For program point L874(lines 874 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,392 INFO L246 CegarLoopResult]: For program point L742(lines 742 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,392 INFO L246 CegarLoopResult]: For program point L2460(lines 2460 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,393 INFO L246 CegarLoopResult]: For program point L82-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,393 INFO L246 CegarLoopResult]: For program point L1932(lines 1932 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,393 INFO L246 CegarLoopResult]: For program point L479(lines 479 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,393 INFO L246 CegarLoopResult]: For program point L347(lines 347 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,393 INFO L246 CegarLoopResult]: For program point L1272(lines 1272 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,393 INFO L246 CegarLoopResult]: For program point L215(lines 215 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,393 INFO L246 CegarLoopResult]: For program point L2197(lines 2197 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,393 INFO L246 CegarLoopResult]: For program point L83(line 83) no Hoare annotation was computed. [2019-12-07 17:46:15,393 INFO L246 CegarLoopResult]: For program point L1933(lines 1933 1944) no Hoare annotation was computed. [2019-12-07 17:46:15,393 INFO L246 CegarLoopResult]: For program point L1933-2(lines 1933 1944) no Hoare annotation was computed. [2019-12-07 17:46:15,393 INFO L246 CegarLoopResult]: For program point L1801(lines 1801 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,393 INFO L246 CegarLoopResult]: For program point L2330(lines 2330 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,393 INFO L246 CegarLoopResult]: For program point L1670(lines 1670 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,393 INFO L246 CegarLoopResult]: For program point L1538(lines 1538 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,393 INFO L246 CegarLoopResult]: For program point L1406(lines 1406 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,393 INFO L246 CegarLoopResult]: For program point L1142(lines 1142 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,393 INFO L246 CegarLoopResult]: For program point L85-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,393 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 17:46:15,393 INFO L246 CegarLoopResult]: For program point L86(line 86) no Hoare annotation was computed. [2019-12-07 17:46:15,393 INFO L246 CegarLoopResult]: For program point L1011(lines 1011 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,393 INFO L246 CegarLoopResult]: For program point L2069(lines 2069 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,393 INFO L246 CegarLoopResult]: For program point L880(lines 880 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,394 INFO L246 CegarLoopResult]: For program point L748(lines 748 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,394 INFO L246 CegarLoopResult]: For program point L2334(lines 2334 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,394 INFO L246 CegarLoopResult]: For program point L1145(lines 1145 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,394 INFO L246 CegarLoopResult]: For program point L88-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,394 INFO L246 CegarLoopResult]: For program point L749(lines 749 760) no Hoare annotation was computed. [2019-12-07 17:46:15,394 INFO L246 CegarLoopResult]: For program point L749-2(lines 749 760) no Hoare annotation was computed. [2019-12-07 17:46:15,394 INFO L246 CegarLoopResult]: For program point L2467(lines 2467 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,394 INFO L246 CegarLoopResult]: For program point L353(lines 353 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,394 INFO L246 CegarLoopResult]: For program point L2203(lines 2203 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,394 INFO L246 CegarLoopResult]: For program point L89(line 89) no Hoare annotation was computed. [2019-12-07 17:46:15,394 INFO L246 CegarLoopResult]: For program point L1807(lines 1807 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,394 INFO L246 CegarLoopResult]: For program point L618(lines 618 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,394 INFO L246 CegarLoopResult]: For program point L486(lines 486 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,394 INFO L246 CegarLoopResult]: For program point L1279(lines 1279 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,394 INFO L246 CegarLoopResult]: For program point L222(lines 222 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,394 INFO L246 CegarLoopResult]: For program point L91-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,394 INFO L246 CegarLoopResult]: For program point L1016(lines 1016 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,394 INFO L246 CegarLoopResult]: For program point L884(lines 884 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,394 INFO L246 CegarLoopResult]: For program point L1677(lines 1677 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,394 INFO L246 CegarLoopResult]: For program point L1545(lines 1545 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,394 INFO L246 CegarLoopResult]: For program point L1413(lines 1413 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,394 INFO L246 CegarLoopResult]: For program point L92(line 92) no Hoare annotation was computed. [2019-12-07 17:46:15,394 INFO L246 CegarLoopResult]: For program point L2074(lines 2074 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,395 INFO L246 CegarLoopResult]: For program point L1017(lines 1017 1027) no Hoare annotation was computed. [2019-12-07 17:46:15,395 INFO L246 CegarLoopResult]: For program point L1017-2(lines 1017 1027) no Hoare annotation was computed. [2019-12-07 17:46:15,395 INFO L246 CegarLoopResult]: For program point L1546(lines 1546 1550) no Hoare annotation was computed. [2019-12-07 17:46:15,395 INFO L246 CegarLoopResult]: For program point L1546-2(lines 1546 1550) no Hoare annotation was computed. [2019-12-07 17:46:15,395 INFO L246 CegarLoopResult]: For program point L1414(lines 1414 1423) no Hoare annotation was computed. [2019-12-07 17:46:15,395 INFO L246 CegarLoopResult]: For program point L1414-2(lines 1414 1423) no Hoare annotation was computed. [2019-12-07 17:46:15,395 INFO L246 CegarLoopResult]: For program point L2339(lines 2339 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,395 INFO L246 CegarLoopResult]: For program point L2075(lines 2075 2085) no Hoare annotation was computed. [2019-12-07 17:46:15,395 INFO L246 CegarLoopResult]: For program point L2075-2(lines 2075 2085) no Hoare annotation was computed. [2019-12-07 17:46:15,395 INFO L246 CegarLoopResult]: For program point L490(lines 490 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,395 INFO L246 CegarLoopResult]: For program point L2472(lines 2472 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,395 INFO L246 CegarLoopResult]: For program point L2340(lines 2340 2350) no Hoare annotation was computed. [2019-12-07 17:46:15,395 INFO L246 CegarLoopResult]: For program point L2340-2(lines 2340 2350) no Hoare annotation was computed. [2019-12-07 17:46:15,395 INFO L246 CegarLoopResult]: For program point L94-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,395 INFO L246 CegarLoopResult]: For program point L1812(lines 1812 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,395 INFO L246 CegarLoopResult]: For program point L1284(lines 1284 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,395 INFO L246 CegarLoopResult]: For program point L1152(lines 1152 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,395 INFO L246 CegarLoopResult]: For program point L2209(lines 2209 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,395 INFO L246 CegarLoopResult]: For program point L95(line 95) no Hoare annotation was computed. [2019-12-07 17:46:15,395 INFO L246 CegarLoopResult]: For program point L1945(lines 1945 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,395 INFO L246 CegarLoopResult]: For program point L360(lines 360 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,395 INFO L246 CegarLoopResult]: For program point L228(lines 228 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,396 INFO L246 CegarLoopResult]: For program point L2210(lines 2210 2219) no Hoare annotation was computed. [2019-12-07 17:46:15,396 INFO L246 CegarLoopResult]: For program point L2210-2(lines 2210 2219) no Hoare annotation was computed. [2019-12-07 17:46:15,396 INFO L246 CegarLoopResult]: For program point L1682(lines 1682 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,396 INFO L246 CegarLoopResult]: For program point L625(lines 625 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,396 INFO L246 CegarLoopResult]: For program point L2475(lines 2475 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,396 INFO L246 CegarLoopResult]: For program point L97-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,396 INFO L246 CegarLoopResult]: For program point L1683(lines 1683 1693) no Hoare annotation was computed. [2019-12-07 17:46:15,396 INFO L246 CegarLoopResult]: For program point L626(lines 626 633) no Hoare annotation was computed. [2019-12-07 17:46:15,396 INFO L246 CegarLoopResult]: For program point L1683-2(lines 1683 1693) no Hoare annotation was computed. [2019-12-07 17:46:15,396 INFO L246 CegarLoopResult]: For program point L626-2(lines 626 633) no Hoare annotation was computed. [2019-12-07 17:46:15,396 INFO L246 CegarLoopResult]: For program point L1551(lines 1551 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,396 INFO L246 CegarLoopResult]: For program point L98(line 98) no Hoare annotation was computed. [2019-12-07 17:46:15,396 INFO L246 CegarLoopResult]: For program point L891(lines 891 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,396 INFO L246 CegarLoopResult]: For program point L231(lines 231 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,396 INFO L246 CegarLoopResult]: For program point L100-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 17:46:15,396 INFO L246 CegarLoopResult]: For program point L1950(lines 1950 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,396 INFO L246 CegarLoopResult]: For program point L1818(lines 1818 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,396 INFO L246 CegarLoopResult]: For program point L761(lines 761 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,396 INFO L246 CegarLoopResult]: For program point L497(lines 497 1642) no Hoare annotation was computed. [2019-12-07 17:46:15,396 INFO L246 CegarLoopResult]: For program point L2479(lines 2479 2570) no Hoare annotation was computed. [2019-12-07 17:46:15,396 INFO L246 CegarLoopResult]: For program point L101(line 101) no Hoare annotation was computed. [2019-12-07 17:46:15,406 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,407 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,407 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,408 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,409 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,410 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,411 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,411 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,411 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,411 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-12-07 17:46:15,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-12-07 17:46:15,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,412 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,413 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,415 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,415 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-12-07 17:46:15,415 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-12-07 17:46:15,415 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-12-07 17:46:15,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,430 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,430 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,430 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,430 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,430 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-12-07 17:46:15,430 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-12-07 17:46:15,431 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,431 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,431 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,431 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,431 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,431 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,433 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,433 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,433 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-12-07 17:46:15,433 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-12-07 17:46:15,433 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-12-07 17:46:15,436 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,437 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,437 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,437 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,437 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,438 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,438 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,438 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,438 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,439 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,439 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,439 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,439 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,439 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,440 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,440 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,440 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,440 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,440 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,441 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-12-07 17:46:15,441 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-12-07 17:46:15,441 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,441 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,441 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,441 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-12-07 17:46:15,441 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-12-07 17:46:15,442 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-12-07 17:46:15,442 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,442 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,442 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,442 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,442 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,443 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,443 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,443 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,443 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,443 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,445 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,445 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,445 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,445 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,447 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,448 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,449 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,449 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-12-07 17:46:15,449 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-12-07 17:46:15,449 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,449 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,449 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,450 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-12-07 17:46:15,450 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-12-07 17:46:15,450 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-12-07 17:46:15,450 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,450 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,450 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,450 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,450 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,451 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,451 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,451 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,451 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,451 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,453 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,453 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,453 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,453 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,454 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,454 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,454 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,454 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,454 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,455 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,455 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,455 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,455 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,455 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,456 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,456 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,456 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-12-07 17:46:15,456 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-12-07 17:46:15,456 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,456 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,456 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,457 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,457 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,457 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,457 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,457 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,457 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,457 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,458 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,458 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,458 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,458 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,458 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,458 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,458 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-12-07 17:46:15,458 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-12-07 17:46:15,458 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-12-07 17:46:15,460 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,460 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,460 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,460 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,461 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,461 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,461 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,461 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,462 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,462 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,462 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,462 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,462 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,463 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,463 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,463 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,463 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-12-07 17:46:15,463 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-12-07 17:46:15,463 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,464 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,464 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,464 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,464 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,464 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,464 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,465 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,465 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,465 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,465 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,465 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,465 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,465 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,465 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,466 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,466 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-12-07 17:46:15,466 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-12-07 17:46:15,466 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-12-07 17:46:15,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:46:15 BoogieIcfgContainer [2019-12-07 17:46:15,468 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:46:15,469 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:46:15,469 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:46:15,469 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:46:15,469 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:38:10" (3/4) ... [2019-12-07 17:46:15,472 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 17:46:15,502 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-12-07 17:46:15,506 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 17:46:15,528 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((((a26 <= 460652 && 217 < a26) && a24 == 1) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124) || ((((((124 < a26 && a28 <= 300) && a24 == 2) && 0 < a14 + 182) && 37 < a28) && a26 <= 217) && a21 <= 124)) || (((((124 < a26 && 300 < a28) && a24 == 2) && (\exists v_~a26~0_1234 : int :: ((v_~a26~0_1234 <= 217 && a26 <= (v_~a26~0_1234 + 308146) / 5) && 124 < v_~a26~0_1234) && 0 == (v_~a26~0_1234 + 1) % 5)) && a14 + 182 <= 0) && a21 <= 124)) || (((((124 < a26 && a24 == 2) && 0 < a14 + 114) && (a26 * -1 + 596057) / -5 <= 124) && a21 <= 124) && a14 + 84 <= 0)) || ((a28 <= 134 && a24 == 1) && a26 <= 217)) || ((((a24 == 2 && a28 <= 134) && 37 < a28) && (a26 * -1 + 596057) / -5 <= 124) && a21 <= 124)) || (((((a24 == 2 && a28 <= 279) && a26 <= 217) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a14 + 182 <= 0) && a21 <= 124)) || (((a24 == 2 && 0 <= a14 + 82) && a26 <= 124) && a21 <= 124)) || ((((((217 < a26 && a24 == 2) && a28 <= 300) && (a26 * -1 + 596057) / -5 <= 124) && 37 < a28) && a14 + 182 <= 0) && a21 <= 124)) || (((((217 < a26 && a24 == 2) && 0 < a14 + 182) && (a26 * -1 + 596057) / -5 <= 124) && a14 + 85 <= 0) && a21 <= 124)) || ((((a14 + 114 <= 0 && 0 < a14 + 182) && 0 < a26 + 68) && a26 <= 124) && a21 <= 124)) || (((((300 < a28 && a24 == 2) && 0 < a14 + 114) && a26 <= 124) && a21 <= 124) && 0 <= a26 + 12)) || (((300 < a28 && a26 + 139421 <= 0) && a14 + 182 <= 0) && a21 <= 124)) || (((((a28 <= 279 && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && 0 < a26 + 68) && a26 <= 124) && a14 + 4163 <= 0) && a21 <= 124)) || ((((a24 == 2 && a28 <= 134) && (a26 * -1 + 596057) / -5 <= 124) && a14 + 4163 <= 0) && a21 <= 124)) || (((((!(a24 == 2) && a28 <= 134) && a14 + 114 <= 0) && 0 < a14 + 182) && 37 < a28) && a21 <= 124)) || (((((a26 + 68 <= 0 && a26 + 10118 <= 0) && a24 == 2) && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || (((((a26 <= 599998 && 217 < a26) && a24 == 2) && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124)) || (((a26 + 68 <= 0 && a28 + 599901 <= 0) && a14 + 4163 <= 0) && a21 <= 124)) || ((((a24 == 2 && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && a26 <= 590083) && a14 + 182 <= 0) && a21 <= 124)) || (((((!(a24 == 2) && a28 <= 134) && a14 + 114 <= 0) && 0 < a14 + 182) && a26 <= 217) && a21 <= 124)) || (((((124 < a26 && a24 == 2) && a26 <= 215) && 0 < a14 + 114) && 37 < a28) && a21 <= 124)) || (((((300 < a28 && !(a24 == 2)) && a14 + 114 <= 0) && a26 <= 215) && 0 < a14 + 182) && a21 <= 124)) || (((300 < a28 && (\exists v_~a26~0_1243 : int :: (v_~a26~0_1243 * -1 + 596057) / -5 <= 124 && a26 + 600073 <= v_~a26~0_1243)) && a14 + 4163 <= 0) && a21 <= 124)) || (((a24 == 1 && 0 < a14 + 84) && a26 <= 217) && a21 <= 124)) || ((((a24 == 2 && a28 <= 134) && a26 <= 217) && a14 + 182 <= 0) && a21 <= 124)) || (((a26 + 68 <= 0 && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && a26 + 150557 <= a28) && a21 <= 124)) || (((((124 < a26 && a24 == 2) && a28 <= 300) && a26 <= 215) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124)) || (a24 == 1 && (a14 + 114 <= 0 || a26 <= 124))) || (((((a26 <= 321684 && 217 < a26) && a24 == 2) && 37 < a28) && a14 + 182 <= 0) && a21 <= 124)) || ((((((124 < a26 && a24 == 2) && a28 <= 300) && a26 <= 449816) && 0 < a14 + 84) && 37 < a28) && a21 <= 124)) || (((300 < a28 && a24 == 1) || (217 < a26 && a24 == 1)) && a26 <= 217)) || ((((a26 + 10118 <= 0 && a28 <= 300) && a24 == 2) && 37 < a28) && a21 <= 124)) || (((((\exists v_~a26~0_1234 : int :: ((v_~a26~0_1234 <= 217 && a26 <= (v_~a26~0_1234 + 308146) / 5) && 124 < v_~a26~0_1234) && 0 == (v_~a26~0_1234 + 1) % 5) && 0 <= a14 + 82) && a24 == 1) && a28 == 111) && a21 <= 124)) || ((((300 < a28 && a26 + 68 <= 0) && a24 == 2) && a14 + 182 <= 0) && a21 <= 124)) || ((((a26 + 68 <= 0 && a28 <= 300) && a24 == 2) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124)) || (((((a26 <= 599998 && a24 == 2) && a28 <= 134) && 37 < a28) && a14 + 182 <= 0) && a21 <= 124)) || (((((a26 + 68 <= 0 && a24 == 2) && 0 < a14 + 114) && 37 < a28) && a21 <= 124) && a14 + 84 <= 0)) || ((((300 < a28 && a24 == 2) && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && (\exists v_~a26~0_1226 : int :: (a26 <= v_~a26~0_1226 / 5 + 460627 && v_~a26~0_1226 <= 124) && 0 <= v_~a26~0_1226)) && a21 <= 124)) || (((a26 + 68 <= 0 && !(a24 == 2)) && 0 < a14 + 182) && a21 <= 124)) || (((((a24 == 2 && 0 < a14 + 114) && 0 < a26 + 68) && a26 <= 124) && a21 <= 124) && a14 + 84 <= 0)) || (((((a26 <= 599998 && 217 < a26) && a24 == 2) && 0 <= a14 + 82) && 0 < a14 + 114) && a21 <= 124)) || (((300 < a28 && a24 == 1) || (217 < a26 && a24 == 1)) && a14 + 84 <= 0) [2019-12-07 17:46:15,530 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((((a26 <= 460652 && 217 < a26) && a24 == 1) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124) || ((((((124 < a26 && a28 <= 300) && a24 == 2) && 0 < a14 + 182) && 37 < a28) && a26 <= 217) && a21 <= 124)) || (((((124 < a26 && 300 < a28) && a24 == 2) && (\exists v_~a26~0_1234 : int :: ((v_~a26~0_1234 <= 217 && a26 <= (v_~a26~0_1234 + 308146) / 5) && 124 < v_~a26~0_1234) && 0 == (v_~a26~0_1234 + 1) % 5)) && a14 + 182 <= 0) && a21 <= 124)) || (((((124 < a26 && a24 == 2) && 0 < a14 + 114) && (a26 * -1 + 596057) / -5 <= 124) && a21 <= 124) && a14 + 84 <= 0)) || ((a28 <= 134 && a24 == 1) && a26 <= 217)) || ((((a24 == 2 && a28 <= 134) && 37 < a28) && (a26 * -1 + 596057) / -5 <= 124) && a21 <= 124)) || (((((a24 == 2 && a28 <= 279) && a26 <= 217) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a14 + 182 <= 0) && a21 <= 124)) || (((a24 == 2 && 0 <= a14 + 82) && a26 <= 124) && a21 <= 124)) || ((((((217 < a26 && a24 == 2) && a28 <= 300) && (a26 * -1 + 596057) / -5 <= 124) && 37 < a28) && a14 + 182 <= 0) && a21 <= 124)) || (((((217 < a26 && a24 == 2) && 0 < a14 + 182) && (a26 * -1 + 596057) / -5 <= 124) && a14 + 85 <= 0) && a21 <= 124)) || ((((a14 + 114 <= 0 && 0 < a14 + 182) && 0 < a26 + 68) && a26 <= 124) && a21 <= 124)) || (((((300 < a28 && a24 == 2) && 0 < a14 + 114) && a26 <= 124) && a21 <= 124) && 0 <= a26 + 12)) || (((300 < a28 && a26 + 139421 <= 0) && a14 + 182 <= 0) && a21 <= 124)) || (((((a28 <= 279 && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && 0 < a26 + 68) && a26 <= 124) && a14 + 4163 <= 0) && a21 <= 124)) || ((((a24 == 2 && a28 <= 134) && (a26 * -1 + 596057) / -5 <= 124) && a14 + 4163 <= 0) && a21 <= 124)) || (((((!(a24 == 2) && a28 <= 134) && a14 + 114 <= 0) && 0 < a14 + 182) && 37 < a28) && a21 <= 124)) || (((((a26 + 68 <= 0 && a26 + 10118 <= 0) && a24 == 2) && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || (((((a26 <= 599998 && 217 < a26) && a24 == 2) && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124)) || (((a26 + 68 <= 0 && a28 + 599901 <= 0) && a14 + 4163 <= 0) && a21 <= 124)) || ((((a24 == 2 && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && a26 <= 590083) && a14 + 182 <= 0) && a21 <= 124)) || (((((!(a24 == 2) && a28 <= 134) && a14 + 114 <= 0) && 0 < a14 + 182) && a26 <= 217) && a21 <= 124)) || (((((124 < a26 && a24 == 2) && a26 <= 215) && 0 < a14 + 114) && 37 < a28) && a21 <= 124)) || (((((300 < a28 && !(a24 == 2)) && a14 + 114 <= 0) && a26 <= 215) && 0 < a14 + 182) && a21 <= 124)) || (((300 < a28 && (\exists v_~a26~0_1243 : int :: (v_~a26~0_1243 * -1 + 596057) / -5 <= 124 && a26 + 600073 <= v_~a26~0_1243)) && a14 + 4163 <= 0) && a21 <= 124)) || (((a24 == 1 && 0 < a14 + 84) && a26 <= 217) && a21 <= 124)) || ((((a24 == 2 && a28 <= 134) && a26 <= 217) && a14 + 182 <= 0) && a21 <= 124)) || (((a26 + 68 <= 0 && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && a26 + 150557 <= a28) && a21 <= 124)) || (((((124 < a26 && a24 == 2) && a28 <= 300) && a26 <= 215) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124)) || (a24 == 1 && (a14 + 114 <= 0 || a26 <= 124))) || (((((a26 <= 321684 && 217 < a26) && a24 == 2) && 37 < a28) && a14 + 182 <= 0) && a21 <= 124)) || ((((((124 < a26 && a24 == 2) && a28 <= 300) && a26 <= 449816) && 0 < a14 + 84) && 37 < a28) && a21 <= 124)) || (((300 < a28 && a24 == 1) || (217 < a26 && a24 == 1)) && a26 <= 217)) || ((((a26 + 10118 <= 0 && a28 <= 300) && a24 == 2) && 37 < a28) && a21 <= 124)) || (((((\exists v_~a26~0_1234 : int :: ((v_~a26~0_1234 <= 217 && a26 <= (v_~a26~0_1234 + 308146) / 5) && 124 < v_~a26~0_1234) && 0 == (v_~a26~0_1234 + 1) % 5) && 0 <= a14 + 82) && a24 == 1) && a28 == 111) && a21 <= 124)) || ((((300 < a28 && a26 + 68 <= 0) && a24 == 2) && a14 + 182 <= 0) && a21 <= 124)) || ((((a26 + 68 <= 0 && a28 <= 300) && a24 == 2) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124)) || (((((a26 <= 599998 && a24 == 2) && a28 <= 134) && 37 < a28) && a14 + 182 <= 0) && a21 <= 124)) || (((((a26 + 68 <= 0 && a24 == 2) && 0 < a14 + 114) && 37 < a28) && a21 <= 124) && a14 + 84 <= 0)) || ((((300 < a28 && a24 == 2) && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && (\exists v_~a26~0_1226 : int :: (a26 <= v_~a26~0_1226 / 5 + 460627 && v_~a26~0_1226 <= 124) && 0 <= v_~a26~0_1226)) && a21 <= 124)) || (((a26 + 68 <= 0 && !(a24 == 2)) && 0 < a14 + 182) && a21 <= 124)) || (((((a24 == 2 && 0 < a14 + 114) && 0 < a26 + 68) && a26 <= 124) && a21 <= 124) && a14 + 84 <= 0)) || (((((a26 <= 599998 && 217 < a26) && a24 == 2) && 0 <= a14 + 82) && 0 < a14 + 114) && a21 <= 124)) || (((300 < a28 && a24 == 1) || (217 < a26 && a24 == 1)) && a14 + 84 <= 0) [2019-12-07 17:46:15,538 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((((((((((a26 <= 460652 && 217 < a26) && a24 == 1) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124) || ((((((124 < a26 && a28 <= 300) && a24 == 2) && 0 < a14 + 182) && 37 < a28) && a26 <= 217) && a21 <= 124)) || (((((124 < a26 && 300 < a28) && a24 == 2) && (\exists v_~a26~0_1234 : int :: ((v_~a26~0_1234 <= 217 && a26 <= (v_~a26~0_1234 + 308146) / 5) && 124 < v_~a26~0_1234) && 0 == (v_~a26~0_1234 + 1) % 5)) && a14 + 182 <= 0) && a21 <= 124)) || (((((124 < a26 && a24 == 2) && 0 < a14 + 114) && (a26 * -1 + 596057) / -5 <= 124) && a21 <= 124) && a14 + 84 <= 0)) || ((a28 <= 134 && a24 == 1) && a26 <= 217)) || ((((a24 == 2 && a28 <= 134) && 37 < a28) && (a26 * -1 + 596057) / -5 <= 124) && a21 <= 124)) || ((((((a26 + 68 <= 0 && a28 <= 300) && a24 == 2) && 0 < a14 + 114) && 37 < a28) && a21 <= 124) && a14 + 84 <= 0)) || ((((((217 < a26 && a24 == 2) && a28 <= 300) && (a26 * -1 + 596057) / -5 <= 124) && 37 < a28) && a14 + 182 <= 0) && a21 <= 124)) || (((((217 < a26 && a24 == 2) && 0 < a14 + 182) && (a26 * -1 + 596057) / -5 <= 124) && a14 + 85 <= 0) && a21 <= 124)) || ((((a14 + 114 <= 0 && 0 < a14 + 182) && 0 < a26 + 68) && a26 <= 124) && a21 <= 124)) || ((((a26 + 68 <= 0 && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && a26 + 150557 <= a28) && a14 + 182 <= 0) && a21 <= 124)) || (((300 < a28 && a26 + 139421 <= 0) && a14 + 182 <= 0) && a21 <= 124)) || (((((a28 <= 279 && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && 0 < a26 + 68) && a26 <= 124) && a14 + 4163 <= 0) && a21 <= 124)) || ((((a24 == 2 && a28 <= 134) && (a26 * -1 + 596057) / -5 <= 124) && a14 + 4163 <= 0) && a21 <= 124)) || (((((a24 == 2 && a26 <= 449816) && a28 <= 279) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a14 + 182 <= 0) && a21 <= 124)) || (((((!(a24 == 2) && a28 <= 134) && a14 + 114 <= 0) && 0 < a14 + 182) && 37 < a28) && a21 <= 124)) || (((((a26 + 68 <= 0 && a26 + 10118 <= 0) && a24 == 2) && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || (((((a26 <= 599998 && 217 < a26) && a24 == 2) && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124)) || (((a26 + 68 <= 0 && a28 + 599901 <= 0) && a14 + 4163 <= 0) && a21 <= 124)) || ((((a24 == 2 && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && a26 <= 590083) && a14 + 182 <= 0) && a21 <= 124)) || (((((!(a24 == 2) && a28 <= 134) && a14 + 114 <= 0) && 0 < a14 + 182) && a26 <= 217) && a21 <= 124)) || (((((124 < a26 && a24 == 2) && a26 <= 215) && 0 < a14 + 114) && 37 < a28) && a21 <= 124)) || (((((300 < a28 && !(a24 == 2)) && a14 + 114 <= 0) && a26 <= 215) && 0 < a14 + 182) && a21 <= 124)) || (((((300 < a28 && a24 == 2) && 0 < a14 + 84) && a26 <= 124) && a21 <= 124) && 0 <= a26 + 12)) || (((300 < a28 && (\exists v_~a26~0_1243 : int :: (v_~a26~0_1243 * -1 + 596057) / -5 <= 124 && a26 + 600073 <= v_~a26~0_1243)) && a14 + 4163 <= 0) && a21 <= 124)) || (((a24 == 1 && 0 < a14 + 84) && a26 <= 217) && a21 <= 124)) || (((((300 < a28 && a26 + 68 <= 0) && a24 == 2) && 0 < a14 + 114) && a14 + 85 <= 0) && a21 <= 124)) || (((((300 < a28 && (a14 + 114 <= 0 || 0 < a14 + 84)) && a24 == 2) && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && (\exists v_~a26~0_1226 : int :: (a26 <= v_~a26~0_1226 / 5 + 460627 && v_~a26~0_1226 <= 124) && 0 <= v_~a26~0_1226)) && a21 <= 124)) || ((((a24 == 2 && a28 <= 134) && a26 <= 217) && a14 + 182 <= 0) && a21 <= 124)) || (((((124 < a26 && a24 == 2) && a28 <= 300) && a26 <= 215) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124)) || (a24 == 1 && (a14 + 114 <= 0 || a26 <= 124))) || (((((a26 <= 321684 && 217 < a26) && a24 == 2) && 37 < a28) && a14 + 182 <= 0) && a21 <= 124)) || ((((((124 < a26 && a24 == 2) && a28 <= 300) && a26 <= 449816) && 0 < a14 + 84) && 37 < a28) && a21 <= 124)) || (((a26 + 68 <= 0 && (((((a28 <= 300 || a14 + 114 <= 0) || 0 < a14 + 84) && (37 < a28 || a14 + 84 <= 0)) || !(5 == input)) || 0 < a26 + 68)) && 0 <= a14 + 82) && a21 <= 124)) || (((300 < a28 && a24 == 1) || (217 < a26 && a24 == 1)) && a26 <= 217)) || ((((a26 + 10118 <= 0 && a28 <= 300) && a24 == 2) && 37 < a28) && a21 <= 124)) || (((((\exists v_~a26~0_1234 : int :: ((v_~a26~0_1234 <= 217 && a26 <= (v_~a26~0_1234 + 308146) / 5) && 124 < v_~a26~0_1234) && 0 == (v_~a26~0_1234 + 1) % 5) && 0 <= a14 + 82) && a24 == 1) && a28 == 111) && a21 <= 124)) || ((((a24 == 2 && 0 <= a14 + 82) && 0 < a26 + 68) && a26 <= 124) && a21 <= 124)) || ((((300 < a28 && a26 + 68 <= 0) && a24 == 2) && a14 + 182 <= 0) && a21 <= 124)) || ((((a26 + 68 <= 0 && a28 <= 300) && a24 == 2) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124)) || (((((a26 <= 599998 && a24 == 2) && a28 <= 134) && 37 < a28) && a14 + 182 <= 0) && a21 <= 124)) || (((a26 + 68 <= 0 && !(a24 == 2)) && 0 < a14 + 182) && a21 <= 124)) || (((((a24 == 2 && 0 < a14 + 114) && 0 < a26 + 68) && a26 <= 124) && a21 <= 124) && a14 + 84 <= 0)) || (((((a26 <= 599998 && 217 < a26) && a24 == 2) && 0 <= a14 + 82) && 0 < a14 + 114) && a21 <= 124)) || (((300 < a28 && a24 == 1) || (217 < a26 && a24 == 1)) && a14 + 84 <= 0)) || ((((((300 < a28 && a24 == 2) && a26 <= 449816) && (((((a28 <= 300 || a14 + 114 <= 0) || 0 < a14 + 84) && (37 < a28 || a14 + 84 <= 0)) || !(5 == input)) || 0 < a26 + 68)) && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0) [2019-12-07 17:46:15,672 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_bf2dd792-7c33-4b94-b123-5ef092f34f93/bin/uautomizer/witness.graphml [2019-12-07 17:46:15,672 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:46:15,673 INFO L168 Benchmark]: Toolchain (without parser) took 488693.80 ms. Allocated memory was 1.0 GB in the beginning and 3.9 GB in the end (delta: 2.8 GB). Free memory was 926.2 MB in the beginning and 1.3 GB in the end (delta: -379.1 MB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2019-12-07 17:46:15,673 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:46:15,673 INFO L168 Benchmark]: CACSL2BoogieTranslator took 840.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 926.2 MB in the beginning and 985.9 MB in the end (delta: -59.7 MB). Peak memory consumption was 68.6 MB. Max. memory is 11.5 GB. [2019-12-07 17:46:15,674 INFO L168 Benchmark]: Boogie Procedure Inliner took 198.71 ms. Allocated memory is still 1.1 GB. Free memory was 980.6 MB in the beginning and 920.4 MB in the end (delta: 60.1 MB). Peak memory consumption was 60.1 MB. Max. memory is 11.5 GB. [2019-12-07 17:46:15,674 INFO L168 Benchmark]: Boogie Preprocessor took 195.60 ms. Allocated memory is still 1.1 GB. Free memory was 920.4 MB in the beginning and 893.1 MB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:46:15,674 INFO L168 Benchmark]: RCFGBuilder took 2711.85 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 90.2 MB). Free memory was 893.1 MB in the beginning and 997.7 MB in the end (delta: -104.7 MB). Peak memory consumption was 113.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:46:15,674 INFO L168 Benchmark]: TraceAbstraction took 484540.46 ms. Allocated memory was 1.2 GB in the beginning and 3.9 GB in the end (delta: 2.6 GB). Free memory was 997.7 MB in the beginning and 1.4 GB in the end (delta: -385.1 MB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. [2019-12-07 17:46:15,674 INFO L168 Benchmark]: Witness Printer took 203.41 ms. Allocated memory is still 3.9 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 77.5 MB). Peak memory consumption was 77.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:46:15,676 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 840.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 926.2 MB in the beginning and 985.9 MB in the end (delta: -59.7 MB). Peak memory consumption was 68.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 198.71 ms. Allocated memory is still 1.1 GB. Free memory was 980.6 MB in the beginning and 920.4 MB in the end (delta: 60.1 MB). Peak memory consumption was 60.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 195.60 ms. Allocated memory is still 1.1 GB. Free memory was 920.4 MB in the beginning and 893.1 MB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2711.85 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 90.2 MB). Free memory was 893.1 MB in the beginning and 997.7 MB in the end (delta: -104.7 MB). Peak memory consumption was 113.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 484540.46 ms. Allocated memory was 1.2 GB in the beginning and 3.9 GB in the end (delta: 2.6 GB). Free memory was 997.7 MB in the beginning and 1.4 GB in the end (delta: -385.1 MB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. * Witness Printer took 203.41 ms. Allocated memory is still 3.9 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 77.5 MB). Peak memory consumption was 77.5 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_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 110]: 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: 2574]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2580]: Loop Invariant [2019-12-07 17:46:15,682 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,682 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,683 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,683 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,683 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,684 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,684 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,684 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,685 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,685 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,685 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,686 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,686 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,686 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,686 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,687 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,687 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-12-07 17:46:15,687 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-12-07 17:46:15,687 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,687 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,688 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,688 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,688 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,688 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,688 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,688 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,688 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,688 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-12-07 17:46:15,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-12-07 17:46:15,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-12-07 17:46:15,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,692 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,692 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,692 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,692 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,692 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,693 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,693 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,693 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,693 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,693 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,694 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,694 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,694 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-12-07 17:46:15,694 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-12-07 17:46:15,694 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,694 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,694 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,695 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,695 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,695 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,695 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,695 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,695 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,695 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,696 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,696 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,696 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,696 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,696 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,696 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,696 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-12-07 17:46:15,696 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-12-07 17:46:15,696 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((a26 <= 460652 && 217 < a26) && a24 == 1) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124) || ((((((124 < a26 && a28 <= 300) && a24 == 2) && 0 < a14 + 182) && 37 < a28) && a26 <= 217) && a21 <= 124)) || (((((124 < a26 && 300 < a28) && a24 == 2) && (\exists v_~a26~0_1234 : int :: ((v_~a26~0_1234 <= 217 && a26 <= (v_~a26~0_1234 + 308146) / 5) && 124 < v_~a26~0_1234) && 0 == (v_~a26~0_1234 + 1) % 5)) && a14 + 182 <= 0) && a21 <= 124)) || (((((124 < a26 && a24 == 2) && 0 < a14 + 114) && (a26 * -1 + 596057) / -5 <= 124) && a21 <= 124) && a14 + 84 <= 0)) || ((a28 <= 134 && a24 == 1) && a26 <= 217)) || ((((a24 == 2 && a28 <= 134) && 37 < a28) && (a26 * -1 + 596057) / -5 <= 124) && a21 <= 124)) || (((((a24 == 2 && a28 <= 279) && a26 <= 217) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a14 + 182 <= 0) && a21 <= 124)) || (((a24 == 2 && 0 <= a14 + 82) && a26 <= 124) && a21 <= 124)) || ((((((217 < a26 && a24 == 2) && a28 <= 300) && (a26 * -1 + 596057) / -5 <= 124) && 37 < a28) && a14 + 182 <= 0) && a21 <= 124)) || (((((217 < a26 && a24 == 2) && 0 < a14 + 182) && (a26 * -1 + 596057) / -5 <= 124) && a14 + 85 <= 0) && a21 <= 124)) || ((((a14 + 114 <= 0 && 0 < a14 + 182) && 0 < a26 + 68) && a26 <= 124) && a21 <= 124)) || (((((300 < a28 && a24 == 2) && 0 < a14 + 114) && a26 <= 124) && a21 <= 124) && 0 <= a26 + 12)) || (((300 < a28 && a26 + 139421 <= 0) && a14 + 182 <= 0) && a21 <= 124)) || (((((a28 <= 279 && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && 0 < a26 + 68) && a26 <= 124) && a14 + 4163 <= 0) && a21 <= 124)) || ((((a24 == 2 && a28 <= 134) && (a26 * -1 + 596057) / -5 <= 124) && a14 + 4163 <= 0) && a21 <= 124)) || (((((!(a24 == 2) && a28 <= 134) && a14 + 114 <= 0) && 0 < a14 + 182) && 37 < a28) && a21 <= 124)) || (((((a26 + 68 <= 0 && a26 + 10118 <= 0) && a24 == 2) && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || (((((a26 <= 599998 && 217 < a26) && a24 == 2) && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124)) || (((a26 + 68 <= 0 && a28 + 599901 <= 0) && a14 + 4163 <= 0) && a21 <= 124)) || ((((a24 == 2 && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && a26 <= 590083) && a14 + 182 <= 0) && a21 <= 124)) || (((((!(a24 == 2) && a28 <= 134) && a14 + 114 <= 0) && 0 < a14 + 182) && a26 <= 217) && a21 <= 124)) || (((((124 < a26 && a24 == 2) && a26 <= 215) && 0 < a14 + 114) && 37 < a28) && a21 <= 124)) || (((((300 < a28 && !(a24 == 2)) && a14 + 114 <= 0) && a26 <= 215) && 0 < a14 + 182) && a21 <= 124)) || (((300 < a28 && (\exists v_~a26~0_1243 : int :: (v_~a26~0_1243 * -1 + 596057) / -5 <= 124 && a26 + 600073 <= v_~a26~0_1243)) && a14 + 4163 <= 0) && a21 <= 124)) || (((a24 == 1 && 0 < a14 + 84) && a26 <= 217) && a21 <= 124)) || ((((a24 == 2 && a28 <= 134) && a26 <= 217) && a14 + 182 <= 0) && a21 <= 124)) || (((a26 + 68 <= 0 && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && a26 + 150557 <= a28) && a21 <= 124)) || (((((124 < a26 && a24 == 2) && a28 <= 300) && a26 <= 215) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124)) || (a24 == 1 && (a14 + 114 <= 0 || a26 <= 124))) || (((((a26 <= 321684 && 217 < a26) && a24 == 2) && 37 < a28) && a14 + 182 <= 0) && a21 <= 124)) || ((((((124 < a26 && a24 == 2) && a28 <= 300) && a26 <= 449816) && 0 < a14 + 84) && 37 < a28) && a21 <= 124)) || (((300 < a28 && a24 == 1) || (217 < a26 && a24 == 1)) && a26 <= 217)) || ((((a26 + 10118 <= 0 && a28 <= 300) && a24 == 2) && 37 < a28) && a21 <= 124)) || (((((\exists v_~a26~0_1234 : int :: ((v_~a26~0_1234 <= 217 && a26 <= (v_~a26~0_1234 + 308146) / 5) && 124 < v_~a26~0_1234) && 0 == (v_~a26~0_1234 + 1) % 5) && 0 <= a14 + 82) && a24 == 1) && a28 == 111) && a21 <= 124)) || ((((300 < a28 && a26 + 68 <= 0) && a24 == 2) && a14 + 182 <= 0) && a21 <= 124)) || ((((a26 + 68 <= 0 && a28 <= 300) && a24 == 2) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124)) || (((((a26 <= 599998 && a24 == 2) && a28 <= 134) && 37 < a28) && a14 + 182 <= 0) && a21 <= 124)) || (((((a26 + 68 <= 0 && a24 == 2) && 0 < a14 + 114) && 37 < a28) && a21 <= 124) && a14 + 84 <= 0)) || ((((300 < a28 && a24 == 2) && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && (\exists v_~a26~0_1226 : int :: (a26 <= v_~a26~0_1226 / 5 + 460627 && v_~a26~0_1226 <= 124) && 0 <= v_~a26~0_1226)) && a21 <= 124)) || (((a26 + 68 <= 0 && !(a24 == 2)) && 0 < a14 + 182) && a21 <= 124)) || (((((a24 == 2 && 0 < a14 + 114) && 0 < a26 + 68) && a26 <= 124) && a21 <= 124) && a14 + 84 <= 0)) || (((((a26 <= 599998 && 217 < a26) && a24 == 2) && 0 <= a14 + 82) && 0 < a14 + 114) && a21 <= 124)) || (((300 < a28 && a24 == 1) || (217 < a26 && a24 == 1)) && a14 + 84 <= 0) - InvariantResult [Line: 1646]: Loop Invariant [2019-12-07 17:46:15,698 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,698 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,698 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,698 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,698 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,699 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,699 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,699 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,699 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,699 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,700 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,700 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,700 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,700 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,700 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,701 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,701 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,701 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,701 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,701 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-12-07 17:46:15,701 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-12-07 17:46:15,702 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,702 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,702 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,702 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-12-07 17:46:15,702 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-12-07 17:46:15,702 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-12-07 17:46:15,702 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,703 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,703 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,703 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,703 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,703 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,703 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,703 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,703 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,704 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,704 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,704 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,705 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,705 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,705 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,705 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,706 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,706 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,706 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,706 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,706 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,707 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,707 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,707 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,707 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,707 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,707 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,708 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,708 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,708 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-12-07 17:46:15,708 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-12-07 17:46:15,708 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,708 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,709 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,709 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-12-07 17:46:15,709 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-12-07 17:46:15,709 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-12-07 17:46:15,709 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,709 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,709 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,709 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,710 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,710 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,710 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,710 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,710 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,710 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((a26 <= 460652 && 217 < a26) && a24 == 1) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124) || ((((((124 < a26 && a28 <= 300) && a24 == 2) && 0 < a14 + 182) && 37 < a28) && a26 <= 217) && a21 <= 124)) || (((((124 < a26 && 300 < a28) && a24 == 2) && (\exists v_~a26~0_1234 : int :: ((v_~a26~0_1234 <= 217 && a26 <= (v_~a26~0_1234 + 308146) / 5) && 124 < v_~a26~0_1234) && 0 == (v_~a26~0_1234 + 1) % 5)) && a14 + 182 <= 0) && a21 <= 124)) || (((((124 < a26 && a24 == 2) && 0 < a14 + 114) && (a26 * -1 + 596057) / -5 <= 124) && a21 <= 124) && a14 + 84 <= 0)) || ((a28 <= 134 && a24 == 1) && a26 <= 217)) || ((((a24 == 2 && a28 <= 134) && 37 < a28) && (a26 * -1 + 596057) / -5 <= 124) && a21 <= 124)) || ((((((a26 + 68 <= 0 && a28 <= 300) && a24 == 2) && 0 < a14 + 114) && 37 < a28) && a21 <= 124) && a14 + 84 <= 0)) || ((((((217 < a26 && a24 == 2) && a28 <= 300) && (a26 * -1 + 596057) / -5 <= 124) && 37 < a28) && a14 + 182 <= 0) && a21 <= 124)) || (((((217 < a26 && a24 == 2) && 0 < a14 + 182) && (a26 * -1 + 596057) / -5 <= 124) && a14 + 85 <= 0) && a21 <= 124)) || ((((a14 + 114 <= 0 && 0 < a14 + 182) && 0 < a26 + 68) && a26 <= 124) && a21 <= 124)) || ((((a26 + 68 <= 0 && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && a26 + 150557 <= a28) && a14 + 182 <= 0) && a21 <= 124)) || (((300 < a28 && a26 + 139421 <= 0) && a14 + 182 <= 0) && a21 <= 124)) || (((((a28 <= 279 && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && 0 < a26 + 68) && a26 <= 124) && a14 + 4163 <= 0) && a21 <= 124)) || ((((a24 == 2 && a28 <= 134) && (a26 * -1 + 596057) / -5 <= 124) && a14 + 4163 <= 0) && a21 <= 124)) || (((((a24 == 2 && a26 <= 449816) && a28 <= 279) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a14 + 182 <= 0) && a21 <= 124)) || (((((!(a24 == 2) && a28 <= 134) && a14 + 114 <= 0) && 0 < a14 + 182) && 37 < a28) && a21 <= 124)) || (((((a26 + 68 <= 0 && a26 + 10118 <= 0) && a24 == 2) && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || (((((a26 <= 599998 && 217 < a26) && a24 == 2) && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124)) || (((a26 + 68 <= 0 && a28 + 599901 <= 0) && a14 + 4163 <= 0) && a21 <= 124)) || ((((a24 == 2 && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && a26 <= 590083) && a14 + 182 <= 0) && a21 <= 124)) || (((((!(a24 == 2) && a28 <= 134) && a14 + 114 <= 0) && 0 < a14 + 182) && a26 <= 217) && a21 <= 124)) || (((((124 < a26 && a24 == 2) && a26 <= 215) && 0 < a14 + 114) && 37 < a28) && a21 <= 124)) || (((((300 < a28 && !(a24 == 2)) && a14 + 114 <= 0) && a26 <= 215) && 0 < a14 + 182) && a21 <= 124)) || (((((300 < a28 && a24 == 2) && 0 < a14 + 84) && a26 <= 124) && a21 <= 124) && 0 <= a26 + 12)) || (((300 < a28 && (\exists v_~a26~0_1243 : int :: (v_~a26~0_1243 * -1 + 596057) / -5 <= 124 && a26 + 600073 <= v_~a26~0_1243)) && a14 + 4163 <= 0) && a21 <= 124)) || (((a24 == 1 && 0 < a14 + 84) && a26 <= 217) && a21 <= 124)) || (((((300 < a28 && a26 + 68 <= 0) && a24 == 2) && 0 < a14 + 114) && a14 + 85 <= 0) && a21 <= 124)) || (((((300 < a28 && (a14 + 114 <= 0 || 0 < a14 + 84)) && a24 == 2) && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && (\exists v_~a26~0_1226 : int :: (a26 <= v_~a26~0_1226 / 5 + 460627 && v_~a26~0_1226 <= 124) && 0 <= v_~a26~0_1226)) && a21 <= 124)) || ((((a24 == 2 && a28 <= 134) && a26 <= 217) && a14 + 182 <= 0) && a21 <= 124)) || (((((124 < a26 && a24 == 2) && a28 <= 300) && a26 <= 215) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124)) || (a24 == 1 && (a14 + 114 <= 0 || a26 <= 124))) || (((((a26 <= 321684 && 217 < a26) && a24 == 2) && 37 < a28) && a14 + 182 <= 0) && a21 <= 124)) || ((((((124 < a26 && a24 == 2) && a28 <= 300) && a26 <= 449816) && 0 < a14 + 84) && 37 < a28) && a21 <= 124)) || (((a26 + 68 <= 0 && (((((a28 <= 300 || a14 + 114 <= 0) || 0 < a14 + 84) && (37 < a28 || a14 + 84 <= 0)) || !(5 == input)) || 0 < a26 + 68)) && 0 <= a14 + 82) && a21 <= 124)) || (((300 < a28 && a24 == 1) || (217 < a26 && a24 == 1)) && a26 <= 217)) || ((((a26 + 10118 <= 0 && a28 <= 300) && a24 == 2) && 37 < a28) && a21 <= 124)) || (((((\exists v_~a26~0_1234 : int :: ((v_~a26~0_1234 <= 217 && a26 <= (v_~a26~0_1234 + 308146) / 5) && 124 < v_~a26~0_1234) && 0 == (v_~a26~0_1234 + 1) % 5) && 0 <= a14 + 82) && a24 == 1) && a28 == 111) && a21 <= 124)) || ((((a24 == 2 && 0 <= a14 + 82) && 0 < a26 + 68) && a26 <= 124) && a21 <= 124)) || ((((300 < a28 && a26 + 68 <= 0) && a24 == 2) && a14 + 182 <= 0) && a21 <= 124)) || ((((a26 + 68 <= 0 && a28 <= 300) && a24 == 2) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124)) || (((((a26 <= 599998 && a24 == 2) && a28 <= 134) && 37 < a28) && a14 + 182 <= 0) && a21 <= 124)) || (((a26 + 68 <= 0 && !(a24 == 2)) && 0 < a14 + 182) && a21 <= 124)) || (((((a24 == 2 && 0 < a14 + 114) && 0 < a26 + 68) && a26 <= 124) && a21 <= 124) && a14 + 84 <= 0)) || (((((a26 <= 599998 && 217 < a26) && a24 == 2) && 0 <= a14 + 82) && 0 < a14 + 114) && a21 <= 124)) || (((300 < a28 && a24 == 1) || (217 < a26 && a24 == 1)) && a14 + 84 <= 0)) || ((((((300 < a28 && a24 == 2) && a26 <= 449816) && (((((a28 <= 300 || a14 + 114 <= 0) || 0 < a14 + 84) && (37 < a28 || a14 + 84 <= 0)) || !(5 == input)) || 0 < a26 + 68)) && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0) - InvariantResult [Line: 24]: Loop Invariant [2019-12-07 17:46:15,711 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,711 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,711 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,712 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,713 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,714 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,714 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,714 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,714 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-12-07 17:46:15,714 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-12-07 17:46:15,714 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,714 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,715 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,715 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,715 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,715 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,715 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,715 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,715 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,715 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-12-07 17:46:15,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-12-07 17:46:15,716 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-12-07 17:46:15,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,718 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,720 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,720 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,720 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,720 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-12-07 17:46:15,720 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1243,QUANTIFIED] [2019-12-07 17:46:15,720 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,721 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,721 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,721 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,721 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,721 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,721 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,721 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,721 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1234,QUANTIFIED] [2019-12-07 17:46:15,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1307,QUANTIFIED] [2019-12-07 17:46:15,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a28~0_1305,QUANTIFIED] [2019-12-07 17:46:15,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-12-07 17:46:15,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] [2019-12-07 17:46:15,722 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a26~0_1226,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((a26 <= 460652 && 217 < a26) && a24 == 1) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124) || ((((((124 < a26 && a28 <= 300) && a24 == 2) && 0 < a14 + 182) && 37 < a28) && a26 <= 217) && a21 <= 124)) || (((((124 < a26 && 300 < a28) && a24 == 2) && (\exists v_~a26~0_1234 : int :: ((v_~a26~0_1234 <= 217 && a26 <= (v_~a26~0_1234 + 308146) / 5) && 124 < v_~a26~0_1234) && 0 == (v_~a26~0_1234 + 1) % 5)) && a14 + 182 <= 0) && a21 <= 124)) || (((((124 < a26 && a24 == 2) && 0 < a14 + 114) && (a26 * -1 + 596057) / -5 <= 124) && a21 <= 124) && a14 + 84 <= 0)) || ((a28 <= 134 && a24 == 1) && a26 <= 217)) || ((((a24 == 2 && a28 <= 134) && 37 < a28) && (a26 * -1 + 596057) / -5 <= 124) && a21 <= 124)) || (((((a24 == 2 && a28 <= 279) && a26 <= 217) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a14 + 182 <= 0) && a21 <= 124)) || (((a24 == 2 && 0 <= a14 + 82) && a26 <= 124) && a21 <= 124)) || ((((((217 < a26 && a24 == 2) && a28 <= 300) && (a26 * -1 + 596057) / -5 <= 124) && 37 < a28) && a14 + 182 <= 0) && a21 <= 124)) || (((((217 < a26 && a24 == 2) && 0 < a14 + 182) && (a26 * -1 + 596057) / -5 <= 124) && a14 + 85 <= 0) && a21 <= 124)) || ((((a14 + 114 <= 0 && 0 < a14 + 182) && 0 < a26 + 68) && a26 <= 124) && a21 <= 124)) || (((((300 < a28 && a24 == 2) && 0 < a14 + 114) && a26 <= 124) && a21 <= 124) && 0 <= a26 + 12)) || (((300 < a28 && a26 + 139421 <= 0) && a14 + 182 <= 0) && a21 <= 124)) || (((((a28 <= 279 && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && 0 < a26 + 68) && a26 <= 124) && a14 + 4163 <= 0) && a21 <= 124)) || ((((a24 == 2 && a28 <= 134) && (a26 * -1 + 596057) / -5 <= 124) && a14 + 4163 <= 0) && a21 <= 124)) || (((((!(a24 == 2) && a28 <= 134) && a14 + 114 <= 0) && 0 < a14 + 182) && 37 < a28) && a21 <= 124)) || (((((a26 + 68 <= 0 && a26 + 10118 <= 0) && a24 == 2) && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || (((((a26 <= 599998 && 217 < a26) && a24 == 2) && 0 < a14 + 114) && a14 + 84 <= 0) && a21 <= 124)) || (((a26 + 68 <= 0 && a28 + 599901 <= 0) && a14 + 4163 <= 0) && a21 <= 124)) || ((((a24 == 2 && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && a26 <= 590083) && a14 + 182 <= 0) && a21 <= 124)) || (((((!(a24 == 2) && a28 <= 134) && a14 + 114 <= 0) && 0 < a14 + 182) && a26 <= 217) && a21 <= 124)) || (((((124 < a26 && a24 == 2) && a26 <= 215) && 0 < a14 + 114) && 37 < a28) && a21 <= 124)) || (((((300 < a28 && !(a24 == 2)) && a14 + 114 <= 0) && a26 <= 215) && 0 < a14 + 182) && a21 <= 124)) || (((300 < a28 && (\exists v_~a26~0_1243 : int :: (v_~a26~0_1243 * -1 + 596057) / -5 <= 124 && a26 + 600073 <= v_~a26~0_1243)) && a14 + 4163 <= 0) && a21 <= 124)) || (((a24 == 1 && 0 < a14 + 84) && a26 <= 217) && a21 <= 124)) || ((((a24 == 2 && a28 <= 134) && a26 <= 217) && a14 + 182 <= 0) && a21 <= 124)) || (((a26 + 68 <= 0 && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && a26 + 150557 <= a28) && a21 <= 124)) || (((((124 < a26 && a24 == 2) && a28 <= 300) && a26 <= 215) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124)) || (a24 == 1 && (a14 + 114 <= 0 || a26 <= 124))) || (((((a26 <= 321684 && 217 < a26) && a24 == 2) && 37 < a28) && a14 + 182 <= 0) && a21 <= 124)) || ((((((124 < a26 && a24 == 2) && a28 <= 300) && a26 <= 449816) && 0 < a14 + 84) && 37 < a28) && a21 <= 124)) || (((300 < a28 && a24 == 1) || (217 < a26 && a24 == 1)) && a26 <= 217)) || ((((a26 + 10118 <= 0 && a28 <= 300) && a24 == 2) && 37 < a28) && a21 <= 124)) || (((((\exists v_~a26~0_1234 : int :: ((v_~a26~0_1234 <= 217 && a26 <= (v_~a26~0_1234 + 308146) / 5) && 124 < v_~a26~0_1234) && 0 == (v_~a26~0_1234 + 1) % 5) && 0 <= a14 + 82) && a24 == 1) && a28 == 111) && a21 <= 124)) || ((((300 < a28 && a26 + 68 <= 0) && a24 == 2) && a14 + 182 <= 0) && a21 <= 124)) || ((((a26 + 68 <= 0 && a28 <= 300) && a24 == 2) && (\exists v_~a28~0_1307 : int :: (!((v_~a28~0_1307 + 6) % 82 == 0) && (v_~a28~0_1307 + 6) % 82 + 137 <= a28) && v_~a28~0_1307 < 89948)) && a21 <= 124)) || (((((a26 <= 599998 && a24 == 2) && a28 <= 134) && 37 < a28) && a14 + 182 <= 0) && a21 <= 124)) || (((((a26 + 68 <= 0 && a24 == 2) && 0 < a14 + 114) && 37 < a28) && a21 <= 124) && a14 + 84 <= 0)) || ((((300 < a28 && a24 == 2) && (\exists v_~a28~0_1305 : int :: (37 < v_~a28~0_1305 && 0 <= v_~a28~0_1305) && v_~a28~0_1305 % 299849 + 18943 <= a28)) && (\exists v_~a26~0_1226 : int :: (a26 <= v_~a26~0_1226 / 5 + 460627 && v_~a26~0_1226 <= 124) && 0 <= v_~a26~0_1226)) && a21 <= 124)) || (((a26 + 68 <= 0 && !(a24 == 2)) && 0 < a14 + 182) && a21 <= 124)) || (((((a24 == 2 && 0 < a14 + 114) && 0 < a26 + 68) && a26 <= 124) && a21 <= 124) && a14 + 84 <= 0)) || (((((a26 <= 599998 && 217 < a26) && a24 == 2) && 0 <= a14 + 82) && 0 < a14 + 114) && a21 <= 124)) || (((300 < a28 && a24 == 1) || (217 < a26 && a24 == 1)) && a14 + 84 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 590 locations, 1 error locations. Result: SAFE, OverallTime: 372.5s, OverallIterations: 36, TraceHistogramMax: 13, AutomataDifference: 260.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 111.8s, HoareTripleCheckerStatistics: 11579 SDtfs, 58874 SDslu, 3542 SDs, 0 SdLazy, 149832 SolverSat, 16905 SolverUnsat, 28 SolverUnknown, 0 SolverNotchecked, 216.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14582 GetRequests, 14294 SyntacticMatches, 11 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3963 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101320occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 19.1s AutomataMinimizationTime, 36 MinimizatonAttempts, 318413 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 720 NumberOfFragments, 3410 HoareAnnotationTreeSize, 4 FomulaSimplifications, 303100955 FormulaSimplificationTreeSizeReduction, 21.7s HoareSimplificationTime, 4 FomulaSimplificationsInter, 110574203 FormulaSimplificationTreeSizeReductionInter, 90.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.5s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 31.9s InterpolantComputationTime, 49563 NumberOfCodeBlocks, 49563 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 49513 ConstructedInterpolants, 1679 QuantifiedInterpolants, 313182889 SizeOfPredicates, 17 NumberOfNonLiveVariables, 16888 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 50 InterpolantComputations, 33 PerfectInterpolantSequences, 104785/114906 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! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...