./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label55.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_380e5fd2-bd2c-4bf3-8772-62c7ca4338b9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_380e5fd2-bd2c-4bf3-8772-62c7ca4338b9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_380e5fd2-bd2c-4bf3-8772-62c7ca4338b9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_380e5fd2-bd2c-4bf3-8772-62c7ca4338b9/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label55.c -s /tmp/vcloud-vcloud-master/worker/run_dir_380e5fd2-bd2c-4bf3-8772-62c7ca4338b9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_380e5fd2-bd2c-4bf3-8772-62c7ca4338b9/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 d551d8685b85ae72a74f40e5098a20631eb2112d ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 10:59:55,000 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:59:55,001 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:59:55,009 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:59:55,009 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:59:55,010 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:59:55,011 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:59:55,013 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:59:55,014 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:59:55,015 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:59:55,016 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:59:55,017 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:59:55,017 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:59:55,018 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:59:55,019 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:59:55,020 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:59:55,020 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:59:55,021 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:59:55,022 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:59:55,024 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:59:55,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:59:55,025 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:59:55,026 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:59:55,026 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:59:55,028 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:59:55,028 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:59:55,028 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:59:55,029 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:59:55,029 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:59:55,030 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:59:55,030 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:59:55,030 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:59:55,031 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:59:55,031 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:59:55,032 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:59:55,032 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:59:55,032 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:59:55,032 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:59:55,033 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:59:55,033 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:59:55,033 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:59:55,034 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_380e5fd2-bd2c-4bf3-8772-62c7ca4338b9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:59:55,043 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:59:55,044 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:59:55,044 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:59:55,044 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:59:55,044 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:59:55,045 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:59:55,045 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:59:55,045 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:59:55,045 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:59:55,045 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:59:55,045 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:59:55,045 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:59:55,046 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:59:55,046 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:59:55,046 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:59:55,046 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:59:55,046 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:59:55,046 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:59:55,046 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:59:55,046 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:59:55,047 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:59:55,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:59:55,047 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:59:55,047 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:59:55,047 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:59:55,047 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:59:55,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:59:55,047 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:59:55,048 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:59:55,048 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_380e5fd2-bd2c-4bf3-8772-62c7ca4338b9/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 -> d551d8685b85ae72a74f40e5098a20631eb2112d [2019-12-07 10:59:55,152 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:59:55,160 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:59:55,162 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:59:55,163 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:59:55,163 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:59:55,164 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_380e5fd2-bd2c-4bf3-8772-62c7ca4338b9/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem11_label55.c [2019-12-07 10:59:55,200 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_380e5fd2-bd2c-4bf3-8772-62c7ca4338b9/bin/uautomizer/data/e677cfafd/28d1687ef021400ab209e28bc219ac32/FLAG0765e5f19 [2019-12-07 10:59:55,639 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:59:55,640 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_380e5fd2-bd2c-4bf3-8772-62c7ca4338b9/sv-benchmarks/c/eca-rers2012/Problem11_label55.c [2019-12-07 10:59:55,652 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_380e5fd2-bd2c-4bf3-8772-62c7ca4338b9/bin/uautomizer/data/e677cfafd/28d1687ef021400ab209e28bc219ac32/FLAG0765e5f19 [2019-12-07 10:59:55,662 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_380e5fd2-bd2c-4bf3-8772-62c7ca4338b9/bin/uautomizer/data/e677cfafd/28d1687ef021400ab209e28bc219ac32 [2019-12-07 10:59:55,664 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:59:55,665 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:59:55,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:59:55,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:59:55,669 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:59:55,669 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:59:55" (1/1) ... [2019-12-07 10:59:55,671 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3729cc33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:59:55, skipping insertion in model container [2019-12-07 10:59:55,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:59:55" (1/1) ... [2019-12-07 10:59:55,676 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:59:55,723 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:59:56,031 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:59:56,034 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:59:56,122 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:59:56,132 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:59:56,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:59:56 WrapperNode [2019-12-07 10:59:56,133 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:59:56,133 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:59:56,133 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:59:56,133 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:59:56,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:59:56" (1/1) ... [2019-12-07 10:59:56,158 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:59:56" (1/1) ... [2019-12-07 10:59:56,210 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:59:56,210 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:59:56,210 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:59:56,211 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:59:56,217 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:59:56" (1/1) ... [2019-12-07 10:59:56,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:59:56" (1/1) ... [2019-12-07 10:59:56,223 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:59:56" (1/1) ... [2019-12-07 10:59:56,224 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:59:56" (1/1) ... [2019-12-07 10:59:56,248 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:59:56" (1/1) ... [2019-12-07 10:59:56,255 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:59:56" (1/1) ... [2019-12-07 10:59:56,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:59:56" (1/1) ... [2019-12-07 10:59:56,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:59:56,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:59:56,280 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:59:56,280 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:59:56,281 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:59:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_380e5fd2-bd2c-4bf3-8772-62c7ca4338b9/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 10:59:56,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:59:56,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:59:57,309 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:59:57,309 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 10:59:57,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:59:57 BoogieIcfgContainer [2019-12-07 10:59:57,310 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:59:57,311 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:59:57,311 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:59:57,313 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:59:57,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:59:55" (1/3) ... [2019-12-07 10:59:57,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a54e894 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:59:57, skipping insertion in model container [2019-12-07 10:59:57,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:59:56" (2/3) ... [2019-12-07 10:59:57,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a54e894 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:59:57, skipping insertion in model container [2019-12-07 10:59:57,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:59:57" (3/3) ... [2019-12-07 10:59:57,315 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label55.c [2019-12-07 10:59:57,322 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:59:57,327 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 10:59:57,335 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 10:59:57,354 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:59:57,354 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:59:57,354 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:59:57,354 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:59:57,355 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:59:57,355 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:59:57,355 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:59:57,355 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:59:57,371 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-12-07 10:59:57,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 10:59:57,376 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:59:57,376 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:59:57,376 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:59:57,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:59:57,380 INFO L82 PathProgramCache]: Analyzing trace with hash -2068820151, now seen corresponding path program 1 times [2019-12-07 10:59:57,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:59:57,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061253389] [2019-12-07 10:59:57,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:59:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:59:57,577 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 10:59:57,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061253389] [2019-12-07 10:59:57,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:59:57,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:59:57,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125284600] [2019-12-07 10:59:57,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:59:57,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:59:57,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:59:57,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:59:57,593 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-12-07 10:59:58,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:59:58,761 INFO L93 Difference]: Finished difference Result 951 states and 1718 transitions. [2019-12-07 10:59:58,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:59:58,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-12-07 10:59:58,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:59:58,774 INFO L225 Difference]: With dead ends: 951 [2019-12-07 10:59:58,775 INFO L226 Difference]: Without dead ends: 600 [2019-12-07 10:59:58,778 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 10:59:58,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-12-07 10:59:58,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 410. [2019-12-07 10:59:58,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-12-07 10:59:58,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 593 transitions. [2019-12-07 10:59:58,822 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 593 transitions. Word has length 45 [2019-12-07 10:59:58,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:59:58,822 INFO L462 AbstractCegarLoop]: Abstraction has 410 states and 593 transitions. [2019-12-07 10:59:58,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:59:58,822 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 593 transitions. [2019-12-07 10:59:58,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-07 10:59:58,826 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:59:58,826 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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 10:59:58,826 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:59:58,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:59:58,826 INFO L82 PathProgramCache]: Analyzing trace with hash -954308976, now seen corresponding path program 1 times [2019-12-07 10:59:58,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:59:58,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438480156] [2019-12-07 10:59:58,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:59:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:59:58,921 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:59:58,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438480156] [2019-12-07 10:59:58,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:59:58,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:59:58,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916516316] [2019-12-07 10:59:58,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:59:58,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:59:58,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:59:58,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:59:58,924 INFO L87 Difference]: Start difference. First operand 410 states and 593 transitions. Second operand 4 states. [2019-12-07 11:00:00,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:00,205 INFO L93 Difference]: Finished difference Result 1572 states and 2289 transitions. [2019-12-07 11:00:00,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:00:00,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-12-07 11:00:00,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:00,211 INFO L225 Difference]: With dead ends: 1572 [2019-12-07 11:00:00,211 INFO L226 Difference]: Without dead ends: 1164 [2019-12-07 11:00:00,213 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 11:00:00,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2019-12-07 11:00:00,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 1150. [2019-12-07 11:00:00,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1150 states. [2019-12-07 11:00:00,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1569 transitions. [2019-12-07 11:00:00,239 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1569 transitions. Word has length 113 [2019-12-07 11:00:00,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:00,240 INFO L462 AbstractCegarLoop]: Abstraction has 1150 states and 1569 transitions. [2019-12-07 11:00:00,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:00:00,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1569 transitions. [2019-12-07 11:00:00,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-12-07 11:00:00,242 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:00,242 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:00:00,242 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:00,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:00,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1653006500, now seen corresponding path program 1 times [2019-12-07 11:00:00,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:00,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233726339] [2019-12-07 11:00:00,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:00,344 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:00:00,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233726339] [2019-12-07 11:00:00,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:00:00,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:00:00,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451681368] [2019-12-07 11:00:00,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:00:00,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:00,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:00:00,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:00:00,347 INFO L87 Difference]: Start difference. First operand 1150 states and 1569 transitions. Second operand 4 states. [2019-12-07 11:00:01,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:01,488 INFO L93 Difference]: Finished difference Result 3966 states and 5435 transitions. [2019-12-07 11:00:01,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:00:01,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-12-07 11:00:01,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:01,502 INFO L225 Difference]: With dead ends: 3966 [2019-12-07 11:00:01,502 INFO L226 Difference]: Without dead ends: 2818 [2019-12-07 11:00:01,504 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:00:01,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states. [2019-12-07 11:00:01,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2255. [2019-12-07 11:00:01,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2255 states. [2019-12-07 11:00:01,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 2255 states and 2823 transitions. [2019-12-07 11:00:01,542 INFO L78 Accepts]: Start accepts. Automaton has 2255 states and 2823 transitions. Word has length 121 [2019-12-07 11:00:01,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:01,543 INFO L462 AbstractCegarLoop]: Abstraction has 2255 states and 2823 transitions. [2019-12-07 11:00:01,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:00:01,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 2823 transitions. [2019-12-07 11:00:01,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-12-07 11:00:01,546 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:01,546 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:00:01,546 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:01,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:01,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1015853899, now seen corresponding path program 1 times [2019-12-07 11:00:01,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:01,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580903932] [2019-12-07 11:00:01,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:01,676 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:00:01,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580903932] [2019-12-07 11:00:01,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:00:01,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:00:01,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582405083] [2019-12-07 11:00:01,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:00:01,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:01,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:00:01,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:00:01,677 INFO L87 Difference]: Start difference. First operand 2255 states and 2823 transitions. Second operand 5 states. [2019-12-07 11:00:03,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:03,010 INFO L93 Difference]: Finished difference Result 7660 states and 9979 transitions. [2019-12-07 11:00:03,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:00:03,010 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 172 [2019-12-07 11:00:03,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:03,030 INFO L225 Difference]: With dead ends: 7660 [2019-12-07 11:00:03,030 INFO L226 Difference]: Without dead ends: 5591 [2019-12-07 11:00:03,033 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:00:03,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5591 states. [2019-12-07 11:00:03,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5591 to 5590. [2019-12-07 11:00:03,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5590 states. [2019-12-07 11:00:03,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5590 states to 5590 states and 7033 transitions. [2019-12-07 11:00:03,103 INFO L78 Accepts]: Start accepts. Automaton has 5590 states and 7033 transitions. Word has length 172 [2019-12-07 11:00:03,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:03,104 INFO L462 AbstractCegarLoop]: Abstraction has 5590 states and 7033 transitions. [2019-12-07 11:00:03,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:00:03,104 INFO L276 IsEmpty]: Start isEmpty. Operand 5590 states and 7033 transitions. [2019-12-07 11:00:03,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-12-07 11:00:03,107 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:03,108 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 11:00:03,108 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:03,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:03,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1806172888, now seen corresponding path program 1 times [2019-12-07 11:00:03,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:03,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315084458] [2019-12-07 11:00:03,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:03,270 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-12-07 11:00:03,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315084458] [2019-12-07 11:00:03,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:00:03,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:00:03,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350535148] [2019-12-07 11:00:03,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:00:03,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:03,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:00:03,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:00:03,272 INFO L87 Difference]: Start difference. First operand 5590 states and 7033 transitions. Second operand 4 states. [2019-12-07 11:00:04,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:04,282 INFO L93 Difference]: Finished difference Result 12489 states and 15870 transitions. [2019-12-07 11:00:04,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:00:04,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 249 [2019-12-07 11:00:04,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:04,305 INFO L225 Difference]: With dead ends: 12489 [2019-12-07 11:00:04,305 INFO L226 Difference]: Without dead ends: 7085 [2019-12-07 11:00:04,310 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:00:04,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7085 states. [2019-12-07 11:00:04,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7085 to 6878. [2019-12-07 11:00:04,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6878 states. [2019-12-07 11:00:04,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6878 states to 6878 states and 8515 transitions. [2019-12-07 11:00:04,392 INFO L78 Accepts]: Start accepts. Automaton has 6878 states and 8515 transitions. Word has length 249 [2019-12-07 11:00:04,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:04,392 INFO L462 AbstractCegarLoop]: Abstraction has 6878 states and 8515 transitions. [2019-12-07 11:00:04,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:00:04,393 INFO L276 IsEmpty]: Start isEmpty. Operand 6878 states and 8515 transitions. [2019-12-07 11:00:04,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-12-07 11:00:04,400 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:04,400 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:00:04,400 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:04,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:04,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1851926517, now seen corresponding path program 1 times [2019-12-07 11:00:04,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:04,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221861196] [2019-12-07 11:00:04,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:04,572 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 305 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-12-07 11:00:04,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221861196] [2019-12-07 11:00:04,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:00:04,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:00:04,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916610262] [2019-12-07 11:00:04,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:00:04,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:04,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:00:04,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:00:04,574 INFO L87 Difference]: Start difference. First operand 6878 states and 8515 transitions. Second operand 4 states. [2019-12-07 11:00:05,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:05,512 INFO L93 Difference]: Finished difference Result 15060 states and 18819 transitions. [2019-12-07 11:00:05,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:00:05,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 328 [2019-12-07 11:00:05,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:05,538 INFO L225 Difference]: With dead ends: 15060 [2019-12-07 11:00:05,538 INFO L226 Difference]: Without dead ends: 8368 [2019-12-07 11:00:05,543 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 11:00:05,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8368 states. [2019-12-07 11:00:05,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8368 to 8166. [2019-12-07 11:00:05,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8166 states. [2019-12-07 11:00:05,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8166 states to 8166 states and 9905 transitions. [2019-12-07 11:00:05,639 INFO L78 Accepts]: Start accepts. Automaton has 8166 states and 9905 transitions. Word has length 328 [2019-12-07 11:00:05,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:05,639 INFO L462 AbstractCegarLoop]: Abstraction has 8166 states and 9905 transitions. [2019-12-07 11:00:05,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:00:05,639 INFO L276 IsEmpty]: Start isEmpty. Operand 8166 states and 9905 transitions. [2019-12-07 11:00:05,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-12-07 11:00:05,647 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:05,647 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:00:05,647 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:05,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:05,647 INFO L82 PathProgramCache]: Analyzing trace with hash 976606001, now seen corresponding path program 1 times [2019-12-07 11:00:05,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:05,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519380623] [2019-12-07 11:00:05,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:05,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:05,857 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-12-07 11:00:05,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519380623] [2019-12-07 11:00:05,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:00:05,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:00:05,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941758902] [2019-12-07 11:00:05,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:00:05,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:05,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:00:05,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:00:05,858 INFO L87 Difference]: Start difference. First operand 8166 states and 9905 transitions. Second operand 3 states. [2019-12-07 11:00:06,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:06,402 INFO L93 Difference]: Finished difference Result 17072 states and 20672 transitions. [2019-12-07 11:00:06,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:00:06,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 337 [2019-12-07 11:00:06,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:06,419 INFO L225 Difference]: With dead ends: 17072 [2019-12-07 11:00:06,419 INFO L226 Difference]: Without dead ends: 8538 [2019-12-07 11:00:06,425 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 11:00:06,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8538 states. [2019-12-07 11:00:06,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8538 to 8167. [2019-12-07 11:00:06,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8167 states. [2019-12-07 11:00:06,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8167 states to 8167 states and 9716 transitions. [2019-12-07 11:00:06,492 INFO L78 Accepts]: Start accepts. Automaton has 8167 states and 9716 transitions. Word has length 337 [2019-12-07 11:00:06,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:06,493 INFO L462 AbstractCegarLoop]: Abstraction has 8167 states and 9716 transitions. [2019-12-07 11:00:06,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:00:06,493 INFO L276 IsEmpty]: Start isEmpty. Operand 8167 states and 9716 transitions. [2019-12-07 11:00:06,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-12-07 11:00:06,500 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:06,500 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:00:06,500 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:06,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:06,500 INFO L82 PathProgramCache]: Analyzing trace with hash 162175160, now seen corresponding path program 1 times [2019-12-07 11:00:06,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:06,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740234481] [2019-12-07 11:00:06,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:06,739 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:00:06,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740234481] [2019-12-07 11:00:06,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354047257] [2019-12-07 11:00:06,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_380e5fd2-bd2c-4bf3-8772-62c7ca4338b9/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 11:00:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:06,870 INFO L264 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 11:00:06,884 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:00:06,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:06,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:07,187 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 166 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:00:07,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:00:07,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2019-12-07 11:00:07,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67127890] [2019-12-07 11:00:07,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 11:00:07,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:07,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 11:00:07,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:00:07,189 INFO L87 Difference]: Start difference. First operand 8167 states and 9716 transitions. Second operand 10 states. [2019-12-07 11:00:20,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:20,632 INFO L93 Difference]: Finished difference Result 41479 states and 49499 transitions. [2019-12-07 11:00:20,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 11:00:20,632 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 343 [2019-12-07 11:00:20,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:20,689 INFO L225 Difference]: With dead ends: 41479 [2019-12-07 11:00:20,689 INFO L226 Difference]: Without dead ends: 33498 [2019-12-07 11:00:20,718 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=327, Invalid=863, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 11:00:20,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33498 states. [2019-12-07 11:00:20,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33498 to 27389. [2019-12-07 11:00:20,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27389 states. [2019-12-07 11:00:21,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27389 states to 27389 states and 31496 transitions. [2019-12-07 11:00:21,005 INFO L78 Accepts]: Start accepts. Automaton has 27389 states and 31496 transitions. Word has length 343 [2019-12-07 11:00:21,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:21,006 INFO L462 AbstractCegarLoop]: Abstraction has 27389 states and 31496 transitions. [2019-12-07 11:00:21,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 11:00:21,006 INFO L276 IsEmpty]: Start isEmpty. Operand 27389 states and 31496 transitions. [2019-12-07 11:00:21,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-12-07 11:00:21,023 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:21,024 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 11:00:21,224 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:00:21,225 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:21,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:21,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1310153897, now seen corresponding path program 1 times [2019-12-07 11:00:21,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:21,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024811963] [2019-12-07 11:00:21,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:21,678 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 0 proven. 412 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:00:21,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024811963] [2019-12-07 11:00:21,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797581442] [2019-12-07 11:00:21,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_380e5fd2-bd2c-4bf3-8772-62c7ca4338b9/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 11:00:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:21,757 INFO L264 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 11:00:21,763 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:00:21,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:21,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:21,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:21,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:21,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:21,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:21,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:21,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:21,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:21,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:21,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:21,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:21,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:21,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:21,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:21,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:21,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:21,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:21,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:21,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:21,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:21,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:21,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:21,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:21,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:21,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:21,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:21,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:21,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:22,616 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 26 [2019-12-07 11:00:22,989 INFO L134 CoverageAnalysis]: Checked inductivity of 412 backedges. 0 proven. 307 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-12-07 11:00:22,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:00:22,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 10 [2019-12-07 11:00:22,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986811549] [2019-12-07 11:00:22,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 11:00:22,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:22,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 11:00:22,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:00:22,991 INFO L87 Difference]: Start difference. First operand 27389 states and 31496 transitions. Second operand 11 states. [2019-12-07 11:00:37,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:37,004 INFO L93 Difference]: Finished difference Result 67562 states and 77913 transitions. [2019-12-07 11:00:37,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 11:00:37,004 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 353 [2019-12-07 11:00:37,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:37,058 INFO L225 Difference]: With dead ends: 67562 [2019-12-07 11:00:37,059 INFO L226 Difference]: Without dead ends: 40359 [2019-12-07 11:00:37,075 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 350 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2019-12-07 11:00:37,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40359 states. [2019-12-07 11:00:37,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40359 to 26278. [2019-12-07 11:00:37,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26278 states. [2019-12-07 11:00:37,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26278 states to 26278 states and 29447 transitions. [2019-12-07 11:00:37,335 INFO L78 Accepts]: Start accepts. Automaton has 26278 states and 29447 transitions. Word has length 353 [2019-12-07 11:00:37,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:37,335 INFO L462 AbstractCegarLoop]: Abstraction has 26278 states and 29447 transitions. [2019-12-07 11:00:37,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 11:00:37,336 INFO L276 IsEmpty]: Start isEmpty. Operand 26278 states and 29447 transitions. [2019-12-07 11:00:37,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2019-12-07 11:00:37,352 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:37,352 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:00:37,553 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:00:37,554 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:37,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:37,554 INFO L82 PathProgramCache]: Analyzing trace with hash 273234903, now seen corresponding path program 1 times [2019-12-07 11:00:37,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:37,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540688150] [2019-12-07 11:00:37,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:37,757 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 570 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-12-07 11:00:37,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540688150] [2019-12-07 11:00:37,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:00:37,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:00:37,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452409545] [2019-12-07 11:00:37,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:00:37,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:37,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:00:37,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:00:37,759 INFO L87 Difference]: Start difference. First operand 26278 states and 29447 transitions. Second operand 4 states. [2019-12-07 11:00:38,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:38,802 INFO L93 Difference]: Finished difference Result 50728 states and 56908 transitions. [2019-12-07 11:00:38,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:00:38,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 431 [2019-12-07 11:00:38,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:38,825 INFO L225 Difference]: With dead ends: 50728 [2019-12-07 11:00:38,825 INFO L226 Difference]: Without dead ends: 26852 [2019-12-07 11:00:38,837 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:00:38,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26852 states. [2019-12-07 11:00:39,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26852 to 24802. [2019-12-07 11:00:39,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24802 states. [2019-12-07 11:00:39,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24802 states to 24802 states and 27654 transitions. [2019-12-07 11:00:39,043 INFO L78 Accepts]: Start accepts. Automaton has 24802 states and 27654 transitions. Word has length 431 [2019-12-07 11:00:39,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:39,044 INFO L462 AbstractCegarLoop]: Abstraction has 24802 states and 27654 transitions. [2019-12-07 11:00:39,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:00:39,044 INFO L276 IsEmpty]: Start isEmpty. Operand 24802 states and 27654 transitions. [2019-12-07 11:00:39,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2019-12-07 11:00:39,062 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:39,062 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-12-07 11:00:39,063 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:39,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:39,063 INFO L82 PathProgramCache]: Analyzing trace with hash -268191883, now seen corresponding path program 1 times [2019-12-07 11:00:39,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:39,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124353246] [2019-12-07 11:00:39,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:39,294 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 387 proven. 0 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2019-12-07 11:00:39,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124353246] [2019-12-07 11:00:39,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:00:39,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:00:39,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167589782] [2019-12-07 11:00:39,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:00:39,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:39,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:00:39,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:00:39,295 INFO L87 Difference]: Start difference. First operand 24802 states and 27654 transitions. Second operand 3 states. [2019-12-07 11:00:39,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:39,915 INFO L93 Difference]: Finished difference Result 49772 states and 55451 transitions. [2019-12-07 11:00:39,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:00:39,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 467 [2019-12-07 11:00:39,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:39,931 INFO L225 Difference]: With dead ends: 49772 [2019-12-07 11:00:39,931 INFO L226 Difference]: Without dead ends: 22024 [2019-12-07 11:00:39,941 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 11:00:39,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22024 states. [2019-12-07 11:00:40,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22024 to 19443. [2019-12-07 11:00:40,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19443 states. [2019-12-07 11:00:40,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19443 states to 19443 states and 21088 transitions. [2019-12-07 11:00:40,106 INFO L78 Accepts]: Start accepts. Automaton has 19443 states and 21088 transitions. Word has length 467 [2019-12-07 11:00:40,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:40,106 INFO L462 AbstractCegarLoop]: Abstraction has 19443 states and 21088 transitions. [2019-12-07 11:00:40,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:00:40,106 INFO L276 IsEmpty]: Start isEmpty. Operand 19443 states and 21088 transitions. [2019-12-07 11:00:40,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2019-12-07 11:00:40,121 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:40,122 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:00:40,122 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:40,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:40,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1445886331, now seen corresponding path program 1 times [2019-12-07 11:00:40,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:40,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949693152] [2019-12-07 11:00:40,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:40,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:40,671 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 477 proven. 176 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-12-07 11:00:40,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949693152] [2019-12-07 11:00:40,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507013910] [2019-12-07 11:00:40,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_380e5fd2-bd2c-4bf3-8772-62c7ca4338b9/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 11:00:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:40,802 INFO L264 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 11:00:40,807 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:00:40,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:40,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:40,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:40,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:42,691 WARN L192 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-12-07 11:00:42,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:42,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:42,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:00:44,037 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 261 proven. 392 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-12-07 11:00:44,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:00:44,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 11 [2019-12-07 11:00:44,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204171133] [2019-12-07 11:00:44,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 11:00:44,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:44,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 11:00:44,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:00:44,039 INFO L87 Difference]: Start difference. First operand 19443 states and 21088 transitions. Second operand 11 states. [2019-12-07 11:01:07,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:07,600 INFO L93 Difference]: Finished difference Result 41467 states and 45227 transitions. [2019-12-07 11:01:07,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 11:01:07,601 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 562 [2019-12-07 11:01:07,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:07,616 INFO L225 Difference]: With dead ends: 41467 [2019-12-07 11:01:07,616 INFO L226 Difference]: Without dead ends: 22210 [2019-12-07 11:01:07,622 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 569 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-12-07 11:01:07,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22210 states. [2019-12-07 11:01:07,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22210 to 12940. [2019-12-07 11:01:07,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12940 states. [2019-12-07 11:01:07,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12940 states to 12940 states and 14046 transitions. [2019-12-07 11:01:07,751 INFO L78 Accepts]: Start accepts. Automaton has 12940 states and 14046 transitions. Word has length 562 [2019-12-07 11:01:07,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:07,752 INFO L462 AbstractCegarLoop]: Abstraction has 12940 states and 14046 transitions. [2019-12-07 11:01:07,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 11:01:07,752 INFO L276 IsEmpty]: Start isEmpty. Operand 12940 states and 14046 transitions. [2019-12-07 11:01:07,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2019-12-07 11:01:07,759 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:07,759 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, 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, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:01:07,960 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:01:07,960 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:07,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:07,961 INFO L82 PathProgramCache]: Analyzing trace with hash -933871913, now seen corresponding path program 1 times [2019-12-07 11:01:07,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:01:07,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273769687] [2019-12-07 11:01:07,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:08,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 678 proven. 176 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2019-12-07 11:01:08,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273769687] [2019-12-07 11:01:08,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827394045] [2019-12-07 11:01:08,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_380e5fd2-bd2c-4bf3-8772-62c7ca4338b9/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 11:01:08,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:08,766 INFO L264 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-07 11:01:08,771 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:01:08,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:01:08,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:01:08,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:01:08,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:01:08,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:01:08,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:01:09,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 765 proven. 89 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2019-12-07 11:01:09,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:01:09,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2019-12-07 11:01:09,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145091236] [2019-12-07 11:01:09,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 11:01:09,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:01:09,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 11:01:09,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:01:09,998 INFO L87 Difference]: Start difference. First operand 12940 states and 14046 transitions. Second operand 13 states. [2019-12-07 11:01:26,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:26,332 INFO L93 Difference]: Finished difference Result 35006 states and 37966 transitions. [2019-12-07 11:01:26,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-07 11:01:26,332 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 582 [2019-12-07 11:01:26,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:26,333 INFO L225 Difference]: With dead ends: 35006 [2019-12-07 11:01:26,333 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 11:01:26,340 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 650 GetRequests, 606 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=397, Invalid=1583, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 11:01:26,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 11:01:26,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 11:01:26,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 11:01:26,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 11:01:26,340 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 582 [2019-12-07 11:01:26,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:26,341 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 11:01:26,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 11:01:26,341 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 11:01:26,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 11:01:26,541 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:01:26,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 11:01:27,266 WARN L192 SmtUtils]: Spent 705.00 ms on a formula simplification. DAG size of input: 740 DAG size of output: 533 [2019-12-07 11:01:27,853 WARN L192 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 740 DAG size of output: 533 [2019-12-07 11:01:31,272 WARN L192 SmtUtils]: Spent 3.41 s on a formula simplification. DAG size of input: 504 DAG size of output: 152 [2019-12-07 11:01:34,814 WARN L192 SmtUtils]: Spent 3.54 s on a formula simplification. DAG size of input: 504 DAG size of output: 152 [2019-12-07 11:01:34,817 INFO L246 CegarLoopResult]: For program point L168(line 168) no Hoare annotation was computed. [2019-12-07 11:01:34,817 INFO L246 CegarLoopResult]: For program point L102(line 102) no Hoare annotation was computed. [2019-12-07 11:01:34,817 INFO L246 CegarLoopResult]: For program point L36(line 36) no Hoare annotation was computed. [2019-12-07 11:01:34,817 INFO L249 CegarLoopResult]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-12-07 11:01:34,817 INFO L246 CegarLoopResult]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,817 INFO L246 CegarLoopResult]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,817 INFO L246 CegarLoopResult]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,817 INFO L246 CegarLoopResult]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,817 INFO L246 CegarLoopResult]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,817 INFO L246 CegarLoopResult]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,817 INFO L246 CegarLoopResult]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,818 INFO L246 CegarLoopResult]: For program point L171(line 171) no Hoare annotation was computed. [2019-12-07 11:01:34,818 INFO L246 CegarLoopResult]: For program point L105(line 105) no Hoare annotation was computed. [2019-12-07 11:01:34,818 INFO L246 CegarLoopResult]: For program point L39(line 39) no Hoare annotation was computed. [2019-12-07 11:01:34,818 INFO L246 CegarLoopResult]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,818 INFO L246 CegarLoopResult]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,818 INFO L246 CegarLoopResult]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,818 INFO L246 CegarLoopResult]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,818 INFO L246 CegarLoopResult]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,818 INFO L246 CegarLoopResult]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,818 INFO L246 CegarLoopResult]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,818 INFO L246 CegarLoopResult]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,818 INFO L246 CegarLoopResult]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,818 INFO L246 CegarLoopResult]: For program point L174(line 174) no Hoare annotation was computed. [2019-12-07 11:01:34,818 INFO L246 CegarLoopResult]: For program point L108(line 108) no Hoare annotation was computed. [2019-12-07 11:01:34,818 INFO L246 CegarLoopResult]: For program point L42(line 42) no Hoare annotation was computed. [2019-12-07 11:01:34,818 INFO L246 CegarLoopResult]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,819 INFO L242 CegarLoopResult]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse24 (< 245 ~a29~0)) (.cse23 (= ~a25~0 10)) (.cse26 (= ~a25~0 13)) (.cse7 (= ~a25~0 9))) (let ((.cse11 (<= 0 (+ ~a23~0 599772))) (.cse10 (<= ~a29~0 140)) (.cse17 (not .cse7)) (.cse9 (not .cse26)) (.cse20 (<= 312 ~a23~0)) (.cse22 (not .cse23)) (.cse25 (<= (+ ~a29~0 193245) 0)) (.cse6 (<= ~a23~0 312)) (.cse4 (= ~a25~0 11)) (.cse5 (= ~a25~0 12)) (.cse0 (or (<= ~a29~0 243) .cse24)) (.cse19 (<= 130 ~a29~0)) (.cse21 (exists ((v_~a29~0_501 Int)) (and (<= ~a29~0 (+ (mod (+ v_~a29~0_501 26) 52) 192)) (<= 130 v_~a29~0_501) (<= 0 (+ v_~a29~0_501 370578))))) (.cse18 (<= ~a29~0 277)) (.cse8 (< 306 ~a23~0)) (.cse1 (= 1 ~a3~0)) (.cse3 (= 15 ~a8~0)) (.cse16 (<= 141 ~a29~0)) (.cse2 (<= ~a23~0 138)) (.cse12 (= 1 ~a4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse2 .cse3) (and .cse6 .cse7 .cse1 .cse8 .cse9 .cse3 .cse10) (and .cse11 .cse1 .cse2 .cse3) (and .cse11 .cse2 .cse12 .cse4) (and .cse9 (exists ((v_~a23~0_472 Int)) (let ((.cse15 (div v_~a23~0_472 5))) (let ((.cse14 (+ .cse15 371130))) (let ((.cse13 (div .cse14 5))) (and (<= 0 (+ .cse13 1)) (<= 0 v_~a23~0_472) (<= 0 .cse14) (<= 312 v_~a23~0_472) (< 0 (+ .cse15 370824)) (<= (+ ~a23~0 127612) (div .cse13 5)) (<= 0 .cse13) (<= v_~a23~0_472 312)))))) .cse4 .cse12 .cse10) (and .cse6 .cse7 .cse9 .cse12 .cse10) (and .cse5 .cse6 .cse1 .cse3 .cse12) (and .cse0 .cse7 .cse1 .cse16 .cse3 .cse12) (and .cse17 .cse1 .cse9 .cse18 .cse3 .cse12 .cse19 .cse20 .cse21 .cse22) (and .cse5 .cse1 .cse3 .cse19 .cse21) (and .cse11 .cse5 .cse9 .cse2 .cse12 .cse10) (and .cse1 .cse3 .cse23 .cse10) (and .cse1 .cse8 .cse3 .cse18 .cse12 .cse24) (and .cse17 .cse1 .cse9 .cse18 .cse3 .cse12 .cse19 .cse4 .cse20 .cse22) (and .cse25 .cse1 .cse3 .cse12 .cse4) (and .cse2 .cse12 .cse23) (and .cse5 .cse25 .cse1 .cse3) (and .cse0 .cse6 .cse1 .cse3 .cse12 .cse4) (and .cse0 .cse1 .cse3 .cse16 .cse12 .cse4) (and .cse2 .cse18 .cse12 .cse24 .cse4) (and .cse26 .cse2 .cse18 .cse12) (and .cse5 .cse1 .cse3 .cse18 .cse24) (and .cse0 .cse7 .cse1 .cse2 .cse3) (and (exists ((v_~a29~0_504 Int)) (and (<= ~a29~0 (+ (div v_~a29~0_504 5) 206649)) (<= 0 v_~a29~0_504) (<= v_~a29~0_504 140))) (<= 13 ~a25~0) .cse1 .cse8 .cse3 .cse12) (and (<= (+ ~a29~0 181700) ~a23~0) .cse1 .cse3 .cse12 .cse19 .cse21) (and .cse1 .cse3 .cse18 .cse12 .cse23) (and .cse26 .cse1 (<= ~a29~0 130) .cse3 .cse12) (and .cse1 .cse8 .cse3 .cse12 .cse23) (and (<= ~a29~0 206673) .cse26 (< 0 (+ ~a23~0 43)) .cse1 .cse3 .cse16 .cse12) (and .cse7 .cse2 .cse12)))) [2019-12-07 11:01:34,819 INFO L246 CegarLoopResult]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,819 INFO L246 CegarLoopResult]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,819 INFO L246 CegarLoopResult]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,819 INFO L246 CegarLoopResult]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,819 INFO L246 CegarLoopResult]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,819 INFO L246 CegarLoopResult]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,819 INFO L246 CegarLoopResult]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,819 INFO L246 CegarLoopResult]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,819 INFO L246 CegarLoopResult]: For program point L177(line 177) no Hoare annotation was computed. [2019-12-07 11:01:34,819 INFO L246 CegarLoopResult]: For program point L111(line 111) no Hoare annotation was computed. [2019-12-07 11:01:34,819 INFO L246 CegarLoopResult]: For program point L45(line 45) no Hoare annotation was computed. [2019-12-07 11:01:34,819 INFO L246 CegarLoopResult]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-12-07 11:01:34,819 INFO L246 CegarLoopResult]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-12-07 11:01:34,819 INFO L246 CegarLoopResult]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-12-07 11:01:34,820 INFO L246 CegarLoopResult]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-12-07 11:01:34,820 INFO L246 CegarLoopResult]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,820 INFO L246 CegarLoopResult]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,820 INFO L246 CegarLoopResult]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,820 INFO L246 CegarLoopResult]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,820 INFO L246 CegarLoopResult]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,820 INFO L246 CegarLoopResult]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,820 INFO L246 CegarLoopResult]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,820 INFO L246 CegarLoopResult]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,820 INFO L246 CegarLoopResult]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,820 INFO L246 CegarLoopResult]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,820 INFO L246 CegarLoopResult]: For program point L180(line 180) no Hoare annotation was computed. [2019-12-07 11:01:34,820 INFO L246 CegarLoopResult]: For program point L114(line 114) no Hoare annotation was computed. [2019-12-07 11:01:34,820 INFO L246 CegarLoopResult]: For program point L48(line 48) no Hoare annotation was computed. [2019-12-07 11:01:34,820 INFO L246 CegarLoopResult]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-12-07 11:01:34,820 INFO L246 CegarLoopResult]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,820 INFO L246 CegarLoopResult]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,820 INFO L246 CegarLoopResult]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,820 INFO L246 CegarLoopResult]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,820 INFO L246 CegarLoopResult]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,821 INFO L246 CegarLoopResult]: For program point L183(line 183) no Hoare annotation was computed. [2019-12-07 11:01:34,821 INFO L246 CegarLoopResult]: For program point L117(line 117) no Hoare annotation was computed. [2019-12-07 11:01:34,821 INFO L246 CegarLoopResult]: For program point L51(line 51) no Hoare annotation was computed. [2019-12-07 11:01:34,821 INFO L246 CegarLoopResult]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,821 INFO L246 CegarLoopResult]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,821 INFO L246 CegarLoopResult]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,821 INFO L246 CegarLoopResult]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,821 INFO L246 CegarLoopResult]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-12-07 11:01:34,821 INFO L246 CegarLoopResult]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-12-07 11:01:34,821 INFO L246 CegarLoopResult]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,821 INFO L246 CegarLoopResult]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,821 INFO L246 CegarLoopResult]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,821 INFO L246 CegarLoopResult]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,821 INFO L246 CegarLoopResult]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,821 INFO L246 CegarLoopResult]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,821 INFO L246 CegarLoopResult]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-12-07 11:01:34,821 INFO L246 CegarLoopResult]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-12-07 11:01:34,821 INFO L246 CegarLoopResult]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,821 INFO L246 CegarLoopResult]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,821 INFO L246 CegarLoopResult]: For program point L186(line 186) no Hoare annotation was computed. [2019-12-07 11:01:34,822 INFO L246 CegarLoopResult]: For program point L120(line 120) no Hoare annotation was computed. [2019-12-07 11:01:34,822 INFO L246 CegarLoopResult]: For program point L54(line 54) no Hoare annotation was computed. [2019-12-07 11:01:34,822 INFO L246 CegarLoopResult]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,822 INFO L246 CegarLoopResult]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,822 INFO L246 CegarLoopResult]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,822 INFO L246 CegarLoopResult]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,822 INFO L246 CegarLoopResult]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,822 INFO L246 CegarLoopResult]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,822 INFO L246 CegarLoopResult]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,822 INFO L246 CegarLoopResult]: For program point L189(line 189) no Hoare annotation was computed. [2019-12-07 11:01:34,822 INFO L246 CegarLoopResult]: For program point L123(line 123) no Hoare annotation was computed. [2019-12-07 11:01:34,822 INFO L246 CegarLoopResult]: For program point L57(line 57) no Hoare annotation was computed. [2019-12-07 11:01:34,822 INFO L246 CegarLoopResult]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-12-07 11:01:34,822 INFO L246 CegarLoopResult]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-12-07 11:01:34,822 INFO L246 CegarLoopResult]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-12-07 11:01:34,822 INFO L246 CegarLoopResult]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-12-07 11:01:34,822 INFO L246 CegarLoopResult]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,822 INFO L246 CegarLoopResult]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,822 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 11:01:34,822 INFO L246 CegarLoopResult]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-12-07 11:01:34,822 INFO L246 CegarLoopResult]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-12-07 11:01:34,823 INFO L246 CegarLoopResult]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,823 INFO L246 CegarLoopResult]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,823 INFO L246 CegarLoopResult]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,823 INFO L246 CegarLoopResult]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,823 INFO L246 CegarLoopResult]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,823 INFO L246 CegarLoopResult]: For program point L192(line 192) no Hoare annotation was computed. [2019-12-07 11:01:34,823 INFO L246 CegarLoopResult]: For program point L126(line 126) no Hoare annotation was computed. [2019-12-07 11:01:34,823 INFO L246 CegarLoopResult]: For program point L60(line 60) no Hoare annotation was computed. [2019-12-07 11:01:34,823 INFO L246 CegarLoopResult]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,823 INFO L246 CegarLoopResult]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,823 INFO L246 CegarLoopResult]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,823 INFO L246 CegarLoopResult]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,823 INFO L246 CegarLoopResult]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,823 INFO L246 CegarLoopResult]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,823 INFO L246 CegarLoopResult]: For program point L195(line 195) no Hoare annotation was computed. [2019-12-07 11:01:34,823 INFO L246 CegarLoopResult]: For program point L129(line 129) no Hoare annotation was computed. [2019-12-07 11:01:34,823 INFO L246 CegarLoopResult]: For program point L63(line 63) no Hoare annotation was computed. [2019-12-07 11:01:34,823 INFO L246 CegarLoopResult]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,823 INFO L246 CegarLoopResult]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,823 INFO L246 CegarLoopResult]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,824 INFO L246 CegarLoopResult]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,824 INFO L246 CegarLoopResult]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,824 INFO L246 CegarLoopResult]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,824 INFO L246 CegarLoopResult]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,824 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 11:01:34,824 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 141) no Hoare annotation was computed. [2019-12-07 11:01:34,824 INFO L246 CegarLoopResult]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,824 INFO L246 CegarLoopResult]: For program point L198(line 198) no Hoare annotation was computed. [2019-12-07 11:01:34,824 INFO L246 CegarLoopResult]: For program point L132(line 132) no Hoare annotation was computed. [2019-12-07 11:01:34,824 INFO L246 CegarLoopResult]: For program point L66(line 66) no Hoare annotation was computed. [2019-12-07 11:01:34,824 INFO L246 CegarLoopResult]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,824 INFO L246 CegarLoopResult]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,824 INFO L246 CegarLoopResult]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,824 INFO L246 CegarLoopResult]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,824 INFO L246 CegarLoopResult]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,824 INFO L246 CegarLoopResult]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,824 INFO L246 CegarLoopResult]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,824 INFO L246 CegarLoopResult]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,824 INFO L246 CegarLoopResult]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,824 INFO L246 CegarLoopResult]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,825 INFO L246 CegarLoopResult]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,825 INFO L246 CegarLoopResult]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-12-07 11:01:34,825 INFO L246 CegarLoopResult]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-12-07 11:01:34,825 INFO L246 CegarLoopResult]: For program point L201(line 201) no Hoare annotation was computed. [2019-12-07 11:01:34,825 INFO L246 CegarLoopResult]: For program point L135(line 135) no Hoare annotation was computed. [2019-12-07 11:01:34,825 INFO L246 CegarLoopResult]: For program point L69(line 69) no Hoare annotation was computed. [2019-12-07 11:01:34,825 INFO L246 CegarLoopResult]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,825 INFO L246 CegarLoopResult]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,825 INFO L246 CegarLoopResult]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,825 INFO L246 CegarLoopResult]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,825 INFO L246 CegarLoopResult]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,825 INFO L246 CegarLoopResult]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,825 INFO L246 CegarLoopResult]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,825 INFO L246 CegarLoopResult]: For program point L204(line 204) no Hoare annotation was computed. [2019-12-07 11:01:34,825 INFO L246 CegarLoopResult]: For program point L138(line 138) no Hoare annotation was computed. [2019-12-07 11:01:34,825 INFO L246 CegarLoopResult]: For program point L72(line 72) no Hoare annotation was computed. [2019-12-07 11:01:34,825 INFO L246 CegarLoopResult]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,825 INFO L246 CegarLoopResult]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,825 INFO L246 CegarLoopResult]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,825 INFO L246 CegarLoopResult]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-12-07 11:01:34,825 INFO L246 CegarLoopResult]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-12-07 11:01:34,826 INFO L246 CegarLoopResult]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,826 INFO L246 CegarLoopResult]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,826 INFO L246 CegarLoopResult]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,826 INFO L246 CegarLoopResult]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,826 INFO L246 CegarLoopResult]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,826 INFO L246 CegarLoopResult]: For program point L141(line 141) no Hoare annotation was computed. [2019-12-07 11:01:34,826 INFO L246 CegarLoopResult]: For program point L75(line 75) no Hoare annotation was computed. [2019-12-07 11:01:34,826 INFO L246 CegarLoopResult]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,826 INFO L246 CegarLoopResult]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,826 INFO L246 CegarLoopResult]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-12-07 11:01:34,826 INFO L246 CegarLoopResult]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-12-07 11:01:34,826 INFO L246 CegarLoopResult]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,826 INFO L246 CegarLoopResult]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,826 INFO L246 CegarLoopResult]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,826 INFO L246 CegarLoopResult]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,826 INFO L246 CegarLoopResult]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,826 INFO L246 CegarLoopResult]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,826 INFO L246 CegarLoopResult]: For program point L144(line 144) no Hoare annotation was computed. [2019-12-07 11:01:34,826 INFO L246 CegarLoopResult]: For program point L78(line 78) no Hoare annotation was computed. [2019-12-07 11:01:34,826 INFO L246 CegarLoopResult]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-12-07 11:01:34,826 INFO L246 CegarLoopResult]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-12-07 11:01:34,827 INFO L246 CegarLoopResult]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,827 INFO L246 CegarLoopResult]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,827 INFO L246 CegarLoopResult]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,827 INFO L246 CegarLoopResult]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,827 INFO L246 CegarLoopResult]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,827 INFO L246 CegarLoopResult]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,827 INFO L246 CegarLoopResult]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,827 INFO L246 CegarLoopResult]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,827 INFO L246 CegarLoopResult]: For program point L147(line 147) no Hoare annotation was computed. [2019-12-07 11:01:34,827 INFO L246 CegarLoopResult]: For program point L81(line 81) no Hoare annotation was computed. [2019-12-07 11:01:34,827 INFO L246 CegarLoopResult]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-12-07 11:01:34,827 INFO L246 CegarLoopResult]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-12-07 11:01:34,827 INFO L246 CegarLoopResult]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-12-07 11:01:34,827 INFO L246 CegarLoopResult]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-12-07 11:01:34,827 INFO L246 CegarLoopResult]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,827 INFO L246 CegarLoopResult]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,827 INFO L246 CegarLoopResult]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,827 INFO L246 CegarLoopResult]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,827 INFO L246 CegarLoopResult]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,827 INFO L246 CegarLoopResult]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,828 INFO L246 CegarLoopResult]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,828 INFO L246 CegarLoopResult]: For program point L150(line 150) no Hoare annotation was computed. [2019-12-07 11:01:34,828 INFO L246 CegarLoopResult]: For program point L84(line 84) no Hoare annotation was computed. [2019-12-07 11:01:34,828 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 11:01:34,828 INFO L246 CegarLoopResult]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,828 INFO L246 CegarLoopResult]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,828 INFO L246 CegarLoopResult]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,828 INFO L246 CegarLoopResult]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,828 INFO L246 CegarLoopResult]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,828 INFO L246 CegarLoopResult]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,828 INFO L246 CegarLoopResult]: For program point L153(line 153) no Hoare annotation was computed. [2019-12-07 11:01:34,828 INFO L246 CegarLoopResult]: For program point L87(line 87) no Hoare annotation was computed. [2019-12-07 11:01:34,828 INFO L246 CegarLoopResult]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,828 INFO L246 CegarLoopResult]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,828 INFO L246 CegarLoopResult]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,828 INFO L246 CegarLoopResult]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,828 INFO L246 CegarLoopResult]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,828 INFO L246 CegarLoopResult]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,828 INFO L246 CegarLoopResult]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,828 INFO L246 CegarLoopResult]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-12-07 11:01:34,828 INFO L246 CegarLoopResult]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,829 INFO L246 CegarLoopResult]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,829 INFO L246 CegarLoopResult]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,829 INFO L246 CegarLoopResult]: For program point L156(line 156) no Hoare annotation was computed. [2019-12-07 11:01:34,829 INFO L246 CegarLoopResult]: For program point L90(line 90) no Hoare annotation was computed. [2019-12-07 11:01:34,829 INFO L246 CegarLoopResult]: For program point L24(line 24) no Hoare annotation was computed. [2019-12-07 11:01:34,829 INFO L246 CegarLoopResult]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,829 INFO L246 CegarLoopResult]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-12-07 11:01:34,829 INFO L246 CegarLoopResult]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,829 INFO L246 CegarLoopResult]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-12-07 11:01:34,829 INFO L246 CegarLoopResult]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,829 INFO L246 CegarLoopResult]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,829 INFO L246 CegarLoopResult]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,829 INFO L246 CegarLoopResult]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,829 INFO L246 CegarLoopResult]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,829 INFO L246 CegarLoopResult]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,829 INFO L246 CegarLoopResult]: For program point L159(line 159) no Hoare annotation was computed. [2019-12-07 11:01:34,829 INFO L246 CegarLoopResult]: For program point L93(line 93) no Hoare annotation was computed. [2019-12-07 11:01:34,829 INFO L246 CegarLoopResult]: For program point L27(line 27) no Hoare annotation was computed. [2019-12-07 11:01:34,829 INFO L246 CegarLoopResult]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,829 INFO L246 CegarLoopResult]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,829 INFO L246 CegarLoopResult]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,830 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 11:01:34,830 INFO L246 CegarLoopResult]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,830 INFO L246 CegarLoopResult]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,830 INFO L246 CegarLoopResult]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,830 INFO L246 CegarLoopResult]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,830 INFO L246 CegarLoopResult]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,830 INFO L246 CegarLoopResult]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,830 INFO L246 CegarLoopResult]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,830 INFO L246 CegarLoopResult]: For program point L162(line 162) no Hoare annotation was computed. [2019-12-07 11:01:34,830 INFO L246 CegarLoopResult]: For program point L96(line 96) no Hoare annotation was computed. [2019-12-07 11:01:34,830 INFO L246 CegarLoopResult]: For program point L30(line 30) no Hoare annotation was computed. [2019-12-07 11:01:34,830 INFO L246 CegarLoopResult]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,830 INFO L246 CegarLoopResult]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-12-07 11:01:34,830 INFO L246 CegarLoopResult]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-12-07 11:01:34,830 INFO L246 CegarLoopResult]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,830 INFO L246 CegarLoopResult]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,830 INFO L246 CegarLoopResult]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,830 INFO L246 CegarLoopResult]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,830 INFO L246 CegarLoopResult]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,831 INFO L246 CegarLoopResult]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,831 INFO L246 CegarLoopResult]: For program point L165(line 165) no Hoare annotation was computed. [2019-12-07 11:01:34,831 INFO L246 CegarLoopResult]: For program point L99(line 99) no Hoare annotation was computed. [2019-12-07 11:01:34,831 INFO L246 CegarLoopResult]: For program point L33(line 33) no Hoare annotation was computed. [2019-12-07 11:01:34,831 INFO L246 CegarLoopResult]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,831 INFO L246 CegarLoopResult]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,831 INFO L246 CegarLoopResult]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,831 INFO L242 CegarLoopResult]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse24 (< 245 ~a29~0)) (.cse23 (= ~a25~0 10)) (.cse26 (= ~a25~0 13)) (.cse7 (= ~a25~0 9))) (let ((.cse11 (<= 0 (+ ~a23~0 599772))) (.cse10 (<= ~a29~0 140)) (.cse17 (not .cse7)) (.cse9 (not .cse26)) (.cse20 (<= 312 ~a23~0)) (.cse22 (not .cse23)) (.cse25 (<= (+ ~a29~0 193245) 0)) (.cse6 (<= ~a23~0 312)) (.cse4 (= ~a25~0 11)) (.cse5 (= ~a25~0 12)) (.cse0 (or (<= ~a29~0 243) .cse24)) (.cse19 (<= 130 ~a29~0)) (.cse21 (exists ((v_~a29~0_501 Int)) (and (<= ~a29~0 (+ (mod (+ v_~a29~0_501 26) 52) 192)) (<= 130 v_~a29~0_501) (<= 0 (+ v_~a29~0_501 370578))))) (.cse18 (<= ~a29~0 277)) (.cse8 (< 306 ~a23~0)) (.cse1 (= 1 ~a3~0)) (.cse3 (= 15 ~a8~0)) (.cse16 (<= 141 ~a29~0)) (.cse2 (<= ~a23~0 138)) (.cse12 (= 1 ~a4~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse2 .cse3) (and .cse6 .cse7 .cse1 .cse8 .cse9 .cse3 .cse10) (and .cse11 .cse1 .cse2 .cse3) (and .cse11 .cse2 .cse12 .cse4) (and .cse9 (exists ((v_~a23~0_472 Int)) (let ((.cse15 (div v_~a23~0_472 5))) (let ((.cse14 (+ .cse15 371130))) (let ((.cse13 (div .cse14 5))) (and (<= 0 (+ .cse13 1)) (<= 0 v_~a23~0_472) (<= 0 .cse14) (<= 312 v_~a23~0_472) (< 0 (+ .cse15 370824)) (<= (+ ~a23~0 127612) (div .cse13 5)) (<= 0 .cse13) (<= v_~a23~0_472 312)))))) .cse4 .cse12 .cse10) (and .cse6 .cse7 .cse9 .cse12 .cse10) (and .cse5 .cse6 .cse1 .cse3 .cse12) (and .cse0 .cse7 .cse1 .cse16 .cse3 .cse12) (and .cse17 .cse1 .cse9 .cse18 .cse3 .cse12 .cse19 .cse20 .cse21 .cse22) (and .cse5 .cse1 .cse3 .cse19 .cse21) (and .cse11 .cse5 .cse9 .cse2 .cse12 .cse10) (and .cse1 .cse3 .cse23 .cse10) (and .cse1 .cse8 .cse3 .cse18 .cse12 .cse24) (and .cse17 .cse1 .cse9 .cse18 .cse3 .cse12 .cse19 .cse4 .cse20 .cse22) (and .cse25 .cse1 .cse3 .cse12 .cse4) (and .cse2 .cse12 .cse23) (and .cse5 .cse25 .cse1 .cse3) (and .cse0 .cse6 .cse1 .cse3 .cse12 .cse4) (and .cse0 .cse1 .cse3 .cse16 .cse12 .cse4) (and .cse2 .cse18 .cse12 .cse24 .cse4) (and .cse26 .cse2 .cse18 .cse12) (and .cse5 .cse1 .cse3 .cse18 .cse24) (and .cse0 .cse7 .cse1 .cse2 .cse3) (and (exists ((v_~a29~0_504 Int)) (and (<= ~a29~0 (+ (div v_~a29~0_504 5) 206649)) (<= 0 v_~a29~0_504) (<= v_~a29~0_504 140))) (<= 13 ~a25~0) .cse1 .cse8 .cse3 .cse12) (and (<= (+ ~a29~0 181700) ~a23~0) .cse1 .cse3 .cse12 .cse19 .cse21) (and .cse1 .cse3 .cse18 .cse12 .cse23) (and .cse26 .cse1 (<= ~a29~0 130) .cse3 .cse12) (and .cse1 .cse8 .cse3 .cse12 .cse23) (and (<= ~a29~0 206673) .cse26 (< 0 (+ ~a23~0 43)) .cse1 .cse3 .cse16 .cse12) (and .cse7 .cse2 .cse12)))) [2019-12-07 11:01:34,831 INFO L246 CegarLoopResult]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,831 INFO L246 CegarLoopResult]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-12-07 11:01:34,831 INFO L246 CegarLoopResult]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-12-07 11:01:34,831 INFO L246 CegarLoopResult]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,831 INFO L246 CegarLoopResult]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,832 INFO L246 CegarLoopResult]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-12-07 11:01:34,832 INFO L246 CegarLoopResult]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,832 INFO L246 CegarLoopResult]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,832 INFO L246 CegarLoopResult]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-12-07 11:01:34,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:34,841 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:34,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:34,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:34,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:34,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:34,842 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:34,843 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:34,843 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:34,843 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:34,843 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:34,843 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:34,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:34,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:34,844 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 11:01:34,845 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 11:01:34,845 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 11:01:34,845 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:34,845 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:34,845 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:34,853 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:34,854 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:34,854 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:34,854 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:34,854 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:34,854 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:34,855 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:34,855 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:34,855 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:34,855 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:34,855 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:34,855 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:34,856 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:34,856 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:34,856 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 11:01:34,856 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 11:01:34,856 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 11:01:34,857 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:34,857 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:34,857 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:34,859 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:34,859 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:34,859 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:34,860 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:34,860 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:34,860 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:34,860 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:34,860 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:34,861 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:34,861 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:34,861 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:34,861 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:34,861 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:34,862 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:34,862 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 11:01:34,862 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 11:01:34,862 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 11:01:34,862 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:34,863 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:34,863 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:34,864 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:34,865 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:34,865 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:34,865 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:34,865 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:34,865 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:34,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:34,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:34,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:34,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:34,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:34,867 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:34,867 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:34,867 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:34,867 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 11:01:34,868 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 11:01:34,868 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 11:01:34,868 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:34,868 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:34,868 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:34,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:01:34 BoogieIcfgContainer [2019-12-07 11:01:34,871 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:01:34,871 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:01:34,871 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:01:34,871 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:01:34,871 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:59:57" (3/4) ... [2019-12-07 11:01:34,874 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 11:01:34,891 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 11:01:34,893 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 11:01:34,913 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((a29 <= 243 || 245 < a29) && 1 == a3) && a23 <= 138) && 15 == a8) && a25 == 11) || (((a25 == 12 && 1 == a3) && a23 <= 138) && 15 == a8)) || ((((((a23 <= 312 && a25 == 9) && 1 == a3) && 306 < a23) && !(a25 == 13)) && 15 == a8) && a29 <= 140)) || (((0 <= a23 + 599772 && 1 == a3) && a23 <= 138) && 15 == a8)) || (((0 <= a23 + 599772 && a23 <= 138) && 1 == a4) && a25 == 11)) || ((((!(a25 == 13) && (\exists v_~a23~0_472 : int :: ((((((0 <= (v_~a23~0_472 / 5 + 371130) / 5 + 1 && 0 <= v_~a23~0_472) && 0 <= v_~a23~0_472 / 5 + 371130) && 312 <= v_~a23~0_472) && 0 < v_~a23~0_472 / 5 + 370824) && a23 + 127612 <= (v_~a23~0_472 / 5 + 371130) / 5 / 5) && 0 <= (v_~a23~0_472 / 5 + 371130) / 5) && v_~a23~0_472 <= 312)) && a25 == 11) && 1 == a4) && a29 <= 140)) || ((((a23 <= 312 && a25 == 9) && !(a25 == 13)) && 1 == a4) && a29 <= 140)) || ((((a25 == 12 && a23 <= 312) && 1 == a3) && 15 == a8) && 1 == a4)) || ((((((a29 <= 243 || 245 < a29) && a25 == 9) && 1 == a3) && 141 <= a29) && 15 == a8) && 1 == a4)) || (((((((((!(a25 == 9) && 1 == a3) && !(a25 == 13)) && a29 <= 277) && 15 == a8) && 1 == a4) && 130 <= a29) && 312 <= a23) && (\exists v_~a29~0_501 : int :: (a29 <= (v_~a29~0_501 + 26) % 52 + 192 && 130 <= v_~a29~0_501) && 0 <= v_~a29~0_501 + 370578)) && !(a25 == 10))) || ((((a25 == 12 && 1 == a3) && 15 == a8) && 130 <= a29) && (\exists v_~a29~0_501 : int :: (a29 <= (v_~a29~0_501 + 26) % 52 + 192 && 130 <= v_~a29~0_501) && 0 <= v_~a29~0_501 + 370578))) || (((((0 <= a23 + 599772 && a25 == 12) && !(a25 == 13)) && a23 <= 138) && 1 == a4) && a29 <= 140)) || (((1 == a3 && 15 == a8) && a25 == 10) && a29 <= 140)) || (((((1 == a3 && 306 < a23) && 15 == a8) && a29 <= 277) && 1 == a4) && 245 < a29)) || (((((((((!(a25 == 9) && 1 == a3) && !(a25 == 13)) && a29 <= 277) && 15 == a8) && 1 == a4) && 130 <= a29) && a25 == 11) && 312 <= a23) && !(a25 == 10))) || ((((a29 + 193245 <= 0 && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 11)) || ((a23 <= 138 && 1 == a4) && a25 == 10)) || (((a25 == 12 && a29 + 193245 <= 0) && 1 == a3) && 15 == a8)) || ((((((a29 <= 243 || 245 < a29) && a23 <= 312) && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 11)) || ((((((a29 <= 243 || 245 < a29) && 1 == a3) && 15 == a8) && 141 <= a29) && 1 == a4) && a25 == 11)) || ((((a23 <= 138 && a29 <= 277) && 1 == a4) && 245 < a29) && a25 == 11)) || (((a25 == 13 && a23 <= 138) && a29 <= 277) && 1 == a4)) || ((((a25 == 12 && 1 == a3) && 15 == a8) && a29 <= 277) && 245 < a29)) || (((((a29 <= 243 || 245 < a29) && a25 == 9) && 1 == a3) && a23 <= 138) && 15 == a8)) || ((((((\exists v_~a29~0_504 : int :: (a29 <= v_~a29~0_504 / 5 + 206649 && 0 <= v_~a29~0_504) && v_~a29~0_504 <= 140) && 13 <= a25) && 1 == a3) && 306 < a23) && 15 == a8) && 1 == a4)) || (((((a29 + 181700 <= a23 && 1 == a3) && 15 == a8) && 1 == a4) && 130 <= a29) && (\exists v_~a29~0_501 : int :: (a29 <= (v_~a29~0_501 + 26) % 52 + 192 && 130 <= v_~a29~0_501) && 0 <= v_~a29~0_501 + 370578))) || ((((1 == a3 && 15 == a8) && a29 <= 277) && 1 == a4) && a25 == 10)) || ((((a25 == 13 && 1 == a3) && a29 <= 130) && 15 == a8) && 1 == a4)) || ((((1 == a3 && 306 < a23) && 15 == a8) && 1 == a4) && a25 == 10)) || ((((((a29 <= 206673 && a25 == 13) && 0 < a23 + 43) && 1 == a3) && 15 == a8) && 141 <= a29) && 1 == a4)) || ((a25 == 9 && a23 <= 138) && 1 == a4) [2019-12-07 11:01:34,915 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((a29 <= 243 || 245 < a29) && 1 == a3) && a23 <= 138) && 15 == a8) && a25 == 11) || (((a25 == 12 && 1 == a3) && a23 <= 138) && 15 == a8)) || ((((((a23 <= 312 && a25 == 9) && 1 == a3) && 306 < a23) && !(a25 == 13)) && 15 == a8) && a29 <= 140)) || (((0 <= a23 + 599772 && 1 == a3) && a23 <= 138) && 15 == a8)) || (((0 <= a23 + 599772 && a23 <= 138) && 1 == a4) && a25 == 11)) || ((((!(a25 == 13) && (\exists v_~a23~0_472 : int :: ((((((0 <= (v_~a23~0_472 / 5 + 371130) / 5 + 1 && 0 <= v_~a23~0_472) && 0 <= v_~a23~0_472 / 5 + 371130) && 312 <= v_~a23~0_472) && 0 < v_~a23~0_472 / 5 + 370824) && a23 + 127612 <= (v_~a23~0_472 / 5 + 371130) / 5 / 5) && 0 <= (v_~a23~0_472 / 5 + 371130) / 5) && v_~a23~0_472 <= 312)) && a25 == 11) && 1 == a4) && a29 <= 140)) || ((((a23 <= 312 && a25 == 9) && !(a25 == 13)) && 1 == a4) && a29 <= 140)) || ((((a25 == 12 && a23 <= 312) && 1 == a3) && 15 == a8) && 1 == a4)) || ((((((a29 <= 243 || 245 < a29) && a25 == 9) && 1 == a3) && 141 <= a29) && 15 == a8) && 1 == a4)) || (((((((((!(a25 == 9) && 1 == a3) && !(a25 == 13)) && a29 <= 277) && 15 == a8) && 1 == a4) && 130 <= a29) && 312 <= a23) && (\exists v_~a29~0_501 : int :: (a29 <= (v_~a29~0_501 + 26) % 52 + 192 && 130 <= v_~a29~0_501) && 0 <= v_~a29~0_501 + 370578)) && !(a25 == 10))) || ((((a25 == 12 && 1 == a3) && 15 == a8) && 130 <= a29) && (\exists v_~a29~0_501 : int :: (a29 <= (v_~a29~0_501 + 26) % 52 + 192 && 130 <= v_~a29~0_501) && 0 <= v_~a29~0_501 + 370578))) || (((((0 <= a23 + 599772 && a25 == 12) && !(a25 == 13)) && a23 <= 138) && 1 == a4) && a29 <= 140)) || (((1 == a3 && 15 == a8) && a25 == 10) && a29 <= 140)) || (((((1 == a3 && 306 < a23) && 15 == a8) && a29 <= 277) && 1 == a4) && 245 < a29)) || (((((((((!(a25 == 9) && 1 == a3) && !(a25 == 13)) && a29 <= 277) && 15 == a8) && 1 == a4) && 130 <= a29) && a25 == 11) && 312 <= a23) && !(a25 == 10))) || ((((a29 + 193245 <= 0 && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 11)) || ((a23 <= 138 && 1 == a4) && a25 == 10)) || (((a25 == 12 && a29 + 193245 <= 0) && 1 == a3) && 15 == a8)) || ((((((a29 <= 243 || 245 < a29) && a23 <= 312) && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 11)) || ((((((a29 <= 243 || 245 < a29) && 1 == a3) && 15 == a8) && 141 <= a29) && 1 == a4) && a25 == 11)) || ((((a23 <= 138 && a29 <= 277) && 1 == a4) && 245 < a29) && a25 == 11)) || (((a25 == 13 && a23 <= 138) && a29 <= 277) && 1 == a4)) || ((((a25 == 12 && 1 == a3) && 15 == a8) && a29 <= 277) && 245 < a29)) || (((((a29 <= 243 || 245 < a29) && a25 == 9) && 1 == a3) && a23 <= 138) && 15 == a8)) || ((((((\exists v_~a29~0_504 : int :: (a29 <= v_~a29~0_504 / 5 + 206649 && 0 <= v_~a29~0_504) && v_~a29~0_504 <= 140) && 13 <= a25) && 1 == a3) && 306 < a23) && 15 == a8) && 1 == a4)) || (((((a29 + 181700 <= a23 && 1 == a3) && 15 == a8) && 1 == a4) && 130 <= a29) && (\exists v_~a29~0_501 : int :: (a29 <= (v_~a29~0_501 + 26) % 52 + 192 && 130 <= v_~a29~0_501) && 0 <= v_~a29~0_501 + 370578))) || ((((1 == a3 && 15 == a8) && a29 <= 277) && 1 == a4) && a25 == 10)) || ((((a25 == 13 && 1 == a3) && a29 <= 130) && 15 == a8) && 1 == a4)) || ((((1 == a3 && 306 < a23) && 15 == a8) && 1 == a4) && a25 == 10)) || ((((((a29 <= 206673 && a25 == 13) && 0 < a23 + 43) && 1 == a3) && 15 == a8) && 141 <= a29) && 1 == a4)) || ((a25 == 9 && a23 <= 138) && 1 == a4) [2019-12-07 11:01:34,999 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_380e5fd2-bd2c-4bf3-8772-62c7ca4338b9/bin/uautomizer/witness.graphml [2019-12-07 11:01:34,999 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:01:35,000 INFO L168 Benchmark]: Toolchain (without parser) took 99335.00 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 935.5 MB in the beginning and 1.3 GB in the end (delta: -337.8 MB). Peak memory consumption was 767.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:01:35,000 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 954.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:01:35,000 INFO L168 Benchmark]: CACSL2BoogieTranslator took 467.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -153.5 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:01:35,000 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:01:35,001 INFO L168 Benchmark]: Boogie Preprocessor took 69.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:01:35,001 INFO L168 Benchmark]: RCFGBuilder took 1029.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 886.2 MB in the end (delta: 173.6 MB). Peak memory consumption was 173.6 MB. Max. memory is 11.5 GB. [2019-12-07 11:01:35,001 INFO L168 Benchmark]: TraceAbstraction took 97559.78 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 970.5 MB). Free memory was 886.2 MB in the beginning and 1.3 GB in the end (delta: -444.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-12-07 11:01:35,001 INFO L168 Benchmark]: Witness Printer took 127.95 ms. Allocated memory is still 2.1 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:01:35,003 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 954.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 467.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -153.5 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 77.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1029.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 886.2 MB in the end (delta: 173.6 MB). Peak memory consumption was 173.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 97559.78 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 970.5 MB). Free memory was 886.2 MB in the beginning and 1.3 GB in the end (delta: -444.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 127.95 ms. Allocated memory is still 2.1 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 141]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant [2019-12-07 11:01:35,007 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:35,008 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:35,008 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:35,008 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:35,009 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:35,009 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:35,009 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:35,009 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:35,010 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:35,010 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:35,010 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:35,010 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:35,010 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:35,011 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:35,011 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 11:01:35,011 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 11:01:35,011 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 11:01:35,011 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:35,011 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:35,011 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:35,013 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:35,013 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:35,013 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:35,013 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:35,013 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:35,014 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:35,014 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:35,014 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:35,014 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:35,014 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:35,014 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:35,014 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:35,015 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:35,015 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:35,015 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 11:01:35,015 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 11:01:35,015 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 11:01:35,015 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:35,015 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:35,015 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((((a29 <= 243 || 245 < a29) && 1 == a3) && a23 <= 138) && 15 == a8) && a25 == 11) || (((a25 == 12 && 1 == a3) && a23 <= 138) && 15 == a8)) || ((((((a23 <= 312 && a25 == 9) && 1 == a3) && 306 < a23) && !(a25 == 13)) && 15 == a8) && a29 <= 140)) || (((0 <= a23 + 599772 && 1 == a3) && a23 <= 138) && 15 == a8)) || (((0 <= a23 + 599772 && a23 <= 138) && 1 == a4) && a25 == 11)) || ((((!(a25 == 13) && (\exists v_~a23~0_472 : int :: ((((((0 <= (v_~a23~0_472 / 5 + 371130) / 5 + 1 && 0 <= v_~a23~0_472) && 0 <= v_~a23~0_472 / 5 + 371130) && 312 <= v_~a23~0_472) && 0 < v_~a23~0_472 / 5 + 370824) && a23 + 127612 <= (v_~a23~0_472 / 5 + 371130) / 5 / 5) && 0 <= (v_~a23~0_472 / 5 + 371130) / 5) && v_~a23~0_472 <= 312)) && a25 == 11) && 1 == a4) && a29 <= 140)) || ((((a23 <= 312 && a25 == 9) && !(a25 == 13)) && 1 == a4) && a29 <= 140)) || ((((a25 == 12 && a23 <= 312) && 1 == a3) && 15 == a8) && 1 == a4)) || ((((((a29 <= 243 || 245 < a29) && a25 == 9) && 1 == a3) && 141 <= a29) && 15 == a8) && 1 == a4)) || (((((((((!(a25 == 9) && 1 == a3) && !(a25 == 13)) && a29 <= 277) && 15 == a8) && 1 == a4) && 130 <= a29) && 312 <= a23) && (\exists v_~a29~0_501 : int :: (a29 <= (v_~a29~0_501 + 26) % 52 + 192 && 130 <= v_~a29~0_501) && 0 <= v_~a29~0_501 + 370578)) && !(a25 == 10))) || ((((a25 == 12 && 1 == a3) && 15 == a8) && 130 <= a29) && (\exists v_~a29~0_501 : int :: (a29 <= (v_~a29~0_501 + 26) % 52 + 192 && 130 <= v_~a29~0_501) && 0 <= v_~a29~0_501 + 370578))) || (((((0 <= a23 + 599772 && a25 == 12) && !(a25 == 13)) && a23 <= 138) && 1 == a4) && a29 <= 140)) || (((1 == a3 && 15 == a8) && a25 == 10) && a29 <= 140)) || (((((1 == a3 && 306 < a23) && 15 == a8) && a29 <= 277) && 1 == a4) && 245 < a29)) || (((((((((!(a25 == 9) && 1 == a3) && !(a25 == 13)) && a29 <= 277) && 15 == a8) && 1 == a4) && 130 <= a29) && a25 == 11) && 312 <= a23) && !(a25 == 10))) || ((((a29 + 193245 <= 0 && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 11)) || ((a23 <= 138 && 1 == a4) && a25 == 10)) || (((a25 == 12 && a29 + 193245 <= 0) && 1 == a3) && 15 == a8)) || ((((((a29 <= 243 || 245 < a29) && a23 <= 312) && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 11)) || ((((((a29 <= 243 || 245 < a29) && 1 == a3) && 15 == a8) && 141 <= a29) && 1 == a4) && a25 == 11)) || ((((a23 <= 138 && a29 <= 277) && 1 == a4) && 245 < a29) && a25 == 11)) || (((a25 == 13 && a23 <= 138) && a29 <= 277) && 1 == a4)) || ((((a25 == 12 && 1 == a3) && 15 == a8) && a29 <= 277) && 245 < a29)) || (((((a29 <= 243 || 245 < a29) && a25 == 9) && 1 == a3) && a23 <= 138) && 15 == a8)) || ((((((\exists v_~a29~0_504 : int :: (a29 <= v_~a29~0_504 / 5 + 206649 && 0 <= v_~a29~0_504) && v_~a29~0_504 <= 140) && 13 <= a25) && 1 == a3) && 306 < a23) && 15 == a8) && 1 == a4)) || (((((a29 + 181700 <= a23 && 1 == a3) && 15 == a8) && 1 == a4) && 130 <= a29) && (\exists v_~a29~0_501 : int :: (a29 <= (v_~a29~0_501 + 26) % 52 + 192 && 130 <= v_~a29~0_501) && 0 <= v_~a29~0_501 + 370578))) || ((((1 == a3 && 15 == a8) && a29 <= 277) && 1 == a4) && a25 == 10)) || ((((a25 == 13 && 1 == a3) && a29 <= 130) && 15 == a8) && 1 == a4)) || ((((1 == a3 && 306 < a23) && 15 == a8) && 1 == a4) && a25 == 10)) || ((((((a29 <= 206673 && a25 == 13) && 0 < a23 + 43) && 1 == a3) && 15 == a8) && 141 <= a29) && 1 == a4)) || ((a25 == 9 && a23 <= 138) && 1 == a4) - InvariantResult [Line: 22]: Loop Invariant [2019-12-07 11:01:35,016 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:35,017 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:35,017 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:35,017 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:35,017 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:35,017 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:35,017 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:35,018 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:35,018 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:35,018 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:35,018 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:35,018 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:35,018 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:35,018 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:35,019 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 11:01:35,019 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 11:01:35,019 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 11:01:35,019 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:35,019 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:35,019 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:35,020 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:35,020 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:35,021 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:35,021 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:35,021 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:35,021 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:35,021 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:35,021 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_472,QUANTIFIED] [2019-12-07 11:01:35,021 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:35,022 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:35,022 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:35,022 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:35,022 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:35,022 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:35,022 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 11:01:35,022 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 11:01:35,023 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-12-07 11:01:35,023 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:35,023 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] [2019-12-07 11:01:35,023 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_501,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((((a29 <= 243 || 245 < a29) && 1 == a3) && a23 <= 138) && 15 == a8) && a25 == 11) || (((a25 == 12 && 1 == a3) && a23 <= 138) && 15 == a8)) || ((((((a23 <= 312 && a25 == 9) && 1 == a3) && 306 < a23) && !(a25 == 13)) && 15 == a8) && a29 <= 140)) || (((0 <= a23 + 599772 && 1 == a3) && a23 <= 138) && 15 == a8)) || (((0 <= a23 + 599772 && a23 <= 138) && 1 == a4) && a25 == 11)) || ((((!(a25 == 13) && (\exists v_~a23~0_472 : int :: ((((((0 <= (v_~a23~0_472 / 5 + 371130) / 5 + 1 && 0 <= v_~a23~0_472) && 0 <= v_~a23~0_472 / 5 + 371130) && 312 <= v_~a23~0_472) && 0 < v_~a23~0_472 / 5 + 370824) && a23 + 127612 <= (v_~a23~0_472 / 5 + 371130) / 5 / 5) && 0 <= (v_~a23~0_472 / 5 + 371130) / 5) && v_~a23~0_472 <= 312)) && a25 == 11) && 1 == a4) && a29 <= 140)) || ((((a23 <= 312 && a25 == 9) && !(a25 == 13)) && 1 == a4) && a29 <= 140)) || ((((a25 == 12 && a23 <= 312) && 1 == a3) && 15 == a8) && 1 == a4)) || ((((((a29 <= 243 || 245 < a29) && a25 == 9) && 1 == a3) && 141 <= a29) && 15 == a8) && 1 == a4)) || (((((((((!(a25 == 9) && 1 == a3) && !(a25 == 13)) && a29 <= 277) && 15 == a8) && 1 == a4) && 130 <= a29) && 312 <= a23) && (\exists v_~a29~0_501 : int :: (a29 <= (v_~a29~0_501 + 26) % 52 + 192 && 130 <= v_~a29~0_501) && 0 <= v_~a29~0_501 + 370578)) && !(a25 == 10))) || ((((a25 == 12 && 1 == a3) && 15 == a8) && 130 <= a29) && (\exists v_~a29~0_501 : int :: (a29 <= (v_~a29~0_501 + 26) % 52 + 192 && 130 <= v_~a29~0_501) && 0 <= v_~a29~0_501 + 370578))) || (((((0 <= a23 + 599772 && a25 == 12) && !(a25 == 13)) && a23 <= 138) && 1 == a4) && a29 <= 140)) || (((1 == a3 && 15 == a8) && a25 == 10) && a29 <= 140)) || (((((1 == a3 && 306 < a23) && 15 == a8) && a29 <= 277) && 1 == a4) && 245 < a29)) || (((((((((!(a25 == 9) && 1 == a3) && !(a25 == 13)) && a29 <= 277) && 15 == a8) && 1 == a4) && 130 <= a29) && a25 == 11) && 312 <= a23) && !(a25 == 10))) || ((((a29 + 193245 <= 0 && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 11)) || ((a23 <= 138 && 1 == a4) && a25 == 10)) || (((a25 == 12 && a29 + 193245 <= 0) && 1 == a3) && 15 == a8)) || ((((((a29 <= 243 || 245 < a29) && a23 <= 312) && 1 == a3) && 15 == a8) && 1 == a4) && a25 == 11)) || ((((((a29 <= 243 || 245 < a29) && 1 == a3) && 15 == a8) && 141 <= a29) && 1 == a4) && a25 == 11)) || ((((a23 <= 138 && a29 <= 277) && 1 == a4) && 245 < a29) && a25 == 11)) || (((a25 == 13 && a23 <= 138) && a29 <= 277) && 1 == a4)) || ((((a25 == 12 && 1 == a3) && 15 == a8) && a29 <= 277) && 245 < a29)) || (((((a29 <= 243 || 245 < a29) && a25 == 9) && 1 == a3) && a23 <= 138) && 15 == a8)) || ((((((\exists v_~a29~0_504 : int :: (a29 <= v_~a29~0_504 / 5 + 206649 && 0 <= v_~a29~0_504) && v_~a29~0_504 <= 140) && 13 <= a25) && 1 == a3) && 306 < a23) && 15 == a8) && 1 == a4)) || (((((a29 + 181700 <= a23 && 1 == a3) && 15 == a8) && 1 == a4) && 130 <= a29) && (\exists v_~a29~0_501 : int :: (a29 <= (v_~a29~0_501 + 26) % 52 + 192 && 130 <= v_~a29~0_501) && 0 <= v_~a29~0_501 + 370578))) || ((((1 == a3 && 15 == a8) && a29 <= 277) && 1 == a4) && a25 == 10)) || ((((a25 == 13 && 1 == a3) && a29 <= 130) && 15 == a8) && 1 == a4)) || ((((1 == a3 && 306 < a23) && 15 == a8) && 1 == a4) && a25 == 10)) || ((((((a29 <= 206673 && a25 == 13) && 0 < a23 + 43) && 1 == a3) && 15 == a8) && 141 <= a29) && 1 == a4)) || ((a25 == 9 && a23 <= 138) && 1 == a4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Result: SAFE, OverallTime: 89.1s, OverallIterations: 13, TraceHistogramMax: 6, AutomataDifference: 76.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.2s, HoareTripleCheckerStatistics: 1919 SDtfs, 18953 SDslu, 1284 SDs, 0 SdLazy, 46648 SolverSat, 6372 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 64.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2040 GetRequests, 1902 SyntacticMatches, 6 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 958 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27389occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 35639 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 290 NumberOfFragments, 1379 HoareAnnotationTreeSize, 3 FomulaSimplifications, 46668 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 46464 FormulaSimplificationTreeSizeReductionInter, 6.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 5943 NumberOfCodeBlocks, 5943 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 5926 ConstructedInterpolants, 508 QuantifiedInterpolants, 20713806 SizeOfPredicates, 9 NumberOfNonLiveVariables, 2395 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 17 InterpolantComputations, 9 PerfectInterpolantSequences, 5645/7449 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...