./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label48.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_cf3899b3-6a0c-46c2-8181-7a8eff463335/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_cf3899b3-6a0c-46c2-8181-7a8eff463335/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_cf3899b3-6a0c-46c2-8181-7a8eff463335/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_cf3899b3-6a0c-46c2-8181-7a8eff463335/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label48.c -s /tmp/vcloud-vcloud-master/worker/run_dir_cf3899b3-6a0c-46c2-8181-7a8eff463335/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_cf3899b3-6a0c-46c2-8181-7a8eff463335/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 8a1a825ec98775a2851ce5a0e999a3f43690bf7c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 00:15:44,037 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 00:15:44,039 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 00:15:44,052 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 00:15:44,053 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 00:15:44,054 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 00:15:44,055 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 00:15:44,057 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 00:15:44,059 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 00:15:44,060 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 00:15:44,061 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 00:15:44,062 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 00:15:44,062 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 00:15:44,063 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 00:15:44,067 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 00:15:44,068 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 00:15:44,070 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 00:15:44,073 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 00:15:44,075 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 00:15:44,079 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 00:15:44,082 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 00:15:44,086 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 00:15:44,088 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 00:15:44,090 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 00:15:44,094 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 00:15:44,095 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 00:15:44,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 00:15:44,097 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 00:15:44,099 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 00:15:44,100 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 00:15:44,100 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 00:15:44,101 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 00:15:44,102 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 00:15:44,103 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 00:15:44,104 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 00:15:44,104 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 00:15:44,105 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 00:15:44,105 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 00:15:44,105 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 00:15:44,107 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 00:15:44,108 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 00:15:44,109 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_cf3899b3-6a0c-46c2-8181-7a8eff463335/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 00:15:44,125 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 00:15:44,126 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 00:15:44,127 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 00:15:44,127 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 00:15:44,127 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 00:15:44,128 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 00:15:44,128 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 00:15:44,128 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 00:15:44,128 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 00:15:44,128 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 00:15:44,130 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 00:15:44,130 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 00:15:44,130 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 00:15:44,130 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 00:15:44,131 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 00:15:44,131 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 00:15:44,131 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 00:15:44,131 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 00:15:44,131 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 00:15:44,132 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 00:15:44,132 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 00:15:44,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 00:15:44,132 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 00:15:44,133 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 00:15:44,133 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 00:15:44,133 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 00:15:44,133 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 00:15:44,134 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 00:15:44,134 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_cf3899b3-6a0c-46c2-8181-7a8eff463335/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 -> 8a1a825ec98775a2851ce5a0e999a3f43690bf7c [2019-11-20 00:15:44,287 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 00:15:44,298 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 00:15:44,301 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 00:15:44,302 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 00:15:44,303 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 00:15:44,303 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_cf3899b3-6a0c-46c2-8181-7a8eff463335/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem11_label48.c [2019-11-20 00:15:44,368 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cf3899b3-6a0c-46c2-8181-7a8eff463335/bin/uautomizer/data/a680d551e/23307b78d8884732b8b6d3012604e916/FLAGeeba14f07 [2019-11-20 00:15:44,917 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 00:15:44,918 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_cf3899b3-6a0c-46c2-8181-7a8eff463335/sv-benchmarks/c/eca-rers2012/Problem11_label48.c [2019-11-20 00:15:44,931 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cf3899b3-6a0c-46c2-8181-7a8eff463335/bin/uautomizer/data/a680d551e/23307b78d8884732b8b6d3012604e916/FLAGeeba14f07 [2019-11-20 00:15:45,172 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_cf3899b3-6a0c-46c2-8181-7a8eff463335/bin/uautomizer/data/a680d551e/23307b78d8884732b8b6d3012604e916 [2019-11-20 00:15:45,175 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 00:15:45,176 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 00:15:45,177 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 00:15:45,177 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 00:15:45,180 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 00:15:45,181 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:15:45" (1/1) ... [2019-11-20 00:15:45,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e64ea90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:45, skipping insertion in model container [2019-11-20 00:15:45,184 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:15:45" (1/1) ... [2019-11-20 00:15:45,191 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 00:15:45,255 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 00:15:45,873 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:15:45,879 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 00:15:46,086 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:15:46,104 INFO L192 MainTranslator]: Completed translation [2019-11-20 00:15:46,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:46 WrapperNode [2019-11-20 00:15:46,106 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 00:15:46,107 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 00:15:46,107 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 00:15:46,107 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 00:15:46,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:46" (1/1) ... [2019-11-20 00:15:46,162 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:46" (1/1) ... [2019-11-20 00:15:46,283 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 00:15:46,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 00:15:46,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 00:15:46,285 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 00:15:46,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:46" (1/1) ... [2019-11-20 00:15:46,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:46" (1/1) ... [2019-11-20 00:15:46,312 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:46" (1/1) ... [2019-11-20 00:15:46,312 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:46" (1/1) ... [2019-11-20 00:15:46,366 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:46" (1/1) ... [2019-11-20 00:15:46,390 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:46" (1/1) ... [2019-11-20 00:15:46,413 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:46" (1/1) ... [2019-11-20 00:15:46,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 00:15:46,430 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 00:15:46,431 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 00:15:46,431 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 00:15:46,432 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cf3899b3-6a0c-46c2-8181-7a8eff463335/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 00:15:46,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 00:15:46,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 00:15:48,568 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 00:15:48,568 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 00:15:48,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:15:48 BoogieIcfgContainer [2019-11-20 00:15:48,570 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 00:15:48,571 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 00:15:48,571 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 00:15:48,575 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 00:15:48,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:15:45" (1/3) ... [2019-11-20 00:15:48,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4831cf5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:15:48, skipping insertion in model container [2019-11-20 00:15:48,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:46" (2/3) ... [2019-11-20 00:15:48,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4831cf5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:15:48, skipping insertion in model container [2019-11-20 00:15:48,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:15:48" (3/3) ... [2019-11-20 00:15:48,580 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label48.c [2019-11-20 00:15:48,590 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 00:15:48,599 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 00:15:48,610 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 00:15:48,650 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 00:15:48,651 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 00:15:48,651 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 00:15:48,651 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 00:15:48,651 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 00:15:48,652 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 00:15:48,652 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 00:15:48,653 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 00:15:48,686 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-11-20 00:15:48,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-20 00:15:48,695 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:15:48,696 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:15:48,696 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:15:48,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:15:48,701 INFO L82 PathProgramCache]: Analyzing trace with hash 761214138, now seen corresponding path program 1 times [2019-11-20 00:15:48,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:15:48,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520955488] [2019-11-20 00:15:48,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:15:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:15:49,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:15:49,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520955488] [2019-11-20 00:15:49,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:15:49,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:15:49,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707842299] [2019-11-20 00:15:49,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:15:49,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:15:49,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:15:49,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:15:49,104 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-11-20 00:15:51,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:15:51,501 INFO L93 Difference]: Finished difference Result 951 states and 1718 transitions. [2019-11-20 00:15:51,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:15:51,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-20 00:15:51,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:15:51,530 INFO L225 Difference]: With dead ends: 951 [2019-11-20 00:15:51,530 INFO L226 Difference]: Without dead ends: 600 [2019-11-20 00:15:51,534 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:15:51,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-11-20 00:15:51,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 410. [2019-11-20 00:15:51,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-11-20 00:15:51,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 593 transitions. [2019-11-20 00:15:51,624 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 593 transitions. Word has length 50 [2019-11-20 00:15:51,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:15:51,625 INFO L462 AbstractCegarLoop]: Abstraction has 410 states and 593 transitions. [2019-11-20 00:15:51,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:15:51,625 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 593 transitions. [2019-11-20 00:15:51,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-20 00:15:51,638 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:15:51,639 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:15:51,639 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:15:51,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:15:51,640 INFO L82 PathProgramCache]: Analyzing trace with hash 2108563154, now seen corresponding path program 1 times [2019-11-20 00:15:51,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:15:51,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676701289] [2019-11-20 00:15:51,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:15:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:15:51,885 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:15:51,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676701289] [2019-11-20 00:15:51,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:15:51,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:15:51,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449769129] [2019-11-20 00:15:51,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:15:51,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:15:51,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:15:51,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:15:51,891 INFO L87 Difference]: Start difference. First operand 410 states and 593 transitions. Second operand 4 states. [2019-11-20 00:15:53,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:15:53,504 INFO L93 Difference]: Finished difference Result 1572 states and 2289 transitions. [2019-11-20 00:15:53,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:15:53,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-11-20 00:15:53,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:15:53,513 INFO L225 Difference]: With dead ends: 1572 [2019-11-20 00:15:53,514 INFO L226 Difference]: Without dead ends: 1164 [2019-11-20 00:15:53,516 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:15:53,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2019-11-20 00:15:53,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 1150. [2019-11-20 00:15:53,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1150 states. [2019-11-20 00:15:53,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1567 transitions. [2019-11-20 00:15:53,563 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1567 transitions. Word has length 118 [2019-11-20 00:15:53,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:15:53,564 INFO L462 AbstractCegarLoop]: Abstraction has 1150 states and 1567 transitions. [2019-11-20 00:15:53,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:15:53,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1567 transitions. [2019-11-20 00:15:53,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-20 00:15:53,567 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:15:53,567 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:15:53,567 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:15:53,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:15:53,568 INFO L82 PathProgramCache]: Analyzing trace with hash -209624514, now seen corresponding path program 1 times [2019-11-20 00:15:53,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:15:53,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186653485] [2019-11-20 00:15:53,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:15:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:15:53,801 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:15:53,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186653485] [2019-11-20 00:15:53,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:15:53,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:15:53,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675500143] [2019-11-20 00:15:53,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:15:53,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:15:53,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:15:53,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:15:53,803 INFO L87 Difference]: Start difference. First operand 1150 states and 1567 transitions. Second operand 4 states. [2019-11-20 00:15:55,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:15:55,430 INFO L93 Difference]: Finished difference Result 3966 states and 5427 transitions. [2019-11-20 00:15:55,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:15:55,431 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-11-20 00:15:55,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:15:55,445 INFO L225 Difference]: With dead ends: 3966 [2019-11-20 00:15:55,446 INFO L226 Difference]: Without dead ends: 2818 [2019-11-20 00:15:55,448 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:15:55,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states. [2019-11-20 00:15:55,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2255. [2019-11-20 00:15:55,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2255 states. [2019-11-20 00:15:55,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 2255 states and 2821 transitions. [2019-11-20 00:15:55,503 INFO L78 Accepts]: Start accepts. Automaton has 2255 states and 2821 transitions. Word has length 126 [2019-11-20 00:15:55,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:15:55,504 INFO L462 AbstractCegarLoop]: Abstraction has 2255 states and 2821 transitions. [2019-11-20 00:15:55,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:15:55,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 2821 transitions. [2019-11-20 00:15:55,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-11-20 00:15:55,508 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:15:55,508 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:15:55,509 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:15:55,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:15:55,509 INFO L82 PathProgramCache]: Analyzing trace with hash 2124204058, now seen corresponding path program 1 times [2019-11-20 00:15:55,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:15:55,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298837774] [2019-11-20 00:15:55,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:15:55,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:15:55,921 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:15:55,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298837774] [2019-11-20 00:15:55,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:15:55,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:15:55,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509920481] [2019-11-20 00:15:55,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:15:55,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:15:55,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:15:55,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:15:55,924 INFO L87 Difference]: Start difference. First operand 2255 states and 2821 transitions. Second operand 4 states. [2019-11-20 00:15:57,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:15:57,450 INFO L93 Difference]: Finished difference Result 5629 states and 7168 transitions. [2019-11-20 00:15:57,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:15:57,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2019-11-20 00:15:57,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:15:57,471 INFO L225 Difference]: With dead ends: 5629 [2019-11-20 00:15:57,471 INFO L226 Difference]: Without dead ends: 3560 [2019-11-20 00:15:57,474 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:15:57,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3560 states. [2019-11-20 00:15:57,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3560 to 3359. [2019-11-20 00:15:57,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3359 states. [2019-11-20 00:15:57,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3359 states to 3359 states and 4170 transitions. [2019-11-20 00:15:57,543 INFO L78 Accepts]: Start accepts. Automaton has 3359 states and 4170 transitions. Word has length 238 [2019-11-20 00:15:57,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:15:57,544 INFO L462 AbstractCegarLoop]: Abstraction has 3359 states and 4170 transitions. [2019-11-20 00:15:57,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:15:57,544 INFO L276 IsEmpty]: Start isEmpty. Operand 3359 states and 4170 transitions. [2019-11-20 00:15:57,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-11-20 00:15:57,549 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:15:57,549 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2019-11-20 00:15:57,550 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:15:57,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:15:57,550 INFO L82 PathProgramCache]: Analyzing trace with hash 2110216437, now seen corresponding path program 1 times [2019-11-20 00:15:57,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:15:57,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822342755] [2019-11-20 00:15:57,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:15:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:15:57,743 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-20 00:15:57,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822342755] [2019-11-20 00:15:57,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:15:57,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:15:57,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691590510] [2019-11-20 00:15:57,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:15:57,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:15:57,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:15:57,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:15:57,747 INFO L87 Difference]: Start difference. First operand 3359 states and 4170 transitions. Second operand 3 states. [2019-11-20 00:15:58,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:15:58,659 INFO L93 Difference]: Finished difference Result 8004 states and 10137 transitions. [2019-11-20 00:15:58,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:15:58,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2019-11-20 00:15:58,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:15:58,682 INFO L225 Difference]: With dead ends: 8004 [2019-11-20 00:15:58,682 INFO L226 Difference]: Without dead ends: 4831 [2019-11-20 00:15:58,686 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:15:58,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4831 states. [2019-11-20 00:15:58,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4831 to 4279. [2019-11-20 00:15:58,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4279 states. [2019-11-20 00:15:58,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4279 states to 4279 states and 5222 transitions. [2019-11-20 00:15:58,765 INFO L78 Accepts]: Start accepts. Automaton has 4279 states and 5222 transitions. Word has length 253 [2019-11-20 00:15:58,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:15:58,766 INFO L462 AbstractCegarLoop]: Abstraction has 4279 states and 5222 transitions. [2019-11-20 00:15:58,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:15:58,767 INFO L276 IsEmpty]: Start isEmpty. Operand 4279 states and 5222 transitions. [2019-11-20 00:15:58,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-11-20 00:15:58,772 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:15:58,772 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-20 00:15:58,773 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:15:58,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:15:58,773 INFO L82 PathProgramCache]: Analyzing trace with hash 697992722, now seen corresponding path program 1 times [2019-11-20 00:15:58,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:15:58,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019724930] [2019-11-20 00:15:58,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:15:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:15:59,052 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 143 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:15:59,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019724930] [2019-11-20 00:15:59,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350338453] [2019-11-20 00:15:59,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cf3899b3-6a0c-46c2-8181-7a8eff463335/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:15:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:15:59,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 00:15:59,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:15:59,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:15:59,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:15:59,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:15:59,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:15:59,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:15:59,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:15:59,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:15:59,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:15:59,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:15:59,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:15:59,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:15:59,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:15:59,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:15:59,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:15:59,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:15:59,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:15:59,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:15:59,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:15:59,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:15:59,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:15:59,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:15:59,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:15:59,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:15:59,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:15:59,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:15:59,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:16:01,820 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 23 [2019-11-20 00:16:02,084 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-20 00:16:02,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 00:16:02,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-11-20 00:16:02,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396452465] [2019-11-20 00:16:02,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:16:02,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:16:02,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:16:02,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=26, Unknown=1, NotChecked=0, Total=42 [2019-11-20 00:16:02,087 INFO L87 Difference]: Start difference. First operand 4279 states and 5222 transitions. Second operand 3 states. [2019-11-20 00:16:04,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:16:04,478 INFO L93 Difference]: Finished difference Result 9849 states and 12070 transitions. [2019-11-20 00:16:04,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:16:04,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2019-11-20 00:16:04,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:16:04,507 INFO L225 Difference]: With dead ends: 9849 [2019-11-20 00:16:04,508 INFO L226 Difference]: Without dead ends: 5572 [2019-11-20 00:16:04,513 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=15, Invalid=26, Unknown=1, NotChecked=0, Total=42 [2019-11-20 00:16:04,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5572 states. [2019-11-20 00:16:04,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5572 to 5018. [2019-11-20 00:16:04,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5018 states. [2019-11-20 00:16:04,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5018 states to 5018 states and 6016 transitions. [2019-11-20 00:16:04,616 INFO L78 Accepts]: Start accepts. Automaton has 5018 states and 6016 transitions. Word has length 259 [2019-11-20 00:16:04,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:16:04,617 INFO L462 AbstractCegarLoop]: Abstraction has 5018 states and 6016 transitions. [2019-11-20 00:16:04,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:16:04,618 INFO L276 IsEmpty]: Start isEmpty. Operand 5018 states and 6016 transitions. [2019-11-20 00:16:04,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-11-20 00:16:04,624 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:16:04,625 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2019-11-20 00:16:04,838 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:16:04,838 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:16:04,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:16:04,839 INFO L82 PathProgramCache]: Analyzing trace with hash 384725077, now seen corresponding path program 1 times [2019-11-20 00:16:04,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:16:04,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085570416] [2019-11-20 00:16:04,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:16:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:16:05,253 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:16:05,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085570416] [2019-11-20 00:16:05,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544993356] [2019-11-20 00:16:05,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cf3899b3-6a0c-46c2-8181-7a8eff463335/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:16:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:16:05,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 00:16:05,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:16:05,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:16:05,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:16:05,708 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:16:05,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 00:16:05,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2019-11-20 00:16:05,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960961366] [2019-11-20 00:16:05,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:16:05,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:16:05,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:16:05,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-20 00:16:05,711 INFO L87 Difference]: Start difference. First operand 5018 states and 6016 transitions. Second operand 4 states. [2019-11-20 00:16:07,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:16:07,751 INFO L93 Difference]: Finished difference Result 14279 states and 17154 transitions. [2019-11-20 00:16:07,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:16:07,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 269 [2019-11-20 00:16:07,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:16:07,790 INFO L225 Difference]: With dead ends: 14279 [2019-11-20 00:16:07,791 INFO L226 Difference]: Without dead ends: 9263 [2019-11-20 00:16:07,796 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-20 00:16:07,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9263 states. [2019-11-20 00:16:07,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9263 to 8336. [2019-11-20 00:16:07,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8336 states. [2019-11-20 00:16:07,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8336 states to 8336 states and 9955 transitions. [2019-11-20 00:16:07,968 INFO L78 Accepts]: Start accepts. Automaton has 8336 states and 9955 transitions. Word has length 269 [2019-11-20 00:16:07,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:16:07,969 INFO L462 AbstractCegarLoop]: Abstraction has 8336 states and 9955 transitions. [2019-11-20 00:16:07,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:16:07,969 INFO L276 IsEmpty]: Start isEmpty. Operand 8336 states and 9955 transitions. [2019-11-20 00:16:07,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-11-20 00:16:07,976 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:16:07,977 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 00:16:08,180 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:16:08,181 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:16:08,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:16:08,181 INFO L82 PathProgramCache]: Analyzing trace with hash 510762410, now seen corresponding path program 1 times [2019-11-20 00:16:08,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:16:08,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62694858] [2019-11-20 00:16:08,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:16:08,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:16:08,398 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 149 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-20 00:16:08,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62694858] [2019-11-20 00:16:08,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425773059] [2019-11-20 00:16:08,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cf3899b3-6a0c-46c2-8181-7a8eff463335/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:16:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:16:08,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 00:16:08,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:16:08,649 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-20 00:16:08,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 00:16:08,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-11-20 00:16:08,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040999150] [2019-11-20 00:16:08,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:16:08,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:16:08,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:16:08,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:16:08,652 INFO L87 Difference]: Start difference. First operand 8336 states and 9955 transitions. Second operand 3 states. [2019-11-20 00:16:09,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:16:09,683 INFO L93 Difference]: Finished difference Result 16483 states and 19697 transitions. [2019-11-20 00:16:09,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:16:09,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 280 [2019-11-20 00:16:09,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:16:09,719 INFO L225 Difference]: With dead ends: 16483 [2019-11-20 00:16:09,720 INFO L226 Difference]: Without dead ends: 8149 [2019-11-20 00:16:09,727 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:16:09,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8149 states. [2019-11-20 00:16:09,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8149 to 8148. [2019-11-20 00:16:09,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8148 states. [2019-11-20 00:16:09,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8148 states to 8148 states and 9455 transitions. [2019-11-20 00:16:09,844 INFO L78 Accepts]: Start accepts. Automaton has 8148 states and 9455 transitions. Word has length 280 [2019-11-20 00:16:09,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:16:09,844 INFO L462 AbstractCegarLoop]: Abstraction has 8148 states and 9455 transitions. [2019-11-20 00:16:09,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:16:09,845 INFO L276 IsEmpty]: Start isEmpty. Operand 8148 states and 9455 transitions. [2019-11-20 00:16:09,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-11-20 00:16:09,854 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:16:09,855 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:16:10,067 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:16:10,067 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:16:10,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:16:10,068 INFO L82 PathProgramCache]: Analyzing trace with hash 577294273, now seen corresponding path program 1 times [2019-11-20 00:16:10,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:16:10,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890085390] [2019-11-20 00:16:10,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:16:10,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:16:10,301 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:16:10,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890085390] [2019-11-20 00:16:10,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:16:10,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:16:10,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375517383] [2019-11-20 00:16:10,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:16:10,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:16:10,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:16:10,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:16:10,303 INFO L87 Difference]: Start difference. First operand 8148 states and 9455 transitions. Second operand 4 states. [2019-11-20 00:16:11,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:16:11,436 INFO L93 Difference]: Finished difference Result 17050 states and 19801 transitions. [2019-11-20 00:16:11,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:16:11,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 283 [2019-11-20 00:16:11,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:16:11,468 INFO L225 Difference]: With dead ends: 17050 [2019-11-20 00:16:11,468 INFO L226 Difference]: Without dead ends: 8904 [2019-11-20 00:16:11,476 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:16:11,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8904 states. [2019-11-20 00:16:11,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8904 to 8518. [2019-11-20 00:16:11,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8518 states. [2019-11-20 00:16:11,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8518 states to 8518 states and 9862 transitions. [2019-11-20 00:16:11,600 INFO L78 Accepts]: Start accepts. Automaton has 8518 states and 9862 transitions. Word has length 283 [2019-11-20 00:16:11,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:16:11,600 INFO L462 AbstractCegarLoop]: Abstraction has 8518 states and 9862 transitions. [2019-11-20 00:16:11,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:16:11,601 INFO L276 IsEmpty]: Start isEmpty. Operand 8518 states and 9862 transitions. [2019-11-20 00:16:11,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-11-20 00:16:11,611 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:16:11,612 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:16:11,612 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:16:11,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:16:11,612 INFO L82 PathProgramCache]: Analyzing trace with hash 934196540, now seen corresponding path program 1 times [2019-11-20 00:16:11,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:16:11,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821589118] [2019-11-20 00:16:11,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:16:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:16:12,385 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 110 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:16:12,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821589118] [2019-11-20 00:16:12,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979989876] [2019-11-20 00:16:12,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cf3899b3-6a0c-46c2-8181-7a8eff463335/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:16:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:16:12,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 00:16:12,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:16:12,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:16:12,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:16:12,772 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2019-11-20 00:16:12,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 00:16:12,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 13 [2019-11-20 00:16:12,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628334925] [2019-11-20 00:16:12,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:16:12,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:16:12,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:16:12,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-20 00:16:12,774 INFO L87 Difference]: Start difference. First operand 8518 states and 9862 transitions. Second operand 3 states. [2019-11-20 00:16:45,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:16:45,084 INFO L93 Difference]: Finished difference Result 20362 states and 23682 transitions. [2019-11-20 00:16:45,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:16:45,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2019-11-20 00:16:45,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:16:45,100 INFO L225 Difference]: With dead ends: 20362 [2019-11-20 00:16:45,100 INFO L226 Difference]: Without dead ends: 11110 [2019-11-20 00:16:45,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 306 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-20 00:16:45,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11110 states. [2019-11-20 00:16:45,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11110 to 10922. [2019-11-20 00:16:45,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10922 states. [2019-11-20 00:16:45,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10922 states to 10922 states and 12643 transitions. [2019-11-20 00:16:45,249 INFO L78 Accepts]: Start accepts. Automaton has 10922 states and 12643 transitions. Word has length 307 [2019-11-20 00:16:45,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:16:45,250 INFO L462 AbstractCegarLoop]: Abstraction has 10922 states and 12643 transitions. [2019-11-20 00:16:45,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:16:45,250 INFO L276 IsEmpty]: Start isEmpty. Operand 10922 states and 12643 transitions. [2019-11-20 00:16:45,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-11-20 00:16:45,262 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:16:45,264 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:16:45,566 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:16:45,566 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:16:45,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:16:45,566 INFO L82 PathProgramCache]: Analyzing trace with hash 100748151, now seen corresponding path program 1 times [2019-11-20 00:16:45,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:16:45,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464112260] [2019-11-20 00:16:45,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:16:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:16:45,779 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-20 00:16:45,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464112260] [2019-11-20 00:16:45,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:16:45,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:16:45,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801766606] [2019-11-20 00:16:45,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:16:45,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:16:45,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:16:45,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:16:45,782 INFO L87 Difference]: Start difference. First operand 10922 states and 12643 transitions. Second operand 3 states. [2019-11-20 00:16:46,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:16:46,652 INFO L93 Difference]: Finished difference Result 24050 states and 27739 transitions. [2019-11-20 00:16:46,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:16:46,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-11-20 00:16:46,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:16:46,667 INFO L225 Difference]: With dead ends: 24050 [2019-11-20 00:16:46,667 INFO L226 Difference]: Without dead ends: 12394 [2019-11-20 00:16:46,678 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:16:46,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12394 states. [2019-11-20 00:16:46,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12394 to 10002. [2019-11-20 00:16:46,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10002 states. [2019-11-20 00:16:46,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10002 states to 10002 states and 11589 transitions. [2019-11-20 00:16:46,818 INFO L78 Accepts]: Start accepts. Automaton has 10002 states and 11589 transitions. Word has length 312 [2019-11-20 00:16:46,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:16:46,819 INFO L462 AbstractCegarLoop]: Abstraction has 10002 states and 11589 transitions. [2019-11-20 00:16:46,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:16:46,819 INFO L276 IsEmpty]: Start isEmpty. Operand 10002 states and 11589 transitions. [2019-11-20 00:16:46,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-11-20 00:16:46,831 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:16:46,832 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:16:46,832 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:16:46,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:16:46,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1462001354, now seen corresponding path program 1 times [2019-11-20 00:16:46,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:16:46,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106903971] [2019-11-20 00:16:46,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:16:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:16:47,077 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 317 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-11-20 00:16:47,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106903971] [2019-11-20 00:16:47,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:16:47,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:16:47,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60226706] [2019-11-20 00:16:47,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:16:47,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:16:47,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:16:47,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:16:47,085 INFO L87 Difference]: Start difference. First operand 10002 states and 11589 transitions. Second operand 3 states. [2019-11-20 00:16:47,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:16:47,983 INFO L93 Difference]: Finished difference Result 20741 states and 23985 transitions. [2019-11-20 00:16:47,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:16:47,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 337 [2019-11-20 00:16:47,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:16:47,998 INFO L225 Difference]: With dead ends: 20741 [2019-11-20 00:16:47,998 INFO L226 Difference]: Without dead ends: 10189 [2019-11-20 00:16:48,011 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:16:48,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10189 states. [2019-11-20 00:16:48,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10189 to 9452. [2019-11-20 00:16:48,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9452 states. [2019-11-20 00:16:48,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9452 states to 9452 states and 10850 transitions. [2019-11-20 00:16:48,129 INFO L78 Accepts]: Start accepts. Automaton has 9452 states and 10850 transitions. Word has length 337 [2019-11-20 00:16:48,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:16:48,130 INFO L462 AbstractCegarLoop]: Abstraction has 9452 states and 10850 transitions. [2019-11-20 00:16:48,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:16:48,130 INFO L276 IsEmpty]: Start isEmpty. Operand 9452 states and 10850 transitions. [2019-11-20 00:16:48,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-11-20 00:16:48,137 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:16:48,139 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:16:48,139 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:16:48,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:16:48,140 INFO L82 PathProgramCache]: Analyzing trace with hash 364338523, now seen corresponding path program 1 times [2019-11-20 00:16:48,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:16:48,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233032907] [2019-11-20 00:16:48,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:16:48,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:16:48,497 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-20 00:16:48,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233032907] [2019-11-20 00:16:48,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:16:48,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:16:48,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145154264] [2019-11-20 00:16:48,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:16:48,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:16:48,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:16:48,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:16:48,500 INFO L87 Difference]: Start difference. First operand 9452 states and 10850 transitions. Second operand 4 states. [2019-11-20 00:16:50,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:16:50,067 INFO L93 Difference]: Finished difference Result 19843 states and 22705 transitions. [2019-11-20 00:16:50,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:16:50,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 338 [2019-11-20 00:16:50,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:16:50,080 INFO L225 Difference]: With dead ends: 19843 [2019-11-20 00:16:50,081 INFO L226 Difference]: Without dead ends: 10390 [2019-11-20 00:16:50,087 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:16:50,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10390 states. [2019-11-20 00:16:50,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10390 to 9450. [2019-11-20 00:16:50,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9450 states. [2019-11-20 00:16:50,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9450 states to 9450 states and 10624 transitions. [2019-11-20 00:16:50,211 INFO L78 Accepts]: Start accepts. Automaton has 9450 states and 10624 transitions. Word has length 338 [2019-11-20 00:16:50,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:16:50,212 INFO L462 AbstractCegarLoop]: Abstraction has 9450 states and 10624 transitions. [2019-11-20 00:16:50,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:16:50,212 INFO L276 IsEmpty]: Start isEmpty. Operand 9450 states and 10624 transitions. [2019-11-20 00:16:50,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-11-20 00:16:50,221 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:16:50,222 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:16:50,222 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:16:50,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:16:50,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1557741476, now seen corresponding path program 1 times [2019-11-20 00:16:50,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:16:50,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823357471] [2019-11-20 00:16:50,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:16:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:16:50,639 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 248 proven. 193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:16:50,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823357471] [2019-11-20 00:16:50,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099399700] [2019-11-20 00:16:50,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cf3899b3-6a0c-46c2-8181-7a8eff463335/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-11-20 00:16:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:16:50,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 00:16:50,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:16:50,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:16:50,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:16:50,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:16:50,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:16:50,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:16:51,498 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 63 proven. 282 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-20 00:16:51,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:16:51,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 12 [2019-11-20 00:16:51,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10361631] [2019-11-20 00:16:51,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 00:16:51,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:16:51,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 00:16:51,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-20 00:16:51,502 INFO L87 Difference]: Start difference. First operand 9450 states and 10624 transitions. Second operand 12 states. [2019-11-20 00:17:02,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:17:02,432 INFO L93 Difference]: Finished difference Result 28861 states and 32597 transitions. [2019-11-20 00:17:02,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-11-20 00:17:02,433 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 365 [2019-11-20 00:17:02,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:17:02,453 INFO L225 Difference]: With dead ends: 28861 [2019-11-20 00:17:02,453 INFO L226 Difference]: Without dead ends: 18677 [2019-11-20 00:17:02,462 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=425, Invalid=1555, Unknown=0, NotChecked=0, Total=1980 [2019-11-20 00:17:02,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18677 states. [2019-11-20 00:17:02,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18677 to 10371. [2019-11-20 00:17:02,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10371 states. [2019-11-20 00:17:02,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10371 states to 10371 states and 11396 transitions. [2019-11-20 00:17:02,740 INFO L78 Accepts]: Start accepts. Automaton has 10371 states and 11396 transitions. Word has length 365 [2019-11-20 00:17:02,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:17:02,741 INFO L462 AbstractCegarLoop]: Abstraction has 10371 states and 11396 transitions. [2019-11-20 00:17:02,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 00:17:02,741 INFO L276 IsEmpty]: Start isEmpty. Operand 10371 states and 11396 transitions. [2019-11-20 00:17:02,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-11-20 00:17:02,750 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:17:02,751 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:17:02,958 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:17:02,958 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:17:02,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:17:02,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1257108569, now seen corresponding path program 1 times [2019-11-20 00:17:02,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:17:02,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578699895] [2019-11-20 00:17:02,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:17:03,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:17:03,484 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 48 proven. 395 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:17:03,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578699895] [2019-11-20 00:17:03,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100400562] [2019-11-20 00:17:03,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cf3899b3-6a0c-46c2-8181-7a8eff463335/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-11-20 00:17:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:17:03,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 00:17:03,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:17:03,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:17:03,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:17:03,887 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 395 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-20 00:17:03,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 00:17:03,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2019-11-20 00:17:03,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911655634] [2019-11-20 00:17:03,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:17:03,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:17:03,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:17:03,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-20 00:17:03,889 INFO L87 Difference]: Start difference. First operand 10371 states and 11396 transitions. Second operand 4 states. [2019-11-20 00:17:05,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:17:05,342 INFO L93 Difference]: Finished difference Result 22405 states and 24669 transitions. [2019-11-20 00:17:05,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:17:05,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 381 [2019-11-20 00:17:05,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:17:05,354 INFO L225 Difference]: With dead ends: 22405 [2019-11-20 00:17:05,354 INFO L226 Difference]: Without dead ends: 12220 [2019-11-20 00:17:05,362 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-20 00:17:05,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12220 states. [2019-11-20 00:17:05,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12220 to 12027. [2019-11-20 00:17:05,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12027 states. [2019-11-20 00:17:05,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12027 states to 12027 states and 13119 transitions. [2019-11-20 00:17:05,500 INFO L78 Accepts]: Start accepts. Automaton has 12027 states and 13119 transitions. Word has length 381 [2019-11-20 00:17:05,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:17:05,501 INFO L462 AbstractCegarLoop]: Abstraction has 12027 states and 13119 transitions. [2019-11-20 00:17:05,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:17:05,501 INFO L276 IsEmpty]: Start isEmpty. Operand 12027 states and 13119 transitions. [2019-11-20 00:17:05,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2019-11-20 00:17:05,510 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:17:05,511 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:17:05,723 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:17:05,723 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:17:05,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:17:05,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1760358101, now seen corresponding path program 1 times [2019-11-20 00:17:05,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:17:05,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778224245] [2019-11-20 00:17:05,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:17:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:17:06,133 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 422 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-20 00:17:06,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778224245] [2019-11-20 00:17:06,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:17:06,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:17:06,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337702100] [2019-11-20 00:17:06,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:17:06,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:17:06,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:17:06,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:17:06,137 INFO L87 Difference]: Start difference. First operand 12027 states and 13119 transitions. Second operand 4 states. [2019-11-20 00:17:07,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:17:07,212 INFO L93 Difference]: Finished difference Result 25163 states and 27429 transitions. [2019-11-20 00:17:07,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:17:07,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 405 [2019-11-20 00:17:07,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:17:07,222 INFO L225 Difference]: With dead ends: 25163 [2019-11-20 00:17:07,222 INFO L226 Difference]: Without dead ends: 13322 [2019-11-20 00:17:07,234 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:17:07,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13322 states. [2019-11-20 00:17:07,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13322 to 11471. [2019-11-20 00:17:07,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11471 states. [2019-11-20 00:17:07,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11471 states to 11471 states and 12388 transitions. [2019-11-20 00:17:07,341 INFO L78 Accepts]: Start accepts. Automaton has 11471 states and 12388 transitions. Word has length 405 [2019-11-20 00:17:07,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:17:07,341 INFO L462 AbstractCegarLoop]: Abstraction has 11471 states and 12388 transitions. [2019-11-20 00:17:07,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:17:07,341 INFO L276 IsEmpty]: Start isEmpty. Operand 11471 states and 12388 transitions. [2019-11-20 00:17:07,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-11-20 00:17:07,346 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:17:07,347 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:17:07,347 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:17:07,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:17:07,348 INFO L82 PathProgramCache]: Analyzing trace with hash -2014347638, now seen corresponding path program 1 times [2019-11-20 00:17:07,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:17:07,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538098801] [2019-11-20 00:17:07,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:17:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:17:07,614 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-20 00:17:07,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538098801] [2019-11-20 00:17:07,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:17:07,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:17:07,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558839212] [2019-11-20 00:17:07,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:17:07,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:17:07,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:17:07,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:17:07,616 INFO L87 Difference]: Start difference. First operand 11471 states and 12388 transitions. Second operand 4 states. [2019-11-20 00:17:08,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:17:08,688 INFO L93 Difference]: Finished difference Result 23324 states and 25175 transitions. [2019-11-20 00:17:08,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:17:08,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 412 [2019-11-20 00:17:08,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:17:08,696 INFO L225 Difference]: With dead ends: 23324 [2019-11-20 00:17:08,696 INFO L226 Difference]: Without dead ends: 12039 [2019-11-20 00:17:08,702 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:17:08,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12039 states. [2019-11-20 00:17:08,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12039 to 10919. [2019-11-20 00:17:08,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10919 states. [2019-11-20 00:17:08,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10919 states to 10919 states and 11724 transitions. [2019-11-20 00:17:08,796 INFO L78 Accepts]: Start accepts. Automaton has 10919 states and 11724 transitions. Word has length 412 [2019-11-20 00:17:08,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:17:08,796 INFO L462 AbstractCegarLoop]: Abstraction has 10919 states and 11724 transitions. [2019-11-20 00:17:08,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:17:08,796 INFO L276 IsEmpty]: Start isEmpty. Operand 10919 states and 11724 transitions. [2019-11-20 00:17:08,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2019-11-20 00:17:08,802 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:17:08,803 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 00:17:08,803 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:17:08,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:17:08,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1465243018, now seen corresponding path program 1 times [2019-11-20 00:17:08,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:17:08,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767764273] [2019-11-20 00:17:08,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:17:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:17:09,137 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-11-20 00:17:09,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767764273] [2019-11-20 00:17:09,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:17:09,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:17:09,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785123132] [2019-11-20 00:17:09,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 00:17:09,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:17:09,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 00:17:09,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:17:09,139 INFO L87 Difference]: Start difference. First operand 10919 states and 11724 transitions. Second operand 5 states. [2019-11-20 00:17:10,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:17:10,550 INFO L93 Difference]: Finished difference Result 27546 states and 29547 transitions. [2019-11-20 00:17:10,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 00:17:10,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 414 [2019-11-20 00:17:10,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:17:10,563 INFO L225 Difference]: With dead ends: 27546 [2019-11-20 00:17:10,563 INFO L226 Difference]: Without dead ends: 16077 [2019-11-20 00:17:10,569 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:17:10,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16077 states. [2019-11-20 00:17:10,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16077 to 13304. [2019-11-20 00:17:10,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13304 states. [2019-11-20 00:17:10,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13304 states to 13304 states and 14196 transitions. [2019-11-20 00:17:10,708 INFO L78 Accepts]: Start accepts. Automaton has 13304 states and 14196 transitions. Word has length 414 [2019-11-20 00:17:10,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:17:10,709 INFO L462 AbstractCegarLoop]: Abstraction has 13304 states and 14196 transitions. [2019-11-20 00:17:10,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 00:17:10,709 INFO L276 IsEmpty]: Start isEmpty. Operand 13304 states and 14196 transitions. [2019-11-20 00:17:10,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2019-11-20 00:17:10,718 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:17:10,719 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:17:10,719 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:17:10,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:17:10,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1627853402, now seen corresponding path program 1 times [2019-11-20 00:17:10,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:17:10,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598247261] [2019-11-20 00:17:10,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:17:10,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:17:11,975 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 44 proven. 434 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:17:11,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598247261] [2019-11-20 00:17:11,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928126866] [2019-11-20 00:17:11,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cf3899b3-6a0c-46c2-8181-7a8eff463335/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-11-20 00:17:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:17:12,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 00:17:12,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:17:12,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:17:12,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:17:12,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:17:12,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:17:13,091 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 248 proven. 230 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:17:13,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:17:13,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 16 [2019-11-20 00:17:13,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549040566] [2019-11-20 00:17:13,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-20 00:17:13,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:17:13,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-20 00:17:13,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-11-20 00:17:13,093 INFO L87 Difference]: Start difference. First operand 13304 states and 14196 transitions. Second operand 17 states. [2019-11-20 00:17:22,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:17:22,850 INFO L93 Difference]: Finished difference Result 41425 states and 44108 transitions. [2019-11-20 00:17:22,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-20 00:17:22,851 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 417 [2019-11-20 00:17:22,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:17:22,871 INFO L225 Difference]: With dead ends: 41425 [2019-11-20 00:17:22,871 INFO L226 Difference]: Without dead ends: 28307 [2019-11-20 00:17:22,877 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 413 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=416, Invalid=1306, Unknown=0, NotChecked=0, Total=1722 [2019-11-20 00:17:22,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28307 states. [2019-11-20 00:17:23,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28307 to 12745. [2019-11-20 00:17:23,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12745 states. [2019-11-20 00:17:23,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12745 states to 12745 states and 13553 transitions. [2019-11-20 00:17:23,046 INFO L78 Accepts]: Start accepts. Automaton has 12745 states and 13553 transitions. Word has length 417 [2019-11-20 00:17:23,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:17:23,046 INFO L462 AbstractCegarLoop]: Abstraction has 12745 states and 13553 transitions. [2019-11-20 00:17:23,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-20 00:17:23,046 INFO L276 IsEmpty]: Start isEmpty. Operand 12745 states and 13553 transitions. [2019-11-20 00:17:23,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2019-11-20 00:17:23,055 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:17:23,055 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:17:23,258 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:17:23,258 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:17:23,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:17:23,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1574106967, now seen corresponding path program 1 times [2019-11-20 00:17:23,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:17:23,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115466666] [2019-11-20 00:17:23,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:17:23,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:17:24,827 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 92 proven. 727 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:17:24,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115466666] [2019-11-20 00:17:24,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260244979] [2019-11-20 00:17:24,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cf3899b3-6a0c-46c2-8181-7a8eff463335/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-11-20 00:17:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:17:24,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 00:17:24,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:17:25,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 00:17:25,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:17:25,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:17:25,868 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 549 proven. 222 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-20 00:17:25,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:17:25,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 17 [2019-11-20 00:17:25,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684262121] [2019-11-20 00:17:25,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 00:17:25,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:17:25,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 00:17:25,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-11-20 00:17:25,874 INFO L87 Difference]: Start difference. First operand 12745 states and 13553 transitions. Second operand 18 states. [2019-11-20 00:17:41,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:17:41,767 INFO L93 Difference]: Finished difference Result 41777 states and 44444 transitions. [2019-11-20 00:17:41,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-11-20 00:17:41,768 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 536 [2019-11-20 00:17:41,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:17:41,787 INFO L225 Difference]: With dead ends: 41777 [2019-11-20 00:17:41,787 INFO L226 Difference]: Without dead ends: 29218 [2019-11-20 00:17:41,791 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 531 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1509 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1220, Invalid=3336, Unknown=0, NotChecked=0, Total=4556 [2019-11-20 00:17:41,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29218 states. [2019-11-20 00:17:41,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29218 to 12737. [2019-11-20 00:17:41,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12737 states. [2019-11-20 00:17:41,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12737 states to 12737 states and 13463 transitions. [2019-11-20 00:17:41,952 INFO L78 Accepts]: Start accepts. Automaton has 12737 states and 13463 transitions. Word has length 536 [2019-11-20 00:17:41,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:17:41,952 INFO L462 AbstractCegarLoop]: Abstraction has 12737 states and 13463 transitions. [2019-11-20 00:17:41,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 00:17:41,952 INFO L276 IsEmpty]: Start isEmpty. Operand 12737 states and 13463 transitions. [2019-11-20 00:17:41,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2019-11-20 00:17:41,960 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:17:41,960 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 00:17:42,160 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:17:42,161 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:17:42,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:17:42,161 INFO L82 PathProgramCache]: Analyzing trace with hash 27903080, now seen corresponding path program 1 times [2019-11-20 00:17:42,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:17:42,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378718131] [2019-11-20 00:17:42,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:17:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:17:42,718 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 111 proven. 486 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-11-20 00:17:42,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378718131] [2019-11-20 00:17:42,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095164614] [2019-11-20 00:17:42,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cf3899b3-6a0c-46c2-8181-7a8eff463335/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-11-20 00:17:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:17:42,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 00:17:42,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:17:42,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:17:42,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:17:43,409 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 241 proven. 454 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-11-20 00:17:43,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:17:43,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-11-20 00:17:43,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027256372] [2019-11-20 00:17:43,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 00:17:43,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:17:43,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 00:17:43,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-20 00:17:43,411 INFO L87 Difference]: Start difference. First operand 12737 states and 13463 transitions. Second operand 8 states. [2019-11-20 00:17:45,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:17:45,879 INFO L93 Difference]: Finished difference Result 21035 states and 22144 transitions. [2019-11-20 00:17:45,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 00:17:45,880 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 572 [2019-11-20 00:17:45,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:17:45,896 INFO L225 Difference]: With dead ends: 21035 [2019-11-20 00:17:45,896 INFO L226 Difference]: Without dead ends: 21033 [2019-11-20 00:17:45,899 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 570 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-20 00:17:45,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21033 states. [2019-11-20 00:17:46,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21033 to 13475. [2019-11-20 00:17:46,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13475 states. [2019-11-20 00:17:46,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13475 states to 13475 states and 14259 transitions. [2019-11-20 00:17:46,032 INFO L78 Accepts]: Start accepts. Automaton has 13475 states and 14259 transitions. Word has length 572 [2019-11-20 00:17:46,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:17:46,033 INFO L462 AbstractCegarLoop]: Abstraction has 13475 states and 14259 transitions. [2019-11-20 00:17:46,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 00:17:46,033 INFO L276 IsEmpty]: Start isEmpty. Operand 13475 states and 14259 transitions. [2019-11-20 00:17:46,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2019-11-20 00:17:46,040 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:17:46,041 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:17:46,241 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:17:46,241 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:17:46,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:17:46,242 INFO L82 PathProgramCache]: Analyzing trace with hash -406675492, now seen corresponding path program 1 times [2019-11-20 00:17:46,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:17:46,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319514427] [2019-11-20 00:17:46,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:17:46,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:17:46,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1307 backedges. 688 proven. 0 refuted. 0 times theorem prover too weak. 619 trivial. 0 not checked. [2019-11-20 00:17:46,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319514427] [2019-11-20 00:17:46,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:17:46,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:17:46,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180724975] [2019-11-20 00:17:46,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:17:46,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:17:46,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:17:46,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:17:46,774 INFO L87 Difference]: Start difference. First operand 13475 states and 14259 transitions. Second operand 3 states. [2019-11-20 00:17:47,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:17:47,375 INFO L93 Difference]: Finished difference Result 26580 states and 28129 transitions. [2019-11-20 00:17:47,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:17:47,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 672 [2019-11-20 00:17:47,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:17:47,387 INFO L225 Difference]: With dead ends: 26580 [2019-11-20 00:17:47,388 INFO L226 Difference]: Without dead ends: 13661 [2019-11-20 00:17:47,394 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:17:47,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13661 states. [2019-11-20 00:17:47,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13661 to 13475. [2019-11-20 00:17:47,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13475 states. [2019-11-20 00:17:47,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13475 states to 13475 states and 14247 transitions. [2019-11-20 00:17:47,509 INFO L78 Accepts]: Start accepts. Automaton has 13475 states and 14247 transitions. Word has length 672 [2019-11-20 00:17:47,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:17:47,510 INFO L462 AbstractCegarLoop]: Abstraction has 13475 states and 14247 transitions. [2019-11-20 00:17:47,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:17:47,510 INFO L276 IsEmpty]: Start isEmpty. Operand 13475 states and 14247 transitions. [2019-11-20 00:17:47,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 674 [2019-11-20 00:17:47,520 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:17:47,520 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:17:47,521 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:17:47,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:17:47,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1738464977, now seen corresponding path program 1 times [2019-11-20 00:17:47,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:17:47,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745929989] [2019-11-20 00:17:47,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:17:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:17:49,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1306 backedges. 509 proven. 513 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2019-11-20 00:17:49,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745929989] [2019-11-20 00:17:49,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752495338] [2019-11-20 00:17:49,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cf3899b3-6a0c-46c2-8181-7a8eff463335/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-11-20 00:17:49,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:17:49,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 00:17:49,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:17:49,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 00:17:50,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1306 backedges. 683 proven. 5 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2019-11-20 00:17:50,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:17:50,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 9 [2019-11-20 00:17:50,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562622070] [2019-11-20 00:17:50,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 00:17:50,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:17:50,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 00:17:50,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-20 00:17:50,867 INFO L87 Difference]: Start difference. First operand 13475 states and 14247 transitions. Second operand 10 states. [2019-11-20 00:17:54,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:17:54,588 INFO L93 Difference]: Finished difference Result 27354 states and 28927 transitions. [2019-11-20 00:17:54,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-20 00:17:54,588 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 673 [2019-11-20 00:17:54,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:17:54,601 INFO L225 Difference]: With dead ends: 27354 [2019-11-20 00:17:54,601 INFO L226 Difference]: Without dead ends: 14435 [2019-11-20 00:17:54,608 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 695 GetRequests, 673 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=331, Unknown=0, NotChecked=0, Total=506 [2019-11-20 00:17:54,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14435 states. [2019-11-20 00:17:54,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14435 to 13290. [2019-11-20 00:17:54,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13290 states. [2019-11-20 00:17:54,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13290 states to 13290 states and 14043 transitions. [2019-11-20 00:17:54,738 INFO L78 Accepts]: Start accepts. Automaton has 13290 states and 14043 transitions. Word has length 673 [2019-11-20 00:17:54,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:17:54,738 INFO L462 AbstractCegarLoop]: Abstraction has 13290 states and 14043 transitions. [2019-11-20 00:17:54,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 00:17:54,738 INFO L276 IsEmpty]: Start isEmpty. Operand 13290 states and 14043 transitions. [2019-11-20 00:17:54,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 748 [2019-11-20 00:17:54,745 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:17:54,746 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:17:54,946 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:17:54,946 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:17:54,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:17:54,947 INFO L82 PathProgramCache]: Analyzing trace with hash -2108246262, now seen corresponding path program 1 times [2019-11-20 00:17:54,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:17:54,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577051892] [2019-11-20 00:17:54,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:17:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:17:56,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1754 backedges. 560 proven. 1104 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-11-20 00:17:56,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577051892] [2019-11-20 00:17:56,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677918499] [2019-11-20 00:17:56,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cf3899b3-6a0c-46c2-8181-7a8eff463335/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-11-20 00:17:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:17:57,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 957 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 00:17:57,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:17:57,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:17:57,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:17:58,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1754 backedges. 902 proven. 121 refuted. 0 times theorem prover too weak. 731 trivial. 0 not checked. [2019-11-20 00:17:58,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:17:58,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 3] total 17 [2019-11-20 00:17:58,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552942485] [2019-11-20 00:17:58,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 00:17:58,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:17:58,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 00:17:58,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2019-11-20 00:17:58,170 INFO L87 Difference]: Start difference. First operand 13290 states and 14043 transitions. Second operand 18 states. [2019-11-20 00:18:10,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:18:10,845 INFO L93 Difference]: Finished difference Result 42011 states and 44222 transitions. [2019-11-20 00:18:10,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-11-20 00:18:10,845 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 747 [2019-11-20 00:18:10,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:18:10,864 INFO L225 Difference]: With dead ends: 42011 [2019-11-20 00:18:10,865 INFO L226 Difference]: Without dead ends: 29087 [2019-11-20 00:18:10,873 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 825 GetRequests, 745 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2112 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1424, Invalid=5056, Unknown=0, NotChecked=0, Total=6480 [2019-11-20 00:18:10,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29087 states. [2019-11-20 00:18:11,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29087 to 12740. [2019-11-20 00:18:11,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12740 states. [2019-11-20 00:18:11,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12740 states to 12740 states and 13431 transitions. [2019-11-20 00:18:11,052 INFO L78 Accepts]: Start accepts. Automaton has 12740 states and 13431 transitions. Word has length 747 [2019-11-20 00:18:11,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:18:11,052 INFO L462 AbstractCegarLoop]: Abstraction has 12740 states and 13431 transitions. [2019-11-20 00:18:11,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 00:18:11,052 INFO L276 IsEmpty]: Start isEmpty. Operand 12740 states and 13431 transitions. [2019-11-20 00:18:11,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 878 [2019-11-20 00:18:11,061 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:18:11,062 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:18:11,265 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:18:11,266 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:18:11,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:18:11,266 INFO L82 PathProgramCache]: Analyzing trace with hash -39729776, now seen corresponding path program 1 times [2019-11-20 00:18:11,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:18:11,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393029422] [2019-11-20 00:18:11,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:18:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:18:12,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2089 backedges. 1301 proven. 204 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2019-11-20 00:18:12,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393029422] [2019-11-20 00:18:12,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128184457] [2019-11-20 00:18:12,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cf3899b3-6a0c-46c2-8181-7a8eff463335/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-11-20 00:18:12,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:18:12,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 1083 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 00:18:12,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:18:12,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:18:12,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:18:12,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:18:14,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2089 backedges. 396 proven. 1551 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-11-20 00:18:14,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:18:14,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 12 [2019-11-20 00:18:14,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585671046] [2019-11-20 00:18:14,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 00:18:14,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:18:14,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 00:18:14,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-20 00:18:14,336 INFO L87 Difference]: Start difference. First operand 12740 states and 13431 transitions. Second operand 12 states. [2019-11-20 00:18:19,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:18:19,957 INFO L93 Difference]: Finished difference Result 29527 states and 31031 transitions. [2019-11-20 00:18:19,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-20 00:18:19,957 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 877 [2019-11-20 00:18:19,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:18:19,969 INFO L225 Difference]: With dead ends: 29527 [2019-11-20 00:18:19,969 INFO L226 Difference]: Without dead ends: 17343 [2019-11-20 00:18:19,974 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 905 GetRequests, 882 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=346, Unknown=0, NotChecked=0, Total=506 [2019-11-20 00:18:19,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17343 states. [2019-11-20 00:18:20,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17343 to 9414. [2019-11-20 00:18:20,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9414 states. [2019-11-20 00:18:20,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9414 states to 9414 states and 9873 transitions. [2019-11-20 00:18:20,089 INFO L78 Accepts]: Start accepts. Automaton has 9414 states and 9873 transitions. Word has length 877 [2019-11-20 00:18:20,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:18:20,090 INFO L462 AbstractCegarLoop]: Abstraction has 9414 states and 9873 transitions. [2019-11-20 00:18:20,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 00:18:20,090 INFO L276 IsEmpty]: Start isEmpty. Operand 9414 states and 9873 transitions. [2019-11-20 00:18:20,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1043 [2019-11-20 00:18:20,099 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:18:20,100 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, 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-11-20 00:18:20,303 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:18:20,303 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:18:20,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:18:20,304 INFO L82 PathProgramCache]: Analyzing trace with hash 462171579, now seen corresponding path program 1 times [2019-11-20 00:18:20,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:18:20,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327521282] [2019-11-20 00:18:20,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:18:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:18:21,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4003 backedges. 2573 proven. 0 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2019-11-20 00:18:21,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327521282] [2019-11-20 00:18:21,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:18:21,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:18:21,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716418447] [2019-11-20 00:18:21,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:18:21,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:18:21,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:18:21,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:18:21,116 INFO L87 Difference]: Start difference. First operand 9414 states and 9873 transitions. Second operand 3 states. [2019-11-20 00:18:21,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:18:21,652 INFO L93 Difference]: Finished difference Result 19011 states and 19935 transitions. [2019-11-20 00:18:21,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:18:21,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1042 [2019-11-20 00:18:21,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:18:21,658 INFO L225 Difference]: With dead ends: 19011 [2019-11-20 00:18:21,658 INFO L226 Difference]: Without dead ends: 10153 [2019-11-20 00:18:21,662 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:18:21,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10153 states. [2019-11-20 00:18:21,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10153 to 9046. [2019-11-20 00:18:21,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9046 states. [2019-11-20 00:18:21,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9046 states to 9046 states and 9478 transitions. [2019-11-20 00:18:21,743 INFO L78 Accepts]: Start accepts. Automaton has 9046 states and 9478 transitions. Word has length 1042 [2019-11-20 00:18:21,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:18:21,744 INFO L462 AbstractCegarLoop]: Abstraction has 9046 states and 9478 transitions. [2019-11-20 00:18:21,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:18:21,744 INFO L276 IsEmpty]: Start isEmpty. Operand 9046 states and 9478 transitions. [2019-11-20 00:18:21,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1058 [2019-11-20 00:18:21,756 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:18:21,757 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, 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:18:21,757 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:18:21,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:18:21,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1858188437, now seen corresponding path program 1 times [2019-11-20 00:18:21,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:18:21,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622243142] [2019-11-20 00:18:21,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:18:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:18:23,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3373 backedges. 2188 proven. 0 refuted. 0 times theorem prover too weak. 1185 trivial. 0 not checked. [2019-11-20 00:18:23,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622243142] [2019-11-20 00:18:23,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:18:23,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 00:18:23,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658456800] [2019-11-20 00:18:23,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 00:18:23,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:18:23,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 00:18:23,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-20 00:18:23,275 INFO L87 Difference]: Start difference. First operand 9046 states and 9478 transitions. Second operand 7 states. [2019-11-20 00:18:24,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:18:24,904 INFO L93 Difference]: Finished difference Result 19193 states and 20119 transitions. [2019-11-20 00:18:24,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 00:18:24,904 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1057 [2019-11-20 00:18:24,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:18:24,912 INFO L225 Difference]: With dead ends: 19193 [2019-11-20 00:18:24,912 INFO L226 Difference]: Without dead ends: 10703 [2019-11-20 00:18:24,917 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-20 00:18:24,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10703 states. [2019-11-20 00:18:25,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10703 to 9598. [2019-11-20 00:18:25,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9598 states. [2019-11-20 00:18:25,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9598 states to 9598 states and 10058 transitions. [2019-11-20 00:18:25,061 INFO L78 Accepts]: Start accepts. Automaton has 9598 states and 10058 transitions. Word has length 1057 [2019-11-20 00:18:25,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:18:25,061 INFO L462 AbstractCegarLoop]: Abstraction has 9598 states and 10058 transitions. [2019-11-20 00:18:25,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 00:18:25,061 INFO L276 IsEmpty]: Start isEmpty. Operand 9598 states and 10058 transitions. [2019-11-20 00:18:25,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1068 [2019-11-20 00:18:25,075 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:18:25,075 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, 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2019-11-20 00:18:25,076 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:18:25,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:18:25,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1236626021, now seen corresponding path program 1 times [2019-11-20 00:18:25,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:18:25,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201409624] [2019-11-20 00:18:25,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:18:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:18:26,185 INFO L134 CoverageAnalysis]: Checked inductivity of 4128 backedges. 2832 proven. 0 refuted. 0 times theorem prover too weak. 1296 trivial. 0 not checked. [2019-11-20 00:18:26,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201409624] [2019-11-20 00:18:26,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:18:26,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 00:18:26,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960095624] [2019-11-20 00:18:26,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 00:18:26,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:18:26,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 00:18:26,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:18:26,187 INFO L87 Difference]: Start difference. First operand 9598 states and 10058 transitions. Second operand 5 states. [2019-11-20 00:18:27,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:18:27,432 INFO L93 Difference]: Finished difference Result 20301 states and 21296 transitions. [2019-11-20 00:18:27,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 00:18:27,432 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1067 [2019-11-20 00:18:27,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:18:27,440 INFO L225 Difference]: With dead ends: 20301 [2019-11-20 00:18:27,440 INFO L226 Difference]: Without dead ends: 11259 [2019-11-20 00:18:27,443 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:18:27,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11259 states. [2019-11-20 00:18:27,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11259 to 10522. [2019-11-20 00:18:27,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10522 states. [2019-11-20 00:18:27,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10522 states to 10522 states and 11025 transitions. [2019-11-20 00:18:27,540 INFO L78 Accepts]: Start accepts. Automaton has 10522 states and 11025 transitions. Word has length 1067 [2019-11-20 00:18:27,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:18:27,541 INFO L462 AbstractCegarLoop]: Abstraction has 10522 states and 11025 transitions. [2019-11-20 00:18:27,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 00:18:27,541 INFO L276 IsEmpty]: Start isEmpty. Operand 10522 states and 11025 transitions. [2019-11-20 00:18:27,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1075 [2019-11-20 00:18:27,550 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:18:27,550 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, 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:18:27,550 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:18:27,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:18:27,551 INFO L82 PathProgramCache]: Analyzing trace with hash -89935406, now seen corresponding path program 1 times [2019-11-20 00:18:27,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:18:27,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144822970] [2019-11-20 00:18:27,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:18:27,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:18:28,904 INFO L134 CoverageAnalysis]: Checked inductivity of 3397 backedges. 2489 proven. 0 refuted. 0 times theorem prover too weak. 908 trivial. 0 not checked. [2019-11-20 00:18:28,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144822970] [2019-11-20 00:18:28,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:18:28,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 00:18:28,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883466370] [2019-11-20 00:18:28,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 00:18:28,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:18:28,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 00:18:28,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:18:28,907 INFO L87 Difference]: Start difference. First operand 10522 states and 11025 transitions. Second operand 5 states. [2019-11-20 00:18:29,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:18:29,928 INFO L93 Difference]: Finished difference Result 16980 states and 17788 transitions. [2019-11-20 00:18:29,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 00:18:29,928 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1074 [2019-11-20 00:18:29,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:18:29,929 INFO L225 Difference]: With dead ends: 16980 [2019-11-20 00:18:29,929 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 00:18:29,932 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:18:29,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 00:18:29,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 00:18:29,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 00:18:29,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 00:18:29,933 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1074 [2019-11-20 00:18:29,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:18:29,934 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 00:18:29,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 00:18:29,934 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 00:18:29,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 00:18:29,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 00:18:33,855 WARN L191 SmtUtils]: Spent 3.91 s on a formula simplification. DAG size of input: 1487 DAG size of output: 1280 [2019-11-20 00:18:37,216 WARN L191 SmtUtils]: Spent 3.36 s on a formula simplification. DAG size of input: 1487 DAG size of output: 1280 [2019-11-20 00:18:51,898 WARN L191 SmtUtils]: Spent 14.67 s on a formula simplification. DAG size of input: 1262 DAG size of output: 222 [2019-11-20 00:19:06,606 WARN L191 SmtUtils]: Spent 14.70 s on a formula simplification. DAG size of input: 1262 DAG size of output: 222 [2019-11-20 00:19:06,608 INFO L444 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-11-20 00:19:06,608 INFO L444 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-11-20 00:19:06,608 INFO L444 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-11-20 00:19:06,608 INFO L447 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-11-20 00:19:06,609 INFO L444 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,609 INFO L444 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,609 INFO L444 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,609 INFO L444 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,609 INFO L444 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,609 INFO L444 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,609 INFO L444 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,609 INFO L444 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-20 00:19:06,609 INFO L444 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-11-20 00:19:06,609 INFO L444 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-20 00:19:06,609 INFO L444 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,609 INFO L444 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,609 INFO L444 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,609 INFO L444 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,609 INFO L444 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,609 INFO L444 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,610 INFO L444 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,610 INFO L444 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,610 INFO L444 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,610 INFO L444 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-11-20 00:19:06,610 INFO L444 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-11-20 00:19:06,610 INFO L444 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-11-20 00:19:06,610 INFO L444 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,610 INFO L440 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse12 (= 12 ~a25~0)) (.cse3 (<= ~a4~0 0)) (.cse4 (= ~a25~0 11)) (.cse34 (<= 130 ~a29~0))) (let ((.cse27 (and .cse4 .cse34)) (.cse17 (<= ~a29~0 277)) (.cse14 (= ~a4~0 1)) (.cse15 (<= ~a23~0 138)) (.cse23 (= ~a25~0 13)) (.cse31 (<= ~a29~0 140)) (.cse16 (and .cse12 .cse3 .cse34))) (let ((.cse13 (and (<= ~a29~0 274) .cse16)) (.cse11 (< 140 ~a29~0)) (.cse25 (<= 0 (+ ~a23~0 599913))) (.cse8 (<= ~a23~0 312)) (.cse5 (and (not .cse23) .cse31)) (.cse30 (= 10 ~a25~0)) (.cse0 (<= 0 (+ ~a29~0 28553))) (.cse1 (<= (+ ~a23~0 55) 0)) (.cse2 (<= 0 (+ ~a23~0 600262))) (.cse18 (= ~a25~0 9)) (.cse28 (and .cse14 .cse15 .cse34)) (.cse26 (<= ~a29~0 245)) (.cse22 (<= ~a23~0 600000)) (.cse9 (and .cse27 .cse17)) (.cse32 (<= 141 ~a29~0)) (.cse24 (< 306 ~a23~0)) (.cse10 (= 1 ~a4~0)) (.cse6 (= 1 ~a3~0)) (.cse29 (<= ~a23~0 306)) (.cse7 (= 15 ~a8~0)) (.cse20 (+ ~a23~0 43))) (or (and .cse0 .cse1 (and .cse2 (and (and (and .cse3 .cse4 .cse5) .cse6) .cse7))) (and (and .cse6 (and (and .cse8 .cse9) (exists ((v_~a29~0_508 Int)) (and (<= 0 v_~a29~0_508) (<= 130 v_~a29~0_508) (<= ~a29~0 (+ (mod v_~a29~0_508 15) 261))))) .cse7 .cse10) .cse11) (and .cse1 (and (<= 0 (+ ~a23~0 577827)) .cse6 (and (not (= 4 ULTIMATE.start_calculate_output_~input)) .cse12 .cse3 (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse5) .cse7)) (and (and (and .cse13 (<= 0 (+ ~a23~0 599908))) .cse6 .cse7) .cse11 .cse1) (and .cse6 (and .cse14 .cse15) .cse7 (<= ~a29~0 220)) (and (or (or (and (exists ((v_~a29~0_502 Int)) (and (<= 0 v_~a29~0_502) (<= (+ (mod v_~a29~0_502 15) 260) ~a29~0) (<= 130 v_~a29~0_502))) .cse16 .cse17) (and .cse18 .cse3 (exists ((v_~a29~0_504 Int)) (let ((.cse19 (mod v_~a29~0_504 299861))) (and (<= (+ .cse19 10250) ~a29~0) (= 0 .cse19) (< 140 v_~a29~0_504)))) (<= .cse20 0))) (and .cse13 (exists ((v_~a29~0_506 Int)) (let ((.cse21 (mod v_~a29~0_506 15))) (and (= 0 .cse21) (<= (+ .cse21 256) ~a29~0) (< 140 v_~a29~0_506)))))) .cse6 .cse7) (and .cse22 (and (and .cse18 .cse6 .cse7) .cse10)) (and .cse22 (and (and (and .cse23 .cse24) .cse6) .cse7 .cse10) (<= ~a29~0 599998)) (and (and .cse25 (and (and .cse16 .cse26) .cse6 .cse7)) .cse11 .cse1) (and .cse22 (and (and .cse27 .cse6 .cse7 .cse10) (< 277 ~a29~0))) (and (and (and (and .cse6 (and .cse18 .cse3 .cse5)) .cse7) .cse25) .cse1) (and .cse23 .cse6 .cse28 .cse7 .cse26) (and .cse8 .cse7 .cse10 (= ~a25~0 12) .cse6 (<= 0 (+ ~a23~0 39))) (and .cse18 (and .cse14 .cse5)) (and .cse23 .cse6 .cse29 (<= ~a29~0 130) .cse7 .cse10) (and .cse22 (and .cse6 .cse30 .cse7 .cse10)) (and .cse28 .cse4) (and .cse14 .cse15 .cse30) (and (and (and .cse3 (and .cse30 .cse31)) .cse6 .cse7) .cse0 .cse1 .cse2) (and .cse18 .cse28) (and .cse22 (and (and (and (and .cse12 .cse26) .cse32) .cse6) .cse7 .cse10 (<= 312 ~a23~0))) (and .cse22 (and (or (and .cse6 (and .cse9 .cse32) .cse7) (and (and .cse6 (and (and .cse12 .cse17) .cse32)) (not (= 1 ULTIMATE.start_calculate_output_~input)) .cse7)) .cse24 .cse10)) (and .cse23 .cse6 .cse29 (and .cse14 (exists ((v_~a29~0_499 Int)) (let ((.cse33 (div (* v_~a29~0_499 12) 10))) (and (<= 0 (* 12 v_~a29~0_499)) (= 0 (mod .cse33 5)) (< 245 v_~a29~0_499) (<= (+ (div .cse33 5) 99853) ~a29~0) (<= 0 (+ .cse33 1)))))) .cse7 (< 0 .cse20)))))) [2019-11-20 00:19:06,611 INFO L444 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,611 INFO L444 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,611 INFO L444 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,611 INFO L444 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,611 INFO L444 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,611 INFO L444 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,611 INFO L444 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,611 INFO L444 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,611 INFO L444 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-11-20 00:19:06,611 INFO L444 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-11-20 00:19:06,611 INFO L444 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-11-20 00:19:06,611 INFO L444 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-11-20 00:19:06,611 INFO L444 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-11-20 00:19:06,611 INFO L444 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-11-20 00:19:06,612 INFO L444 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-11-20 00:19:06,612 INFO L444 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,612 INFO L444 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,612 INFO L444 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,612 INFO L444 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,612 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,612 INFO L444 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,612 INFO L444 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,613 INFO L444 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,613 INFO L444 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,613 INFO L444 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,613 INFO L444 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-11-20 00:19:06,613 INFO L444 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-11-20 00:19:06,613 INFO L444 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-11-20 00:19:06,613 INFO L444 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-11-20 00:19:06,614 INFO L444 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,614 INFO L444 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,614 INFO L444 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,614 INFO L444 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,614 INFO L444 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,614 INFO L444 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-11-20 00:19:06,614 INFO L444 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-11-20 00:19:06,614 INFO L444 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-20 00:19:06,615 INFO L444 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,615 INFO L444 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,615 INFO L444 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,615 INFO L444 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,615 INFO L444 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-11-20 00:19:06,615 INFO L444 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-11-20 00:19:06,615 INFO L444 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,616 INFO L444 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,616 INFO L444 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,616 INFO L444 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,616 INFO L444 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,616 INFO L444 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,616 INFO L444 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-11-20 00:19:06,616 INFO L444 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-11-20 00:19:06,616 INFO L444 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,617 INFO L444 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,617 INFO L444 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-11-20 00:19:06,617 INFO L444 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-11-20 00:19:06,617 INFO L444 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-11-20 00:19:06,617 INFO L444 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,617 INFO L444 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,617 INFO L444 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,618 INFO L444 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,618 INFO L444 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,618 INFO L444 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,618 INFO L444 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,618 INFO L444 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-11-20 00:19:06,618 INFO L444 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-11-20 00:19:06,618 INFO L444 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-11-20 00:19:06,619 INFO L444 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-11-20 00:19:06,619 INFO L444 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-11-20 00:19:06,619 INFO L444 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-11-20 00:19:06,619 INFO L444 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-11-20 00:19:06,619 INFO L444 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,619 INFO L444 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,619 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 00:19:06,619 INFO L444 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-11-20 00:19:06,620 INFO L444 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-11-20 00:19:06,620 INFO L444 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,620 INFO L444 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,620 INFO L444 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,620 INFO L444 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,620 INFO L444 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,620 INFO L444 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-11-20 00:19:06,621 INFO L444 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-11-20 00:19:06,621 INFO L444 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-11-20 00:19:06,621 INFO L444 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,621 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,621 INFO L444 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,621 INFO L444 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,621 INFO L444 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,621 INFO L444 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,622 INFO L444 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-11-20 00:19:06,622 INFO L444 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-11-20 00:19:06,622 INFO L444 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-11-20 00:19:06,622 INFO L444 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,622 INFO L444 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,622 INFO L444 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,622 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,623 INFO L444 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,623 INFO L444 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,623 INFO L444 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,623 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 00:19:06,623 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 156) no Hoare annotation was computed. [2019-11-20 00:19:06,623 INFO L444 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,623 INFO L444 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-11-20 00:19:06,624 INFO L444 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-11-20 00:19:06,624 INFO L444 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-11-20 00:19:06,624 INFO L444 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,624 INFO L444 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,624 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,624 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,624 INFO L444 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,624 INFO L444 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,625 INFO L444 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,625 INFO L444 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,625 INFO L444 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,625 INFO L444 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,625 INFO L444 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,625 INFO L444 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-11-20 00:19:06,625 INFO L444 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-11-20 00:19:06,625 INFO L444 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-20 00:19:06,625 INFO L444 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-11-20 00:19:06,625 INFO L444 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-11-20 00:19:06,625 INFO L444 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,625 INFO L444 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,625 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,625 INFO L444 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,625 INFO L444 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,626 INFO L444 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,626 INFO L444 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,626 INFO L444 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-11-20 00:19:06,626 INFO L444 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-11-20 00:19:06,626 INFO L444 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-11-20 00:19:06,626 INFO L444 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,626 INFO L444 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,626 INFO L444 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,626 INFO L444 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-11-20 00:19:06,626 INFO L444 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-11-20 00:19:06,626 INFO L444 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,626 INFO L444 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,626 INFO L444 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,626 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,626 INFO L444 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,626 INFO L444 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-11-20 00:19:06,626 INFO L444 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-11-20 00:19:06,627 INFO L444 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,627 INFO L444 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,627 INFO L444 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-11-20 00:19:06,627 INFO L444 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-11-20 00:19:06,627 INFO L444 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,627 INFO L444 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,627 INFO L444 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,627 INFO L444 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,627 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,627 INFO L444 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,627 INFO L444 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-11-20 00:19:06,627 INFO L444 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-11-20 00:19:06,627 INFO L444 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-11-20 00:19:06,627 INFO L444 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-11-20 00:19:06,627 INFO L444 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,627 INFO L444 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,627 INFO L444 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,628 INFO L444 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,628 INFO L444 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,628 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,628 INFO L444 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,628 INFO L444 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,628 INFO L444 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-11-20 00:19:06,628 INFO L444 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-11-20 00:19:06,628 INFO L444 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-11-20 00:19:06,628 INFO L444 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-11-20 00:19:06,628 INFO L444 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-11-20 00:19:06,628 INFO L444 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-11-20 00:19:06,628 INFO L444 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,628 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,628 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,628 INFO L444 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,628 INFO L444 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,629 INFO L444 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,629 INFO L444 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,629 INFO L444 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-20 00:19:06,629 INFO L444 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-11-20 00:19:06,629 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 00:19:06,629 INFO L444 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,629 INFO L444 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,629 INFO L444 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,629 INFO L444 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,629 INFO L444 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,629 INFO L444 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,629 INFO L444 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-11-20 00:19:06,629 INFO L444 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-11-20 00:19:06,629 INFO L444 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,629 INFO L444 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,629 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,629 INFO L444 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,630 INFO L444 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,630 INFO L444 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,630 INFO L444 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,630 INFO L444 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-11-20 00:19:06,630 INFO L444 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,630 INFO L444 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,630 INFO L444 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,630 INFO L444 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-11-20 00:19:06,630 INFO L444 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-11-20 00:19:06,630 INFO L444 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-11-20 00:19:06,630 INFO L444 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,630 INFO L444 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-11-20 00:19:06,630 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,630 INFO L444 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-11-20 00:19:06,630 INFO L444 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,630 INFO L444 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,630 INFO L444 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,631 INFO L444 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,631 INFO L444 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,631 INFO L444 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,631 INFO L444 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-11-20 00:19:06,631 INFO L444 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-11-20 00:19:06,631 INFO L444 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-11-20 00:19:06,631 INFO L444 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,631 INFO L444 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,631 INFO L444 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,632 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 00:19:06,632 INFO L444 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,632 INFO L444 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,632 INFO L444 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,632 INFO L444 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,632 INFO L444 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,632 INFO L444 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,632 INFO L444 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,633 INFO L444 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-11-20 00:19:06,633 INFO L444 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-11-20 00:19:06,633 INFO L444 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-11-20 00:19:06,633 INFO L444 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,633 INFO L444 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-11-20 00:19:06,633 INFO L444 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-11-20 00:19:06,633 INFO L444 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,634 INFO L444 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,634 INFO L444 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,634 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,634 INFO L444 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,634 INFO L444 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,634 INFO L444 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-11-20 00:19:06,634 INFO L444 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-20 00:19:06,634 INFO L444 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-11-20 00:19:06,635 INFO L444 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,635 INFO L444 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,635 INFO L444 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,635 INFO L440 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse12 (= 12 ~a25~0)) (.cse3 (<= ~a4~0 0)) (.cse4 (= ~a25~0 11)) (.cse34 (<= 130 ~a29~0))) (let ((.cse27 (and .cse4 .cse34)) (.cse17 (<= ~a29~0 277)) (.cse14 (= ~a4~0 1)) (.cse15 (<= ~a23~0 138)) (.cse23 (= ~a25~0 13)) (.cse31 (<= ~a29~0 140)) (.cse16 (and .cse12 .cse3 .cse34))) (let ((.cse13 (and (<= ~a29~0 274) .cse16)) (.cse11 (< 140 ~a29~0)) (.cse25 (<= 0 (+ ~a23~0 599913))) (.cse8 (<= ~a23~0 312)) (.cse5 (and (not .cse23) .cse31)) (.cse30 (= 10 ~a25~0)) (.cse0 (<= 0 (+ ~a29~0 28553))) (.cse1 (<= (+ ~a23~0 55) 0)) (.cse2 (<= 0 (+ ~a23~0 600262))) (.cse18 (= ~a25~0 9)) (.cse28 (and .cse14 .cse15 .cse34)) (.cse26 (<= ~a29~0 245)) (.cse22 (<= ~a23~0 600000)) (.cse9 (and .cse27 .cse17)) (.cse32 (<= 141 ~a29~0)) (.cse24 (< 306 ~a23~0)) (.cse10 (= 1 ~a4~0)) (.cse6 (= 1 ~a3~0)) (.cse29 (<= ~a23~0 306)) (.cse7 (= 15 ~a8~0)) (.cse20 (+ ~a23~0 43))) (or (and .cse0 .cse1 (and .cse2 (and (and (and .cse3 .cse4 .cse5) .cse6) .cse7))) (and (and .cse6 (and (and .cse8 .cse9) (exists ((v_~a29~0_508 Int)) (and (<= 0 v_~a29~0_508) (<= 130 v_~a29~0_508) (<= ~a29~0 (+ (mod v_~a29~0_508 15) 261))))) .cse7 .cse10) .cse11) (and .cse1 (and (<= 0 (+ ~a23~0 577827)) .cse6 (and (not (= 4 ULTIMATE.start_calculate_output_~input)) .cse12 .cse3 (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse5) .cse7)) (and (and (and .cse13 (<= 0 (+ ~a23~0 599908))) .cse6 .cse7) .cse11 .cse1) (and .cse6 (and .cse14 .cse15) .cse7 (<= ~a29~0 220)) (and (or (or (and (exists ((v_~a29~0_502 Int)) (and (<= 0 v_~a29~0_502) (<= (+ (mod v_~a29~0_502 15) 260) ~a29~0) (<= 130 v_~a29~0_502))) .cse16 .cse17) (and .cse18 .cse3 (exists ((v_~a29~0_504 Int)) (let ((.cse19 (mod v_~a29~0_504 299861))) (and (<= (+ .cse19 10250) ~a29~0) (= 0 .cse19) (< 140 v_~a29~0_504)))) (<= .cse20 0))) (and .cse13 (exists ((v_~a29~0_506 Int)) (let ((.cse21 (mod v_~a29~0_506 15))) (and (= 0 .cse21) (<= (+ .cse21 256) ~a29~0) (< 140 v_~a29~0_506)))))) .cse6 .cse7) (and .cse22 (and (and .cse18 .cse6 .cse7) .cse10)) (and .cse22 (and (and (and .cse23 .cse24) .cse6) .cse7 .cse10) (<= ~a29~0 599998)) (and (and .cse25 (and (and .cse16 .cse26) .cse6 .cse7)) .cse11 .cse1) (and .cse22 (and (and .cse27 .cse6 .cse7 .cse10) (< 277 ~a29~0))) (and (and (and (and .cse6 (and .cse18 .cse3 .cse5)) .cse7) .cse25) .cse1) (and .cse23 .cse6 .cse28 .cse7 .cse26) (and .cse8 .cse7 .cse10 (= ~a25~0 12) .cse6 (<= 0 (+ ~a23~0 39))) (and .cse18 (and .cse14 .cse5)) (and .cse23 .cse6 .cse29 (<= ~a29~0 130) .cse7 .cse10) (and .cse22 (and .cse6 .cse30 .cse7 .cse10)) (and .cse28 .cse4) (and .cse14 .cse15 .cse30) (and (and (and .cse3 (and .cse30 .cse31)) .cse6 .cse7) .cse0 .cse1 .cse2) (and .cse18 .cse28) (and .cse22 (and (and (and (and .cse12 .cse26) .cse32) .cse6) .cse7 .cse10 (<= 312 ~a23~0))) (and .cse22 (and (or (and .cse6 (and .cse9 .cse32) .cse7) (and (and .cse6 (and (and .cse12 .cse17) .cse32)) (not (= 1 ULTIMATE.start_calculate_output_~input)) .cse7)) .cse24 .cse10)) (and .cse23 .cse6 .cse29 (and .cse14 (exists ((v_~a29~0_499 Int)) (let ((.cse33 (div (* v_~a29~0_499 12) 10))) (and (<= 0 (* 12 v_~a29~0_499)) (= 0 (mod .cse33 5)) (< 245 v_~a29~0_499) (<= (+ (div .cse33 5) 99853) ~a29~0) (<= 0 (+ .cse33 1)))))) .cse7 (< 0 .cse20)))))) [2019-11-20 00:19:06,635 INFO L444 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,636 INFO L444 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-11-20 00:19:06,636 INFO L444 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-11-20 00:19:06,636 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,636 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,636 INFO L444 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-11-20 00:19:06,636 INFO L444 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,636 INFO L444 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,636 INFO L444 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 00:19:06,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-20 00:19:06,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-20 00:19:06,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-20 00:19:06,650 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 00:19:06,650 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 00:19:06,650 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 00:19:06,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-20 00:19:06,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-20 00:19:06,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-20 00:19:06,652 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-11-20 00:19:06,652 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-11-20 00:19:06,652 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-11-20 00:19:06,654 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:19:06,654 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:19:06,654 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:19:06,655 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:19:06,655 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:19:06,668 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-20 00:19:06,668 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-20 00:19:06,668 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-20 00:19:06,669 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 00:19:06,669 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 00:19:06,670 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 00:19:06,670 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-20 00:19:06,670 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-20 00:19:06,671 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-20 00:19:06,671 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-11-20 00:19:06,671 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-11-20 00:19:06,672 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-11-20 00:19:06,673 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:19:06,673 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:19:06,673 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:19:06,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:19:06,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:19:06,679 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-20 00:19:06,679 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-20 00:19:06,679 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-20 00:19:06,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 00:19:06,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 00:19:06,681 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 00:19:06,681 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-20 00:19:06,681 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-20 00:19:06,682 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-20 00:19:06,682 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-11-20 00:19:06,682 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-11-20 00:19:06,683 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-11-20 00:19:06,684 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:19:06,684 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:19:06,684 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:19:06,684 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:19:06,685 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:19:06,688 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-20 00:19:06,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-20 00:19:06,689 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-20 00:19:06,690 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 00:19:06,690 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 00:19:06,690 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 00:19:06,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-20 00:19:06,691 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-20 00:19:06,692 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-20 00:19:06,692 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-11-20 00:19:06,692 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-11-20 00:19:06,693 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-11-20 00:19:06,694 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:19:06,694 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:19:06,694 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:19:06,694 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:19:06,694 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:19:06,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:19:06 BoogieIcfgContainer [2019-11-20 00:19:06,700 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 00:19:06,700 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 00:19:06,700 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 00:19:06,700 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 00:19:06,701 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:15:48" (3/4) ... [2019-11-20 00:19:06,704 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 00:19:06,730 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 00:19:06,732 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 00:19:06,772 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((0 <= a29 + 28553 && a23 + 55 <= 0) && 0 <= a23 + 600262 && (((a4 <= 0 && a25 == 11) && !(a25 == 13) && a29 <= 140) && 1 == a3) && 15 == a8) || ((((1 == a3 && (a23 <= 312 && (a25 == 11 && 130 <= a29) && a29 <= 277) && (\exists v_~a29~0_508 : int :: (0 <= v_~a29~0_508 && 130 <= v_~a29~0_508) && a29 <= v_~a29~0_508 % 15 + 261)) && 15 == a8) && 1 == a4) && 140 < a29)) || (a23 + 55 <= 0 && ((0 <= a23 + 577827 && 1 == a3) && (((!(4 == input) && 12 == a25) && a4 <= 0) && !(3 == input)) && !(a25 == 13) && a29 <= 140) && 15 == a8)) || ((((((a29 <= 274 && (12 == a25 && a4 <= 0) && 130 <= a29) && 0 <= a23 + 599908) && 1 == a3) && 15 == a8) && 140 < a29) && a23 + 55 <= 0)) || (((1 == a3 && a4 == 1 && a23 <= 138) && 15 == a8) && a29 <= 220)) || (((((((\exists v_~a29~0_502 : int :: (0 <= v_~a29~0_502 && v_~a29~0_502 % 15 + 260 <= a29) && 130 <= v_~a29~0_502) && (12 == a25 && a4 <= 0) && 130 <= a29) && a29 <= 277) || (((a25 == 9 && a4 <= 0) && (\exists v_~a29~0_504 : int :: (v_~a29~0_504 % 299861 + 10250 <= a29 && 0 == v_~a29~0_504 % 299861) && 140 < v_~a29~0_504)) && a23 + 43 <= 0)) || ((a29 <= 274 && (12 == a25 && a4 <= 0) && 130 <= a29) && (\exists v_~a29~0_506 : int :: (0 == v_~a29~0_506 % 15 && v_~a29~0_506 % 15 + 256 <= a29) && 140 < v_~a29~0_506))) && 1 == a3) && 15 == a8)) || (a23 <= 600000 && ((a25 == 9 && 1 == a3) && 15 == a8) && 1 == a4)) || ((a23 <= 600000 && (((a25 == 13 && 306 < a23) && 1 == a3) && 15 == a8) && 1 == a4) && a29 <= 599998)) || (((0 <= a23 + 599913 && ((((12 == a25 && a4 <= 0) && 130 <= a29) && a29 <= 245) && 1 == a3) && 15 == a8) && 140 < a29) && a23 + 55 <= 0)) || (a23 <= 600000 && ((((a25 == 11 && 130 <= a29) && 1 == a3) && 15 == a8) && 1 == a4) && 277 < a29)) || ((((1 == a3 && (a25 == 9 && a4 <= 0) && !(a25 == 13) && a29 <= 140) && 15 == a8) && 0 <= a23 + 599913) && a23 + 55 <= 0)) || ((((a25 == 13 && 1 == a3) && (a4 == 1 && a23 <= 138) && 130 <= a29) && 15 == a8) && a29 <= 245)) || (((((a23 <= 312 && 15 == a8) && 1 == a4) && a25 == 12) && 1 == a3) && 0 <= a23 + 39)) || (a25 == 9 && a4 == 1 && !(a25 == 13) && a29 <= 140)) || (((((a25 == 13 && 1 == a3) && a23 <= 306) && a29 <= 130) && 15 == a8) && 1 == a4)) || (a23 <= 600000 && ((1 == a3 && 10 == a25) && 15 == a8) && 1 == a4)) || (((a4 == 1 && a23 <= 138) && 130 <= a29) && a25 == 11)) || ((a4 == 1 && a23 <= 138) && 10 == a25)) || ((((((a4 <= 0 && 10 == a25 && a29 <= 140) && 1 == a3) && 15 == a8) && 0 <= a29 + 28553) && a23 + 55 <= 0) && 0 <= a23 + 600262)) || (a25 == 9 && (a4 == 1 && a23 <= 138) && 130 <= a29)) || (a23 <= 600000 && (((((12 == a25 && a29 <= 245) && 141 <= a29) && 1 == a3) && 15 == a8) && 1 == a4) && 312 <= a23)) || (a23 <= 600000 && ((((1 == a3 && ((a25 == 11 && 130 <= a29) && a29 <= 277) && 141 <= a29) && 15 == a8) || (((1 == a3 && (12 == a25 && a29 <= 277) && 141 <= a29) && !(1 == input)) && 15 == a8)) && 306 < a23) && 1 == a4)) || (((((a25 == 13 && 1 == a3) && a23 <= 306) && a4 == 1 && (\exists v_~a29~0_499 : int :: (((0 <= 12 * v_~a29~0_499 && 0 == v_~a29~0_499 * 12 / 10 % 5) && 245 < v_~a29~0_499) && v_~a29~0_499 * 12 / 10 / 5 + 99853 <= a29) && 0 <= v_~a29~0_499 * 12 / 10 + 1)) && 15 == a8) && 0 < a23 + 43) [2019-11-20 00:19:06,777 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((0 <= a29 + 28553 && a23 + 55 <= 0) && 0 <= a23 + 600262 && (((a4 <= 0 && a25 == 11) && !(a25 == 13) && a29 <= 140) && 1 == a3) && 15 == a8) || ((((1 == a3 && (a23 <= 312 && (a25 == 11 && 130 <= a29) && a29 <= 277) && (\exists v_~a29~0_508 : int :: (0 <= v_~a29~0_508 && 130 <= v_~a29~0_508) && a29 <= v_~a29~0_508 % 15 + 261)) && 15 == a8) && 1 == a4) && 140 < a29)) || (a23 + 55 <= 0 && ((0 <= a23 + 577827 && 1 == a3) && (((!(4 == input) && 12 == a25) && a4 <= 0) && !(3 == input)) && !(a25 == 13) && a29 <= 140) && 15 == a8)) || ((((((a29 <= 274 && (12 == a25 && a4 <= 0) && 130 <= a29) && 0 <= a23 + 599908) && 1 == a3) && 15 == a8) && 140 < a29) && a23 + 55 <= 0)) || (((1 == a3 && a4 == 1 && a23 <= 138) && 15 == a8) && a29 <= 220)) || (((((((\exists v_~a29~0_502 : int :: (0 <= v_~a29~0_502 && v_~a29~0_502 % 15 + 260 <= a29) && 130 <= v_~a29~0_502) && (12 == a25 && a4 <= 0) && 130 <= a29) && a29 <= 277) || (((a25 == 9 && a4 <= 0) && (\exists v_~a29~0_504 : int :: (v_~a29~0_504 % 299861 + 10250 <= a29 && 0 == v_~a29~0_504 % 299861) && 140 < v_~a29~0_504)) && a23 + 43 <= 0)) || ((a29 <= 274 && (12 == a25 && a4 <= 0) && 130 <= a29) && (\exists v_~a29~0_506 : int :: (0 == v_~a29~0_506 % 15 && v_~a29~0_506 % 15 + 256 <= a29) && 140 < v_~a29~0_506))) && 1 == a3) && 15 == a8)) || (a23 <= 600000 && ((a25 == 9 && 1 == a3) && 15 == a8) && 1 == a4)) || ((a23 <= 600000 && (((a25 == 13 && 306 < a23) && 1 == a3) && 15 == a8) && 1 == a4) && a29 <= 599998)) || (((0 <= a23 + 599913 && ((((12 == a25 && a4 <= 0) && 130 <= a29) && a29 <= 245) && 1 == a3) && 15 == a8) && 140 < a29) && a23 + 55 <= 0)) || (a23 <= 600000 && ((((a25 == 11 && 130 <= a29) && 1 == a3) && 15 == a8) && 1 == a4) && 277 < a29)) || ((((1 == a3 && (a25 == 9 && a4 <= 0) && !(a25 == 13) && a29 <= 140) && 15 == a8) && 0 <= a23 + 599913) && a23 + 55 <= 0)) || ((((a25 == 13 && 1 == a3) && (a4 == 1 && a23 <= 138) && 130 <= a29) && 15 == a8) && a29 <= 245)) || (((((a23 <= 312 && 15 == a8) && 1 == a4) && a25 == 12) && 1 == a3) && 0 <= a23 + 39)) || (a25 == 9 && a4 == 1 && !(a25 == 13) && a29 <= 140)) || (((((a25 == 13 && 1 == a3) && a23 <= 306) && a29 <= 130) && 15 == a8) && 1 == a4)) || (a23 <= 600000 && ((1 == a3 && 10 == a25) && 15 == a8) && 1 == a4)) || (((a4 == 1 && a23 <= 138) && 130 <= a29) && a25 == 11)) || ((a4 == 1 && a23 <= 138) && 10 == a25)) || ((((((a4 <= 0 && 10 == a25 && a29 <= 140) && 1 == a3) && 15 == a8) && 0 <= a29 + 28553) && a23 + 55 <= 0) && 0 <= a23 + 600262)) || (a25 == 9 && (a4 == 1 && a23 <= 138) && 130 <= a29)) || (a23 <= 600000 && (((((12 == a25 && a29 <= 245) && 141 <= a29) && 1 == a3) && 15 == a8) && 1 == a4) && 312 <= a23)) || (a23 <= 600000 && ((((1 == a3 && ((a25 == 11 && 130 <= a29) && a29 <= 277) && 141 <= a29) && 15 == a8) || (((1 == a3 && (12 == a25 && a29 <= 277) && 141 <= a29) && !(1 == input)) && 15 == a8)) && 306 < a23) && 1 == a4)) || (((((a25 == 13 && 1 == a3) && a23 <= 306) && a4 == 1 && (\exists v_~a29~0_499 : int :: (((0 <= 12 * v_~a29~0_499 && 0 == v_~a29~0_499 * 12 / 10 % 5) && 245 < v_~a29~0_499) && v_~a29~0_499 * 12 / 10 / 5 + 99853 <= a29) && 0 <= v_~a29~0_499 * 12 / 10 + 1)) && 15 == a8) && 0 < a23 + 43) [2019-11-20 00:19:06,954 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_cf3899b3-6a0c-46c2-8181-7a8eff463335/bin/uautomizer/witness.graphml [2019-11-20 00:19:06,954 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 00:19:06,955 INFO L168 Benchmark]: Toolchain (without parser) took 201779.83 ms. Allocated memory was 1.0 GB in the beginning and 4.2 GB in the end (delta: 3.2 GB). Free memory was 944.7 MB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-11-20 00:19:06,956 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:19:06,956 INFO L168 Benchmark]: CACSL2BoogieTranslator took 929.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -133.5 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-11-20 00:19:06,956 INFO L168 Benchmark]: Boogie Procedure Inliner took 178.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-11-20 00:19:06,957 INFO L168 Benchmark]: Boogie Preprocessor took 145.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-20 00:19:06,957 INFO L168 Benchmark]: RCFGBuilder took 2139.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 872.1 MB in the end (delta: 173.9 MB). Peak memory consumption was 173.9 MB. Max. memory is 11.5 GB. [2019-11-20 00:19:06,957 INFO L168 Benchmark]: TraceAbstraction took 198129.09 ms. Allocated memory was 1.2 GB in the beginning and 4.2 GB in the end (delta: 3.1 GB). Free memory was 872.1 MB in the beginning and 2.5 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2019-11-20 00:19:06,958 INFO L168 Benchmark]: Witness Printer took 254.22 ms. Allocated memory is still 4.2 GB. Free memory was 2.5 GB in the beginning and 2.5 GB in the end (delta: 89.0 MB). Peak memory consumption was 89.0 MB. Max. memory is 11.5 GB. [2019-11-20 00:19:06,960 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 929.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -133.5 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 178.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 145.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2139.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 872.1 MB in the end (delta: 173.9 MB). Peak memory consumption was 173.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 198129.09 ms. Allocated memory was 1.2 GB in the beginning and 4.2 GB in the end (delta: 3.1 GB). Free memory was 872.1 MB in the beginning and 2.5 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. * Witness Printer took 254.22 ms. Allocated memory is still 4.2 GB. Free memory was 2.5 GB in the beginning and 2.5 GB in the end (delta: 89.0 MB). Peak memory consumption was 89.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 156]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant [2019-11-20 00:19:06,973 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-20 00:19:06,974 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-20 00:19:06,974 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-20 00:19:06,975 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 00:19:06,975 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 00:19:06,975 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 00:19:06,976 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-20 00:19:06,976 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-20 00:19:06,976 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-20 00:19:06,977 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-11-20 00:19:06,977 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-11-20 00:19:06,977 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-11-20 00:19:06,978 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:19:06,979 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:19:06,979 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:19:06,979 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:19:06,980 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:19:06,983 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-20 00:19:06,983 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-20 00:19:06,983 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-20 00:19:06,984 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 00:19:06,984 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 00:19:06,984 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 00:19:06,985 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-20 00:19:06,985 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-20 00:19:06,985 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-20 00:19:06,986 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-11-20 00:19:06,986 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-11-20 00:19:06,986 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-11-20 00:19:06,987 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:19:06,987 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:19:06,987 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:19:06,988 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:19:06,988 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((0 <= a29 + 28553 && a23 + 55 <= 0) && 0 <= a23 + 600262 && (((a4 <= 0 && a25 == 11) && !(a25 == 13) && a29 <= 140) && 1 == a3) && 15 == a8) || ((((1 == a3 && (a23 <= 312 && (a25 == 11 && 130 <= a29) && a29 <= 277) && (\exists v_~a29~0_508 : int :: (0 <= v_~a29~0_508 && 130 <= v_~a29~0_508) && a29 <= v_~a29~0_508 % 15 + 261)) && 15 == a8) && 1 == a4) && 140 < a29)) || (a23 + 55 <= 0 && ((0 <= a23 + 577827 && 1 == a3) && (((!(4 == input) && 12 == a25) && a4 <= 0) && !(3 == input)) && !(a25 == 13) && a29 <= 140) && 15 == a8)) || ((((((a29 <= 274 && (12 == a25 && a4 <= 0) && 130 <= a29) && 0 <= a23 + 599908) && 1 == a3) && 15 == a8) && 140 < a29) && a23 + 55 <= 0)) || (((1 == a3 && a4 == 1 && a23 <= 138) && 15 == a8) && a29 <= 220)) || (((((((\exists v_~a29~0_502 : int :: (0 <= v_~a29~0_502 && v_~a29~0_502 % 15 + 260 <= a29) && 130 <= v_~a29~0_502) && (12 == a25 && a4 <= 0) && 130 <= a29) && a29 <= 277) || (((a25 == 9 && a4 <= 0) && (\exists v_~a29~0_504 : int :: (v_~a29~0_504 % 299861 + 10250 <= a29 && 0 == v_~a29~0_504 % 299861) && 140 < v_~a29~0_504)) && a23 + 43 <= 0)) || ((a29 <= 274 && (12 == a25 && a4 <= 0) && 130 <= a29) && (\exists v_~a29~0_506 : int :: (0 == v_~a29~0_506 % 15 && v_~a29~0_506 % 15 + 256 <= a29) && 140 < v_~a29~0_506))) && 1 == a3) && 15 == a8)) || (a23 <= 600000 && ((a25 == 9 && 1 == a3) && 15 == a8) && 1 == a4)) || ((a23 <= 600000 && (((a25 == 13 && 306 < a23) && 1 == a3) && 15 == a8) && 1 == a4) && a29 <= 599998)) || (((0 <= a23 + 599913 && ((((12 == a25 && a4 <= 0) && 130 <= a29) && a29 <= 245) && 1 == a3) && 15 == a8) && 140 < a29) && a23 + 55 <= 0)) || (a23 <= 600000 && ((((a25 == 11 && 130 <= a29) && 1 == a3) && 15 == a8) && 1 == a4) && 277 < a29)) || ((((1 == a3 && (a25 == 9 && a4 <= 0) && !(a25 == 13) && a29 <= 140) && 15 == a8) && 0 <= a23 + 599913) && a23 + 55 <= 0)) || ((((a25 == 13 && 1 == a3) && (a4 == 1 && a23 <= 138) && 130 <= a29) && 15 == a8) && a29 <= 245)) || (((((a23 <= 312 && 15 == a8) && 1 == a4) && a25 == 12) && 1 == a3) && 0 <= a23 + 39)) || (a25 == 9 && a4 == 1 && !(a25 == 13) && a29 <= 140)) || (((((a25 == 13 && 1 == a3) && a23 <= 306) && a29 <= 130) && 15 == a8) && 1 == a4)) || (a23 <= 600000 && ((1 == a3 && 10 == a25) && 15 == a8) && 1 == a4)) || (((a4 == 1 && a23 <= 138) && 130 <= a29) && a25 == 11)) || ((a4 == 1 && a23 <= 138) && 10 == a25)) || ((((((a4 <= 0 && 10 == a25 && a29 <= 140) && 1 == a3) && 15 == a8) && 0 <= a29 + 28553) && a23 + 55 <= 0) && 0 <= a23 + 600262)) || (a25 == 9 && (a4 == 1 && a23 <= 138) && 130 <= a29)) || (a23 <= 600000 && (((((12 == a25 && a29 <= 245) && 141 <= a29) && 1 == a3) && 15 == a8) && 1 == a4) && 312 <= a23)) || (a23 <= 600000 && ((((1 == a3 && ((a25 == 11 && 130 <= a29) && a29 <= 277) && 141 <= a29) && 15 == a8) || (((1 == a3 && (12 == a25 && a29 <= 277) && 141 <= a29) && !(1 == input)) && 15 == a8)) && 306 < a23) && 1 == a4)) || (((((a25 == 13 && 1 == a3) && a23 <= 306) && a4 == 1 && (\exists v_~a29~0_499 : int :: (((0 <= 12 * v_~a29~0_499 && 0 == v_~a29~0_499 * 12 / 10 % 5) && 245 < v_~a29~0_499) && v_~a29~0_499 * 12 / 10 / 5 + 99853 <= a29) && 0 <= v_~a29~0_499 * 12 / 10 + 1)) && 15 == a8) && 0 < a23 + 43) - InvariantResult [Line: 22]: Loop Invariant [2019-11-20 00:19:06,991 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-20 00:19:06,991 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-20 00:19:06,992 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-20 00:19:06,992 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 00:19:06,992 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 00:19:06,993 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 00:19:06,993 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-20 00:19:06,993 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-20 00:19:06,994 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-20 00:19:06,994 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-11-20 00:19:06,994 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-11-20 00:19:06,995 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-11-20 00:19:06,995 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:19:06,995 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:19:06,996 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:19:06,996 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:19:06,996 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:19:06,999 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-20 00:19:07,000 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-20 00:19:07,001 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_508,QUANTIFIED] [2019-11-20 00:19:07,001 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 00:19:07,002 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 00:19:07,002 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_502,QUANTIFIED] [2019-11-20 00:19:07,002 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-20 00:19:07,003 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-20 00:19:07,003 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_504,QUANTIFIED] [2019-11-20 00:19:07,003 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-11-20 00:19:07,004 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-11-20 00:19:07,004 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_506,QUANTIFIED] [2019-11-20 00:19:07,005 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:19:07,005 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:19:07,005 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:19:07,005 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] [2019-11-20 00:19:07,005 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_499,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((0 <= a29 + 28553 && a23 + 55 <= 0) && 0 <= a23 + 600262 && (((a4 <= 0 && a25 == 11) && !(a25 == 13) && a29 <= 140) && 1 == a3) && 15 == a8) || ((((1 == a3 && (a23 <= 312 && (a25 == 11 && 130 <= a29) && a29 <= 277) && (\exists v_~a29~0_508 : int :: (0 <= v_~a29~0_508 && 130 <= v_~a29~0_508) && a29 <= v_~a29~0_508 % 15 + 261)) && 15 == a8) && 1 == a4) && 140 < a29)) || (a23 + 55 <= 0 && ((0 <= a23 + 577827 && 1 == a3) && (((!(4 == input) && 12 == a25) && a4 <= 0) && !(3 == input)) && !(a25 == 13) && a29 <= 140) && 15 == a8)) || ((((((a29 <= 274 && (12 == a25 && a4 <= 0) && 130 <= a29) && 0 <= a23 + 599908) && 1 == a3) && 15 == a8) && 140 < a29) && a23 + 55 <= 0)) || (((1 == a3 && a4 == 1 && a23 <= 138) && 15 == a8) && a29 <= 220)) || (((((((\exists v_~a29~0_502 : int :: (0 <= v_~a29~0_502 && v_~a29~0_502 % 15 + 260 <= a29) && 130 <= v_~a29~0_502) && (12 == a25 && a4 <= 0) && 130 <= a29) && a29 <= 277) || (((a25 == 9 && a4 <= 0) && (\exists v_~a29~0_504 : int :: (v_~a29~0_504 % 299861 + 10250 <= a29 && 0 == v_~a29~0_504 % 299861) && 140 < v_~a29~0_504)) && a23 + 43 <= 0)) || ((a29 <= 274 && (12 == a25 && a4 <= 0) && 130 <= a29) && (\exists v_~a29~0_506 : int :: (0 == v_~a29~0_506 % 15 && v_~a29~0_506 % 15 + 256 <= a29) && 140 < v_~a29~0_506))) && 1 == a3) && 15 == a8)) || (a23 <= 600000 && ((a25 == 9 && 1 == a3) && 15 == a8) && 1 == a4)) || ((a23 <= 600000 && (((a25 == 13 && 306 < a23) && 1 == a3) && 15 == a8) && 1 == a4) && a29 <= 599998)) || (((0 <= a23 + 599913 && ((((12 == a25 && a4 <= 0) && 130 <= a29) && a29 <= 245) && 1 == a3) && 15 == a8) && 140 < a29) && a23 + 55 <= 0)) || (a23 <= 600000 && ((((a25 == 11 && 130 <= a29) && 1 == a3) && 15 == a8) && 1 == a4) && 277 < a29)) || ((((1 == a3 && (a25 == 9 && a4 <= 0) && !(a25 == 13) && a29 <= 140) && 15 == a8) && 0 <= a23 + 599913) && a23 + 55 <= 0)) || ((((a25 == 13 && 1 == a3) && (a4 == 1 && a23 <= 138) && 130 <= a29) && 15 == a8) && a29 <= 245)) || (((((a23 <= 312 && 15 == a8) && 1 == a4) && a25 == 12) && 1 == a3) && 0 <= a23 + 39)) || (a25 == 9 && a4 == 1 && !(a25 == 13) && a29 <= 140)) || (((((a25 == 13 && 1 == a3) && a23 <= 306) && a29 <= 130) && 15 == a8) && 1 == a4)) || (a23 <= 600000 && ((1 == a3 && 10 == a25) && 15 == a8) && 1 == a4)) || (((a4 == 1 && a23 <= 138) && 130 <= a29) && a25 == 11)) || ((a4 == 1 && a23 <= 138) && 10 == a25)) || ((((((a4 <= 0 && 10 == a25 && a29 <= 140) && 1 == a3) && 15 == a8) && 0 <= a29 + 28553) && a23 + 55 <= 0) && 0 <= a23 + 600262)) || (a25 == 9 && (a4 == 1 && a23 <= 138) && 130 <= a29)) || (a23 <= 600000 && (((((12 == a25 && a29 <= 245) && 141 <= a29) && 1 == a3) && 15 == a8) && 1 == a4) && 312 <= a23)) || (a23 <= 600000 && ((((1 == a3 && ((a25 == 11 && 130 <= a29) && a29 <= 277) && 141 <= a29) && 15 == a8) || (((1 == a3 && (12 == a25 && a29 <= 277) && 141 <= a29) && !(1 == input)) && 15 == a8)) && 306 < a23) && 1 == a4)) || (((((a25 == 13 && 1 == a3) && a23 <= 306) && a4 == 1 && (\exists v_~a29~0_499 : int :: (((0 <= 12 * v_~a29~0_499 && 0 == v_~a29~0_499 * 12 / 10 % 5) && 245 < v_~a29~0_499) && v_~a29~0_499 * 12 / 10 / 5 + 99853 <= a29) && 0 <= v_~a29~0_499 * 12 / 10 + 1)) && 15 == a8) && 0 < a23 + 43) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Result: SAFE, OverallTime: 197.9s, OverallIterations: 29, TraceHistogramMax: 10, AutomataDifference: 122.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 36.6s, HoareTripleCheckerStatistics: 4303 SDtfs, 32786 SDslu, 2208 SDs, 0 SdLazy, 87323 SolverSat, 8869 SolverUnsat, 13 SolverUnknown, 0 SolverNotchecked, 98.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6083 GetRequests, 5728 SyntacticMatches, 10 SemanticMatches, 345 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4897 ImplicationChecksByTransitivity, 10.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13475occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 29 MinimizatonAttempts, 90045 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 130 NumberOfFragments, 1467 HoareAnnotationTreeSize, 3 FomulaSimplifications, 4170541524 FormulaSimplificationTreeSizeReduction, 7.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 623470004 FormulaSimplificationTreeSizeReductionInter, 29.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 17.7s InterpolantComputationTime, 19564 NumberOfCodeBlocks, 19564 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 19523 ConstructedInterpolants, 781 QuantifiedInterpolants, 65356632 SizeOfPredicates, 30 NumberOfNonLiveVariables, 7378 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 41 InterpolantComputations, 22 PerfectInterpolantSequences, 30047/37435 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...