./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem17_label19.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_00b127c2-e00f-4824-80fe-40c8a266fdb0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_00b127c2-e00f-4824-80fe-40c8a266fdb0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_00b127c2-e00f-4824-80fe-40c8a266fdb0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_00b127c2-e00f-4824-80fe-40c8a266fdb0/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem17_label19.c -s /tmp/vcloud-vcloud-master/worker/run_dir_00b127c2-e00f-4824-80fe-40c8a266fdb0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_00b127c2-e00f-4824-80fe-40c8a266fdb0/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 ae44815abe4c47f139211779a869862d37e7c620 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 12:52:42,015 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:52:42,016 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:52:42,024 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:52:42,024 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:52:42,025 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:52:42,026 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:52:42,027 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:52:42,028 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:52:42,029 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:52:42,030 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:52:42,030 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:52:42,031 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:52:42,031 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:52:42,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:52:42,033 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:52:42,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:52:42,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:52:42,035 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:52:42,037 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:52:42,038 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:52:42,039 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:52:42,039 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:52:42,040 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:52:42,041 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:52:42,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:52:42,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:52:42,042 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:52:42,042 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:52:42,043 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:52:42,043 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:52:42,044 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:52:42,044 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:52:42,044 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:52:42,045 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:52:42,045 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:52:42,045 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:52:42,046 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:52:42,046 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:52:42,046 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:52:42,047 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:52:42,047 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_00b127c2-e00f-4824-80fe-40c8a266fdb0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 12:52:42,056 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:52:42,056 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:52:42,057 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:52:42,057 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:52:42,057 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:52:42,057 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:52:42,057 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:52:42,057 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:52:42,058 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:52:42,058 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:52:42,058 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:52:42,058 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:52:42,058 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:52:42,058 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:52:42,058 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:52:42,058 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:52:42,058 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:52:42,058 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:52:42,059 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:52:42,059 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:52:42,059 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:52:42,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:52:42,059 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:52:42,059 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:52:42,059 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:52:42,059 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 12:52:42,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:52:42,060 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:52:42,060 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:52:42,060 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_00b127c2-e00f-4824-80fe-40c8a266fdb0/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 -> ae44815abe4c47f139211779a869862d37e7c620 [2019-12-07 12:52:42,161 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:52:42,171 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:52:42,174 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:52:42,175 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:52:42,175 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:52:42,176 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_00b127c2-e00f-4824-80fe-40c8a266fdb0/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem17_label19.c [2019-12-07 12:52:42,212 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_00b127c2-e00f-4824-80fe-40c8a266fdb0/bin/uautomizer/data/22f32b4f1/5a9bc54cc020434984570b9ed6c92184/FLAGe1242e17b [2019-12-07 12:52:42,675 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:52:42,675 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_00b127c2-e00f-4824-80fe-40c8a266fdb0/sv-benchmarks/c/eca-rers2012/Problem17_label19.c [2019-12-07 12:52:42,690 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_00b127c2-e00f-4824-80fe-40c8a266fdb0/bin/uautomizer/data/22f32b4f1/5a9bc54cc020434984570b9ed6c92184/FLAGe1242e17b [2019-12-07 12:52:42,983 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_00b127c2-e00f-4824-80fe-40c8a266fdb0/bin/uautomizer/data/22f32b4f1/5a9bc54cc020434984570b9ed6c92184 [2019-12-07 12:52:42,986 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:52:42,988 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:52:42,989 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:52:42,989 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:52:42,993 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:52:42,994 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:52:42" (1/1) ... [2019-12-07 12:52:42,998 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29b99664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:52:42, skipping insertion in model container [2019-12-07 12:52:42,998 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:52:42" (1/1) ... [2019-12-07 12:52:43,007 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:52:43,110 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:52:43,641 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:52:43,644 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:52:43,873 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:52:43,885 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:52:43,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:52:43 WrapperNode [2019-12-07 12:52:43,886 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:52:43,886 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:52:43,886 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:52:43,887 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:52:43,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:52:43" (1/1) ... [2019-12-07 12:52:43,920 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:52:43" (1/1) ... [2019-12-07 12:52:44,055 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:52:44,056 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:52:44,056 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:52:44,056 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:52:44,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:52:43" (1/1) ... [2019-12-07 12:52:44,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:52:43" (1/1) ... [2019-12-07 12:52:44,078 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:52:43" (1/1) ... [2019-12-07 12:52:44,078 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:52:43" (1/1) ... [2019-12-07 12:52:44,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:52:43" (1/1) ... [2019-12-07 12:52:44,163 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:52:43" (1/1) ... [2019-12-07 12:52:44,195 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:52:43" (1/1) ... [2019-12-07 12:52:44,224 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:52:44,225 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:52:44,225 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:52:44,225 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:52:44,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:52:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00b127c2-e00f-4824-80fe-40c8a266fdb0/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 12:52:44,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:52:44,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:52:46,692 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:52:46,692 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-12-07 12:52:46,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:52:46 BoogieIcfgContainer [2019-12-07 12:52:46,693 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:52:46,694 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:52:46,694 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:52:46,695 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:52:46,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:52:42" (1/3) ... [2019-12-07 12:52:46,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bcb7130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:52:46, skipping insertion in model container [2019-12-07 12:52:46,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:52:43" (2/3) ... [2019-12-07 12:52:46,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bcb7130 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:52:46, skipping insertion in model container [2019-12-07 12:52:46,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:52:46" (3/3) ... [2019-12-07 12:52:46,697 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem17_label19.c [2019-12-07 12:52:46,704 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:52:46,709 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 12:52:46,716 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 12:52:46,736 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:52:46,736 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:52:46,736 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:52:46,736 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:52:46,736 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:52:46,736 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:52:46,736 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:52:46,736 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:52:46,756 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states. [2019-12-07 12:52:46,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 12:52:46,761 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:52:46,761 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] [2019-12-07 12:52:46,762 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:52:46,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:52:46,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1824112922, now seen corresponding path program 1 times [2019-12-07 12:52:46,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:52:46,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575329600] [2019-12-07 12:52:46,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:52:46,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:52:46,941 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 12:52:46,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575329600] [2019-12-07 12:52:46,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:52:46,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:52:46,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529140194] [2019-12-07 12:52:46,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:52:46,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:52:46,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:52:46,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:52:46,957 INFO L87 Difference]: Start difference. First operand 590 states. Second operand 4 states. [2019-12-07 12:52:51,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:52:51,098 INFO L93 Difference]: Finished difference Result 2089 states and 3897 transitions. [2019-12-07 12:52:51,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:52:51,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-07 12:52:51,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:52:51,120 INFO L225 Difference]: With dead ends: 2089 [2019-12-07 12:52:51,120 INFO L226 Difference]: Without dead ends: 1419 [2019-12-07 12:52:51,125 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 12:52:51,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2019-12-07 12:52:51,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1412. [2019-12-07 12:52:51,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2019-12-07 12:52:51,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2069 transitions. [2019-12-07 12:52:51,201 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2069 transitions. Word has length 42 [2019-12-07 12:52:51,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:52:51,202 INFO L462 AbstractCegarLoop]: Abstraction has 1412 states and 2069 transitions. [2019-12-07 12:52:51,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:52:51,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2069 transitions. [2019-12-07 12:52:51,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-07 12:52:51,206 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:52:51,207 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:52:51,207 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:52:51,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:52:51,207 INFO L82 PathProgramCache]: Analyzing trace with hash 214146598, now seen corresponding path program 1 times [2019-12-07 12:52:51,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:52:51,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236454465] [2019-12-07 12:52:51,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:52:51,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:52:51,378 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:52:51,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236454465] [2019-12-07 12:52:51,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533127532] [2019-12-07 12:52:51,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00b127c2-e00f-4824-80fe-40c8a266fdb0/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 12:52:51,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:52:51,431 INFO L264 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:52:51,437 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:52:51,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:52:51,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:52:51,904 WARN L192 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 21 [2019-12-07 12:52:51,994 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:52:51,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 12:52:51,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-12-07 12:52:51,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889934045] [2019-12-07 12:52:51,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:52:51,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:52:51,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:52:51,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:52:51,997 INFO L87 Difference]: Start difference. First operand 1412 states and 2069 transitions. Second operand 4 states. [2019-12-07 12:52:57,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:52:57,069 INFO L93 Difference]: Finished difference Result 4589 states and 6895 transitions. [2019-12-07 12:52:57,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:52:57,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-12-07 12:52:57,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:52:57,082 INFO L225 Difference]: With dead ends: 4589 [2019-12-07 12:52:57,083 INFO L226 Difference]: Without dead ends: 3179 [2019-12-07 12:52:57,085 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:52:57,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2019-12-07 12:52:57,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 3175. [2019-12-07 12:52:57,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3175 states. [2019-12-07 12:52:57,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3175 states to 3175 states and 4562 transitions. [2019-12-07 12:52:57,129 INFO L78 Accepts]: Start accepts. Automaton has 3175 states and 4562 transitions. Word has length 112 [2019-12-07 12:52:57,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:52:57,129 INFO L462 AbstractCegarLoop]: Abstraction has 3175 states and 4562 transitions. [2019-12-07 12:52:57,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:52:57,130 INFO L276 IsEmpty]: Start isEmpty. Operand 3175 states and 4562 transitions. [2019-12-07 12:52:57,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-12-07 12:52:57,133 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:52:57,133 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:52:57,334 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:52:57,334 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:52:57,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:52:57,334 INFO L82 PathProgramCache]: Analyzing trace with hash 579168329, now seen corresponding path program 1 times [2019-12-07 12:52:57,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:52:57,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66401878] [2019-12-07 12:52:57,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:52:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:52:57,431 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:52:57,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66401878] [2019-12-07 12:52:57,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:52:57,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:52:57,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568005866] [2019-12-07 12:52:57,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:52:57,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:52:57,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:52:57,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:52:57,434 INFO L87 Difference]: Start difference. First operand 3175 states and 4562 transitions. Second operand 4 states. [2019-12-07 12:53:01,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:01,219 INFO L93 Difference]: Finished difference Result 11465 states and 16734 transitions. [2019-12-07 12:53:01,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:01,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-12-07 12:53:01,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:01,248 INFO L225 Difference]: With dead ends: 11465 [2019-12-07 12:53:01,249 INFO L226 Difference]: Without dead ends: 8292 [2019-12-07 12:53:01,253 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 12:53:01,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8292 states. [2019-12-07 12:53:01,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8292 to 8275. [2019-12-07 12:53:01,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8275 states. [2019-12-07 12:53:01,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8275 states to 8275 states and 10636 transitions. [2019-12-07 12:53:01,366 INFO L78 Accepts]: Start accepts. Automaton has 8275 states and 10636 transitions. Word has length 134 [2019-12-07 12:53:01,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:01,366 INFO L462 AbstractCegarLoop]: Abstraction has 8275 states and 10636 transitions. [2019-12-07 12:53:01,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:01,366 INFO L276 IsEmpty]: Start isEmpty. Operand 8275 states and 10636 transitions. [2019-12-07 12:53:01,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-12-07 12:53:01,369 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:01,369 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:01,369 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:01,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:01,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1863909515, now seen corresponding path program 1 times [2019-12-07 12:53:01,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:01,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89365184] [2019-12-07 12:53:01,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:01,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:01,524 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 79 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:53:01,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89365184] [2019-12-07 12:53:01,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695630561] [2019-12-07 12:53:01,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00b127c2-e00f-4824-80fe-40c8a266fdb0/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 12:53:01,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:01,583 INFO L264 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 12:53:01,588 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:53:01,623 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-12-07 12:53:01,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 12:53:01,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2019-12-07 12:53:01,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948543248] [2019-12-07 12:53:01,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:53:01,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:01,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:53:01,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:53:01,625 INFO L87 Difference]: Start difference. First operand 8275 states and 10636 transitions. Second operand 3 states. [2019-12-07 12:53:05,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:05,584 INFO L93 Difference]: Finished difference Result 18688 states and 24630 transitions. [2019-12-07 12:53:05,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:53:05,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2019-12-07 12:53:05,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:05,619 INFO L225 Difference]: With dead ends: 18688 [2019-12-07 12:53:05,619 INFO L226 Difference]: Without dead ends: 10840 [2019-12-07 12:53:05,625 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 176 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:53:05,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10840 states. [2019-12-07 12:53:05,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10840 to 10838. [2019-12-07 12:53:05,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10838 states. [2019-12-07 12:53:05,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10838 states to 10838 states and 13664 transitions. [2019-12-07 12:53:05,732 INFO L78 Accepts]: Start accepts. Automaton has 10838 states and 13664 transitions. Word has length 177 [2019-12-07 12:53:05,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:05,733 INFO L462 AbstractCegarLoop]: Abstraction has 10838 states and 13664 transitions. [2019-12-07 12:53:05,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:53:05,733 INFO L276 IsEmpty]: Start isEmpty. Operand 10838 states and 13664 transitions. [2019-12-07 12:53:05,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-12-07 12:53:05,735 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:05,736 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 12:53:05,936 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:53:05,937 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:05,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:05,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1639068595, now seen corresponding path program 1 times [2019-12-07 12:53:05,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:05,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40472592] [2019-12-07 12:53:05,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:05,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:06,105 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-12-07 12:53:06,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40472592] [2019-12-07 12:53:06,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:06,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:06,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328536600] [2019-12-07 12:53:06,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:53:06,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:06,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:53:06,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:53:06,106 INFO L87 Difference]: Start difference. First operand 10838 states and 13664 transitions. Second operand 5 states. [2019-12-07 12:53:12,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:12,180 INFO L93 Difference]: Finished difference Result 38307 states and 48662 transitions. [2019-12-07 12:53:12,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:53:12,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 219 [2019-12-07 12:53:12,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:12,262 INFO L225 Difference]: With dead ends: 38307 [2019-12-07 12:53:12,263 INFO L226 Difference]: Without dead ends: 27896 [2019-12-07 12:53:12,269 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 12:53:12,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27896 states. [2019-12-07 12:53:12,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27896 to 20187. [2019-12-07 12:53:12,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20187 states. [2019-12-07 12:53:12,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20187 states to 20187 states and 24184 transitions. [2019-12-07 12:53:12,447 INFO L78 Accepts]: Start accepts. Automaton has 20187 states and 24184 transitions. Word has length 219 [2019-12-07 12:53:12,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:12,448 INFO L462 AbstractCegarLoop]: Abstraction has 20187 states and 24184 transitions. [2019-12-07 12:53:12,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:53:12,448 INFO L276 IsEmpty]: Start isEmpty. Operand 20187 states and 24184 transitions. [2019-12-07 12:53:12,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-12-07 12:53:12,451 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:12,452 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:12,452 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:12,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:12,452 INFO L82 PathProgramCache]: Analyzing trace with hash 293167203, now seen corresponding path program 1 times [2019-12-07 12:53:12,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:12,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126915895] [2019-12-07 12:53:12,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:12,557 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 213 proven. 64 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-12-07 12:53:12,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126915895] [2019-12-07 12:53:12,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011935687] [2019-12-07 12:53:12,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00b127c2-e00f-4824-80fe-40c8a266fdb0/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 12:53:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:12,628 INFO L264 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 12:53:12,631 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:53:12,679 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-07 12:53:12,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 12:53:12,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2019-12-07 12:53:12,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488111909] [2019-12-07 12:53:12,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:53:12,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:12,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:53:12,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:53:12,681 INFO L87 Difference]: Start difference. First operand 20187 states and 24184 transitions. Second operand 3 states. [2019-12-07 12:53:14,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:14,914 INFO L93 Difference]: Finished difference Result 52699 states and 63905 transitions. [2019-12-07 12:53:14,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:53:14,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2019-12-07 12:53:14,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:14,937 INFO L225 Difference]: With dead ends: 52699 [2019-12-07 12:53:14,937 INFO L226 Difference]: Without dead ends: 29108 [2019-12-07 12:53:14,951 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 264 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:53:14,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29108 states. [2019-12-07 12:53:15,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29108 to 21024. [2019-12-07 12:53:15,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21024 states. [2019-12-07 12:53:15,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21024 states to 21024 states and 23944 transitions. [2019-12-07 12:53:15,119 INFO L78 Accepts]: Start accepts. Automaton has 21024 states and 23944 transitions. Word has length 265 [2019-12-07 12:53:15,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:15,119 INFO L462 AbstractCegarLoop]: Abstraction has 21024 states and 23944 transitions. [2019-12-07 12:53:15,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:53:15,119 INFO L276 IsEmpty]: Start isEmpty. Operand 21024 states and 23944 transitions. [2019-12-07 12:53:15,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-12-07 12:53:15,122 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:15,123 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, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:15,323 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:53:15,324 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:15,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:15,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1882720223, now seen corresponding path program 1 times [2019-12-07 12:53:15,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:15,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118041272] [2019-12-07 12:53:15,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:15,436 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-12-07 12:53:15,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118041272] [2019-12-07 12:53:15,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:15,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:53:15,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23999646] [2019-12-07 12:53:15,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:53:15,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:15,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:53:15,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:53:15,437 INFO L87 Difference]: Start difference. First operand 21024 states and 23944 transitions. Second operand 3 states. [2019-12-07 12:53:17,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:17,127 INFO L93 Difference]: Finished difference Result 52247 states and 60153 transitions. [2019-12-07 12:53:17,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:53:17,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 278 [2019-12-07 12:53:17,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:17,150 INFO L225 Difference]: With dead ends: 52247 [2019-12-07 12:53:17,151 INFO L226 Difference]: Without dead ends: 31225 [2019-12-07 12:53:17,167 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 12:53:17,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31225 states. [2019-12-07 12:53:17,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31225 to 31225. [2019-12-07 12:53:17,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31225 states. [2019-12-07 12:53:17,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31225 states to 31225 states and 34792 transitions. [2019-12-07 12:53:17,393 INFO L78 Accepts]: Start accepts. Automaton has 31225 states and 34792 transitions. Word has length 278 [2019-12-07 12:53:17,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:17,393 INFO L462 AbstractCegarLoop]: Abstraction has 31225 states and 34792 transitions. [2019-12-07 12:53:17,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:53:17,393 INFO L276 IsEmpty]: Start isEmpty. Operand 31225 states and 34792 transitions. [2019-12-07 12:53:17,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-12-07 12:53:17,396 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:17,396 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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 12:53:17,396 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:17,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:17,396 INFO L82 PathProgramCache]: Analyzing trace with hash -582388829, now seen corresponding path program 1 times [2019-12-07 12:53:17,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:17,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804385861] [2019-12-07 12:53:17,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:17,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:17,707 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 227 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:53:17,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804385861] [2019-12-07 12:53:17,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357100479] [2019-12-07 12:53:17,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00b127c2-e00f-4824-80fe-40c8a266fdb0/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 12:53:17,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:17,784 INFO L264 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 12:53:17,786 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:53:17,908 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 222 proven. 82 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-12-07 12:53:17,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:53:17,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 3] total 10 [2019-12-07 12:53:17,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094733127] [2019-12-07 12:53:17,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 12:53:17,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:17,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 12:53:17,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:53:17,910 INFO L87 Difference]: Start difference. First operand 31225 states and 34792 transitions. Second operand 10 states. [2019-12-07 12:53:31,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:31,145 INFO L93 Difference]: Finished difference Result 110612 states and 122769 transitions. [2019-12-07 12:53:31,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 12:53:31,146 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 302 [2019-12-07 12:53:31,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:31,201 INFO L225 Difference]: With dead ends: 110612 [2019-12-07 12:53:31,201 INFO L226 Difference]: Without dead ends: 75131 [2019-12-07 12:53:31,220 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2019-12-07 12:53:31,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75131 states. [2019-12-07 12:53:31,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75131 to 57201. [2019-12-07 12:53:31,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57201 states. [2019-12-07 12:53:31,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57201 states to 57201 states and 63330 transitions. [2019-12-07 12:53:31,723 INFO L78 Accepts]: Start accepts. Automaton has 57201 states and 63330 transitions. Word has length 302 [2019-12-07 12:53:31,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:31,724 INFO L462 AbstractCegarLoop]: Abstraction has 57201 states and 63330 transitions. [2019-12-07 12:53:31,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 12:53:31,724 INFO L276 IsEmpty]: Start isEmpty. Operand 57201 states and 63330 transitions. [2019-12-07 12:53:31,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2019-12-07 12:53:31,748 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:31,749 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:53:31,949 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:53:31,950 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:31,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:31,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1410443075, now seen corresponding path program 1 times [2019-12-07 12:53:31,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:31,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380144546] [2019-12-07 12:53:31,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:32,380 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-07 12:53:32,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380144546] [2019-12-07 12:53:32,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:32,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:53:32,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991668173] [2019-12-07 12:53:32,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:53:32,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:32,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:53:32,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:53:32,382 INFO L87 Difference]: Start difference. First operand 57201 states and 63330 transitions. Second operand 3 states. [2019-12-07 12:53:34,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:34,112 INFO L93 Difference]: Finished difference Result 113969 states and 126225 transitions. [2019-12-07 12:53:34,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:53:34,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 609 [2019-12-07 12:53:34,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:34,163 INFO L225 Difference]: With dead ends: 113969 [2019-12-07 12:53:34,163 INFO L226 Difference]: Without dead ends: 57195 [2019-12-07 12:53:34,188 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 4 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 12:53:34,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57195 states. [2019-12-07 12:53:34,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57195 to 56769. [2019-12-07 12:53:34,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56769 states. [2019-12-07 12:53:34,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56769 states to 56769 states and 62794 transitions. [2019-12-07 12:53:34,618 INFO L78 Accepts]: Start accepts. Automaton has 56769 states and 62794 transitions. Word has length 609 [2019-12-07 12:53:34,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:34,619 INFO L462 AbstractCegarLoop]: Abstraction has 56769 states and 62794 transitions. [2019-12-07 12:53:34,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:53:34,619 INFO L276 IsEmpty]: Start isEmpty. Operand 56769 states and 62794 transitions. [2019-12-07 12:53:34,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2019-12-07 12:53:34,639 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:34,639 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:34,640 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:34,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:34,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1172597637, now seen corresponding path program 1 times [2019-12-07 12:53:34,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:34,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447398498] [2019-12-07 12:53:34,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:35,035 INFO L134 CoverageAnalysis]: Checked inductivity of 781 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2019-12-07 12:53:35,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447398498] [2019-12-07 12:53:35,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:35,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:53:35,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469070588] [2019-12-07 12:53:35,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:53:35,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:35,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:53:35,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:53:35,037 INFO L87 Difference]: Start difference. First operand 56769 states and 62794 transitions. Second operand 3 states. [2019-12-07 12:53:39,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:39,314 INFO L93 Difference]: Finished difference Result 118640 states and 131216 transitions. [2019-12-07 12:53:39,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:53:39,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 628 [2019-12-07 12:53:39,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:39,366 INFO L225 Difference]: With dead ends: 118640 [2019-12-07 12:53:39,366 INFO L226 Difference]: Without dead ends: 61443 [2019-12-07 12:53:39,391 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 12:53:39,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61443 states. [2019-12-07 12:53:39,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61443 to 58888. [2019-12-07 12:53:39,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58888 states. [2019-12-07 12:53:39,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58888 states to 58888 states and 64260 transitions. [2019-12-07 12:53:39,859 INFO L78 Accepts]: Start accepts. Automaton has 58888 states and 64260 transitions. Word has length 628 [2019-12-07 12:53:39,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:39,860 INFO L462 AbstractCegarLoop]: Abstraction has 58888 states and 64260 transitions. [2019-12-07 12:53:39,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:53:39,860 INFO L276 IsEmpty]: Start isEmpty. Operand 58888 states and 64260 transitions. [2019-12-07 12:53:39,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2019-12-07 12:53:39,891 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:39,891 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:39,891 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:39,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:39,892 INFO L82 PathProgramCache]: Analyzing trace with hash 130534975, now seen corresponding path program 1 times [2019-12-07 12:53:39,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:39,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258127535] [2019-12-07 12:53:39,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:40,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1303 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-12-07 12:53:40,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258127535] [2019-12-07 12:53:40,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:40,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:53:40,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884493781] [2019-12-07 12:53:40,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:53:40,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:40,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:53:40,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:53:40,302 INFO L87 Difference]: Start difference. First operand 58888 states and 64260 transitions. Second operand 3 states. [2019-12-07 12:53:43,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:43,200 INFO L93 Difference]: Finished difference Result 120753 states and 131776 transitions. [2019-12-07 12:53:43,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:53:43,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 704 [2019-12-07 12:53:43,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:43,247 INFO L225 Difference]: With dead ends: 120753 [2019-12-07 12:53:43,247 INFO L226 Difference]: Without dead ends: 61434 [2019-12-07 12:53:43,270 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 12:53:43,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61434 states. [2019-12-07 12:53:43,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61434 to 60155. [2019-12-07 12:53:43,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60155 states. [2019-12-07 12:53:43,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60155 states to 60155 states and 65082 transitions. [2019-12-07 12:53:43,735 INFO L78 Accepts]: Start accepts. Automaton has 60155 states and 65082 transitions. Word has length 704 [2019-12-07 12:53:43,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:43,736 INFO L462 AbstractCegarLoop]: Abstraction has 60155 states and 65082 transitions. [2019-12-07 12:53:43,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:53:43,736 INFO L276 IsEmpty]: Start isEmpty. Operand 60155 states and 65082 transitions. [2019-12-07 12:53:43,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 737 [2019-12-07 12:53:43,759 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:43,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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-12-07 12:53:43,759 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:43,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:43,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1200477907, now seen corresponding path program 1 times [2019-12-07 12:53:43,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:43,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784685275] [2019-12-07 12:53:43,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:43,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:44,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 1044 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2019-12-07 12:53:44,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784685275] [2019-12-07 12:53:44,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:44,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:53:44,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448893779] [2019-12-07 12:53:44,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:53:44,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:44,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:53:44,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:53:44,274 INFO L87 Difference]: Start difference. First operand 60155 states and 65082 transitions. Second operand 3 states. [2019-12-07 12:53:46,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:46,301 INFO L93 Difference]: Finished difference Result 124979 states and 135163 transitions. [2019-12-07 12:53:46,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:53:46,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 736 [2019-12-07 12:53:46,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:46,349 INFO L225 Difference]: With dead ends: 124979 [2019-12-07 12:53:46,349 INFO L226 Difference]: Without dead ends: 65251 [2019-12-07 12:53:46,370 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 12:53:46,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65251 states. [2019-12-07 12:53:46,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65251 to 56317. [2019-12-07 12:53:46,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56317 states. [2019-12-07 12:53:46,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56317 states to 56317 states and 60688 transitions. [2019-12-07 12:53:46,830 INFO L78 Accepts]: Start accepts. Automaton has 56317 states and 60688 transitions. Word has length 736 [2019-12-07 12:53:46,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:46,830 INFO L462 AbstractCegarLoop]: Abstraction has 56317 states and 60688 transitions. [2019-12-07 12:53:46,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:53:46,830 INFO L276 IsEmpty]: Start isEmpty. Operand 56317 states and 60688 transitions. [2019-12-07 12:53:46,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 799 [2019-12-07 12:53:46,854 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:46,855 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:46,855 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:46,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:46,856 INFO L82 PathProgramCache]: Analyzing trace with hash 756007935, now seen corresponding path program 1 times [2019-12-07 12:53:46,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:46,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492015338] [2019-12-07 12:53:46,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:48,518 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 44 proven. 474 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2019-12-07 12:53:48,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492015338] [2019-12-07 12:53:48,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098327640] [2019-12-07 12:53:48,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00b127c2-e00f-4824-80fe-40c8a266fdb0/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:53:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:48,669 INFO L264 TraceCheckSpWp]: Trace formula consists of 945 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 12:53:48,676 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:53:48,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-12-07 12:53:48,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:53:48,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:53:48,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:53:48,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:53:48,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:53:48,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:53:48,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:53:48,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:53:48,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:53:49,629 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 440 proven. 235 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-12-07 12:53:49,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:53:49,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11 [2019-12-07 12:53:49,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287918007] [2019-12-07 12:53:49,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 12:53:49,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:49,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 12:53:49,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:53:49,631 INFO L87 Difference]: Start difference. First operand 56317 states and 60688 transitions. Second operand 11 states. [2019-12-07 12:53:58,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:58,087 INFO L93 Difference]: Finished difference Result 136797 states and 146691 transitions. [2019-12-07 12:53:58,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 12:53:58,089 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 798 [2019-12-07 12:53:58,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:58,151 INFO L225 Difference]: With dead ends: 136797 [2019-12-07 12:53:58,151 INFO L226 Difference]: Without dead ends: 80049 [2019-12-07 12:53:58,176 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 837 GetRequests, 809 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=227, Invalid=423, Unknown=0, NotChecked=0, Total=650 [2019-12-07 12:53:58,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80049 states. [2019-12-07 12:53:58,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80049 to 65625. [2019-12-07 12:53:58,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65625 states. [2019-12-07 12:53:58,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65625 states to 65625 states and 69039 transitions. [2019-12-07 12:53:58,746 INFO L78 Accepts]: Start accepts. Automaton has 65625 states and 69039 transitions. Word has length 798 [2019-12-07 12:53:58,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:58,747 INFO L462 AbstractCegarLoop]: Abstraction has 65625 states and 69039 transitions. [2019-12-07 12:53:58,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 12:53:58,747 INFO L276 IsEmpty]: Start isEmpty. Operand 65625 states and 69039 transitions. [2019-12-07 12:53:58,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 962 [2019-12-07 12:53:58,775 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:58,776 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 12:53:58,976 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:53:58,977 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:58,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:58,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1475185063, now seen corresponding path program 1 times [2019-12-07 12:53:58,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:58,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347148327] [2019-12-07 12:53:58,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:59,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:00,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1306 backedges. 692 proven. 385 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2019-12-07 12:54:00,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347148327] [2019-12-07 12:54:00,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136356211] [2019-12-07 12:54:00,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00b127c2-e00f-4824-80fe-40c8a266fdb0/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:54:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:01,128 INFO L264 TraceCheckSpWp]: Trace formula consists of 1140 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 12:54:01,134 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:54:01,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1306 backedges. 1077 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2019-12-07 12:54:01,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 12:54:01,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-12-07 12:54:01,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809231596] [2019-12-07 12:54:01,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:54:01,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:01,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:54:01,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:54:01,881 INFO L87 Difference]: Start difference. First operand 65625 states and 69039 transitions. Second operand 4 states. [2019-12-07 12:54:05,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:05,059 INFO L93 Difference]: Finished difference Result 159344 states and 167514 transitions. [2019-12-07 12:54:05,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:54:05,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 961 [2019-12-07 12:54:05,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:05,129 INFO L225 Difference]: With dead ends: 159344 [2019-12-07 12:54:05,130 INFO L226 Difference]: Without dead ends: 93721 [2019-12-07 12:54:05,161 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 967 GetRequests, 960 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:54:05,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93721 states. [2019-12-07 12:54:05,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93721 to 72436. [2019-12-07 12:54:05,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72436 states. [2019-12-07 12:54:05,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72436 states to 72436 states and 76073 transitions. [2019-12-07 12:54:05,824 INFO L78 Accepts]: Start accepts. Automaton has 72436 states and 76073 transitions. Word has length 961 [2019-12-07 12:54:05,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:05,825 INFO L462 AbstractCegarLoop]: Abstraction has 72436 states and 76073 transitions. [2019-12-07 12:54:05,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:54:05,825 INFO L276 IsEmpty]: Start isEmpty. Operand 72436 states and 76073 transitions. [2019-12-07 12:54:05,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 967 [2019-12-07 12:54:05,853 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:05,854 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 12:54:06,054 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:54:06,055 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:06,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:06,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1803371503, now seen corresponding path program 1 times [2019-12-07 12:54:06,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:06,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95948129] [2019-12-07 12:54:06,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:06,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:07,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 1057 proven. 30 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2019-12-07 12:54:07,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95948129] [2019-12-07 12:54:07,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032515783] [2019-12-07 12:54:07,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00b127c2-e00f-4824-80fe-40c8a266fdb0/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:54:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:07,311 INFO L264 TraceCheckSpWp]: Trace formula consists of 1147 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 12:54:07,316 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:54:07,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:07,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:07,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:09,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 732 proven. 355 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2019-12-07 12:54:09,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:54:09,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-12-07 12:54:09,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927288983] [2019-12-07 12:54:09,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 12:54:09,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:09,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 12:54:09,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:54:09,293 INFO L87 Difference]: Start difference. First operand 72436 states and 76073 transitions. Second operand 9 states. [2019-12-07 12:54:19,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:19,301 INFO L93 Difference]: Finished difference Result 172975 states and 181599 transitions. [2019-12-07 12:54:19,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 12:54:19,301 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 966 [2019-12-07 12:54:19,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:19,390 INFO L225 Difference]: With dead ends: 172975 [2019-12-07 12:54:19,390 INFO L226 Difference]: Without dead ends: 100966 [2019-12-07 12:54:19,425 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 977 GetRequests, 967 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-12-07 12:54:19,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100966 states. [2019-12-07 12:54:20,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100966 to 75844. [2019-12-07 12:54:20,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75844 states. [2019-12-07 12:54:20,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75844 states to 75844 states and 79516 transitions. [2019-12-07 12:54:20,173 INFO L78 Accepts]: Start accepts. Automaton has 75844 states and 79516 transitions. Word has length 966 [2019-12-07 12:54:20,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:20,173 INFO L462 AbstractCegarLoop]: Abstraction has 75844 states and 79516 transitions. [2019-12-07 12:54:20,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 12:54:20,174 INFO L276 IsEmpty]: Start isEmpty. Operand 75844 states and 79516 transitions. [2019-12-07 12:54:20,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1019 [2019-12-07 12:54:20,280 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:20,281 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 12:54:20,481 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:54:20,482 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:20,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:20,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1739013628, now seen corresponding path program 1 times [2019-12-07 12:54:20,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:20,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700280060] [2019-12-07 12:54:20,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:20,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:22,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 802 proven. 385 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-12-07 12:54:22,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700280060] [2019-12-07 12:54:22,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909265500] [2019-12-07 12:54:22,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00b127c2-e00f-4824-80fe-40c8a266fdb0/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:54:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:22,733 INFO L264 TraceCheckSpWp]: Trace formula consists of 1196 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 12:54:22,740 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:54:22,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:22,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:26,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 1187 proven. 0 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-12-07 12:54:26,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 12:54:26,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2019-12-07 12:54:26,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040594063] [2019-12-07 12:54:26,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:54:26,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:26,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:54:26,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-07 12:54:26,276 INFO L87 Difference]: Start difference. First operand 75844 states and 79516 transitions. Second operand 6 states. [2019-12-07 12:54:40,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:40,356 INFO L93 Difference]: Finished difference Result 160624 states and 168205 transitions. [2019-12-07 12:54:40,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:54:40,356 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1018 [2019-12-07 12:54:40,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:40,421 INFO L225 Difference]: With dead ends: 160624 [2019-12-07 12:54:40,421 INFO L226 Difference]: Without dead ends: 85207 [2019-12-07 12:54:40,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1025 GetRequests, 1015 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-07 12:54:40,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85207 states. [2019-12-07 12:54:41,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85207 to 78821. [2019-12-07 12:54:41,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78821 states. [2019-12-07 12:54:41,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78821 states to 78821 states and 82584 transitions. [2019-12-07 12:54:41,123 INFO L78 Accepts]: Start accepts. Automaton has 78821 states and 82584 transitions. Word has length 1018 [2019-12-07 12:54:41,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:41,124 INFO L462 AbstractCegarLoop]: Abstraction has 78821 states and 82584 transitions. [2019-12-07 12:54:41,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:54:41,124 INFO L276 IsEmpty]: Start isEmpty. Operand 78821 states and 82584 transitions. [2019-12-07 12:54:41,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1034 [2019-12-07 12:54:41,154 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:41,155 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 12:54:41,355 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:54:41,355 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:41,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:41,356 INFO L82 PathProgramCache]: Analyzing trace with hash 829003154, now seen corresponding path program 1 times [2019-12-07 12:54:41,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:41,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582724035] [2019-12-07 12:54:41,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:41,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:42,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1031 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 871 trivial. 0 not checked. [2019-12-07 12:54:42,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582724035] [2019-12-07 12:54:42,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:42,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:54:42,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007204834] [2019-12-07 12:54:42,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:54:42,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:42,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:54:42,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:54:42,003 INFO L87 Difference]: Start difference. First operand 78821 states and 82584 transitions. Second operand 3 states. [2019-12-07 12:54:44,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:44,017 INFO L93 Difference]: Finished difference Result 160181 states and 167770 transitions. [2019-12-07 12:54:44,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:54:44,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1033 [2019-12-07 12:54:44,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:44,084 INFO L225 Difference]: With dead ends: 160181 [2019-12-07 12:54:44,084 INFO L226 Difference]: Without dead ends: 82635 [2019-12-07 12:54:44,115 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 12:54:44,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82635 states. [2019-12-07 12:54:44,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82635 to 74113. [2019-12-07 12:54:44,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74113 states. [2019-12-07 12:54:44,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74113 states to 74113 states and 77597 transitions. [2019-12-07 12:54:44,751 INFO L78 Accepts]: Start accepts. Automaton has 74113 states and 77597 transitions. Word has length 1033 [2019-12-07 12:54:44,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:44,752 INFO L462 AbstractCegarLoop]: Abstraction has 74113 states and 77597 transitions. [2019-12-07 12:54:44,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:54:44,752 INFO L276 IsEmpty]: Start isEmpty. Operand 74113 states and 77597 transitions. [2019-12-07 12:54:44,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1265 [2019-12-07 12:54:44,798 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:44,799 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:54:44,799 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:44,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:44,799 INFO L82 PathProgramCache]: Analyzing trace with hash 19008312, now seen corresponding path program 1 times [2019-12-07 12:54:44,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:44,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114642672] [2019-12-07 12:54:44,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:45,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2382 backedges. 1250 proven. 0 refuted. 0 times theorem prover too weak. 1132 trivial. 0 not checked. [2019-12-07 12:54:45,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114642672] [2019-12-07 12:54:45,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:45,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:54:45,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254603648] [2019-12-07 12:54:45,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:54:45,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:45,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:54:45,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:54:45,553 INFO L87 Difference]: Start difference. First operand 74113 states and 77597 transitions. Second operand 3 states. [2019-12-07 12:54:47,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:47,818 INFO L93 Difference]: Finished difference Result 149502 states and 156614 transitions. [2019-12-07 12:54:47,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:54:47,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1264 [2019-12-07 12:54:47,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:47,874 INFO L225 Difference]: With dead ends: 149502 [2019-12-07 12:54:47,875 INFO L226 Difference]: Without dead ends: 76666 [2019-12-07 12:54:47,904 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 12:54:47,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76666 states. [2019-12-07 12:54:48,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76666 to 75387. [2019-12-07 12:54:48,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75387 states. [2019-12-07 12:54:48,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75387 states to 75387 states and 78808 transitions. [2019-12-07 12:54:48,593 INFO L78 Accepts]: Start accepts. Automaton has 75387 states and 78808 transitions. Word has length 1264 [2019-12-07 12:54:48,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:48,593 INFO L462 AbstractCegarLoop]: Abstraction has 75387 states and 78808 transitions. [2019-12-07 12:54:48,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:54:48,594 INFO L276 IsEmpty]: Start isEmpty. Operand 75387 states and 78808 transitions. [2019-12-07 12:54:48,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1295 [2019-12-07 12:54:48,639 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:48,640 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:54:48,640 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:48,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:48,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1801826477, now seen corresponding path program 1 times [2019-12-07 12:54:48,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:48,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479232796] [2019-12-07 12:54:48,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:48,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:50,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 1333 proven. 826 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-12-07 12:54:50,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479232796] [2019-12-07 12:54:50,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602498867] [2019-12-07 12:54:50,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00b127c2-e00f-4824-80fe-40c8a266fdb0/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:54:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:51,163 INFO L264 TraceCheckSpWp]: Trace formula consists of 1497 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 12:54:51,172 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:54:51,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 1081 proven. 0 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2019-12-07 12:54:51,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 12:54:51,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2019-12-07 12:54:51,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929160225] [2019-12-07 12:54:51,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:54:51,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:51,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:54:51,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-12-07 12:54:51,990 INFO L87 Difference]: Start difference. First operand 75387 states and 78808 transitions. Second operand 5 states. [2019-12-07 12:54:55,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:55,675 INFO L93 Difference]: Finished difference Result 163528 states and 170805 transitions. [2019-12-07 12:54:55,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:54:55,676 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1294 [2019-12-07 12:54:55,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:55,741 INFO L225 Difference]: With dead ends: 163528 [2019-12-07 12:54:55,741 INFO L226 Difference]: Without dead ends: 88141 [2019-12-07 12:54:55,772 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1307 GetRequests, 1292 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-12-07 12:54:55,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88141 states. [2019-12-07 12:54:56,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88141 to 73250. [2019-12-07 12:54:56,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73250 states. [2019-12-07 12:54:56,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73250 states to 73250 states and 76093 transitions. [2019-12-07 12:54:56,551 INFO L78 Accepts]: Start accepts. Automaton has 73250 states and 76093 transitions. Word has length 1294 [2019-12-07 12:54:56,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:56,552 INFO L462 AbstractCegarLoop]: Abstraction has 73250 states and 76093 transitions. [2019-12-07 12:54:56,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:54:56,552 INFO L276 IsEmpty]: Start isEmpty. Operand 73250 states and 76093 transitions. [2019-12-07 12:54:56,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1422 [2019-12-07 12:54:56,595 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:56,596 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:54:56,796 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:54:56,797 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:56,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:56,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1039281333, now seen corresponding path program 1 times [2019-12-07 12:54:56,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:56,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304476956] [2019-12-07 12:54:56,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:59,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3038 backedges. 2491 proven. 0 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2019-12-07 12:54:59,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304476956] [2019-12-07 12:54:59,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:59,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:54:59,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600533084] [2019-12-07 12:54:59,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:54:59,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:59,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:54:59,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:54:59,302 INFO L87 Difference]: Start difference. First operand 73250 states and 76093 transitions. Second operand 6 states. [2019-12-07 12:55:03,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:03,998 INFO L93 Difference]: Finished difference Result 156294 states and 162268 transitions. [2019-12-07 12:55:03,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:55:03,999 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1421 [2019-12-07 12:55:04,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:04,067 INFO L225 Difference]: With dead ends: 156294 [2019-12-07 12:55:04,067 INFO L226 Difference]: Without dead ends: 83044 [2019-12-07 12:55:04,097 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:55:04,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83044 states. [2019-12-07 12:55:04,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83044 to 69409. [2019-12-07 12:55:04,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69409 states. [2019-12-07 12:55:04,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69409 states to 69409 states and 72032 transitions. [2019-12-07 12:55:04,736 INFO L78 Accepts]: Start accepts. Automaton has 69409 states and 72032 transitions. Word has length 1421 [2019-12-07 12:55:04,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:04,737 INFO L462 AbstractCegarLoop]: Abstraction has 69409 states and 72032 transitions. [2019-12-07 12:55:04,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:55:04,737 INFO L276 IsEmpty]: Start isEmpty. Operand 69409 states and 72032 transitions. [2019-12-07 12:55:04,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1561 [2019-12-07 12:55:04,785 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:04,786 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-12-07 12:55:04,786 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:04,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:04,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1425848221, now seen corresponding path program 1 times [2019-12-07 12:55:04,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:04,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856382646] [2019-12-07 12:55:04,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:06,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2896 backedges. 2136 proven. 36 refuted. 0 times theorem prover too weak. 724 trivial. 0 not checked. [2019-12-07 12:55:06,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856382646] [2019-12-07 12:55:06,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072336693] [2019-12-07 12:55:06,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00b127c2-e00f-4824-80fe-40c8a266fdb0/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:55:07,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:07,163 INFO L264 TraceCheckSpWp]: Trace formula consists of 1780 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 12:55:07,171 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:55:10,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2896 backedges. 2158 proven. 0 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2019-12-07 12:55:10,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 12:55:10,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-12-07 12:55:10,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029681955] [2019-12-07 12:55:10,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:55:10,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:10,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:55:10,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:55:10,432 INFO L87 Difference]: Start difference. First operand 69409 states and 72032 transitions. Second operand 4 states. [2019-12-07 12:55:36,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:36,639 INFO L93 Difference]: Finished difference Result 158824 states and 164877 transitions. [2019-12-07 12:55:36,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:55:36,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1560 [2019-12-07 12:55:36,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:36,710 INFO L225 Difference]: With dead ends: 158824 [2019-12-07 12:55:36,711 INFO L226 Difference]: Without dead ends: 90692 [2019-12-07 12:55:36,735 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1567 GetRequests, 1559 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:55:36,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90692 states. [2019-12-07 12:55:37,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90692 to 78772. [2019-12-07 12:55:37,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78772 states. [2019-12-07 12:55:37,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78772 states to 78772 states and 81693 transitions. [2019-12-07 12:55:37,451 INFO L78 Accepts]: Start accepts. Automaton has 78772 states and 81693 transitions. Word has length 1560 [2019-12-07 12:55:37,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:37,452 INFO L462 AbstractCegarLoop]: Abstraction has 78772 states and 81693 transitions. [2019-12-07 12:55:37,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:55:37,452 INFO L276 IsEmpty]: Start isEmpty. Operand 78772 states and 81693 transitions. [2019-12-07 12:55:37,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1579 [2019-12-07 12:55:37,506 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:37,507 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-12-07 12:55:37,707 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:55:37,708 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:37,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:37,709 INFO L82 PathProgramCache]: Analyzing trace with hash -605926517, now seen corresponding path program 1 times [2019-12-07 12:55:37,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:37,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882416021] [2019-12-07 12:55:37,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:41,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3108 backedges. 1855 proven. 1171 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-12-07 12:55:41,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882416021] [2019-12-07 12:55:41,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375061143] [2019-12-07 12:55:41,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00b127c2-e00f-4824-80fe-40c8a266fdb0/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:55:41,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:41,715 INFO L264 TraceCheckSpWp]: Trace formula consists of 1795 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 12:55:41,722 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:55:45,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3108 backedges. 2488 proven. 0 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2019-12-07 12:55:45,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 12:55:45,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-12-07 12:55:45,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698614652] [2019-12-07 12:55:45,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:55:45,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:45,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:55:45,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-07 12:55:45,856 INFO L87 Difference]: Start difference. First operand 78772 states and 81693 transitions. Second operand 5 states. [2019-12-07 12:56:03,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:56:03,357 INFO L93 Difference]: Finished difference Result 175831 states and 182245 transitions. [2019-12-07 12:56:03,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:56:03,357 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1578 [2019-12-07 12:56:03,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:56:03,444 INFO L225 Difference]: With dead ends: 175831 [2019-12-07 12:56:03,444 INFO L226 Difference]: Without dead ends: 98336 [2019-12-07 12:56:03,477 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1588 GetRequests, 1576 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-07 12:56:03,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98336 states. [2019-12-07 12:56:04,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98336 to 88540. [2019-12-07 12:56:04,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88540 states. [2019-12-07 12:56:04,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88540 states to 88540 states and 91471 transitions. [2019-12-07 12:56:04,298 INFO L78 Accepts]: Start accepts. Automaton has 88540 states and 91471 transitions. Word has length 1578 [2019-12-07 12:56:04,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:56:04,299 INFO L462 AbstractCegarLoop]: Abstraction has 88540 states and 91471 transitions. [2019-12-07 12:56:04,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:56:04,299 INFO L276 IsEmpty]: Start isEmpty. Operand 88540 states and 91471 transitions. [2019-12-07 12:56:04,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1608 [2019-12-07 12:56:04,359 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:56:04,360 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:56:04,561 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:56:04,561 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:56:04,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:56:04,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1431347478, now seen corresponding path program 1 times [2019-12-07 12:56:04,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:56:04,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777288811] [2019-12-07 12:56:04,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:56:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:56:07,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4099 backedges. 3197 proven. 0 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2019-12-07 12:56:07,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777288811] [2019-12-07 12:56:07,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:56:07,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 12:56:07,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43807555] [2019-12-07 12:56:07,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:56:07,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:56:07,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:56:07,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:56:07,157 INFO L87 Difference]: Start difference. First operand 88540 states and 91471 transitions. Second operand 7 states. [2019-12-07 12:56:14,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:56:14,403 INFO L93 Difference]: Finished difference Result 182620 states and 188519 transitions. [2019-12-07 12:56:14,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:56:14,404 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1607 [2019-12-07 12:56:14,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:56:14,494 INFO L225 Difference]: With dead ends: 182620 [2019-12-07 12:56:14,494 INFO L226 Difference]: Without dead ends: 95357 [2019-12-07 12:56:14,534 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:56:14,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95357 states. [2019-12-07 12:56:15,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95357 to 85986. [2019-12-07 12:56:15,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85986 states. [2019-12-07 12:56:15,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85986 states to 85986 states and 88567 transitions. [2019-12-07 12:56:15,364 INFO L78 Accepts]: Start accepts. Automaton has 85986 states and 88567 transitions. Word has length 1607 [2019-12-07 12:56:15,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:56:15,364 INFO L462 AbstractCegarLoop]: Abstraction has 85986 states and 88567 transitions. [2019-12-07 12:56:15,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:56:15,365 INFO L276 IsEmpty]: Start isEmpty. Operand 85986 states and 88567 transitions. [2019-12-07 12:56:15,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1666 [2019-12-07 12:56:15,426 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:56:15,427 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:56:15,427 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:56:15,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:56:15,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1151993617, now seen corresponding path program 1 times [2019-12-07 12:56:15,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:56:15,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930131801] [2019-12-07 12:56:15,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:56:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:56:20,660 INFO L134 CoverageAnalysis]: Checked inductivity of 4098 backedges. 1696 proven. 2320 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-12-07 12:56:20,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930131801] [2019-12-07 12:56:20,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283496920] [2019-12-07 12:56:20,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00b127c2-e00f-4824-80fe-40c8a266fdb0/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:56:20,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:56:20,947 INFO L264 TraceCheckSpWp]: Trace formula consists of 1925 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:56:20,955 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:56:22,148 INFO L134 CoverageAnalysis]: Checked inductivity of 4098 backedges. 2196 proven. 0 refuted. 0 times theorem prover too weak. 1902 trivial. 0 not checked. [2019-12-07 12:56:22,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 12:56:22,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [14] total 15 [2019-12-07 12:56:22,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121199918] [2019-12-07 12:56:22,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:56:22,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:56:22,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:56:22,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2019-12-07 12:56:22,151 INFO L87 Difference]: Start difference. First operand 85986 states and 88567 transitions. Second operand 3 states. [2019-12-07 12:56:24,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:56:24,077 INFO L93 Difference]: Finished difference Result 170695 states and 175822 transitions. [2019-12-07 12:56:24,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:56:24,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1665 [2019-12-07 12:56:24,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:56:24,143 INFO L225 Difference]: With dead ends: 170695 [2019-12-07 12:56:24,144 INFO L226 Difference]: Without dead ends: 85986 [2019-12-07 12:56:24,176 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1678 GetRequests, 1665 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2019-12-07 12:56:24,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85986 states. [2019-12-07 12:56:24,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85986 to 81302. [2019-12-07 12:56:24,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81302 states. [2019-12-07 12:56:24,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81302 states to 81302 states and 83787 transitions. [2019-12-07 12:56:24,914 INFO L78 Accepts]: Start accepts. Automaton has 81302 states and 83787 transitions. Word has length 1665 [2019-12-07 12:56:24,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:56:24,915 INFO L462 AbstractCegarLoop]: Abstraction has 81302 states and 83787 transitions. [2019-12-07 12:56:24,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:56:24,915 INFO L276 IsEmpty]: Start isEmpty. Operand 81302 states and 83787 transitions. [2019-12-07 12:56:24,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1952 [2019-12-07 12:56:24,980 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:56:24,980 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:56:25,181 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:56:25,181 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:56:25,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:56:25,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1757327394, now seen corresponding path program 1 times [2019-12-07 12:56:25,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:56:25,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590899987] [2019-12-07 12:56:25,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:56:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:56:29,114 INFO L134 CoverageAnalysis]: Checked inductivity of 5097 backedges. 3923 proven. 90 refuted. 0 times theorem prover too weak. 1084 trivial. 0 not checked. [2019-12-07 12:56:29,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590899987] [2019-12-07 12:56:29,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748446073] [2019-12-07 12:56:29,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00b127c2-e00f-4824-80fe-40c8a266fdb0/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:56:29,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:56:29,455 INFO L264 TraceCheckSpWp]: Trace formula consists of 2241 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 12:56:29,465 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:56:29,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:56:29,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:56:32,572 INFO L134 CoverageAnalysis]: Checked inductivity of 5097 backedges. 4013 proven. 0 refuted. 0 times theorem prover too weak. 1084 trivial. 0 not checked. [2019-12-07 12:56:32,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 12:56:32,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 7 [2019-12-07 12:56:32,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380374119] [2019-12-07 12:56:32,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:56:32,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:56:32,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:56:32,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:56:32,575 INFO L87 Difference]: Start difference. First operand 81302 states and 83787 transitions. Second operand 6 states. [2019-12-07 12:56:35,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:56:35,858 INFO L93 Difference]: Finished difference Result 181758 states and 187380 transitions. [2019-12-07 12:56:35,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:56:35,858 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1951 [2019-12-07 12:56:35,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:56:35,946 INFO L225 Difference]: With dead ends: 181758 [2019-12-07 12:56:35,946 INFO L226 Difference]: Without dead ends: 101308 [2019-12-07 12:56:35,974 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1957 GetRequests, 1951 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:56:36,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101308 states. [2019-12-07 12:56:36,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101308 to 85562. [2019-12-07 12:56:36,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85562 states. [2019-12-07 12:56:36,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85562 states to 85562 states and 88186 transitions. [2019-12-07 12:56:36,790 INFO L78 Accepts]: Start accepts. Automaton has 85562 states and 88186 transitions. Word has length 1951 [2019-12-07 12:56:36,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:56:36,792 INFO L462 AbstractCegarLoop]: Abstraction has 85562 states and 88186 transitions. [2019-12-07 12:56:36,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:56:36,792 INFO L276 IsEmpty]: Start isEmpty. Operand 85562 states and 88186 transitions. [2019-12-07 12:56:36,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2056 [2019-12-07 12:56:36,860 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:56:36,861 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:56:37,062 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:56:37,062 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:56:37,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:56:37,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1859421298, now seen corresponding path program 1 times [2019-12-07 12:56:37,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:56:37,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743043439] [2019-12-07 12:56:37,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:56:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:56:42,316 INFO L134 CoverageAnalysis]: Checked inductivity of 5683 backedges. 2660 proven. 2341 refuted. 0 times theorem prover too weak. 682 trivial. 0 not checked. [2019-12-07 12:56:42,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743043439] [2019-12-07 12:56:42,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130136771] [2019-12-07 12:56:42,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00b127c2-e00f-4824-80fe-40c8a266fdb0/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:56:42,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:56:42,708 INFO L264 TraceCheckSpWp]: Trace formula consists of 2332 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:56:42,718 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:56:42,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:56:42,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:56:42,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:56:42,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:56:42,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:56:42,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:56:42,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:56:42,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:56:42,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:56:42,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:56:42,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:56:42,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:56:42,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:56:42,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:56:42,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:56:42,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:56:42,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:56:42,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:56:42,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:56:42,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:56:42,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:56:42,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:56:42,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:56:42,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:56:42,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:56:42,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:56:43,127 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 27 [2019-12-07 12:56:49,888 INFO L134 CoverageAnalysis]: Checked inductivity of 5683 backedges. 3897 proven. 0 refuted. 0 times theorem prover too weak. 1786 trivial. 0 not checked. [2019-12-07 12:56:49,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 12:56:49,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 13 [2019-12-07 12:56:49,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668531351] [2019-12-07 12:56:49,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:56:49,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:56:49,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:56:49,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-07 12:56:49,891 INFO L87 Difference]: Start difference. First operand 85562 states and 88186 transitions. Second operand 4 states. [2019-12-07 12:56:55,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:56:55,393 INFO L93 Difference]: Finished difference Result 177085 states and 182529 transitions. [2019-12-07 12:56:55,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:56:55,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2055 [2019-12-07 12:56:55,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:56:55,469 INFO L225 Difference]: With dead ends: 177085 [2019-12-07 12:56:55,469 INFO L226 Difference]: Without dead ends: 92800 [2019-12-07 12:56:55,503 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2066 GetRequests, 2054 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-07 12:56:55,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92800 states. [2019-12-07 12:56:56,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92800 to 88537. [2019-12-07 12:56:56,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88537 states. [2019-12-07 12:56:56,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88537 states to 88537 states and 91263 transitions. [2019-12-07 12:56:56,310 INFO L78 Accepts]: Start accepts. Automaton has 88537 states and 91263 transitions. Word has length 2055 [2019-12-07 12:56:56,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:56:56,312 INFO L462 AbstractCegarLoop]: Abstraction has 88537 states and 91263 transitions. [2019-12-07 12:56:56,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:56:56,312 INFO L276 IsEmpty]: Start isEmpty. Operand 88537 states and 91263 transitions. [2019-12-07 12:56:56,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2304 [2019-12-07 12:56:56,388 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:56:56,389 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:56:56,590 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:56:56,590 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:56:56,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:56:56,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1712623548, now seen corresponding path program 1 times [2019-12-07 12:56:56,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:56:56,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190996770] [2019-12-07 12:56:56,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:56:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:05,929 INFO L134 CoverageAnalysis]: Checked inductivity of 7352 backedges. 2563 proven. 4422 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-12-07 12:57:05,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190996770] [2019-12-07 12:57:05,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941220478] [2019-12-07 12:57:05,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00b127c2-e00f-4824-80fe-40c8a266fdb0/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:57:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:06,342 INFO L264 TraceCheckSpWp]: Trace formula consists of 2602 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 12:57:06,353 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:57:06,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:57:06,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:57:14,701 INFO L134 CoverageAnalysis]: Checked inductivity of 7352 backedges. 5388 proven. 0 refuted. 0 times theorem prover too weak. 1964 trivial. 0 not checked. [2019-12-07 12:57:14,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 12:57:14,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2019-12-07 12:57:14,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787499069] [2019-12-07 12:57:14,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:57:14,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:57:14,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:57:14,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-12-07 12:57:14,704 INFO L87 Difference]: Start difference. First operand 88537 states and 91263 transitions. Second operand 5 states. [2019-12-07 12:57:22,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:22,160 INFO L93 Difference]: Finished difference Result 209012 states and 215608 transitions. [2019-12-07 12:57:22,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:57:22,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 2303 [2019-12-07 12:57:22,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:22,270 INFO L225 Difference]: With dead ends: 209012 [2019-12-07 12:57:22,270 INFO L226 Difference]: Without dead ends: 121752 [2019-12-07 12:57:22,308 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2317 GetRequests, 2301 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-12-07 12:57:22,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121752 states. [2019-12-07 12:57:23,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121752 to 113237. [2019-12-07 12:57:23,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113237 states. [2019-12-07 12:57:23,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113237 states to 113237 states and 116676 transitions. [2019-12-07 12:57:23,401 INFO L78 Accepts]: Start accepts. Automaton has 113237 states and 116676 transitions. Word has length 2303 [2019-12-07 12:57:23,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:23,402 INFO L462 AbstractCegarLoop]: Abstraction has 113237 states and 116676 transitions. [2019-12-07 12:57:23,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:57:23,402 INFO L276 IsEmpty]: Start isEmpty. Operand 113237 states and 116676 transitions. [2019-12-07 12:57:23,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2547 [2019-12-07 12:57:23,514 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:23,515 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:57:23,715 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:57:23,716 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:23,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:23,717 INFO L82 PathProgramCache]: Analyzing trace with hash -772799974, now seen corresponding path program 1 times [2019-12-07 12:57:23,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:57:23,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235485503] [2019-12-07 12:57:23,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:57:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:35,339 INFO L134 CoverageAnalysis]: Checked inductivity of 9147 backedges. 3027 proven. 5753 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-12-07 12:57:35,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235485503] [2019-12-07 12:57:35,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048960362] [2019-12-07 12:57:35,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00b127c2-e00f-4824-80fe-40c8a266fdb0/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:57:35,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:35,774 INFO L264 TraceCheckSpWp]: Trace formula consists of 2868 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 12:57:35,786 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:57:42,886 INFO L134 CoverageAnalysis]: Checked inductivity of 9147 backedges. 7057 proven. 0 refuted. 0 times theorem prover too weak. 2090 trivial. 0 not checked. [2019-12-07 12:57:42,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 12:57:42,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [15] total 17 [2019-12-07 12:57:42,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420656018] [2019-12-07 12:57:42,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:57:42,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:57:42,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:57:42,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-12-07 12:57:42,889 INFO L87 Difference]: Start difference. First operand 113237 states and 116676 transitions. Second operand 4 states. [2019-12-07 12:58:00,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:00,499 INFO L93 Difference]: Finished difference Result 267764 states and 275892 transitions. [2019-12-07 12:58:00,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:58:00,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2546 [2019-12-07 12:58:00,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:00,633 INFO L225 Difference]: With dead ends: 267764 [2019-12-07 12:58:00,633 INFO L226 Difference]: Without dead ends: 155379 [2019-12-07 12:58:00,682 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2561 GetRequests, 2545 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-12-07 12:58:00,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155379 states. [2019-12-07 12:58:01,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155379 to 146441. [2019-12-07 12:58:01,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146441 states. [2019-12-07 12:58:02,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146441 states to 146441 states and 150719 transitions. [2019-12-07 12:58:02,079 INFO L78 Accepts]: Start accepts. Automaton has 146441 states and 150719 transitions. Word has length 2546 [2019-12-07 12:58:02,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:02,080 INFO L462 AbstractCegarLoop]: Abstraction has 146441 states and 150719 transitions. [2019-12-07 12:58:02,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:58:02,080 INFO L276 IsEmpty]: Start isEmpty. Operand 146441 states and 150719 transitions. [2019-12-07 12:58:02,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2719 [2019-12-07 12:58:02,207 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:02,208 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:02,409 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:58:02,409 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:58:02,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:02,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1642980089, now seen corresponding path program 1 times [2019-12-07 12:58:02,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:58:02,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246578146] [2019-12-07 12:58:02,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:58:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:15,787 INFO L134 CoverageAnalysis]: Checked inductivity of 10306 backedges. 3320 proven. 6619 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-12-07 12:58:15,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246578146] [2019-12-07 12:58:15,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476739388] [2019-12-07 12:58:15,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_00b127c2-e00f-4824-80fe-40c8a266fdb0/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:58:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:16,256 INFO L264 TraceCheckSpWp]: Trace formula consists of 3048 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 12:58:16,269 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:58:24,795 INFO L134 CoverageAnalysis]: Checked inductivity of 10306 backedges. 8068 proven. 0 refuted. 0 times theorem prover too weak. 2238 trivial. 0 not checked. [2019-12-07 12:58:24,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 12:58:24,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [15] total 17 [2019-12-07 12:58:24,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80708383] [2019-12-07 12:58:24,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:58:24,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:58:24,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:58:24,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-12-07 12:58:24,798 INFO L87 Difference]: Start difference. First operand 146441 states and 150719 transitions. Second operand 4 states. [2019-12-07 12:58:39,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:39,538 INFO L93 Difference]: Finished difference Result 341826 states and 351495 transitions. [2019-12-07 12:58:39,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:58:39,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2718 [2019-12-07 12:58:39,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:39,541 INFO L225 Difference]: With dead ends: 341826 [2019-12-07 12:58:39,541 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 12:58:39,633 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2733 GetRequests, 2717 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-12-07 12:58:39,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 12:58:39,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 12:58:39,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 12:58:39,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 12:58:39,633 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2718 [2019-12-07 12:58:39,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:39,634 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 12:58:39,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:58:39,634 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 12:58:39,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 12:58:39,834 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:58:39,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 12:58:50,070 WARN L192 SmtUtils]: Spent 10.21 s on a formula simplification. DAG size of input: 2059 DAG size of output: 1707 [2019-12-07 12:58:59,471 WARN L192 SmtUtils]: Spent 9.39 s on a formula simplification. DAG size of input: 1976 DAG size of output: 1638 [2019-12-07 12:59:09,496 WARN L192 SmtUtils]: Spent 10.02 s on a formula simplification. DAG size of input: 2056 DAG size of output: 1705 [2019-12-07 12:59:50,340 WARN L192 SmtUtils]: Spent 40.83 s on a formula simplification. DAG size of input: 1611 DAG size of output: 210 [2019-12-07 13:00:43,712 WARN L192 SmtUtils]: Spent 53.37 s on a formula simplification. DAG size of input: 1568 DAG size of output: 210 [2019-12-07 13:01:25,247 WARN L192 SmtUtils]: Spent 41.53 s on a formula simplification. DAG size of input: 1611 DAG size of output: 210 [2019-12-07 13:01:25,250 INFO L246 CegarLoopResult]: For program point L1819(lines 1819 1830) no Hoare annotation was computed. [2019-12-07 13:01:25,250 INFO L246 CegarLoopResult]: For program point L762(lines 762 770) no Hoare annotation was computed. [2019-12-07 13:01:25,250 INFO L246 CegarLoopResult]: For program point L1819-2(lines 1819 1830) no Hoare annotation was computed. [2019-12-07 13:01:25,250 INFO L246 CegarLoopResult]: For program point L762-2(lines 762 770) no Hoare annotation was computed. [2019-12-07 13:01:25,250 INFO L246 CegarLoopResult]: For program point L1291(lines 1291 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,250 INFO L246 CegarLoopResult]: For program point L1159(lines 1159 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,250 INFO L246 CegarLoopResult]: For program point L1556(lines 1556 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,250 INFO L246 CegarLoopResult]: For program point L1424(lines 1424 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,250 INFO L246 CegarLoopResult]: For program point L367(lines 367 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,250 INFO L246 CegarLoopResult]: For program point L103-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,250 INFO L246 CegarLoopResult]: For program point L1028(lines 1028 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,250 INFO L246 CegarLoopResult]: For program point L368(lines 368 377) no Hoare annotation was computed. [2019-12-07 13:01:25,250 INFO L246 CegarLoopResult]: For program point L368-2(lines 368 377) no Hoare annotation was computed. [2019-12-07 13:01:25,250 INFO L246 CegarLoopResult]: For program point L104(line 104) no Hoare annotation was computed. [2019-12-07 13:01:25,250 INFO L246 CegarLoopResult]: For program point L2086(lines 2086 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,250 INFO L246 CegarLoopResult]: For program point L2351(lines 2351 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,251 INFO L246 CegarLoopResult]: For program point L898(lines 898 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,251 INFO L246 CegarLoopResult]: For program point L634(lines 634 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,251 INFO L246 CegarLoopResult]: For program point L502(lines 502 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,251 INFO L246 CegarLoopResult]: For program point L238(lines 238 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,251 INFO L246 CegarLoopResult]: For program point L2220(lines 2220 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,251 INFO L246 CegarLoopResult]: For program point L106-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,251 INFO L246 CegarLoopResult]: For program point L1956(lines 1956 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,251 INFO L246 CegarLoopResult]: For program point L899(lines 899 908) no Hoare annotation was computed. [2019-12-07 13:01:25,251 INFO L246 CegarLoopResult]: For program point L899-2(lines 899 908) no Hoare annotation was computed. [2019-12-07 13:01:25,251 INFO L246 CegarLoopResult]: For program point L1428(lines 1428 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,251 INFO L246 CegarLoopResult]: For program point L107(line 107) no Hoare annotation was computed. [2019-12-07 13:01:25,251 INFO L246 CegarLoopResult]: For program point L2486(lines 2486 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,252 INFO L246 CegarLoopResult]: For program point L1429(lines 1429 1439) no Hoare annotation was computed. [2019-12-07 13:01:25,252 INFO L246 CegarLoopResult]: For program point L1429-2(lines 1429 1439) no Hoare annotation was computed. [2019-12-07 13:01:25,252 INFO L246 CegarLoopResult]: For program point L1297(lines 1297 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,252 INFO L246 CegarLoopResult]: For program point L1694(lines 1694 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,252 INFO L246 CegarLoopResult]: For program point L1166(lines 1166 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,252 INFO L246 CegarLoopResult]: For program point L109-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,252 INFO L246 CegarLoopResult]: For program point L1034(lines 1034 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,252 INFO L246 CegarLoopResult]: For program point L1563(lines 1563 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,252 INFO L246 CegarLoopResult]: For program point L2224(lines 2224 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,252 INFO L246 CegarLoopResult]: For program point L110(line 110) no Hoare annotation was computed. [2019-12-07 13:01:25,252 INFO L246 CegarLoopResult]: For program point L2092(lines 2092 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,253 INFO L246 CegarLoopResult]: For program point L771(lines 771 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,253 INFO L246 CegarLoopResult]: For program point L507(lines 507 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,253 INFO L246 CegarLoopResult]: For program point L243(lines 243 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,253 INFO L246 CegarLoopResult]: For program point L640(lines 640 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,253 INFO L246 CegarLoopResult]: For program point L2358(lines 2358 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,253 INFO L246 CegarLoopResult]: For program point L112-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,253 INFO L246 CegarLoopResult]: For program point L2491(lines 2491 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,253 INFO L246 CegarLoopResult]: For program point L113(line 113) no Hoare annotation was computed. [2019-12-07 13:01:25,253 INFO L246 CegarLoopResult]: For program point L2095(lines 2095 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,253 INFO L246 CegarLoopResult]: For program point L1963(lines 1963 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,253 INFO L246 CegarLoopResult]: For program point L1831(lines 1831 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,253 INFO L246 CegarLoopResult]: For program point L378(lines 378 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,254 INFO L246 CegarLoopResult]: For program point L1303(lines 1303 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,254 INFO L246 CegarLoopResult]: For program point L1964(lines 1964 1974) no Hoare annotation was computed. [2019-12-07 13:01:25,254 INFO L246 CegarLoopResult]: For program point L1964-2(lines 1964 1974) no Hoare annotation was computed. [2019-12-07 13:01:25,254 INFO L246 CegarLoopResult]: For program point L1700(lines 1700 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,254 INFO L246 CegarLoopResult]: For program point L1172(lines 1172 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,254 INFO L246 CegarLoopResult]: For program point L115-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,254 INFO L246 CegarLoopResult]: For program point L1040(lines 1040 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,254 INFO L246 CegarLoopResult]: For program point L776(lines 776 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,254 INFO L246 CegarLoopResult]: For program point L116(line 116) no Hoare annotation was computed. [2019-12-07 13:01:25,254 INFO L246 CegarLoopResult]: For program point L909(lines 909 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,254 INFO L246 CegarLoopResult]: For program point L1570(lines 1570 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,254 INFO L246 CegarLoopResult]: For program point L1306(lines 1306 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,254 INFO L246 CegarLoopResult]: For program point L249(lines 249 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,254 INFO L246 CegarLoopResult]: For program point L2231(lines 2231 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,254 INFO L246 CegarLoopResult]: For program point L514(lines 514 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,255 INFO L246 CegarLoopResult]: For program point L2496(lines 2496 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,255 INFO L246 CegarLoopResult]: For program point L2232(lines 2232 2243) no Hoare annotation was computed. [2019-12-07 13:01:25,255 INFO L246 CegarLoopResult]: For program point L2232-2(lines 2232 2243) no Hoare annotation was computed. [2019-12-07 13:01:25,255 INFO L246 CegarLoopResult]: For program point L118-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,255 INFO L246 CegarLoopResult]: For program point L647(lines 647 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,255 INFO L246 CegarLoopResult]: For program point L1440(lines 1440 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,255 INFO L246 CegarLoopResult]: For program point L2365(lines 2365 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,255 INFO L246 CegarLoopResult]: For program point L119(line 119) no Hoare annotation was computed. [2019-12-07 13:01:25,255 INFO L246 CegarLoopResult]: For program point L1044(lines 1044 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,255 INFO L246 CegarLoopResult]: For program point L2101(lines 2101 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,255 INFO L246 CegarLoopResult]: For program point L1837(lines 1837 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,255 INFO L246 CegarLoopResult]: For program point L913(lines 913 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,255 INFO L246 CegarLoopResult]: For program point L781(lines 781 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,255 INFO L246 CegarLoopResult]: For program point L1574(lines 1574 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,255 INFO L246 CegarLoopResult]: For program point L385(lines 385 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,255 INFO L246 CegarLoopResult]: For program point L121-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,255 INFO L246 CegarLoopResult]: For program point L1707(lines 1707 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,255 INFO L246 CegarLoopResult]: For program point L1575(lines 1575 1581) no Hoare annotation was computed. [2019-12-07 13:01:25,255 INFO L246 CegarLoopResult]: For program point L1575-2(lines 1575 1581) no Hoare annotation was computed. [2019-12-07 13:01:25,255 INFO L246 CegarLoopResult]: For program point L1179(lines 1179 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,255 INFO L246 CegarLoopResult]: For program point L122(line 122) no Hoare annotation was computed. [2019-12-07 13:01:25,256 INFO L246 CegarLoopResult]: For program point L1708(lines 1708 1717) no Hoare annotation was computed. [2019-12-07 13:01:25,256 INFO L246 CegarLoopResult]: For program point L1708-2(lines 1708 1717) no Hoare annotation was computed. [2019-12-07 13:01:25,256 INFO L246 CegarLoopResult]: For program point L1444(lines 1444 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,256 INFO L246 CegarLoopResult]: For program point L2105(lines 2105 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,256 INFO L246 CegarLoopResult]: For program point L2502(lines 2502 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,256 INFO L246 CegarLoopResult]: For program point L1313(lines 1313 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,256 INFO L246 CegarLoopResult]: For program point L256(lines 256 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,256 INFO L246 CegarLoopResult]: For program point L124-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,256 INFO L246 CegarLoopResult]: For program point L2106(lines 2106 2112) no Hoare annotation was computed. [2019-12-07 13:01:25,256 INFO L246 CegarLoopResult]: For program point L2106-2(lines 2106 2112) no Hoare annotation was computed. [2019-12-07 13:01:25,256 INFO L246 CegarLoopResult]: For program point L1842(lines 1842 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,256 INFO L246 CegarLoopResult]: For program point L653(lines 653 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,256 INFO L246 CegarLoopResult]: For program point L521(lines 521 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,256 INFO L246 CegarLoopResult]: For program point L2371(lines 2371 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,256 INFO L246 CegarLoopResult]: For program point L125(line 125) no Hoare annotation was computed. [2019-12-07 13:01:25,256 INFO L246 CegarLoopResult]: For program point L1050(lines 1050 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,256 INFO L246 CegarLoopResult]: For program point L1975(lines 1975 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,256 INFO L246 CegarLoopResult]: For program point L522(lines 522 531) no Hoare annotation was computed. [2019-12-07 13:01:25,256 INFO L246 CegarLoopResult]: For program point L522-2(lines 522 531) no Hoare annotation was computed. [2019-12-07 13:01:25,256 INFO L246 CegarLoopResult]: For program point L919(lines 919 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,257 INFO L246 CegarLoopResult]: For program point L787(lines 787 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,257 INFO L246 CegarLoopResult]: For program point L1184(lines 1184 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,257 INFO L246 CegarLoopResult]: For program point L127-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,257 INFO L246 CegarLoopResult]: For program point L920(lines 920 929) no Hoare annotation was computed. [2019-12-07 13:01:25,257 INFO L246 CegarLoopResult]: For program point L920-2(lines 920 929) no Hoare annotation was computed. [2019-12-07 13:01:25,257 INFO L246 CegarLoopResult]: For program point L1845(lines 1845 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,257 INFO L246 CegarLoopResult]: For program point L392(lines 392 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,257 INFO L246 CegarLoopResult]: For program point L1317(lines 1317 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,257 INFO L246 CegarLoopResult]: For program point L1185(lines 1185 1196) no Hoare annotation was computed. [2019-12-07 13:01:25,257 INFO L246 CegarLoopResult]: For program point L128(line 128) no Hoare annotation was computed. [2019-12-07 13:01:25,257 INFO L246 CegarLoopResult]: For program point L1185-2(lines 1185 1196) no Hoare annotation was computed. [2019-12-07 13:01:25,257 INFO L246 CegarLoopResult]: For program point L1582(lines 1582 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,257 INFO L246 CegarLoopResult]: For program point L1979(lines 1979 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,257 INFO L246 CegarLoopResult]: For program point L1451(lines 1451 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,257 INFO L246 CegarLoopResult]: For program point L262(lines 262 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,257 INFO L246 CegarLoopResult]: For program point L2244(lines 2244 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,257 INFO L246 CegarLoopResult]: For program point L130-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,257 INFO L246 CegarLoopResult]: For program point L2509(lines 2509 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,257 INFO L246 CegarLoopResult]: For program point L2377(lines 2377 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,257 INFO L246 CegarLoopResult]: For program point L2245(lines 2245 2255) no Hoare annotation was computed. [2019-12-07 13:01:25,258 INFO L246 CegarLoopResult]: For program point L131(line 131) no Hoare annotation was computed. [2019-12-07 13:01:25,258 INFO L246 CegarLoopResult]: For program point L2245-2(lines 2245 2255) no Hoare annotation was computed. [2019-12-07 13:01:25,258 INFO L246 CegarLoopResult]: For program point L1056(lines 1056 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,258 INFO L246 CegarLoopResult]: For program point L2113(lines 2113 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,258 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 13:01:25,258 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 134) no Hoare annotation was computed. [2019-12-07 13:01:25,258 INFO L246 CegarLoopResult]: For program point L660(lines 660 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,258 INFO L246 CegarLoopResult]: For program point L793(lines 793 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,258 INFO L246 CegarLoopResult]: For program point L1718(lines 1718 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,258 INFO L246 CegarLoopResult]: For program point L1322(lines 1322 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,258 INFO L246 CegarLoopResult]: For program point L133-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,258 INFO L246 CegarLoopResult]: For program point L1587(lines 1587 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,258 INFO L246 CegarLoopResult]: For program point L266(lines 266 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,258 INFO L246 CegarLoopResult]: For program point L134(line 134) no Hoare annotation was computed. [2019-12-07 13:01:25,258 INFO L246 CegarLoopResult]: For program point L1984(lines 1984 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,258 INFO L246 CegarLoopResult]: For program point L1852(lines 1852 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,258 INFO L246 CegarLoopResult]: For program point L399(lines 399 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,258 INFO L246 CegarLoopResult]: For program point L532(lines 532 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,258 INFO L246 CegarLoopResult]: For program point L2514(lines 2514 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,258 INFO L246 CegarLoopResult]: For program point L1457(lines 1457 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,259 INFO L246 CegarLoopResult]: For program point L2382(lines 2382 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,259 INFO L246 CegarLoopResult]: For program point L136-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,259 INFO L246 CegarLoopResult]: For program point L2118(lines 2118 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,259 INFO L246 CegarLoopResult]: For program point L1590(lines 1590 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,259 INFO L246 CegarLoopResult]: For program point L137(line 137) no Hoare annotation was computed. [2019-12-07 13:01:25,259 INFO L246 CegarLoopResult]: For program point L930(lines 930 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,259 INFO L246 CegarLoopResult]: For program point L1723(lines 1723 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,259 INFO L246 CegarLoopResult]: For program point L1063(lines 1063 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,259 INFO L246 CegarLoopResult]: For program point L667(lines 667 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,259 INFO L246 CegarLoopResult]: For program point L535(lines 535 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,259 INFO L246 CegarLoopResult]: For program point L2517(lines 2517 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,259 INFO L246 CegarLoopResult]: For program point L1328(lines 1328 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,259 INFO L246 CegarLoopResult]: For program point L139-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,259 INFO L246 CegarLoopResult]: For program point L800(lines 800 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,259 INFO L246 CegarLoopResult]: For program point L1329(lines 1329 1338) no Hoare annotation was computed. [2019-12-07 13:01:25,259 INFO L246 CegarLoopResult]: For program point L1329-2(lines 1329 1338) no Hoare annotation was computed. [2019-12-07 13:01:25,259 INFO L246 CegarLoopResult]: For program point L1197(lines 1197 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,259 INFO L246 CegarLoopResult]: For program point L140(line 140) no Hoare annotation was computed. [2019-12-07 13:01:25,259 INFO L246 CegarLoopResult]: For program point L1858(lines 1858 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,259 INFO L246 CegarLoopResult]: For program point L1462(lines 1462 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,260 INFO L246 CegarLoopResult]: For program point L405(lines 405 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,260 INFO L246 CegarLoopResult]: For program point L273(lines 273 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,260 INFO L246 CegarLoopResult]: For program point L1991(lines 1991 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,260 INFO L246 CegarLoopResult]: For program point L1859(lines 1859 1867) no Hoare annotation was computed. [2019-12-07 13:01:25,260 INFO L246 CegarLoopResult]: For program point L1859-2(lines 1859 1867) no Hoare annotation was computed. [2019-12-07 13:01:25,260 INFO L246 CegarLoopResult]: For program point L1595(lines 1595 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,260 INFO L246 CegarLoopResult]: For program point L406(lines 406 415) no Hoare annotation was computed. [2019-12-07 13:01:25,260 INFO L246 CegarLoopResult]: For program point L406-2(lines 406 415) no Hoare annotation was computed. [2019-12-07 13:01:25,260 INFO L246 CegarLoopResult]: For program point L274(lines 274 286) no Hoare annotation was computed. [2019-12-07 13:01:25,260 INFO L246 CegarLoopResult]: For program point L2256(lines 2256 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,260 INFO L246 CegarLoopResult]: For program point L274-2(lines 274 286) no Hoare annotation was computed. [2019-12-07 13:01:25,260 INFO L246 CegarLoopResult]: For program point L142-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,260 INFO L246 CegarLoopResult]: For program point L935(lines 935 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,260 INFO L246 CegarLoopResult]: For program point L1596(lines 1596 1607) no Hoare annotation was computed. [2019-12-07 13:01:25,260 INFO L246 CegarLoopResult]: For program point L1596-2(lines 1596 1607) no Hoare annotation was computed. [2019-12-07 13:01:25,260 INFO L246 CegarLoopResult]: For program point L2389(lines 2389 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,260 INFO L246 CegarLoopResult]: For program point L143(line 143) no Hoare annotation was computed. [2019-12-07 13:01:25,260 INFO L246 CegarLoopResult]: For program point L2125(lines 2125 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,260 INFO L246 CegarLoopResult]: For program point L2522(lines 2522 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,260 INFO L246 CegarLoopResult]: For program point L2390(lines 2390 2402) no Hoare annotation was computed. [2019-12-07 13:01:25,260 INFO L246 CegarLoopResult]: For program point L2390-2(lines 2390 2402) no Hoare annotation was computed. [2019-12-07 13:01:25,260 INFO L246 CegarLoopResult]: For program point L1069(lines 1069 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,261 INFO L246 CegarLoopResult]: For program point L1730(lines 1730 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,261 INFO L246 CegarLoopResult]: For program point L673(lines 673 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,261 INFO L246 CegarLoopResult]: For program point L541(lines 541 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,261 INFO L246 CegarLoopResult]: For program point L1202(lines 1202 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,261 INFO L246 CegarLoopResult]: For program point L145-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,261 INFO L246 CegarLoopResult]: For program point L1995(lines 1995 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,261 INFO L246 CegarLoopResult]: For program point L1467(lines 1467 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,261 INFO L246 CegarLoopResult]: For program point L146(line 146) no Hoare annotation was computed. [2019-12-07 13:01:25,261 INFO L246 CegarLoopResult]: For program point L939(lines 939 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,261 INFO L246 CegarLoopResult]: For program point L807(lines 807 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,261 INFO L246 CegarLoopResult]: For program point L2129(lines 2129 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,261 INFO L246 CegarLoopResult]: For program point L148-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,261 INFO L246 CegarLoopResult]: For program point L2527(lines 2527 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,261 INFO L246 CegarLoopResult]: For program point L2263(lines 2263 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,261 INFO L246 CegarLoopResult]: For program point L149(line 149) no Hoare annotation was computed. [2019-12-07 13:01:25,261 INFO L246 CegarLoopResult]: For program point L1735(lines 1735 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,261 INFO L246 CegarLoopResult]: For program point L2528(lines 2528 2538) no Hoare annotation was computed. [2019-12-07 13:01:25,261 INFO L246 CegarLoopResult]: For program point L2528-2(lines 2528 2538) no Hoare annotation was computed. [2019-12-07 13:01:25,261 INFO L246 CegarLoopResult]: For program point L1339(lines 1339 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,261 INFO L246 CegarLoopResult]: For program point L1868(lines 1868 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,262 INFO L246 CegarLoopResult]: For program point L679(lines 679 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,262 INFO L246 CegarLoopResult]: For program point L547(lines 547 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,262 INFO L246 CegarLoopResult]: For program point L151-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,262 INFO L246 CegarLoopResult]: For program point L1076(lines 1076 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,262 INFO L246 CegarLoopResult]: For program point L548(lines 548 557) no Hoare annotation was computed. [2019-12-07 13:01:25,262 INFO L246 CegarLoopResult]: For program point L548-2(lines 548 557) no Hoare annotation was computed. [2019-12-07 13:01:25,262 INFO L246 CegarLoopResult]: For program point L416(lines 416 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,262 INFO L246 CegarLoopResult]: For program point L1209(lines 1209 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,262 INFO L246 CegarLoopResult]: For program point L152(line 152) no Hoare annotation was computed. [2019-12-07 13:01:25,262 INFO L246 CegarLoopResult]: For program point L2002(lines 2002 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,262 INFO L246 CegarLoopResult]: For program point L1474(lines 1474 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,262 INFO L246 CegarLoopResult]: For program point L2135(lines 2135 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,262 INFO L246 CegarLoopResult]: For program point L946(lines 946 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,262 INFO L246 CegarLoopResult]: For program point L814(lines 814 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,262 INFO L246 CegarLoopResult]: For program point L2268(lines 2268 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,262 INFO L246 CegarLoopResult]: For program point L154-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,262 INFO L246 CegarLoopResult]: For program point L1608(lines 1608 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,262 INFO L246 CegarLoopResult]: For program point L287(lines 287 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,262 INFO L246 CegarLoopResult]: For program point L155(line 155) no Hoare annotation was computed. [2019-12-07 13:01:25,262 INFO L246 CegarLoopResult]: For program point L1741(lines 1741 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,262 INFO L246 CegarLoopResult]: For program point L1081(lines 1081 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,263 INFO L246 CegarLoopResult]: For program point L1346(lines 1346 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,263 INFO L246 CegarLoopResult]: For program point L2403(lines 2403 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,263 INFO L246 CegarLoopResult]: For program point L157-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,263 INFO L246 CegarLoopResult]: For program point L25(lines 25 27) no Hoare annotation was computed. [2019-12-07 13:01:25,263 INFO L246 CegarLoopResult]: For program point L25-2(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,263 INFO L246 CegarLoopResult]: For program point L2007(lines 2007 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,263 INFO L246 CegarLoopResult]: For program point L1875(lines 1875 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,263 INFO L246 CegarLoopResult]: For program point L686(lines 686 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,263 INFO L246 CegarLoopResult]: For program point L2404(lines 2404 2415) no Hoare annotation was computed. [2019-12-07 13:01:25,263 INFO L246 CegarLoopResult]: For program point L2404-2(lines 2404 2415) no Hoare annotation was computed. [2019-12-07 13:01:25,263 INFO L246 CegarLoopResult]: For program point L158(line 158) no Hoare annotation was computed. [2019-12-07 13:01:25,263 INFO L246 CegarLoopResult]: For program point L2140(lines 2140 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,263 INFO L246 CegarLoopResult]: For program point L26(line 26) no Hoare annotation was computed. [2019-12-07 13:01:25,263 INFO L246 CegarLoopResult]: For program point L687(lines 687 697) no Hoare annotation was computed. [2019-12-07 13:01:25,263 INFO L246 CegarLoopResult]: For program point L687-2(lines 687 697) no Hoare annotation was computed. [2019-12-07 13:01:25,263 INFO L246 CegarLoopResult]: For program point L423(lines 423 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,263 INFO L246 CegarLoopResult]: For program point L1216(lines 1216 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,263 INFO L246 CegarLoopResult]: For program point L952(lines 952 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,263 INFO L246 CegarLoopResult]: For program point L820(lines 820 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,264 INFO L246 CegarLoopResult]: For program point L1745(lines 1745 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,264 INFO L246 CegarLoopResult]: For program point L1613(lines 1613 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,264 INFO L246 CegarLoopResult]: For program point L1481(lines 1481 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,264 INFO L246 CegarLoopResult]: For program point L160-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,264 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 13:01:25,264 INFO L246 CegarLoopResult]: For program point L28-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,264 INFO L246 CegarLoopResult]: For program point L2010(lines 2010 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,264 INFO L246 CegarLoopResult]: For program point L2539(lines 2539 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,264 INFO L246 CegarLoopResult]: For program point L2275(lines 2275 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,264 INFO L246 CegarLoopResult]: For program point L161(line 161) no Hoare annotation was computed. [2019-12-07 13:01:25,264 INFO L246 CegarLoopResult]: For program point L29(line 29) no Hoare annotation was computed. [2019-12-07 13:01:25,264 INFO L246 CegarLoopResult]: For program point L558(lines 558 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,264 INFO L246 CegarLoopResult]: For program point L294(lines 294 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,264 INFO L246 CegarLoopResult]: For program point L1352(lines 1352 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,264 INFO L246 CegarLoopResult]: For program point L1220(lines 1220 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,264 INFO L246 CegarLoopResult]: For program point L163-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,264 INFO L246 CegarLoopResult]: For program point L1088(lines 1088 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,264 INFO L246 CegarLoopResult]: For program point L2145(lines 2145 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,264 INFO L246 CegarLoopResult]: For program point L31-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,264 INFO L246 CegarLoopResult]: For program point L1881(lines 1881 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,265 INFO L246 CegarLoopResult]: For program point L1749(lines 1749 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,265 INFO L246 CegarLoopResult]: For program point L428(lines 428 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,265 INFO L246 CegarLoopResult]: For program point L1221(lines 1221 1230) no Hoare annotation was computed. [2019-12-07 13:01:25,265 INFO L246 CegarLoopResult]: For program point L164(line 164) no Hoare annotation was computed. [2019-12-07 13:01:25,265 INFO L246 CegarLoopResult]: For program point L1221-2(lines 1221 1230) no Hoare annotation was computed. [2019-12-07 13:01:25,265 INFO L246 CegarLoopResult]: For program point L32(line 32) no Hoare annotation was computed. [2019-12-07 13:01:25,265 INFO L246 CegarLoopResult]: For program point L826(lines 826 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,265 INFO L246 CegarLoopResult]: For program point L2544(lines 2544 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,265 INFO L246 CegarLoopResult]: For program point L1487(lines 1487 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,265 INFO L246 CegarLoopResult]: For program point L166-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,265 INFO L246 CegarLoopResult]: For program point L34-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,265 INFO L246 CegarLoopResult]: For program point L2016(lines 2016 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,265 INFO L246 CegarLoopResult]: For program point L959(lines 959 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,265 INFO L246 CegarLoopResult]: For program point L1620(lines 1620 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,265 INFO L246 CegarLoopResult]: For program point L2281(lines 2281 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,265 INFO L246 CegarLoopResult]: For program point L167(line 167) no Hoare annotation was computed. [2019-12-07 13:01:25,265 INFO L246 CegarLoopResult]: For program point L35(line 35) no Hoare annotation was computed. [2019-12-07 13:01:25,265 INFO L246 CegarLoopResult]: For program point L565(lines 565 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,265 INFO L246 CegarLoopResult]: For program point L1490(lines 1490 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,266 INFO L246 CegarLoopResult]: For program point L433(lines 433 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,266 INFO L246 CegarLoopResult]: For program point L301(lines 301 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,266 INFO L246 CegarLoopResult]: For program point L169-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,266 INFO L246 CegarLoopResult]: For program point L1094(lines 1094 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,266 INFO L246 CegarLoopResult]: For program point L37-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,266 INFO L246 CegarLoopResult]: For program point L698(lines 698 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,266 INFO L246 CegarLoopResult]: For program point L2416(lines 2416 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,266 INFO L246 CegarLoopResult]: For program point L1359(lines 1359 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,266 INFO L246 CegarLoopResult]: For program point L170(line 170) no Hoare annotation was computed. [2019-12-07 13:01:25,266 INFO L246 CegarLoopResult]: For program point L2152(lines 2152 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,266 INFO L246 CegarLoopResult]: For program point L38(line 38) no Hoare annotation was computed. [2019-12-07 13:01:25,266 INFO L246 CegarLoopResult]: For program point L2020(lines 2020 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,266 INFO L246 CegarLoopResult]: For program point L1888(lines 1888 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,266 INFO L246 CegarLoopResult]: For program point L831(lines 831 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,266 INFO L246 CegarLoopResult]: For program point L1756(lines 1756 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,266 INFO L246 CegarLoopResult]: For program point L2021(lines 2021 2030) no Hoare annotation was computed. [2019-12-07 13:01:25,267 INFO L246 CegarLoopResult]: For program point L2021-2(lines 2021 2030) no Hoare annotation was computed. [2019-12-07 13:01:25,267 INFO L246 CegarLoopResult]: For program point L172-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,267 INFO L246 CegarLoopResult]: For program point L40-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,267 INFO L246 CegarLoopResult]: For program point L1626(lines 1626 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,267 INFO L246 CegarLoopResult]: For program point L2551(lines 2551 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,267 INFO L246 CegarLoopResult]: For program point L2287(lines 2287 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,267 INFO L246 CegarLoopResult]: For program point L173(line 173) no Hoare annotation was computed. [2019-12-07 13:01:25,267 INFO L246 CegarLoopResult]: For program point L41(line 41) no Hoare annotation was computed. [2019-12-07 13:01:25,267 INFO L246 CegarLoopResult]: For program point L966(lines 966 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,267 INFO L246 CegarLoopResult]: For program point L570(lines 570 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,267 INFO L246 CegarLoopResult]: For program point L306(lines 306 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,267 INFO L246 CegarLoopResult]: For program point L1231(lines 1231 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,267 INFO L246 CegarLoopResult]: For program point L703(lines 703 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,268 INFO L246 CegarLoopResult]: For program point L439(lines 439 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,268 INFO L246 CegarLoopResult]: For program point L1364(lines 1364 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,268 INFO L246 CegarLoopResult]: For program point L175-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,268 INFO L246 CegarLoopResult]: For program point L1100(lines 1100 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,268 INFO L246 CegarLoopResult]: For program point L2157(lines 2157 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,268 INFO L246 CegarLoopResult]: For program point L43-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,268 INFO L246 CegarLoopResult]: For program point L1497(lines 1497 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,268 INFO L246 CegarLoopResult]: For program point L2422(lines 2422 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,268 INFO L246 CegarLoopResult]: For program point L1365(lines 1365 1376) no Hoare annotation was computed. [2019-12-07 13:01:25,268 INFO L246 CegarLoopResult]: For program point L1365-2(lines 1365 1376) no Hoare annotation was computed. [2019-12-07 13:01:25,268 INFO L246 CegarLoopResult]: For program point L176(line 176) no Hoare annotation was computed. [2019-12-07 13:01:25,268 INFO L246 CegarLoopResult]: For program point L44(line 44) no Hoare annotation was computed. [2019-12-07 13:01:25,268 INFO L246 CegarLoopResult]: For program point L837(lines 837 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,269 INFO L246 CegarLoopResult]: For program point L1895(lines 1895 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,269 INFO L246 CegarLoopResult]: For program point L838(lines 838 846) no Hoare annotation was computed. [2019-12-07 13:01:25,269 INFO L246 CegarLoopResult]: For program point L838-2(lines 838 846) no Hoare annotation was computed. [2019-12-07 13:01:25,269 INFO L246 CegarLoopResult]: For program point L1763(lines 1763 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,269 INFO L246 CegarLoopResult]: For program point L178-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,269 INFO L246 CegarLoopResult]: For program point L46-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,269 INFO L246 CegarLoopResult]: For program point L1632(lines 1632 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,269 INFO L246 CegarLoopResult]: For program point L2557(lines 2557 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,269 INFO L246 CegarLoopResult]: For program point L2293(lines 2293 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,269 INFO L246 CegarLoopResult]: For program point L179(line 179) no Hoare annotation was computed. [2019-12-07 13:01:25,269 INFO L246 CegarLoopResult]: For program point L47(line 47) no Hoare annotation was computed. [2019-12-07 13:01:25,269 INFO L246 CegarLoopResult]: For program point L972(lines 972 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,269 INFO L246 CegarLoopResult]: For program point L576(lines 576 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,270 INFO L246 CegarLoopResult]: For program point L1237(lines 1237 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,270 INFO L246 CegarLoopResult]: For program point L709(lines 709 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,270 INFO L246 CegarLoopResult]: For program point L313(lines 313 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,270 INFO L246 CegarLoopResult]: For program point L181-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,270 INFO L246 CegarLoopResult]: For program point L1106(lines 1106 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,270 INFO L246 CegarLoopResult]: For program point L2163(lines 2163 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,270 INFO L246 CegarLoopResult]: For program point L49-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,270 INFO L246 CegarLoopResult]: For program point L2031(lines 2031 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,270 INFO L246 CegarLoopResult]: For program point L710(lines 710 718) no Hoare annotation was computed. [2019-12-07 13:01:25,270 INFO L246 CegarLoopResult]: For program point L710-2(lines 710 718) no Hoare annotation was computed. [2019-12-07 13:01:25,270 INFO L246 CegarLoopResult]: For program point L446(lines 446 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,270 INFO L246 CegarLoopResult]: For program point L182(line 182) no Hoare annotation was computed. [2019-12-07 13:01:25,271 INFO L246 CegarLoopResult]: For program point L50(line 50) no Hoare annotation was computed. [2019-12-07 13:01:25,271 INFO L246 CegarLoopResult]: For program point L975(lines 975 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,271 INFO L246 CegarLoopResult]: For program point L1900(lines 1900 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,271 INFO L246 CegarLoopResult]: For program point L1636(lines 1636 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,271 INFO L246 CegarLoopResult]: For program point L1504(lines 1504 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,271 INFO L246 CegarLoopResult]: For program point L2429(lines 2429 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,271 INFO L246 CegarLoopResult]: For program point L2297(lines 2297 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,271 INFO L246 CegarLoopResult]: For program point L2430(lines 2430 2439) no Hoare annotation was computed. [2019-12-07 13:01:25,271 INFO L246 CegarLoopResult]: For program point L2430-2(lines 2430 2439) no Hoare annotation was computed. [2019-12-07 13:01:25,271 INFO L246 CegarLoopResult]: For program point L184-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,271 INFO L246 CegarLoopResult]: For program point L52-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,271 INFO L246 CegarLoopResult]: For program point L1770(lines 1770 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,271 INFO L246 CegarLoopResult]: For program point L2563(lines 2563 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,272 INFO L246 CegarLoopResult]: For program point L185(line 185) no Hoare annotation was computed. [2019-12-07 13:01:25,272 INFO L246 CegarLoopResult]: For program point L53(line 53) no Hoare annotation was computed. [2019-12-07 13:01:25,272 INFO L246 CegarLoopResult]: For program point L582(lines 582 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,272 INFO L246 CegarLoopResult]: For program point L2168(lines 2168 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,272 INFO L246 CegarLoopResult]: For program point L847(lines 847 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,272 INFO L246 CegarLoopResult]: For program point L451(lines 451 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,272 INFO L246 CegarLoopResult]: For program point L319(lines 319 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,272 INFO L246 CegarLoopResult]: For program point L1244(lines 1244 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,272 INFO L246 CegarLoopResult]: For program point L187-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,272 INFO L246 CegarLoopResult]: For program point L55-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,272 INFO L246 CegarLoopResult]: For program point L848(lines 848 858) no Hoare annotation was computed. [2019-12-07 13:01:25,272 INFO L246 CegarLoopResult]: For program point L848-2(lines 848 858) no Hoare annotation was computed. [2019-12-07 13:01:25,272 INFO L246 CegarLoopResult]: For program point L1377(lines 1377 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,273 INFO L246 CegarLoopResult]: For program point L2302(lines 2302 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,273 INFO L246 CegarLoopResult]: For program point L188(line 188) no Hoare annotation was computed. [2019-12-07 13:01:25,273 INFO L246 CegarLoopResult]: For program point L1113(lines 1113 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,273 INFO L246 CegarLoopResult]: For program point L56(line 56) no Hoare annotation was computed. [2019-12-07 13:01:25,273 INFO L246 CegarLoopResult]: For program point L2038(lines 2038 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,273 INFO L246 CegarLoopResult]: For program point L981(lines 981 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,273 INFO L246 CegarLoopResult]: For program point L1906(lines 1906 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,273 INFO L246 CegarLoopResult]: For program point L1510(lines 1510 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,273 INFO L246 CegarLoopResult]: For program point L1907(lines 1907 1915) no Hoare annotation was computed. [2019-12-07 13:01:25,273 INFO L246 CegarLoopResult]: For program point L1907-2(lines 1907 1915) no Hoare annotation was computed. [2019-12-07 13:01:25,274 INFO L242 CegarLoopResult]: At program point L1643(lines 24 1644) the Hoare annotation is: (let ((.cse38 (+ ~a14~0 114))) (let ((.cse32 (< 0 .cse38)) (.cse0 (< 124 ~a26~0)) (.cse8 (<= ~a28~0 134)) (.cse9 (< 37 ~a28~0)) (.cse23 (<= ~a24~0 1)) (.cse39 (+ ~a14~0 182))) (let ((.cse34 (* ~a26~0 (- 1))) (.cse5 (< 134 ~a28~0)) (.cse14 (<= .cse39 0)) (.cse26 (<= 301 ~a28~0)) (.cse33 (or (and .cse32 .cse23) (and .cse0 .cse23) (and .cse8 .cse9 .cse23))) (.cse6 (<= ~a21~0 124)) (.cse25 (<= (+ ~a14~0 84) 0))) (let ((.cse19 (or (<= ~a28~0 37) .cse25)) (.cse24 (<= ~a26~0 460652)) (.cse13 (<= 0 (+ ~a14~0 79))) (.cse3 (< 0 .cse39)) (.cse16 (<= 183 ~a28~0)) (.cse17 (<= ~a28~0 279)) (.cse4 (<= ~a26~0 217)) (.cse18 (<= ~a26~0 599553)) (.cse20 (<= ~a14~0 364756)) (.cse15 (or (and .cse26 .cse23 .cse6) (and .cse33 .cse6))) (.cse27 (< 217 ~a26~0)) (.cse29 (<= ~a26~0 222)) (.cse2 (<= .cse38 0)) (.cse22 (or .cse5 .cse14)) (.cse11 (<= ~a26~0 124)) (.cse31 (exists ((v_~a14~0_1227 Int)) (let ((.cse37 (div v_~a14~0_1227 (- 5)))) (let ((.cse36 (* 10 .cse37))) (and (<= 0 (+ .cse36 3221490)) (<= (div (+ (* .cse37 10) 3221480) 9) ~a14~0) (not (= (mod v_~a14~0_1227 (- 5)) 0)) (< v_~a14~0_1227 0) (<= (+ v_~a14~0_1227 84) 0) (<= 0 (+ .cse36 3221480))))))) (.cse21 (<= (+ ~a26~0 68) 0)) (.cse10 (<= (+ ~a14~0 183) 0)) (.cse1 (= ~a24~0 3)) (.cse7 (= ~a24~0 2)) (.cse30 (<= 0 (+ (div (+ ~a14~0 459561) 5) 113))) (.cse28 (<= (div (+ .cse34 596057) (- 5)) 124)) (.cse12 (<= 222 ~a26~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (or (not (= 2 ULTIMATE.start_calculate_output_~input)) .cse5) .cse6) (and .cse7 (<= (+ ~a26~0 600) 0) .cse8 .cse9 .cse6) (and .cse10 .cse7 .cse8 .cse11 .cse6) (and .cse7 .cse8 .cse9 .cse12 .cse13 .cse6) (and .cse1 .cse8 .cse9 .cse4 .cse14 .cse6) (and .cse15 .cse4) (and .cse1 .cse8 .cse2 .cse3 .cse9 .cse6) (and .cse7 .cse16 .cse17 .cse18 .cse14 .cse6) (and .cse19 .cse7 .cse20 .cse12 .cse13 .cse6) (and .cse21 .cse7 .cse6 .cse22) (and .cse2 .cse9 .cse23 .cse6) (and .cse24 .cse7 .cse9 .cse12 .cse6) (and .cse7 .cse3 .cse4 .cse25 .cse6) (and .cse26 .cse10 .cse1 .cse18 .cse6) (and .cse7 .cse8 .cse18 .cse9 .cse12 .cse6) (and .cse23 (or .cse21 .cse14)) (and .cse19 .cse15) (and .cse0 .cse24 .cse27 .cse10 .cse7 .cse6) (and .cse24 .cse27 .cse7 .cse20 .cse13 .cse6) (and .cse7 .cse3 .cse28 .cse12 .cse6 .cse25) (and .cse0 .cse7 .cse29 .cse8 .cse9 .cse6) (and .cse7 .cse16 .cse17 .cse30 .cse14 .cse6) (and .cse20 (= ~a26~0 222) .cse23 .cse6) (and .cse7 .cse8 .cse30 .cse9 .cse14 .cse6) (and .cse27 .cse10 .cse1 .cse18 .cse9 .cse6) (and .cse7 .cse6 .cse22 .cse31) (and .cse0 .cse7 .cse4 .cse9 .cse6) (and .cse1 .cse32 .cse11 .cse25 .cse6) (and .cse0 .cse10 .cse7 .cse8 .cse30 .cse18 .cse6) (and .cse33 .cse25) (and .cse7 .cse32 .cse6 .cse25) (and .cse26 .cse7 .cse18 .cse6) (and (<= (div (+ .cse34 557256) (- 20)) 124) (or (and .cse20 .cse33 .cse6) (and (<= ~a26~0 466645) .cse15)) .cse22) (and .cse27 .cse7 .cse29 .cse2 .cse9 .cse6) (and .cse7 (exists ((v_~a14~0_1230 Int)) (let ((.cse35 (* v_~a14~0_1230 9))) (and (<= (+ v_~a14~0_1230 182) 0) (< (* 9 v_~a14~0_1230) 0) (<= 0 (+ (div (+ v_~a14~0_1230 459561) 5) 113)) (not (= (mod .cse35 10) 0)) (<= (+ (div .cse35 10) 588353) ~a14~0)))) .cse8 .cse9 .cse6) (and .cse1 .cse9 .cse11 .cse6 .cse22) (and .cse7 .cse11 .cse6 .cse31) (and .cse21 .cse10 .cse1 (<= (+ ~a28~0 599901) 0) .cse6) (and .cse7 .cse30 .cse9 .cse28 .cse12 .cse6 .cse25)))))) [2019-12-07 13:01:25,274 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 13:01:25,274 INFO L246 CegarLoopResult]: For program point L190-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,274 INFO L246 CegarLoopResult]: For program point L2172(lines 2172 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,274 INFO L246 CegarLoopResult]: For program point L58-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,274 INFO L246 CegarLoopResult]: For program point L719(lines 719 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,275 INFO L246 CegarLoopResult]: For program point L587(lines 587 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,275 INFO L246 CegarLoopResult]: For program point L323(lines 323 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,275 INFO L246 CegarLoopResult]: For program point L191(line 191) no Hoare annotation was computed. [2019-12-07 13:01:25,275 INFO L246 CegarLoopResult]: For program point L59(line 59) no Hoare annotation was computed. [2019-12-07 13:01:25,275 INFO L246 CegarLoopResult]: For program point L1777(lines 1777 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,275 INFO L246 CegarLoopResult]: For program point L1249(lines 1249 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,275 INFO L242 CegarLoopResult]: At program point L2571(lines 1646 2572) the Hoare annotation is: (let ((.cse37 (+ ~a14~0 114)) (.cse38 (+ ~a14~0 182))) (let ((.cse13 (* ~a26~0 (- 1))) (.cse10 (< 134 ~a28~0)) (.cse20 (<= .cse38 0)) (.cse33 (< 0 .cse37)) (.cse5 (< 124 ~a26~0)) (.cse12 (<= ~a28~0 134)) (.cse2 (< 37 ~a28~0)) (.cse3 (<= ~a24~0 1)) (.cse29 (<= (+ ~a14~0 84) 0))) (let ((.cse21 (<= ~a28~0 279)) (.cse22 (<= 183 ~a28~0)) (.cse25 (or (<= ~a28~0 37) .cse29)) (.cse28 (<= ~a26~0 460652)) (.cse0 (<= ~a14~0 364756)) (.cse19 (<= 0 (+ ~a14~0 79))) (.cse8 (< 0 .cse38)) (.cse9 (<= ~a26~0 217)) (.cse14 (or (and .cse33 .cse3) (and .cse5 .cse3) (and .cse12 .cse2 .cse3))) (.cse30 (<= 301 ~a28~0)) (.cse24 (<= ~a26~0 599553)) (.cse31 (< 217 ~a26~0)) (.cse1 (<= ~a26~0 222)) (.cse7 (<= .cse37 0)) (.cse15 (or .cse10 .cse20)) (.cse27 (<= (+ ~a26~0 68) 0)) (.cse16 (<= (+ ~a14~0 183) 0)) (.cse6 (= ~a24~0 3)) (.cse17 (<= ~a26~0 124)) (.cse26 (exists ((v_~a14~0_1227 Int)) (let ((.cse36 (div v_~a14~0_1227 (- 5)))) (let ((.cse35 (* 10 .cse36))) (and (<= 0 (+ .cse35 3221490)) (<= (div (+ (* .cse36 10) 3221480) 9) ~a14~0) (not (= (mod v_~a14~0_1227 (- 5)) 0)) (< v_~a14~0_1227 0) (<= (+ v_~a14~0_1227 84) 0) (<= 0 (+ .cse35 3221480))))))) (.cse11 (= ~a24~0 2)) (.cse23 (<= 0 (+ (div (+ ~a14~0 459561) 5) 113))) (.cse32 (<= (div (+ .cse13 596057) (- 5)) 124)) (.cse18 (<= 222 ~a26~0)) (.cse4 (<= ~a21~0 124))) (or (and .cse0 .cse1 (= ~a26~0 222) .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 (or (not (= 2 ULTIMATE.start_calculate_output_~input)) .cse10) .cse4) (and .cse11 (<= (+ ~a26~0 600) 0) .cse12 .cse2 .cse4) (and (<= (div (+ .cse13 557256) (- 20)) 124) (or (and .cse0 .cse14 .cse4) (and (<= ~a26~0 466645) .cse14 .cse4)) .cse15) (and .cse16 .cse11 .cse12 .cse17 .cse4) (and .cse11 .cse12 .cse2 .cse18 .cse19 .cse4) (and .cse6 .cse12 .cse2 .cse9 .cse20 .cse4) (and .cse6 .cse12 .cse7 .cse8 .cse2 .cse4) (and .cse11 .cse21 .cse22 .cse23 .cse20 .cse4) (and .cse11 .cse21 .cse22 .cse24 .cse20 .cse4) (and .cse25 .cse11 .cse0 .cse18 .cse19 .cse4) (and .cse11 .cse15 .cse4 .cse26) (and .cse27 .cse11 .cse4 .cse15) (and .cse28 .cse11 .cse2 .cse18 .cse4) (and .cse11 .cse8 .cse9 .cse29 .cse4) (and .cse30 .cse16 .cse6 .cse24 .cse4) (and .cse25 .cse14 .cse4) (and .cse11 .cse12 .cse24 .cse2 .cse18 .cse4) (and .cse3 (or .cse27 .cse20)) (and .cse5 .cse28 .cse31 .cse16 .cse11 .cse4) (and .cse28 .cse31 .cse11 .cse0 .cse19 .cse4) (and .cse11 .cse8 .cse32 .cse18 .cse4 .cse29) (and .cse1 .cse2 .cse9 .cse3 .cse4) (and .cse5 .cse11 .cse1 .cse12 .cse2 .cse4) (and .cse11 .cse12 .cse23 .cse2 .cse20 .cse4) (and .cse31 .cse16 .cse6 .cse24 .cse2 .cse4) (and .cse5 .cse11 .cse9 .cse2 .cse4) (and .cse6 .cse33 .cse17 .cse29 .cse4) (and .cse5 .cse16 .cse11 .cse12 .cse23 .cse24 .cse4) (and .cse14 .cse29) (and .cse11 .cse33 .cse4 .cse29) (and .cse30 .cse11 .cse24 .cse4) (and .cse31 .cse11 .cse1 .cse7 .cse2 .cse4) (and .cse11 (exists ((v_~a14~0_1230 Int)) (let ((.cse34 (* v_~a14~0_1230 9))) (and (<= (+ v_~a14~0_1230 182) 0) (< (* 9 v_~a14~0_1230) 0) (<= 0 (+ (div (+ v_~a14~0_1230 459561) 5) 113)) (not (= (mod .cse34 10) 0)) (<= (+ (div .cse34 10) 588353) ~a14~0)))) .cse12 .cse2 .cse4) (and .cse6 .cse2 .cse17 .cse4 .cse15) (and .cse27 .cse16 .cse6 (<= (+ ~a28~0 599901) 0) .cse4) (and .cse11 .cse17 .cse4 .cse26) (and .cse11 .cse23 .cse2 .cse32 .cse18 .cse4 .cse29))))) [2019-12-07 13:01:25,275 INFO L246 CegarLoopResult]: For program point L2307(lines 2307 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,275 INFO L246 CegarLoopResult]: For program point L193-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,275 INFO L246 CegarLoopResult]: For program point L61-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,276 INFO L246 CegarLoopResult]: For program point L2043(lines 2043 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,276 INFO L246 CegarLoopResult]: For program point L1515(lines 1515 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,276 INFO L246 CegarLoopResult]: For program point L458(lines 458 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,276 INFO L246 CegarLoopResult]: For program point L2440(lines 2440 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,276 INFO L246 CegarLoopResult]: For program point L1383(lines 1383 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,276 INFO L246 CegarLoopResult]: For program point L194(line 194) no Hoare annotation was computed. [2019-12-07 13:01:25,276 INFO L246 CegarLoopResult]: For program point L1119(lines 1119 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,276 INFO L246 CegarLoopResult]: For program point L62(line 62) no Hoare annotation was computed. [2019-12-07 13:01:25,276 INFO L246 CegarLoopResult]: For program point L988(lines 988 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,276 INFO L246 CegarLoopResult]: For program point L1649(lines 1649 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,276 INFO L249 CegarLoopResult]: At program point L2574(lines 2574 2590) the Hoare annotation is: true [2019-12-07 13:01:25,276 INFO L246 CegarLoopResult]: For program point L196-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,276 INFO L246 CegarLoopResult]: For program point L2178(lines 2178 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,276 INFO L246 CegarLoopResult]: For program point L64-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,276 INFO L246 CegarLoopResult]: For program point L725(lines 725 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,276 INFO L246 CegarLoopResult]: For program point L197(line 197) no Hoare annotation was computed. [2019-12-07 13:01:25,276 INFO L246 CegarLoopResult]: For program point L65(line 65) no Hoare annotation was computed. [2019-12-07 13:01:25,276 INFO L246 CegarLoopResult]: For program point L726(lines 726 736) no Hoare annotation was computed. [2019-12-07 13:01:25,276 INFO L246 CegarLoopResult]: For program point L726-2(lines 726 736) no Hoare annotation was computed. [2019-12-07 13:01:25,276 INFO L246 CegarLoopResult]: For program point L594(lines 594 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,277 INFO L246 CegarLoopResult]: For program point L330(lines 330 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,277 INFO L246 CegarLoopResult]: For program point L1255(lines 1255 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,277 INFO L246 CegarLoopResult]: For program point L1916(lines 1916 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,277 INFO L246 CegarLoopResult]: For program point L859(lines 859 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,277 INFO L246 CegarLoopResult]: For program point L1784(lines 1784 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,277 INFO L246 CegarLoopResult]: For program point L463(lines 463 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,277 INFO L246 CegarLoopResult]: For program point L2313(lines 2313 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,277 INFO L246 CegarLoopResult]: For program point L199-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,277 INFO L246 CegarLoopResult]: For program point L67-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,277 INFO L246 CegarLoopResult]: For program point L1521(lines 1521 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,277 INFO L246 CegarLoopResult]: For program point L2446(lines 2446 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,277 INFO L246 CegarLoopResult]: For program point L1389(lines 1389 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,277 INFO L246 CegarLoopResult]: For program point L200(line 200) no Hoare annotation was computed. [2019-12-07 13:01:25,277 INFO L246 CegarLoopResult]: For program point L1125(lines 1125 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,277 INFO L246 CegarLoopResult]: For program point L68(line 68) no Hoare annotation was computed. [2019-12-07 13:01:25,277 INFO L246 CegarLoopResult]: For program point L2050(lines 2050 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,277 INFO L246 CegarLoopResult]: For program point L1654(lines 1654 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,278 INFO L242 CegarLoopResult]: At program point L2580-2(lines 2580 2589) the Hoare annotation is: (let ((.cse38 (+ ~a14~0 114))) (let ((.cse32 (< 0 .cse38)) (.cse0 (< 124 ~a26~0)) (.cse8 (<= ~a28~0 134)) (.cse9 (< 37 ~a28~0)) (.cse23 (<= ~a24~0 1)) (.cse39 (+ ~a14~0 182))) (let ((.cse34 (* ~a26~0 (- 1))) (.cse5 (< 134 ~a28~0)) (.cse14 (<= .cse39 0)) (.cse26 (<= 301 ~a28~0)) (.cse33 (or (and .cse32 .cse23) (and .cse0 .cse23) (and .cse8 .cse9 .cse23))) (.cse6 (<= ~a21~0 124)) (.cse25 (<= (+ ~a14~0 84) 0))) (let ((.cse19 (or (<= ~a28~0 37) .cse25)) (.cse24 (<= ~a26~0 460652)) (.cse13 (<= 0 (+ ~a14~0 79))) (.cse3 (< 0 .cse39)) (.cse16 (<= 183 ~a28~0)) (.cse17 (<= ~a28~0 279)) (.cse4 (<= ~a26~0 217)) (.cse18 (<= ~a26~0 599553)) (.cse20 (<= ~a14~0 364756)) (.cse15 (or (and .cse26 .cse23 .cse6) (and .cse33 .cse6))) (.cse27 (< 217 ~a26~0)) (.cse29 (<= ~a26~0 222)) (.cse2 (<= .cse38 0)) (.cse22 (or .cse5 .cse14)) (.cse11 (<= ~a26~0 124)) (.cse31 (exists ((v_~a14~0_1227 Int)) (let ((.cse37 (div v_~a14~0_1227 (- 5)))) (let ((.cse36 (* 10 .cse37))) (and (<= 0 (+ .cse36 3221490)) (<= (div (+ (* .cse37 10) 3221480) 9) ~a14~0) (not (= (mod v_~a14~0_1227 (- 5)) 0)) (< v_~a14~0_1227 0) (<= (+ v_~a14~0_1227 84) 0) (<= 0 (+ .cse36 3221480))))))) (.cse21 (<= (+ ~a26~0 68) 0)) (.cse10 (<= (+ ~a14~0 183) 0)) (.cse1 (= ~a24~0 3)) (.cse7 (= ~a24~0 2)) (.cse30 (<= 0 (+ (div (+ ~a14~0 459561) 5) 113))) (.cse28 (<= (div (+ .cse34 596057) (- 5)) 124)) (.cse12 (<= 222 ~a26~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (or (not (= 2 ULTIMATE.start_calculate_output_~input)) .cse5) .cse6) (and .cse7 (<= (+ ~a26~0 600) 0) .cse8 .cse9 .cse6) (and .cse10 .cse7 .cse8 .cse11 .cse6) (and .cse7 .cse8 .cse9 .cse12 .cse13 .cse6) (and .cse1 .cse8 .cse9 .cse4 .cse14 .cse6) (and .cse15 .cse4) (and .cse1 .cse8 .cse2 .cse3 .cse9 .cse6) (and .cse7 .cse16 .cse17 .cse18 .cse14 .cse6) (and .cse19 .cse7 .cse20 .cse12 .cse13 .cse6) (and .cse21 .cse7 .cse6 .cse22) (and .cse2 .cse9 .cse23 .cse6) (and .cse24 .cse7 .cse9 .cse12 .cse6) (and .cse7 .cse3 .cse4 .cse25 .cse6) (and .cse26 .cse10 .cse1 .cse18 .cse6) (and .cse7 .cse8 .cse18 .cse9 .cse12 .cse6) (and .cse23 (or .cse21 .cse14)) (and .cse19 .cse15) (and .cse0 .cse24 .cse27 .cse10 .cse7 .cse6) (and .cse24 .cse27 .cse7 .cse20 .cse13 .cse6) (and .cse7 .cse3 .cse28 .cse12 .cse6 .cse25) (and .cse0 .cse7 .cse29 .cse8 .cse9 .cse6) (and .cse7 .cse16 .cse17 .cse30 .cse14 .cse6) (and .cse20 (= ~a26~0 222) .cse23 .cse6) (and .cse7 .cse8 .cse30 .cse9 .cse14 .cse6) (and .cse27 .cse10 .cse1 .cse18 .cse9 .cse6) (and .cse7 .cse6 .cse22 .cse31) (and .cse0 .cse7 .cse4 .cse9 .cse6) (and .cse1 .cse32 .cse11 .cse25 .cse6) (and .cse0 .cse10 .cse7 .cse8 .cse30 .cse18 .cse6) (and .cse33 .cse25) (and .cse7 .cse32 .cse6 .cse25) (and .cse26 .cse7 .cse18 .cse6) (and (<= (div (+ .cse34 557256) (- 20)) 124) (or (and .cse20 .cse33 .cse6) (and (<= ~a26~0 466645) .cse15)) .cse22) (and .cse27 .cse7 .cse29 .cse2 .cse9 .cse6) (and .cse7 (exists ((v_~a14~0_1230 Int)) (let ((.cse35 (* v_~a14~0_1230 9))) (and (<= (+ v_~a14~0_1230 182) 0) (< (* 9 v_~a14~0_1230) 0) (<= 0 (+ (div (+ v_~a14~0_1230 459561) 5) 113)) (not (= (mod .cse35 10) 0)) (<= (+ (div .cse35 10) 588353) ~a14~0)))) .cse8 .cse9 .cse6) (and .cse1 .cse9 .cse11 .cse6 .cse22) (and .cse7 .cse11 .cse6 .cse31) (and .cse21 .cse10 .cse1 (<= (+ ~a28~0 599901) 0) .cse6) (and .cse7 .cse30 .cse9 .cse28 .cse12 .cse6 .cse25)))))) [2019-12-07 13:01:25,278 INFO L246 CegarLoopResult]: For program point L202-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,278 INFO L246 CegarLoopResult]: For program point L70-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,278 INFO L246 CegarLoopResult]: For program point L995(lines 995 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,278 INFO L246 CegarLoopResult]: For program point L599(lines 599 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,278 INFO L246 CegarLoopResult]: For program point L335(lines 335 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,278 INFO L246 CegarLoopResult]: For program point L2317(lines 2317 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,278 INFO L246 CegarLoopResult]: For program point L203(line 203) no Hoare annotation was computed. [2019-12-07 13:01:25,278 INFO L246 CegarLoopResult]: For program point L2185(lines 2185 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,278 INFO L246 CegarLoopResult]: For program point L71(line 71) no Hoare annotation was computed. [2019-12-07 13:01:25,278 INFO L246 CegarLoopResult]: For program point L600(lines 600 605) no Hoare annotation was computed. [2019-12-07 13:01:25,278 INFO L246 CegarLoopResult]: For program point L600-2(lines 600 605) no Hoare annotation was computed. [2019-12-07 13:01:25,278 INFO L246 CegarLoopResult]: For program point L1525(lines 1525 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,278 INFO L246 CegarLoopResult]: For program point L468(lines 468 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,278 INFO L246 CegarLoopResult]: For program point L2318(lines 2318 2329) no Hoare annotation was computed. [2019-12-07 13:01:25,278 INFO L246 CegarLoopResult]: For program point L2318-2(lines 2318 2329) no Hoare annotation was computed. [2019-12-07 13:01:25,279 INFO L246 CegarLoopResult]: For program point L2186(lines 2186 2196) no Hoare annotation was computed. [2019-12-07 13:01:25,279 INFO L246 CegarLoopResult]: For program point L2186-2(lines 2186 2196) no Hoare annotation was computed. [2019-12-07 13:01:25,279 INFO L246 CegarLoopResult]: For program point L1922(lines 1922 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,279 INFO L246 CegarLoopResult]: For program point L865(lines 865 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,279 INFO L246 CegarLoopResult]: For program point L1262(lines 1262 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,279 INFO L246 CegarLoopResult]: For program point L205-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,279 INFO L246 CegarLoopResult]: For program point L1130(lines 1130 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,279 INFO L246 CegarLoopResult]: For program point L73-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,279 INFO L246 CegarLoopResult]: For program point L1791(lines 1791 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,279 INFO L246 CegarLoopResult]: For program point L1659(lines 1659 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,279 INFO L246 CegarLoopResult]: For program point L1395(lines 1395 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,279 INFO L246 CegarLoopResult]: For program point L206(line 206) no Hoare annotation was computed. [2019-12-07 13:01:25,279 INFO L246 CegarLoopResult]: For program point L74(line 74) no Hoare annotation was computed. [2019-12-07 13:01:25,279 INFO L246 CegarLoopResult]: For program point L999(lines 999 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,279 INFO L246 CegarLoopResult]: For program point L1792(lines 1792 1800) no Hoare annotation was computed. [2019-12-07 13:01:25,279 INFO L246 CegarLoopResult]: For program point L1792-2(lines 1792 1800) no Hoare annotation was computed. [2019-12-07 13:01:25,279 INFO L246 CegarLoopResult]: For program point L2585(line 2585) no Hoare annotation was computed. [2019-12-07 13:01:25,279 INFO L246 CegarLoopResult]: For program point L1396(lines 1396 1405) no Hoare annotation was computed. [2019-12-07 13:01:25,279 INFO L246 CegarLoopResult]: For program point L2453(lines 2453 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,279 INFO L246 CegarLoopResult]: For program point L1396-2(lines 1396 1405) no Hoare annotation was computed. [2019-12-07 13:01:25,279 INFO L246 CegarLoopResult]: For program point L2057(lines 2057 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,279 INFO L246 CegarLoopResult]: For program point L76-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,280 INFO L246 CegarLoopResult]: For program point L737(lines 737 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,280 INFO L246 CegarLoopResult]: For program point L77(line 77) no Hoare annotation was computed. [2019-12-07 13:01:25,280 INFO L246 CegarLoopResult]: For program point L1927(lines 1927 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,280 INFO L246 CegarLoopResult]: For program point L1663(lines 1663 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,280 INFO L246 CegarLoopResult]: For program point L606(lines 606 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,280 INFO L246 CegarLoopResult]: For program point L1531(lines 1531 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,280 INFO L246 CegarLoopResult]: For program point L342(lines 342 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,280 INFO L246 CegarLoopResult]: For program point L1267(lines 1267 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,280 INFO L246 CegarLoopResult]: For program point L1135(lines 1135 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,280 INFO L246 CegarLoopResult]: For program point L871(lines 871 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,280 INFO L246 CegarLoopResult]: For program point L607(lines 607 617) no Hoare annotation was computed. [2019-12-07 13:01:25,280 INFO L246 CegarLoopResult]: For program point L607-2(lines 607 617) no Hoare annotation was computed. [2019-12-07 13:01:25,280 INFO L246 CegarLoopResult]: For program point L475(lines 475 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,280 INFO L246 CegarLoopResult]: For program point L79-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,280 INFO L246 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2019-12-07 13:01:25,280 INFO L246 CegarLoopResult]: For program point L1005(lines 1005 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,280 INFO L246 CegarLoopResult]: For program point L2063(lines 2063 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,280 INFO L246 CegarLoopResult]: For program point L874(lines 874 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,280 INFO L246 CegarLoopResult]: For program point L742(lines 742 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,280 INFO L246 CegarLoopResult]: For program point L2460(lines 2460 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,280 INFO L246 CegarLoopResult]: For program point L82-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,280 INFO L246 CegarLoopResult]: For program point L1932(lines 1932 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,281 INFO L246 CegarLoopResult]: For program point L479(lines 479 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,281 INFO L246 CegarLoopResult]: For program point L347(lines 347 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,281 INFO L246 CegarLoopResult]: For program point L1272(lines 1272 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,281 INFO L246 CegarLoopResult]: For program point L215(lines 215 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,281 INFO L246 CegarLoopResult]: For program point L2197(lines 2197 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,281 INFO L246 CegarLoopResult]: For program point L83(line 83) no Hoare annotation was computed. [2019-12-07 13:01:25,281 INFO L246 CegarLoopResult]: For program point L1933(lines 1933 1944) no Hoare annotation was computed. [2019-12-07 13:01:25,281 INFO L246 CegarLoopResult]: For program point L1933-2(lines 1933 1944) no Hoare annotation was computed. [2019-12-07 13:01:25,281 INFO L246 CegarLoopResult]: For program point L1801(lines 1801 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,281 INFO L246 CegarLoopResult]: For program point L2330(lines 2330 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,281 INFO L246 CegarLoopResult]: For program point L1670(lines 1670 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,281 INFO L246 CegarLoopResult]: For program point L1538(lines 1538 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,281 INFO L246 CegarLoopResult]: For program point L1406(lines 1406 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,281 INFO L246 CegarLoopResult]: For program point L1142(lines 1142 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,281 INFO L246 CegarLoopResult]: For program point L85-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,281 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 13:01:25,281 INFO L246 CegarLoopResult]: For program point L86(line 86) no Hoare annotation was computed. [2019-12-07 13:01:25,281 INFO L246 CegarLoopResult]: For program point L1011(lines 1011 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,281 INFO L246 CegarLoopResult]: For program point L2069(lines 2069 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,281 INFO L246 CegarLoopResult]: For program point L880(lines 880 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,281 INFO L246 CegarLoopResult]: For program point L748(lines 748 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,281 INFO L246 CegarLoopResult]: For program point L2334(lines 2334 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,282 INFO L246 CegarLoopResult]: For program point L1145(lines 1145 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,282 INFO L246 CegarLoopResult]: For program point L88-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,282 INFO L246 CegarLoopResult]: For program point L749(lines 749 760) no Hoare annotation was computed. [2019-12-07 13:01:25,282 INFO L246 CegarLoopResult]: For program point L749-2(lines 749 760) no Hoare annotation was computed. [2019-12-07 13:01:25,282 INFO L246 CegarLoopResult]: For program point L2467(lines 2467 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,282 INFO L246 CegarLoopResult]: For program point L353(lines 353 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,282 INFO L246 CegarLoopResult]: For program point L2203(lines 2203 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,282 INFO L246 CegarLoopResult]: For program point L89(line 89) no Hoare annotation was computed. [2019-12-07 13:01:25,282 INFO L246 CegarLoopResult]: For program point L1807(lines 1807 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,282 INFO L246 CegarLoopResult]: For program point L618(lines 618 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,282 INFO L246 CegarLoopResult]: For program point L486(lines 486 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,282 INFO L246 CegarLoopResult]: For program point L1279(lines 1279 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,282 INFO L246 CegarLoopResult]: For program point L222(lines 222 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,282 INFO L246 CegarLoopResult]: For program point L91-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,282 INFO L246 CegarLoopResult]: For program point L1016(lines 1016 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,282 INFO L246 CegarLoopResult]: For program point L884(lines 884 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,282 INFO L246 CegarLoopResult]: For program point L1677(lines 1677 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,282 INFO L246 CegarLoopResult]: For program point L1545(lines 1545 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,282 INFO L246 CegarLoopResult]: For program point L1413(lines 1413 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,282 INFO L246 CegarLoopResult]: For program point L92(line 92) no Hoare annotation was computed. [2019-12-07 13:01:25,282 INFO L246 CegarLoopResult]: For program point L2074(lines 2074 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,282 INFO L246 CegarLoopResult]: For program point L1017(lines 1017 1027) no Hoare annotation was computed. [2019-12-07 13:01:25,283 INFO L246 CegarLoopResult]: For program point L1017-2(lines 1017 1027) no Hoare annotation was computed. [2019-12-07 13:01:25,283 INFO L246 CegarLoopResult]: For program point L1546(lines 1546 1550) no Hoare annotation was computed. [2019-12-07 13:01:25,283 INFO L246 CegarLoopResult]: For program point L1546-2(lines 1546 1550) no Hoare annotation was computed. [2019-12-07 13:01:25,283 INFO L246 CegarLoopResult]: For program point L1414(lines 1414 1423) no Hoare annotation was computed. [2019-12-07 13:01:25,283 INFO L246 CegarLoopResult]: For program point L1414-2(lines 1414 1423) no Hoare annotation was computed. [2019-12-07 13:01:25,283 INFO L246 CegarLoopResult]: For program point L2339(lines 2339 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,283 INFO L246 CegarLoopResult]: For program point L2075(lines 2075 2085) no Hoare annotation was computed. [2019-12-07 13:01:25,283 INFO L246 CegarLoopResult]: For program point L2075-2(lines 2075 2085) no Hoare annotation was computed. [2019-12-07 13:01:25,283 INFO L246 CegarLoopResult]: For program point L490(lines 490 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,283 INFO L246 CegarLoopResult]: For program point L2472(lines 2472 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,283 INFO L246 CegarLoopResult]: For program point L2340(lines 2340 2350) no Hoare annotation was computed. [2019-12-07 13:01:25,283 INFO L246 CegarLoopResult]: For program point L2340-2(lines 2340 2350) no Hoare annotation was computed. [2019-12-07 13:01:25,283 INFO L246 CegarLoopResult]: For program point L94-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,283 INFO L246 CegarLoopResult]: For program point L1812(lines 1812 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,283 INFO L246 CegarLoopResult]: For program point L1284(lines 1284 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,283 INFO L246 CegarLoopResult]: For program point L1152(lines 1152 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,283 INFO L246 CegarLoopResult]: For program point L2209(lines 2209 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,283 INFO L246 CegarLoopResult]: For program point L95(line 95) no Hoare annotation was computed. [2019-12-07 13:01:25,283 INFO L246 CegarLoopResult]: For program point L1945(lines 1945 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,283 INFO L246 CegarLoopResult]: For program point L360(lines 360 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,283 INFO L246 CegarLoopResult]: For program point L228(lines 228 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,283 INFO L246 CegarLoopResult]: For program point L2210(lines 2210 2219) no Hoare annotation was computed. [2019-12-07 13:01:25,284 INFO L246 CegarLoopResult]: For program point L2210-2(lines 2210 2219) no Hoare annotation was computed. [2019-12-07 13:01:25,284 INFO L246 CegarLoopResult]: For program point L1682(lines 1682 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,284 INFO L246 CegarLoopResult]: For program point L625(lines 625 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,284 INFO L246 CegarLoopResult]: For program point L2475(lines 2475 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,284 INFO L246 CegarLoopResult]: For program point L97-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,284 INFO L246 CegarLoopResult]: For program point L1683(lines 1683 1693) no Hoare annotation was computed. [2019-12-07 13:01:25,284 INFO L246 CegarLoopResult]: For program point L626(lines 626 633) no Hoare annotation was computed. [2019-12-07 13:01:25,284 INFO L246 CegarLoopResult]: For program point L1683-2(lines 1683 1693) no Hoare annotation was computed. [2019-12-07 13:01:25,284 INFO L246 CegarLoopResult]: For program point L626-2(lines 626 633) no Hoare annotation was computed. [2019-12-07 13:01:25,284 INFO L246 CegarLoopResult]: For program point L1551(lines 1551 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,284 INFO L246 CegarLoopResult]: For program point L98(line 98) no Hoare annotation was computed. [2019-12-07 13:01:25,284 INFO L246 CegarLoopResult]: For program point L891(lines 891 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,284 INFO L246 CegarLoopResult]: For program point L231(lines 231 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,284 INFO L246 CegarLoopResult]: For program point L100-1(lines 24 1644) no Hoare annotation was computed. [2019-12-07 13:01:25,284 INFO L246 CegarLoopResult]: For program point L1950(lines 1950 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,284 INFO L246 CegarLoopResult]: For program point L1818(lines 1818 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,284 INFO L246 CegarLoopResult]: For program point L761(lines 761 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,284 INFO L246 CegarLoopResult]: For program point L497(lines 497 1642) no Hoare annotation was computed. [2019-12-07 13:01:25,284 INFO L246 CegarLoopResult]: For program point L2479(lines 2479 2570) no Hoare annotation was computed. [2019-12-07 13:01:25,284 INFO L246 CegarLoopResult]: For program point L101(line 101) no Hoare annotation was computed. [2019-12-07 13:01:25,296 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,297 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,297 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,298 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,298 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,298 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,299 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,299 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,299 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,299 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,300 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,300 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,300 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,300 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,300 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,301 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,301 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,318 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,318 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,318 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,319 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,319 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,319 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,319 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,319 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,319 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,320 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,320 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,320 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,320 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,325 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,325 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,325 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,326 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,326 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,326 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,327 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,327 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,327 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,327 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,328 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,328 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,328 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,328 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,328 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,328 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,329 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,332 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,332 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,332 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,333 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,333 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,333 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,333 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,334 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,334 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,334 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,334 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,334 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,335 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,335 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,335 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,335 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,335 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,344 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,345 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,345 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,345 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,345 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,348 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:01:25 BoogieIcfgContainer [2019-12-07 13:01:25,351 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:01:25,352 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:01:25,352 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:01:25,352 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:01:25,352 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:52:46" (3/4) ... [2019-12-07 13:01:25,355 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 13:01:25,388 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-12-07 13:01:25,391 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 13:01:25,413 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((124 < a26 && a24 == 3) && a14 + 114 <= 0) && 0 < a14 + 182) && a26 <= 217) && (!(2 == input) || 134 < a28)) && a21 <= 124) || ((((a24 == 2 && a26 + 600 <= 0) && a28 <= 134) && 37 < a28) && a21 <= 124)) || ((((a14 + 183 <= 0 && a24 == 2) && a28 <= 134) && a26 <= 124) && a21 <= 124)) || (((((a24 == 2 && a28 <= 134) && 37 < a28) && 222 <= a26) && 0 <= a14 + 79) && a21 <= 124)) || (((((a24 == 3 && a28 <= 134) && 37 < a28) && a26 <= 217) && a14 + 182 <= 0) && a21 <= 124)) || ((((301 <= a28 && a24 <= 1) && a21 <= 124) || ((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a21 <= 124)) && a26 <= 217)) || (((((a24 == 3 && a28 <= 134) && a14 + 114 <= 0) && 0 < a14 + 182) && 37 < a28) && a21 <= 124)) || (((((a24 == 2 && 183 <= a28) && a28 <= 279) && a26 <= 599553) && a14 + 182 <= 0) && a21 <= 124)) || ((((((a28 <= 37 || a14 + 84 <= 0) && a24 == 2) && a14 <= 364756) && 222 <= a26) && 0 <= a14 + 79) && a21 <= 124)) || (((a26 + 68 <= 0 && a24 == 2) && a21 <= 124) && (134 < a28 || a14 + 182 <= 0))) || (((a14 + 114 <= 0 && 37 < a28) && a24 <= 1) && a21 <= 124)) || ((((a26 <= 460652 && a24 == 2) && 37 < a28) && 222 <= a26) && a21 <= 124)) || ((((a24 == 2 && 0 < a14 + 182) && a26 <= 217) && a14 + 84 <= 0) && a21 <= 124)) || ((((301 <= a28 && a14 + 183 <= 0) && a24 == 3) && a26 <= 599553) && a21 <= 124)) || (((((a24 == 2 && a28 <= 134) && a26 <= 599553) && 37 < a28) && 222 <= a26) && a21 <= 124)) || (a24 <= 1 && (a26 + 68 <= 0 || a14 + 182 <= 0))) || ((a28 <= 37 || a14 + 84 <= 0) && (((301 <= a28 && a24 <= 1) && a21 <= 124) || ((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a21 <= 124)))) || (((((124 < a26 && a26 <= 460652) && 217 < a26) && a14 + 183 <= 0) && a24 == 2) && a21 <= 124)) || (((((a26 <= 460652 && 217 < a26) && a24 == 2) && a14 <= 364756) && 0 <= a14 + 79) && a21 <= 124)) || (((((a24 == 2 && 0 < a14 + 182) && (a26 * -1 + 596057) / -5 <= 124) && 222 <= a26) && a21 <= 124) && a14 + 84 <= 0)) || (((((124 < a26 && a24 == 2) && a26 <= 222) && a28 <= 134) && 37 < a28) && a21 <= 124)) || (((((a24 == 2 && 183 <= a28) && a28 <= 279) && 0 <= (a14 + 459561) / 5 + 113) && a14 + 182 <= 0) && a21 <= 124)) || (((a14 <= 364756 && a26 == 222) && a24 <= 1) && a21 <= 124)) || (((((a24 == 2 && a28 <= 134) && 0 <= (a14 + 459561) / 5 + 113) && 37 < a28) && a14 + 182 <= 0) && a21 <= 124)) || (((((217 < a26 && a14 + 183 <= 0) && a24 == 3) && a26 <= 599553) && 37 < a28) && a21 <= 124)) || (((a24 == 2 && a21 <= 124) && (134 < a28 || a14 + 182 <= 0)) && (\exists v_~a14~0_1227 : int :: ((((0 <= 10 * (v_~a14~0_1227 / -5) + 3221490 && (v_~a14~0_1227 / -5 * 10 + 3221480) / 9 <= a14) && !(v_~a14~0_1227 % -5 == 0)) && v_~a14~0_1227 < 0) && v_~a14~0_1227 + 84 <= 0) && 0 <= 10 * (v_~a14~0_1227 / -5) + 3221480))) || ((((124 < a26 && a24 == 2) && a26 <= 217) && 37 < a28) && a21 <= 124)) || ((((a24 == 3 && 0 < a14 + 114) && a26 <= 124) && a14 + 84 <= 0) && a21 <= 124)) || ((((((124 < a26 && a14 + 183 <= 0) && a24 == 2) && a28 <= 134) && 0 <= (a14 + 459561) / 5 + 113) && a26 <= 599553) && a21 <= 124)) || ((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a14 + 84 <= 0)) || (((a24 == 2 && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || (((301 <= a28 && a24 == 2) && a26 <= 599553) && a21 <= 124)) || (((a26 * -1 + 557256) / -20 <= 124 && (((a14 <= 364756 && (((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1))) && a21 <= 124) || (a26 <= 466645 && (((301 <= a28 && a24 <= 1) && a21 <= 124) || ((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a21 <= 124))))) && (134 < a28 || a14 + 182 <= 0))) || (((((217 < a26 && a24 == 2) && a26 <= 222) && a14 + 114 <= 0) && 37 < a28) && a21 <= 124)) || ((((a24 == 2 && (\exists v_~a14~0_1230 : int :: (((v_~a14~0_1230 + 182 <= 0 && 9 * v_~a14~0_1230 < 0) && 0 <= (v_~a14~0_1230 + 459561) / 5 + 113) && !(v_~a14~0_1230 * 9 % 10 == 0)) && v_~a14~0_1230 * 9 / 10 + 588353 <= a14)) && a28 <= 134) && 37 < a28) && a21 <= 124)) || ((((a24 == 3 && 37 < a28) && a26 <= 124) && a21 <= 124) && (134 < a28 || a14 + 182 <= 0))) || (((a24 == 2 && a26 <= 124) && a21 <= 124) && (\exists v_~a14~0_1227 : int :: ((((0 <= 10 * (v_~a14~0_1227 / -5) + 3221490 && (v_~a14~0_1227 / -5 * 10 + 3221480) / 9 <= a14) && !(v_~a14~0_1227 % -5 == 0)) && v_~a14~0_1227 < 0) && v_~a14~0_1227 + 84 <= 0) && 0 <= 10 * (v_~a14~0_1227 / -5) + 3221480))) || ((((a26 + 68 <= 0 && a14 + 183 <= 0) && a24 == 3) && a28 + 599901 <= 0) && a21 <= 124)) || ((((((a24 == 2 && 0 <= (a14 + 459561) / 5 + 113) && 37 < a28) && (a26 * -1 + 596057) / -5 <= 124) && 222 <= a26) && a21 <= 124) && a14 + 84 <= 0) [2019-12-07 13:01:25,415 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((124 < a26 && a24 == 3) && a14 + 114 <= 0) && 0 < a14 + 182) && a26 <= 217) && (!(2 == input) || 134 < a28)) && a21 <= 124) || ((((a24 == 2 && a26 + 600 <= 0) && a28 <= 134) && 37 < a28) && a21 <= 124)) || ((((a14 + 183 <= 0 && a24 == 2) && a28 <= 134) && a26 <= 124) && a21 <= 124)) || (((((a24 == 2 && a28 <= 134) && 37 < a28) && 222 <= a26) && 0 <= a14 + 79) && a21 <= 124)) || (((((a24 == 3 && a28 <= 134) && 37 < a28) && a26 <= 217) && a14 + 182 <= 0) && a21 <= 124)) || ((((301 <= a28 && a24 <= 1) && a21 <= 124) || ((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a21 <= 124)) && a26 <= 217)) || (((((a24 == 3 && a28 <= 134) && a14 + 114 <= 0) && 0 < a14 + 182) && 37 < a28) && a21 <= 124)) || (((((a24 == 2 && 183 <= a28) && a28 <= 279) && a26 <= 599553) && a14 + 182 <= 0) && a21 <= 124)) || ((((((a28 <= 37 || a14 + 84 <= 0) && a24 == 2) && a14 <= 364756) && 222 <= a26) && 0 <= a14 + 79) && a21 <= 124)) || (((a26 + 68 <= 0 && a24 == 2) && a21 <= 124) && (134 < a28 || a14 + 182 <= 0))) || (((a14 + 114 <= 0 && 37 < a28) && a24 <= 1) && a21 <= 124)) || ((((a26 <= 460652 && a24 == 2) && 37 < a28) && 222 <= a26) && a21 <= 124)) || ((((a24 == 2 && 0 < a14 + 182) && a26 <= 217) && a14 + 84 <= 0) && a21 <= 124)) || ((((301 <= a28 && a14 + 183 <= 0) && a24 == 3) && a26 <= 599553) && a21 <= 124)) || (((((a24 == 2 && a28 <= 134) && a26 <= 599553) && 37 < a28) && 222 <= a26) && a21 <= 124)) || (a24 <= 1 && (a26 + 68 <= 0 || a14 + 182 <= 0))) || ((a28 <= 37 || a14 + 84 <= 0) && (((301 <= a28 && a24 <= 1) && a21 <= 124) || ((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a21 <= 124)))) || (((((124 < a26 && a26 <= 460652) && 217 < a26) && a14 + 183 <= 0) && a24 == 2) && a21 <= 124)) || (((((a26 <= 460652 && 217 < a26) && a24 == 2) && a14 <= 364756) && 0 <= a14 + 79) && a21 <= 124)) || (((((a24 == 2 && 0 < a14 + 182) && (a26 * -1 + 596057) / -5 <= 124) && 222 <= a26) && a21 <= 124) && a14 + 84 <= 0)) || (((((124 < a26 && a24 == 2) && a26 <= 222) && a28 <= 134) && 37 < a28) && a21 <= 124)) || (((((a24 == 2 && 183 <= a28) && a28 <= 279) && 0 <= (a14 + 459561) / 5 + 113) && a14 + 182 <= 0) && a21 <= 124)) || (((a14 <= 364756 && a26 == 222) && a24 <= 1) && a21 <= 124)) || (((((a24 == 2 && a28 <= 134) && 0 <= (a14 + 459561) / 5 + 113) && 37 < a28) && a14 + 182 <= 0) && a21 <= 124)) || (((((217 < a26 && a14 + 183 <= 0) && a24 == 3) && a26 <= 599553) && 37 < a28) && a21 <= 124)) || (((a24 == 2 && a21 <= 124) && (134 < a28 || a14 + 182 <= 0)) && (\exists v_~a14~0_1227 : int :: ((((0 <= 10 * (v_~a14~0_1227 / -5) + 3221490 && (v_~a14~0_1227 / -5 * 10 + 3221480) / 9 <= a14) && !(v_~a14~0_1227 % -5 == 0)) && v_~a14~0_1227 < 0) && v_~a14~0_1227 + 84 <= 0) && 0 <= 10 * (v_~a14~0_1227 / -5) + 3221480))) || ((((124 < a26 && a24 == 2) && a26 <= 217) && 37 < a28) && a21 <= 124)) || ((((a24 == 3 && 0 < a14 + 114) && a26 <= 124) && a14 + 84 <= 0) && a21 <= 124)) || ((((((124 < a26 && a14 + 183 <= 0) && a24 == 2) && a28 <= 134) && 0 <= (a14 + 459561) / 5 + 113) && a26 <= 599553) && a21 <= 124)) || ((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a14 + 84 <= 0)) || (((a24 == 2 && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || (((301 <= a28 && a24 == 2) && a26 <= 599553) && a21 <= 124)) || (((a26 * -1 + 557256) / -20 <= 124 && (((a14 <= 364756 && (((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1))) && a21 <= 124) || (a26 <= 466645 && (((301 <= a28 && a24 <= 1) && a21 <= 124) || ((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a21 <= 124))))) && (134 < a28 || a14 + 182 <= 0))) || (((((217 < a26 && a24 == 2) && a26 <= 222) && a14 + 114 <= 0) && 37 < a28) && a21 <= 124)) || ((((a24 == 2 && (\exists v_~a14~0_1230 : int :: (((v_~a14~0_1230 + 182 <= 0 && 9 * v_~a14~0_1230 < 0) && 0 <= (v_~a14~0_1230 + 459561) / 5 + 113) && !(v_~a14~0_1230 * 9 % 10 == 0)) && v_~a14~0_1230 * 9 / 10 + 588353 <= a14)) && a28 <= 134) && 37 < a28) && a21 <= 124)) || ((((a24 == 3 && 37 < a28) && a26 <= 124) && a21 <= 124) && (134 < a28 || a14 + 182 <= 0))) || (((a24 == 2 && a26 <= 124) && a21 <= 124) && (\exists v_~a14~0_1227 : int :: ((((0 <= 10 * (v_~a14~0_1227 / -5) + 3221490 && (v_~a14~0_1227 / -5 * 10 + 3221480) / 9 <= a14) && !(v_~a14~0_1227 % -5 == 0)) && v_~a14~0_1227 < 0) && v_~a14~0_1227 + 84 <= 0) && 0 <= 10 * (v_~a14~0_1227 / -5) + 3221480))) || ((((a26 + 68 <= 0 && a14 + 183 <= 0) && a24 == 3) && a28 + 599901 <= 0) && a21 <= 124)) || ((((((a24 == 2 && 0 <= (a14 + 459561) / 5 + 113) && 37 < a28) && (a26 * -1 + 596057) / -5 <= 124) && 222 <= a26) && a21 <= 124) && a14 + 84 <= 0) [2019-12-07 13:01:25,424 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((a14 <= 364756 && a26 <= 222) && a26 == 222) && 37 < a28) && a24 <= 1) && a21 <= 124) || ((((((124 < a26 && a24 == 3) && a14 + 114 <= 0) && 0 < a14 + 182) && a26 <= 217) && (!(2 == input) || 134 < a28)) && a21 <= 124)) || ((((a24 == 2 && a26 + 600 <= 0) && a28 <= 134) && 37 < a28) && a21 <= 124)) || (((a26 * -1 + 557256) / -20 <= 124 && (((a14 <= 364756 && (((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1))) && a21 <= 124) || ((a26 <= 466645 && (((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1))) && a21 <= 124))) && (134 < a28 || a14 + 182 <= 0))) || ((((a14 + 183 <= 0 && a24 == 2) && a28 <= 134) && a26 <= 124) && a21 <= 124)) || (((((a24 == 2 && a28 <= 134) && 37 < a28) && 222 <= a26) && 0 <= a14 + 79) && a21 <= 124)) || (((((a24 == 3 && a28 <= 134) && 37 < a28) && a26 <= 217) && a14 + 182 <= 0) && a21 <= 124)) || (((((a24 == 3 && a28 <= 134) && a14 + 114 <= 0) && 0 < a14 + 182) && 37 < a28) && a21 <= 124)) || (((((a24 == 2 && a28 <= 279) && 183 <= a28) && 0 <= (a14 + 459561) / 5 + 113) && a14 + 182 <= 0) && a21 <= 124)) || (((((a24 == 2 && a28 <= 279) && 183 <= a28) && a26 <= 599553) && a14 + 182 <= 0) && a21 <= 124)) || ((((((a28 <= 37 || a14 + 84 <= 0) && a24 == 2) && a14 <= 364756) && 222 <= a26) && 0 <= a14 + 79) && a21 <= 124)) || (((a24 == 2 && (134 < a28 || a14 + 182 <= 0)) && a21 <= 124) && (\exists v_~a14~0_1227 : int :: ((((0 <= 10 * (v_~a14~0_1227 / -5) + 3221490 && (v_~a14~0_1227 / -5 * 10 + 3221480) / 9 <= a14) && !(v_~a14~0_1227 % -5 == 0)) && v_~a14~0_1227 < 0) && v_~a14~0_1227 + 84 <= 0) && 0 <= 10 * (v_~a14~0_1227 / -5) + 3221480))) || (((a26 + 68 <= 0 && a24 == 2) && a21 <= 124) && (134 < a28 || a14 + 182 <= 0))) || ((((a26 <= 460652 && a24 == 2) && 37 < a28) && 222 <= a26) && a21 <= 124)) || ((((a24 == 2 && 0 < a14 + 182) && a26 <= 217) && a14 + 84 <= 0) && a21 <= 124)) || ((((301 <= a28 && a14 + 183 <= 0) && a24 == 3) && a26 <= 599553) && a21 <= 124)) || (((a28 <= 37 || a14 + 84 <= 0) && (((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1))) && a21 <= 124)) || (((((a24 == 2 && a28 <= 134) && a26 <= 599553) && 37 < a28) && 222 <= a26) && a21 <= 124)) || (a24 <= 1 && (a26 + 68 <= 0 || a14 + 182 <= 0))) || (((((124 < a26 && a26 <= 460652) && 217 < a26) && a14 + 183 <= 0) && a24 == 2) && a21 <= 124)) || (((((a26 <= 460652 && 217 < a26) && a24 == 2) && a14 <= 364756) && 0 <= a14 + 79) && a21 <= 124)) || (((((a24 == 2 && 0 < a14 + 182) && (a26 * -1 + 596057) / -5 <= 124) && 222 <= a26) && a21 <= 124) && a14 + 84 <= 0)) || ((((a26 <= 222 && 37 < a28) && a26 <= 217) && a24 <= 1) && a21 <= 124)) || (((((124 < a26 && a24 == 2) && a26 <= 222) && a28 <= 134) && 37 < a28) && a21 <= 124)) || (((((a24 == 2 && a28 <= 134) && 0 <= (a14 + 459561) / 5 + 113) && 37 < a28) && a14 + 182 <= 0) && a21 <= 124)) || (((((217 < a26 && a14 + 183 <= 0) && a24 == 3) && a26 <= 599553) && 37 < a28) && a21 <= 124)) || ((((124 < a26 && a24 == 2) && a26 <= 217) && 37 < a28) && a21 <= 124)) || ((((a24 == 3 && 0 < a14 + 114) && a26 <= 124) && a14 + 84 <= 0) && a21 <= 124)) || ((((((124 < a26 && a14 + 183 <= 0) && a24 == 2) && a28 <= 134) && 0 <= (a14 + 459561) / 5 + 113) && a26 <= 599553) && a21 <= 124)) || ((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a14 + 84 <= 0)) || (((a24 == 2 && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || (((301 <= a28 && a24 == 2) && a26 <= 599553) && a21 <= 124)) || (((((217 < a26 && a24 == 2) && a26 <= 222) && a14 + 114 <= 0) && 37 < a28) && a21 <= 124)) || ((((a24 == 2 && (\exists v_~a14~0_1230 : int :: (((v_~a14~0_1230 + 182 <= 0 && 9 * v_~a14~0_1230 < 0) && 0 <= (v_~a14~0_1230 + 459561) / 5 + 113) && !(v_~a14~0_1230 * 9 % 10 == 0)) && v_~a14~0_1230 * 9 / 10 + 588353 <= a14)) && a28 <= 134) && 37 < a28) && a21 <= 124)) || ((((a24 == 3 && 37 < a28) && a26 <= 124) && a21 <= 124) && (134 < a28 || a14 + 182 <= 0))) || ((((a26 + 68 <= 0 && a14 + 183 <= 0) && a24 == 3) && a28 + 599901 <= 0) && a21 <= 124)) || (((a24 == 2 && a26 <= 124) && a21 <= 124) && (\exists v_~a14~0_1227 : int :: ((((0 <= 10 * (v_~a14~0_1227 / -5) + 3221490 && (v_~a14~0_1227 / -5 * 10 + 3221480) / 9 <= a14) && !(v_~a14~0_1227 % -5 == 0)) && v_~a14~0_1227 < 0) && v_~a14~0_1227 + 84 <= 0) && 0 <= 10 * (v_~a14~0_1227 / -5) + 3221480))) || ((((((a24 == 2 && 0 <= (a14 + 459561) / 5 + 113) && 37 < a28) && (a26 * -1 + 596057) / -5 <= 124) && 222 <= a26) && a21 <= 124) && a14 + 84 <= 0) [2019-12-07 13:01:25,556 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_00b127c2-e00f-4824-80fe-40c8a266fdb0/bin/uautomizer/witness.graphml [2019-12-07 13:01:25,556 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:01:25,557 INFO L168 Benchmark]: Toolchain (without parser) took 522570.10 ms. Allocated memory was 1.0 GB in the beginning and 3.8 GB in the end (delta: 2.7 GB). Free memory was 928.7 MB in the beginning and 2.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-12-07 13:01:25,557 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:01:25,558 INFO L168 Benchmark]: CACSL2BoogieTranslator took 897.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 928.7 MB in the beginning and 977.9 MB in the end (delta: -49.3 MB). Peak memory consumption was 65.9 MB. Max. memory is 11.5 GB. [2019-12-07 13:01:25,558 INFO L168 Benchmark]: Boogie Procedure Inliner took 169.30 ms. Allocated memory is still 1.1 GB. Free memory was 977.9 MB in the beginning and 913.5 MB in the end (delta: 64.4 MB). Peak memory consumption was 64.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:01:25,558 INFO L168 Benchmark]: Boogie Preprocessor took 168.48 ms. Allocated memory is still 1.1 GB. Free memory was 913.5 MB in the beginning and 880.2 MB in the end (delta: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. [2019-12-07 13:01:25,558 INFO L168 Benchmark]: RCFGBuilder took 2468.45 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 102.2 MB). Free memory was 880.2 MB in the beginning and 991.6 MB in the end (delta: -111.4 MB). Peak memory consumption was 113.9 MB. Max. memory is 11.5 GB. [2019-12-07 13:01:25,558 INFO L168 Benchmark]: TraceAbstraction took 518657.81 ms. Allocated memory was 1.2 GB in the beginning and 3.8 GB in the end (delta: 2.5 GB). Free memory was 991.6 MB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 4.4 GB. Max. memory is 11.5 GB. [2019-12-07 13:01:25,559 INFO L168 Benchmark]: Witness Printer took 204.81 ms. Allocated memory is still 3.8 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 77.8 MB). Peak memory consumption was 77.8 MB. Max. memory is 11.5 GB. [2019-12-07 13:01:25,560 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 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 897.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 928.7 MB in the beginning and 977.9 MB in the end (delta: -49.3 MB). Peak memory consumption was 65.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 169.30 ms. Allocated memory is still 1.1 GB. Free memory was 977.9 MB in the beginning and 913.5 MB in the end (delta: 64.4 MB). Peak memory consumption was 64.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 168.48 ms. Allocated memory is still 1.1 GB. Free memory was 913.5 MB in the beginning and 880.2 MB in the end (delta: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2468.45 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 102.2 MB). Free memory was 880.2 MB in the beginning and 991.6 MB in the end (delta: -111.4 MB). Peak memory consumption was 113.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 518657.81 ms. Allocated memory was 1.2 GB in the beginning and 3.8 GB in the end (delta: 2.5 GB). Free memory was 991.6 MB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 4.4 GB. Max. memory is 11.5 GB. * Witness Printer took 204.81 ms. Allocated memory is still 3.8 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 77.8 MB). Peak memory consumption was 77.8 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_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 134]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 2574]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2580]: Loop Invariant [2019-12-07 13:01:25,564 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,564 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,564 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,564 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,564 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,565 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,565 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,565 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,565 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,565 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,565 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,565 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,565 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,565 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,565 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,566 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,566 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,567 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,567 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,567 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,567 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,567 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,567 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,568 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,568 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,568 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,568 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,568 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,568 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,568 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,568 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,568 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,569 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,569 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((124 < a26 && a24 == 3) && a14 + 114 <= 0) && 0 < a14 + 182) && a26 <= 217) && (!(2 == input) || 134 < a28)) && a21 <= 124) || ((((a24 == 2 && a26 + 600 <= 0) && a28 <= 134) && 37 < a28) && a21 <= 124)) || ((((a14 + 183 <= 0 && a24 == 2) && a28 <= 134) && a26 <= 124) && a21 <= 124)) || (((((a24 == 2 && a28 <= 134) && 37 < a28) && 222 <= a26) && 0 <= a14 + 79) && a21 <= 124)) || (((((a24 == 3 && a28 <= 134) && 37 < a28) && a26 <= 217) && a14 + 182 <= 0) && a21 <= 124)) || ((((301 <= a28 && a24 <= 1) && a21 <= 124) || ((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a21 <= 124)) && a26 <= 217)) || (((((a24 == 3 && a28 <= 134) && a14 + 114 <= 0) && 0 < a14 + 182) && 37 < a28) && a21 <= 124)) || (((((a24 == 2 && 183 <= a28) && a28 <= 279) && a26 <= 599553) && a14 + 182 <= 0) && a21 <= 124)) || ((((((a28 <= 37 || a14 + 84 <= 0) && a24 == 2) && a14 <= 364756) && 222 <= a26) && 0 <= a14 + 79) && a21 <= 124)) || (((a26 + 68 <= 0 && a24 == 2) && a21 <= 124) && (134 < a28 || a14 + 182 <= 0))) || (((a14 + 114 <= 0 && 37 < a28) && a24 <= 1) && a21 <= 124)) || ((((a26 <= 460652 && a24 == 2) && 37 < a28) && 222 <= a26) && a21 <= 124)) || ((((a24 == 2 && 0 < a14 + 182) && a26 <= 217) && a14 + 84 <= 0) && a21 <= 124)) || ((((301 <= a28 && a14 + 183 <= 0) && a24 == 3) && a26 <= 599553) && a21 <= 124)) || (((((a24 == 2 && a28 <= 134) && a26 <= 599553) && 37 < a28) && 222 <= a26) && a21 <= 124)) || (a24 <= 1 && (a26 + 68 <= 0 || a14 + 182 <= 0))) || ((a28 <= 37 || a14 + 84 <= 0) && (((301 <= a28 && a24 <= 1) && a21 <= 124) || ((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a21 <= 124)))) || (((((124 < a26 && a26 <= 460652) && 217 < a26) && a14 + 183 <= 0) && a24 == 2) && a21 <= 124)) || (((((a26 <= 460652 && 217 < a26) && a24 == 2) && a14 <= 364756) && 0 <= a14 + 79) && a21 <= 124)) || (((((a24 == 2 && 0 < a14 + 182) && (a26 * -1 + 596057) / -5 <= 124) && 222 <= a26) && a21 <= 124) && a14 + 84 <= 0)) || (((((124 < a26 && a24 == 2) && a26 <= 222) && a28 <= 134) && 37 < a28) && a21 <= 124)) || (((((a24 == 2 && 183 <= a28) && a28 <= 279) && 0 <= (a14 + 459561) / 5 + 113) && a14 + 182 <= 0) && a21 <= 124)) || (((a14 <= 364756 && a26 == 222) && a24 <= 1) && a21 <= 124)) || (((((a24 == 2 && a28 <= 134) && 0 <= (a14 + 459561) / 5 + 113) && 37 < a28) && a14 + 182 <= 0) && a21 <= 124)) || (((((217 < a26 && a14 + 183 <= 0) && a24 == 3) && a26 <= 599553) && 37 < a28) && a21 <= 124)) || (((a24 == 2 && a21 <= 124) && (134 < a28 || a14 + 182 <= 0)) && (\exists v_~a14~0_1227 : int :: ((((0 <= 10 * (v_~a14~0_1227 / -5) + 3221490 && (v_~a14~0_1227 / -5 * 10 + 3221480) / 9 <= a14) && !(v_~a14~0_1227 % -5 == 0)) && v_~a14~0_1227 < 0) && v_~a14~0_1227 + 84 <= 0) && 0 <= 10 * (v_~a14~0_1227 / -5) + 3221480))) || ((((124 < a26 && a24 == 2) && a26 <= 217) && 37 < a28) && a21 <= 124)) || ((((a24 == 3 && 0 < a14 + 114) && a26 <= 124) && a14 + 84 <= 0) && a21 <= 124)) || ((((((124 < a26 && a14 + 183 <= 0) && a24 == 2) && a28 <= 134) && 0 <= (a14 + 459561) / 5 + 113) && a26 <= 599553) && a21 <= 124)) || ((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a14 + 84 <= 0)) || (((a24 == 2 && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || (((301 <= a28 && a24 == 2) && a26 <= 599553) && a21 <= 124)) || (((a26 * -1 + 557256) / -20 <= 124 && (((a14 <= 364756 && (((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1))) && a21 <= 124) || (a26 <= 466645 && (((301 <= a28 && a24 <= 1) && a21 <= 124) || ((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a21 <= 124))))) && (134 < a28 || a14 + 182 <= 0))) || (((((217 < a26 && a24 == 2) && a26 <= 222) && a14 + 114 <= 0) && 37 < a28) && a21 <= 124)) || ((((a24 == 2 && (\exists v_~a14~0_1230 : int :: (((v_~a14~0_1230 + 182 <= 0 && 9 * v_~a14~0_1230 < 0) && 0 <= (v_~a14~0_1230 + 459561) / 5 + 113) && !(v_~a14~0_1230 * 9 % 10 == 0)) && v_~a14~0_1230 * 9 / 10 + 588353 <= a14)) && a28 <= 134) && 37 < a28) && a21 <= 124)) || ((((a24 == 3 && 37 < a28) && a26 <= 124) && a21 <= 124) && (134 < a28 || a14 + 182 <= 0))) || (((a24 == 2 && a26 <= 124) && a21 <= 124) && (\exists v_~a14~0_1227 : int :: ((((0 <= 10 * (v_~a14~0_1227 / -5) + 3221490 && (v_~a14~0_1227 / -5 * 10 + 3221480) / 9 <= a14) && !(v_~a14~0_1227 % -5 == 0)) && v_~a14~0_1227 < 0) && v_~a14~0_1227 + 84 <= 0) && 0 <= 10 * (v_~a14~0_1227 / -5) + 3221480))) || ((((a26 + 68 <= 0 && a14 + 183 <= 0) && a24 == 3) && a28 + 599901 <= 0) && a21 <= 124)) || ((((((a24 == 2 && 0 <= (a14 + 459561) / 5 + 113) && 37 < a28) && (a26 * -1 + 596057) / -5 <= 124) && 222 <= a26) && a21 <= 124) && a14 + 84 <= 0) - InvariantResult [Line: 1646]: Loop Invariant [2019-12-07 13:01:25,570 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,570 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,570 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,570 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,570 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,571 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,571 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,571 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,571 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,571 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,571 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,571 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,571 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,571 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,572 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,572 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,572 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,573 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,573 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,573 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,573 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,573 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,573 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,574 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,574 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,574 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,574 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,574 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,574 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,574 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,574 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,574 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,575 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,575 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((a14 <= 364756 && a26 <= 222) && a26 == 222) && 37 < a28) && a24 <= 1) && a21 <= 124) || ((((((124 < a26 && a24 == 3) && a14 + 114 <= 0) && 0 < a14 + 182) && a26 <= 217) && (!(2 == input) || 134 < a28)) && a21 <= 124)) || ((((a24 == 2 && a26 + 600 <= 0) && a28 <= 134) && 37 < a28) && a21 <= 124)) || (((a26 * -1 + 557256) / -20 <= 124 && (((a14 <= 364756 && (((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1))) && a21 <= 124) || ((a26 <= 466645 && (((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1))) && a21 <= 124))) && (134 < a28 || a14 + 182 <= 0))) || ((((a14 + 183 <= 0 && a24 == 2) && a28 <= 134) && a26 <= 124) && a21 <= 124)) || (((((a24 == 2 && a28 <= 134) && 37 < a28) && 222 <= a26) && 0 <= a14 + 79) && a21 <= 124)) || (((((a24 == 3 && a28 <= 134) && 37 < a28) && a26 <= 217) && a14 + 182 <= 0) && a21 <= 124)) || (((((a24 == 3 && a28 <= 134) && a14 + 114 <= 0) && 0 < a14 + 182) && 37 < a28) && a21 <= 124)) || (((((a24 == 2 && a28 <= 279) && 183 <= a28) && 0 <= (a14 + 459561) / 5 + 113) && a14 + 182 <= 0) && a21 <= 124)) || (((((a24 == 2 && a28 <= 279) && 183 <= a28) && a26 <= 599553) && a14 + 182 <= 0) && a21 <= 124)) || ((((((a28 <= 37 || a14 + 84 <= 0) && a24 == 2) && a14 <= 364756) && 222 <= a26) && 0 <= a14 + 79) && a21 <= 124)) || (((a24 == 2 && (134 < a28 || a14 + 182 <= 0)) && a21 <= 124) && (\exists v_~a14~0_1227 : int :: ((((0 <= 10 * (v_~a14~0_1227 / -5) + 3221490 && (v_~a14~0_1227 / -5 * 10 + 3221480) / 9 <= a14) && !(v_~a14~0_1227 % -5 == 0)) && v_~a14~0_1227 < 0) && v_~a14~0_1227 + 84 <= 0) && 0 <= 10 * (v_~a14~0_1227 / -5) + 3221480))) || (((a26 + 68 <= 0 && a24 == 2) && a21 <= 124) && (134 < a28 || a14 + 182 <= 0))) || ((((a26 <= 460652 && a24 == 2) && 37 < a28) && 222 <= a26) && a21 <= 124)) || ((((a24 == 2 && 0 < a14 + 182) && a26 <= 217) && a14 + 84 <= 0) && a21 <= 124)) || ((((301 <= a28 && a14 + 183 <= 0) && a24 == 3) && a26 <= 599553) && a21 <= 124)) || (((a28 <= 37 || a14 + 84 <= 0) && (((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1))) && a21 <= 124)) || (((((a24 == 2 && a28 <= 134) && a26 <= 599553) && 37 < a28) && 222 <= a26) && a21 <= 124)) || (a24 <= 1 && (a26 + 68 <= 0 || a14 + 182 <= 0))) || (((((124 < a26 && a26 <= 460652) && 217 < a26) && a14 + 183 <= 0) && a24 == 2) && a21 <= 124)) || (((((a26 <= 460652 && 217 < a26) && a24 == 2) && a14 <= 364756) && 0 <= a14 + 79) && a21 <= 124)) || (((((a24 == 2 && 0 < a14 + 182) && (a26 * -1 + 596057) / -5 <= 124) && 222 <= a26) && a21 <= 124) && a14 + 84 <= 0)) || ((((a26 <= 222 && 37 < a28) && a26 <= 217) && a24 <= 1) && a21 <= 124)) || (((((124 < a26 && a24 == 2) && a26 <= 222) && a28 <= 134) && 37 < a28) && a21 <= 124)) || (((((a24 == 2 && a28 <= 134) && 0 <= (a14 + 459561) / 5 + 113) && 37 < a28) && a14 + 182 <= 0) && a21 <= 124)) || (((((217 < a26 && a14 + 183 <= 0) && a24 == 3) && a26 <= 599553) && 37 < a28) && a21 <= 124)) || ((((124 < a26 && a24 == 2) && a26 <= 217) && 37 < a28) && a21 <= 124)) || ((((a24 == 3 && 0 < a14 + 114) && a26 <= 124) && a14 + 84 <= 0) && a21 <= 124)) || ((((((124 < a26 && a14 + 183 <= 0) && a24 == 2) && a28 <= 134) && 0 <= (a14 + 459561) / 5 + 113) && a26 <= 599553) && a21 <= 124)) || ((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a14 + 84 <= 0)) || (((a24 == 2 && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || (((301 <= a28 && a24 == 2) && a26 <= 599553) && a21 <= 124)) || (((((217 < a26 && a24 == 2) && a26 <= 222) && a14 + 114 <= 0) && 37 < a28) && a21 <= 124)) || ((((a24 == 2 && (\exists v_~a14~0_1230 : int :: (((v_~a14~0_1230 + 182 <= 0 && 9 * v_~a14~0_1230 < 0) && 0 <= (v_~a14~0_1230 + 459561) / 5 + 113) && !(v_~a14~0_1230 * 9 % 10 == 0)) && v_~a14~0_1230 * 9 / 10 + 588353 <= a14)) && a28 <= 134) && 37 < a28) && a21 <= 124)) || ((((a24 == 3 && 37 < a28) && a26 <= 124) && a21 <= 124) && (134 < a28 || a14 + 182 <= 0))) || ((((a26 + 68 <= 0 && a14 + 183 <= 0) && a24 == 3) && a28 + 599901 <= 0) && a21 <= 124)) || (((a24 == 2 && a26 <= 124) && a21 <= 124) && (\exists v_~a14~0_1227 : int :: ((((0 <= 10 * (v_~a14~0_1227 / -5) + 3221490 && (v_~a14~0_1227 / -5 * 10 + 3221480) / 9 <= a14) && !(v_~a14~0_1227 % -5 == 0)) && v_~a14~0_1227 < 0) && v_~a14~0_1227 + 84 <= 0) && 0 <= 10 * (v_~a14~0_1227 / -5) + 3221480))) || ((((((a24 == 2 && 0 <= (a14 + 459561) / 5 + 113) && 37 < a28) && (a26 * -1 + 596057) / -5 <= 124) && 222 <= a26) && a21 <= 124) && a14 + 84 <= 0) - InvariantResult [Line: 24]: Loop Invariant [2019-12-07 13:01:25,576 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,576 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,576 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,576 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,576 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,576 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,576 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,577 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,577 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,577 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,577 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,577 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,577 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,577 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,577 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,577 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,577 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,579 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,579 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,579 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,579 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,579 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,579 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,579 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,579 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,579 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,580 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,580 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1230,QUANTIFIED] [2019-12-07 13:01:25,580 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,580 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,580 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,580 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,580 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] [2019-12-07 13:01:25,580 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a14~0_1227,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((124 < a26 && a24 == 3) && a14 + 114 <= 0) && 0 < a14 + 182) && a26 <= 217) && (!(2 == input) || 134 < a28)) && a21 <= 124) || ((((a24 == 2 && a26 + 600 <= 0) && a28 <= 134) && 37 < a28) && a21 <= 124)) || ((((a14 + 183 <= 0 && a24 == 2) && a28 <= 134) && a26 <= 124) && a21 <= 124)) || (((((a24 == 2 && a28 <= 134) && 37 < a28) && 222 <= a26) && 0 <= a14 + 79) && a21 <= 124)) || (((((a24 == 3 && a28 <= 134) && 37 < a28) && a26 <= 217) && a14 + 182 <= 0) && a21 <= 124)) || ((((301 <= a28 && a24 <= 1) && a21 <= 124) || ((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a21 <= 124)) && a26 <= 217)) || (((((a24 == 3 && a28 <= 134) && a14 + 114 <= 0) && 0 < a14 + 182) && 37 < a28) && a21 <= 124)) || (((((a24 == 2 && 183 <= a28) && a28 <= 279) && a26 <= 599553) && a14 + 182 <= 0) && a21 <= 124)) || ((((((a28 <= 37 || a14 + 84 <= 0) && a24 == 2) && a14 <= 364756) && 222 <= a26) && 0 <= a14 + 79) && a21 <= 124)) || (((a26 + 68 <= 0 && a24 == 2) && a21 <= 124) && (134 < a28 || a14 + 182 <= 0))) || (((a14 + 114 <= 0 && 37 < a28) && a24 <= 1) && a21 <= 124)) || ((((a26 <= 460652 && a24 == 2) && 37 < a28) && 222 <= a26) && a21 <= 124)) || ((((a24 == 2 && 0 < a14 + 182) && a26 <= 217) && a14 + 84 <= 0) && a21 <= 124)) || ((((301 <= a28 && a14 + 183 <= 0) && a24 == 3) && a26 <= 599553) && a21 <= 124)) || (((((a24 == 2 && a28 <= 134) && a26 <= 599553) && 37 < a28) && 222 <= a26) && a21 <= 124)) || (a24 <= 1 && (a26 + 68 <= 0 || a14 + 182 <= 0))) || ((a28 <= 37 || a14 + 84 <= 0) && (((301 <= a28 && a24 <= 1) && a21 <= 124) || ((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a21 <= 124)))) || (((((124 < a26 && a26 <= 460652) && 217 < a26) && a14 + 183 <= 0) && a24 == 2) && a21 <= 124)) || (((((a26 <= 460652 && 217 < a26) && a24 == 2) && a14 <= 364756) && 0 <= a14 + 79) && a21 <= 124)) || (((((a24 == 2 && 0 < a14 + 182) && (a26 * -1 + 596057) / -5 <= 124) && 222 <= a26) && a21 <= 124) && a14 + 84 <= 0)) || (((((124 < a26 && a24 == 2) && a26 <= 222) && a28 <= 134) && 37 < a28) && a21 <= 124)) || (((((a24 == 2 && 183 <= a28) && a28 <= 279) && 0 <= (a14 + 459561) / 5 + 113) && a14 + 182 <= 0) && a21 <= 124)) || (((a14 <= 364756 && a26 == 222) && a24 <= 1) && a21 <= 124)) || (((((a24 == 2 && a28 <= 134) && 0 <= (a14 + 459561) / 5 + 113) && 37 < a28) && a14 + 182 <= 0) && a21 <= 124)) || (((((217 < a26 && a14 + 183 <= 0) && a24 == 3) && a26 <= 599553) && 37 < a28) && a21 <= 124)) || (((a24 == 2 && a21 <= 124) && (134 < a28 || a14 + 182 <= 0)) && (\exists v_~a14~0_1227 : int :: ((((0 <= 10 * (v_~a14~0_1227 / -5) + 3221490 && (v_~a14~0_1227 / -5 * 10 + 3221480) / 9 <= a14) && !(v_~a14~0_1227 % -5 == 0)) && v_~a14~0_1227 < 0) && v_~a14~0_1227 + 84 <= 0) && 0 <= 10 * (v_~a14~0_1227 / -5) + 3221480))) || ((((124 < a26 && a24 == 2) && a26 <= 217) && 37 < a28) && a21 <= 124)) || ((((a24 == 3 && 0 < a14 + 114) && a26 <= 124) && a14 + 84 <= 0) && a21 <= 124)) || ((((((124 < a26 && a14 + 183 <= 0) && a24 == 2) && a28 <= 134) && 0 <= (a14 + 459561) / 5 + 113) && a26 <= 599553) && a21 <= 124)) || ((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a14 + 84 <= 0)) || (((a24 == 2 && 0 < a14 + 114) && a21 <= 124) && a14 + 84 <= 0)) || (((301 <= a28 && a24 == 2) && a26 <= 599553) && a21 <= 124)) || (((a26 * -1 + 557256) / -20 <= 124 && (((a14 <= 364756 && (((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1))) && a21 <= 124) || (a26 <= 466645 && (((301 <= a28 && a24 <= 1) && a21 <= 124) || ((((0 < a14 + 114 && a24 <= 1) || (124 < a26 && a24 <= 1)) || ((a28 <= 134 && 37 < a28) && a24 <= 1)) && a21 <= 124))))) && (134 < a28 || a14 + 182 <= 0))) || (((((217 < a26 && a24 == 2) && a26 <= 222) && a14 + 114 <= 0) && 37 < a28) && a21 <= 124)) || ((((a24 == 2 && (\exists v_~a14~0_1230 : int :: (((v_~a14~0_1230 + 182 <= 0 && 9 * v_~a14~0_1230 < 0) && 0 <= (v_~a14~0_1230 + 459561) / 5 + 113) && !(v_~a14~0_1230 * 9 % 10 == 0)) && v_~a14~0_1230 * 9 / 10 + 588353 <= a14)) && a28 <= 134) && 37 < a28) && a21 <= 124)) || ((((a24 == 3 && 37 < a28) && a26 <= 124) && a21 <= 124) && (134 < a28 || a14 + 182 <= 0))) || (((a24 == 2 && a26 <= 124) && a21 <= 124) && (\exists v_~a14~0_1227 : int :: ((((0 <= 10 * (v_~a14~0_1227 / -5) + 3221490 && (v_~a14~0_1227 / -5 * 10 + 3221480) / 9 <= a14) && !(v_~a14~0_1227 % -5 == 0)) && v_~a14~0_1227 < 0) && v_~a14~0_1227 + 84 <= 0) && 0 <= 10 * (v_~a14~0_1227 / -5) + 3221480))) || ((((a26 + 68 <= 0 && a14 + 183 <= 0) && a24 == 3) && a28 + 599901 <= 0) && a21 <= 124)) || ((((((a24 == 2 && 0 <= (a14 + 459561) / 5 + 113) && 37 < a28) && (a26 * -1 + 596057) / -5 <= 124) && 222 <= a26) && a21 <= 124) && a14 + 84 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 590 locations, 1 error locations. Result: SAFE, OverallTime: 353.1s, OverallIterations: 29, TraceHistogramMax: 11, AutomataDifference: 203.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 165.4s, HoareTripleCheckerStatistics: 9980 SDtfs, 33675 SDslu, 2995 SDs, 0 SdLazy, 89495 SolverSat, 13472 SolverUnsat, 27 SolverUnknown, 0 SolverNotchecked, 172.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22519 GetRequests, 22293 SyntacticMatches, 17 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146441occurred in iteration=28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 15.8s AutomataMinimizationTime, 29 MinimizatonAttempts, 225724 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 1144 NumberOfFragments, 3172 HoareAnnotationTreeSize, 4 FomulaSimplifications, 24598840 FormulaSimplificationTreeSizeReduction, 29.6s HoareSimplificationTime, 4 FomulaSimplificationsInter, 20302863 FormulaSimplificationTreeSizeReductionInter, 135.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.6s SsaConstructionTime, 4.8s SatisfiabilityAnalysisTime, 61.3s InterpolantComputationTime, 53213 NumberOfCodeBlocks, 53213 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 53167 ConstructedInterpolants, 3111 QuantifiedInterpolants, 486629093 SizeOfPredicates, 11 NumberOfNonLiveVariables, 25754 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 46 InterpolantComputations, 26 PerfectInterpolantSequences, 100377/126185 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...