./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label28.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_d5055f45-6112-4b68-8c38-6031d5e173fd/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d5055f45-6112-4b68-8c38-6031d5e173fd/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d5055f45-6112-4b68-8c38-6031d5e173fd/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d5055f45-6112-4b68-8c38-6031d5e173fd/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label28.c -s /tmp/vcloud-vcloud-master/worker/run_dir_d5055f45-6112-4b68-8c38-6031d5e173fd/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d5055f45-6112-4b68-8c38-6031d5e173fd/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 135f975c9db1c9341bb4a70ce00cbfa1e1ef94a6 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 05:52:53,055 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 05:52:53,057 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 05:52:53,071 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 05:52:53,071 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 05:52:53,073 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 05:52:53,075 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 05:52:53,084 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 05:52:53,089 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 05:52:53,093 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 05:52:53,094 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 05:52:53,095 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 05:52:53,097 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 05:52:53,099 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 05:52:53,100 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 05:52:53,101 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 05:52:53,103 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 05:52:53,104 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 05:52:53,106 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 05:52:53,111 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 05:52:53,115 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 05:52:53,118 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 05:52:53,120 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 05:52:53,121 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 05:52:53,124 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 05:52:53,125 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 05:52:53,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 05:52:53,127 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 05:52:53,127 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 05:52:53,128 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 05:52:53,129 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 05:52:53,129 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 05:52:53,131 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 05:52:53,132 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 05:52:53,133 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 05:52:53,133 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 05:52:53,134 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 05:52:53,134 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 05:52:53,134 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 05:52:53,135 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 05:52:53,137 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 05:52:53,138 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d5055f45-6112-4b68-8c38-6031d5e173fd/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 05:52:53,166 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 05:52:53,177 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 05:52:53,178 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 05:52:53,179 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 05:52:53,179 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 05:52:53,179 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 05:52:53,179 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 05:52:53,180 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 05:52:53,180 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 05:52:53,180 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 05:52:53,180 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 05:52:53,181 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 05:52:53,181 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 05:52:53,181 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 05:52:53,181 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 05:52:53,181 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 05:52:53,182 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 05:52:53,182 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 05:52:53,182 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 05:52:53,182 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 05:52:53,183 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 05:52:53,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 05:52:53,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 05:52:53,183 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 05:52:53,184 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 05:52:53,184 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 05:52:53,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 05:52:53,184 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 05:52:53,185 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_d5055f45-6112-4b68-8c38-6031d5e173fd/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 -> 135f975c9db1c9341bb4a70ce00cbfa1e1ef94a6 [2019-11-20 05:52:53,382 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 05:52:53,399 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 05:52:53,403 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 05:52:53,404 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 05:52:53,405 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 05:52:53,406 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d5055f45-6112-4b68-8c38-6031d5e173fd/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem15_label28.c [2019-11-20 05:52:53,473 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d5055f45-6112-4b68-8c38-6031d5e173fd/bin/uautomizer/data/b9545a3df/f50f3e67d79b444db4ee252493df9498/FLAGfef8877fd [2019-11-20 05:52:54,149 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 05:52:54,150 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d5055f45-6112-4b68-8c38-6031d5e173fd/sv-benchmarks/c/eca-rers2012/Problem15_label28.c [2019-11-20 05:52:54,179 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d5055f45-6112-4b68-8c38-6031d5e173fd/bin/uautomizer/data/b9545a3df/f50f3e67d79b444db4ee252493df9498/FLAGfef8877fd [2019-11-20 05:52:54,356 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d5055f45-6112-4b68-8c38-6031d5e173fd/bin/uautomizer/data/b9545a3df/f50f3e67d79b444db4ee252493df9498 [2019-11-20 05:52:54,358 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 05:52:54,359 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 05:52:54,360 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 05:52:54,361 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 05:52:54,367 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 05:52:54,367 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:52:54" (1/1) ... [2019-11-20 05:52:54,369 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ddc731 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:52:54, skipping insertion in model container [2019-11-20 05:52:54,370 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:52:54" (1/1) ... [2019-11-20 05:52:54,377 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 05:52:54,468 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 05:52:55,359 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:52:55,366 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 05:52:56,017 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 05:52:56,041 INFO L192 MainTranslator]: Completed translation [2019-11-20 05:52:56,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:52:56 WrapperNode [2019-11-20 05:52:56,042 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 05:52:56,043 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 05:52:56,043 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 05:52:56,043 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 05:52:56,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:52:56" (1/1) ... [2019-11-20 05:52:56,103 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:52:56" (1/1) ... [2019-11-20 05:52:56,309 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 05:52:56,310 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 05:52:56,310 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 05:52:56,310 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 05:52:56,322 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:52:56" (1/1) ... [2019-11-20 05:52:56,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:52:56" (1/1) ... [2019-11-20 05:52:56,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:52:56" (1/1) ... [2019-11-20 05:52:56,339 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:52:56" (1/1) ... [2019-11-20 05:52:56,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:52:56" (1/1) ... [2019-11-20 05:52:56,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:52:56" (1/1) ... [2019-11-20 05:52:56,479 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:52:56" (1/1) ... [2019-11-20 05:52:56,523 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 05:52:56,523 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 05:52:56,524 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 05:52:56,524 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 05:52:56,525 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:52:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d5055f45-6112-4b68-8c38-6031d5e173fd/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 05:52:56,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 05:52:56,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 05:53:02,041 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 05:53:02,041 INFO L285 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-20 05:53:02,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:53:02 BoogieIcfgContainer [2019-11-20 05:53:02,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 05:53:02,044 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 05:53:02,044 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 05:53:02,046 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 05:53:02,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:52:54" (1/3) ... [2019-11-20 05:53:02,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e67dba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:53:02, skipping insertion in model container [2019-11-20 05:53:02,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:52:56" (2/3) ... [2019-11-20 05:53:02,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e67dba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:53:02, skipping insertion in model container [2019-11-20 05:53:02,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:53:02" (3/3) ... [2019-11-20 05:53:02,049 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label28.c [2019-11-20 05:53:02,058 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 05:53:02,065 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 05:53:02,075 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 05:53:02,101 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 05:53:02,101 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 05:53:02,101 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 05:53:02,101 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 05:53:02,101 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 05:53:02,101 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 05:53:02,102 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 05:53:02,102 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 05:53:02,125 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-11-20 05:53:02,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-20 05:53:02,131 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:53:02,132 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] [2019-11-20 05:53:02,132 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:53:02,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:53:02,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1317301102, now seen corresponding path program 1 times [2019-11-20 05:53:02,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:53:02,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394288710] [2019-11-20 05:53:02,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:53:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:53:02,345 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 05:53:02,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394288710] [2019-11-20 05:53:02,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:53:02,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:53:02,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610984194] [2019-11-20 05:53:02,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:53:02,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:53:02,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:53:02,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:53:02,367 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-11-20 05:53:06,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:53:06,623 INFO L93 Difference]: Finished difference Result 1468 states and 2718 transitions. [2019-11-20 05:53:06,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:53:06,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-11-20 05:53:06,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:53:06,664 INFO L225 Difference]: With dead ends: 1468 [2019-11-20 05:53:06,664 INFO L226 Difference]: Without dead ends: 977 [2019-11-20 05:53:06,675 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 05:53:06,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2019-11-20 05:53:06,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 973. [2019-11-20 05:53:06,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2019-11-20 05:53:06,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1487 transitions. [2019-11-20 05:53:06,820 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1487 transitions. Word has length 32 [2019-11-20 05:53:06,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:53:06,820 INFO L462 AbstractCegarLoop]: Abstraction has 973 states and 1487 transitions. [2019-11-20 05:53:06,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:53:06,821 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1487 transitions. [2019-11-20 05:53:06,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-20 05:53:06,833 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:53:06,834 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:53:06,834 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:53:06,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:53:06,835 INFO L82 PathProgramCache]: Analyzing trace with hash 2019188173, now seen corresponding path program 1 times [2019-11-20 05:53:06,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:53:06,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979327700] [2019-11-20 05:53:06,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:53:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:53:07,167 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:53:07,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979327700] [2019-11-20 05:53:07,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:53:07,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:53:07,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028400630] [2019-11-20 05:53:07,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:53:07,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:53:07,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:53:07,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:53:07,179 INFO L87 Difference]: Start difference. First operand 973 states and 1487 transitions. Second operand 4 states. [2019-11-20 05:53:11,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:53:11,030 INFO L93 Difference]: Finished difference Result 3746 states and 5750 transitions. [2019-11-20 05:53:11,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:53:11,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-11-20 05:53:11,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:53:11,046 INFO L225 Difference]: With dead ends: 3746 [2019-11-20 05:53:11,046 INFO L226 Difference]: Without dead ends: 2775 [2019-11-20 05:53:11,049 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 05:53:11,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2775 states. [2019-11-20 05:53:11,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2775 to 1872. [2019-11-20 05:53:11,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1872 states. [2019-11-20 05:53:11,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 2495 transitions. [2019-11-20 05:53:11,104 INFO L78 Accepts]: Start accepts. Automaton has 1872 states and 2495 transitions. Word has length 151 [2019-11-20 05:53:11,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:53:11,106 INFO L462 AbstractCegarLoop]: Abstraction has 1872 states and 2495 transitions. [2019-11-20 05:53:11,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:53:11,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 2495 transitions. [2019-11-20 05:53:11,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-11-20 05:53:11,110 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:53:11,110 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:53:11,111 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:53:11,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:53:11,111 INFO L82 PathProgramCache]: Analyzing trace with hash 516991842, now seen corresponding path program 1 times [2019-11-20 05:53:11,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:53:11,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104731556] [2019-11-20 05:53:11,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:53:11,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:53:11,520 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-20 05:53:11,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104731556] [2019-11-20 05:53:11,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191354934] [2019-11-20 05:53:11,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d5055f45-6112-4b68-8c38-6031d5e173fd/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 05:53:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:53:11,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 05:53:11,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:53:11,806 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-20 05:53:11,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 05:53:11,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-11-20 05:53:11,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409890769] [2019-11-20 05:53:11,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:53:11,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:53:11,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:53:11,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:53:11,808 INFO L87 Difference]: Start difference. First operand 1872 states and 2495 transitions. Second operand 3 states. [2019-11-20 05:53:14,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:53:14,684 INFO L93 Difference]: Finished difference Result 4942 states and 6535 transitions. [2019-11-20 05:53:14,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:53:14,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 228 [2019-11-20 05:53:14,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:53:14,701 INFO L225 Difference]: With dead ends: 4942 [2019-11-20 05:53:14,701 INFO L226 Difference]: Without dead ends: 3072 [2019-11-20 05:53:14,703 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 228 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 05:53:14,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2019-11-20 05:53:14,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 2771. [2019-11-20 05:53:14,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2771 states. [2019-11-20 05:53:14,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2771 states to 2771 states and 3503 transitions. [2019-11-20 05:53:14,757 INFO L78 Accepts]: Start accepts. Automaton has 2771 states and 3503 transitions. Word has length 228 [2019-11-20 05:53:14,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:53:14,758 INFO L462 AbstractCegarLoop]: Abstraction has 2771 states and 3503 transitions. [2019-11-20 05:53:14,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:53:14,759 INFO L276 IsEmpty]: Start isEmpty. Operand 2771 states and 3503 transitions. [2019-11-20 05:53:14,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-11-20 05:53:14,764 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:53:14,765 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:53:14,968 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:53:14,968 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:53:14,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:53:14,968 INFO L82 PathProgramCache]: Analyzing trace with hash 78183249, now seen corresponding path program 1 times [2019-11-20 05:53:14,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:53:14,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239821194] [2019-11-20 05:53:14,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:53:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:53:15,593 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-20 05:53:15,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239821194] [2019-11-20 05:53:15,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:53:15,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:53:15,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353918534] [2019-11-20 05:53:15,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 05:53:15,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:53:15,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 05:53:15,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:53:15,597 INFO L87 Difference]: Start difference. First operand 2771 states and 3503 transitions. Second operand 5 states. [2019-11-20 05:53:20,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:53:20,017 INFO L93 Difference]: Finished difference Result 6439 states and 7983 transitions. [2019-11-20 05:53:20,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:53:20,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 310 [2019-11-20 05:53:20,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:53:20,036 INFO L225 Difference]: With dead ends: 6439 [2019-11-20 05:53:20,036 INFO L226 Difference]: Without dead ends: 3670 [2019-11-20 05:53:20,039 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:53:20,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3670 states. [2019-11-20 05:53:20,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3670 to 3370. [2019-11-20 05:53:20,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3370 states. [2019-11-20 05:53:20,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3370 states to 3370 states and 4138 transitions. [2019-11-20 05:53:20,104 INFO L78 Accepts]: Start accepts. Automaton has 3370 states and 4138 transitions. Word has length 310 [2019-11-20 05:53:20,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:53:20,105 INFO L462 AbstractCegarLoop]: Abstraction has 3370 states and 4138 transitions. [2019-11-20 05:53:20,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 05:53:20,105 INFO L276 IsEmpty]: Start isEmpty. Operand 3370 states and 4138 transitions. [2019-11-20 05:53:20,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-11-20 05:53:20,110 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:53:20,111 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:53:20,111 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:53:20,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:53:20,111 INFO L82 PathProgramCache]: Analyzing trace with hash 579536590, now seen corresponding path program 1 times [2019-11-20 05:53:20,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:53:20,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54251156] [2019-11-20 05:53:20,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:53:20,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:53:20,317 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-11-20 05:53:20,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54251156] [2019-11-20 05:53:20,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:53:20,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:53:20,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286791225] [2019-11-20 05:53:20,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:53:20,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:53:20,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:53:20,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:53:20,320 INFO L87 Difference]: Start difference. First operand 3370 states and 4138 transitions. Second operand 3 states. [2019-11-20 05:53:22,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:53:22,489 INFO L93 Difference]: Finished difference Result 9132 states and 11306 transitions. [2019-11-20 05:53:22,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:53:22,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 319 [2019-11-20 05:53:22,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:53:22,515 INFO L225 Difference]: With dead ends: 9132 [2019-11-20 05:53:22,516 INFO L226 Difference]: Without dead ends: 5764 [2019-11-20 05:53:22,519 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:53:22,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5764 states. [2019-11-20 05:53:22,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5764 to 3968. [2019-11-20 05:53:22,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3968 states. [2019-11-20 05:53:22,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3968 states to 3968 states and 4936 transitions. [2019-11-20 05:53:22,599 INFO L78 Accepts]: Start accepts. Automaton has 3968 states and 4936 transitions. Word has length 319 [2019-11-20 05:53:22,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:53:22,600 INFO L462 AbstractCegarLoop]: Abstraction has 3968 states and 4936 transitions. [2019-11-20 05:53:22,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:53:22,600 INFO L276 IsEmpty]: Start isEmpty. Operand 3968 states and 4936 transitions. [2019-11-20 05:53:22,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2019-11-20 05:53:22,607 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:53:22,607 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:53:22,608 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:53:22,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:53:22,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1647724765, now seen corresponding path program 1 times [2019-11-20 05:53:22,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:53:22,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286976935] [2019-11-20 05:53:22,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:53:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:53:23,026 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:53:23,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286976935] [2019-11-20 05:53:23,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:53:23,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:53:23,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531384199] [2019-11-20 05:53:23,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:53:23,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:53:23,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:53:23,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:53:23,029 INFO L87 Difference]: Start difference. First operand 3968 states and 4936 transitions. Second operand 4 states. [2019-11-20 05:53:26,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:53:26,567 INFO L93 Difference]: Finished difference Result 9734 states and 12346 transitions. [2019-11-20 05:53:26,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:53:26,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 384 [2019-11-20 05:53:26,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:53:26,594 INFO L225 Difference]: With dead ends: 9734 [2019-11-20 05:53:26,594 INFO L226 Difference]: Without dead ends: 5768 [2019-11-20 05:53:26,599 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 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 05:53:26,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5768 states. [2019-11-20 05:53:26,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5768 to 5765. [2019-11-20 05:53:26,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5765 states. [2019-11-20 05:53:26,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5765 states to 5765 states and 7047 transitions. [2019-11-20 05:53:26,708 INFO L78 Accepts]: Start accepts. Automaton has 5765 states and 7047 transitions. Word has length 384 [2019-11-20 05:53:26,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:53:26,709 INFO L462 AbstractCegarLoop]: Abstraction has 5765 states and 7047 transitions. [2019-11-20 05:53:26,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:53:26,709 INFO L276 IsEmpty]: Start isEmpty. Operand 5765 states and 7047 transitions. [2019-11-20 05:53:26,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-11-20 05:53:26,718 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:53:26,719 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:53:26,719 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:53:26,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:53:26,720 INFO L82 PathProgramCache]: Analyzing trace with hash 624859565, now seen corresponding path program 1 times [2019-11-20 05:53:26,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:53:26,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263359170] [2019-11-20 05:53:26,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:53:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:53:27,384 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:53:27,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263359170] [2019-11-20 05:53:27,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579456344] [2019-11-20 05:53:27,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d5055f45-6112-4b68-8c38-6031d5e173fd/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 05:53:27,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:53:27,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 05:53:27,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:53:27,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:53:27,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:53:27,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:53:27,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:53:27,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:53:27,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:53:27,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:53:27,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:53:27,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:53:27,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:53:27,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:53:27,937 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 135 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:53:27,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:53:27,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2019-11-20 05:53:27,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188250559] [2019-11-20 05:53:27,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 05:53:27,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:53:27,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 05:53:27,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-20 05:53:27,941 INFO L87 Difference]: Start difference. First operand 5765 states and 7047 transitions. Second operand 8 states. [2019-11-20 05:53:51,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:53:51,252 INFO L93 Difference]: Finished difference Result 33461 states and 41946 transitions. [2019-11-20 05:53:51,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-20 05:53:51,252 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 409 [2019-11-20 05:53:51,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:53:51,319 INFO L225 Difference]: With dead ends: 33461 [2019-11-20 05:53:51,319 INFO L226 Difference]: Without dead ends: 27698 [2019-11-20 05:53:51,327 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2019-11-20 05:53:51,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27698 states. [2019-11-20 05:53:51,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27698 to 20760. [2019-11-20 05:53:51,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20760 states. [2019-11-20 05:53:51,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20760 states to 20760 states and 25499 transitions. [2019-11-20 05:53:51,664 INFO L78 Accepts]: Start accepts. Automaton has 20760 states and 25499 transitions. Word has length 409 [2019-11-20 05:53:51,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:53:51,665 INFO L462 AbstractCegarLoop]: Abstraction has 20760 states and 25499 transitions. [2019-11-20 05:53:51,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 05:53:51,665 INFO L276 IsEmpty]: Start isEmpty. Operand 20760 states and 25499 transitions. [2019-11-20 05:53:51,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2019-11-20 05:53:51,681 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:53:51,682 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:53:51,889 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:53:51,889 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:53:51,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:53:51,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1671806954, now seen corresponding path program 1 times [2019-11-20 05:53:51,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:53:51,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183674087] [2019-11-20 05:53:51,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:53:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:53:53,277 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 504 proven. 3 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-20 05:53:53,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183674087] [2019-11-20 05:53:53,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575575326] [2019-11-20 05:53:53,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d5055f45-6112-4b68-8c38-6031d5e173fd/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 05:53:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:53:53,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 05:53:53,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:53:53,564 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2019-11-20 05:53:53,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 05:53:53,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-20 05:53:53,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153202847] [2019-11-20 05:53:53,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:53:53,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:53:53,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:53:53,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-20 05:53:53,566 INFO L87 Difference]: Start difference. First operand 20760 states and 25499 transitions. Second operand 3 states. [2019-11-20 05:53:55,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:53:55,966 INFO L93 Difference]: Finished difference Result 43610 states and 53948 transitions. [2019-11-20 05:53:55,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:53:55,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 514 [2019-11-20 05:53:55,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:53:56,012 INFO L225 Difference]: With dead ends: 43610 [2019-11-20 05:53:56,012 INFO L226 Difference]: Without dead ends: 22852 [2019-11-20 05:53:56,032 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 513 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-20 05:53:56,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22852 states. [2019-11-20 05:53:56,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22852 to 21349. [2019-11-20 05:53:56,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21349 states. [2019-11-20 05:53:56,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21349 states to 21349 states and 25566 transitions. [2019-11-20 05:53:56,284 INFO L78 Accepts]: Start accepts. Automaton has 21349 states and 25566 transitions. Word has length 514 [2019-11-20 05:53:56,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:53:56,285 INFO L462 AbstractCegarLoop]: Abstraction has 21349 states and 25566 transitions. [2019-11-20 05:53:56,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:53:56,285 INFO L276 IsEmpty]: Start isEmpty. Operand 21349 states and 25566 transitions. [2019-11-20 05:53:56,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2019-11-20 05:53:56,296 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:53:56,296 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 05:53:56,499 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:53:56,500 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:53:56,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:53:56,500 INFO L82 PathProgramCache]: Analyzing trace with hash -402088235, now seen corresponding path program 1 times [2019-11-20 05:53:56,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:53:56,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963150900] [2019-11-20 05:53:56,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:53:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:53:57,895 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 539 proven. 3 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-20 05:53:57,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963150900] [2019-11-20 05:53:57,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448414625] [2019-11-20 05:53:57,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d5055f45-6112-4b68-8c38-6031d5e173fd/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 05:53:58,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:53:58,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 05:53:58,041 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:53:58,245 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 558 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-11-20 05:53:58,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 05:53:58,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-20 05:53:58,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997587221] [2019-11-20 05:53:58,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:53:58,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:53:58,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:53:58,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-20 05:53:58,248 INFO L87 Difference]: Start difference. First operand 21349 states and 25566 transitions. Second operand 3 states. [2019-11-20 05:54:00,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:54:00,276 INFO L93 Difference]: Finished difference Result 42696 states and 51130 transitions. [2019-11-20 05:54:00,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:54:00,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 547 [2019-11-20 05:54:00,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:54:00,303 INFO L225 Difference]: With dead ends: 42696 [2019-11-20 05:54:00,304 INFO L226 Difference]: Without dead ends: 21349 [2019-11-20 05:54:00,321 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 553 GetRequests, 546 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-20 05:54:00,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21349 states. [2019-11-20 05:54:00,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21349 to 21349. [2019-11-20 05:54:00,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21349 states. [2019-11-20 05:54:00,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21349 states to 21349 states and 25218 transitions. [2019-11-20 05:54:00,547 INFO L78 Accepts]: Start accepts. Automaton has 21349 states and 25218 transitions. Word has length 547 [2019-11-20 05:54:00,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:54:00,548 INFO L462 AbstractCegarLoop]: Abstraction has 21349 states and 25218 transitions. [2019-11-20 05:54:00,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:54:00,548 INFO L276 IsEmpty]: Start isEmpty. Operand 21349 states and 25218 transitions. [2019-11-20 05:54:00,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2019-11-20 05:54:00,556 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:54:00,557 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:54:00,759 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:54:00,760 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:54:00,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:54:00,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1478183197, now seen corresponding path program 1 times [2019-11-20 05:54:00,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:54:00,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702411142] [2019-11-20 05:54:00,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:54:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:54:01,227 INFO L134 CoverageAnalysis]: Checked inductivity of 755 backedges. 635 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-11-20 05:54:01,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702411142] [2019-11-20 05:54:01,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:54:01,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 05:54:01,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557914996] [2019-11-20 05:54:01,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 05:54:01,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:54:01,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 05:54:01,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 05:54:01,230 INFO L87 Difference]: Start difference. First operand 21349 states and 25218 transitions. Second operand 4 states. [2019-11-20 05:54:04,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:54:04,321 INFO L93 Difference]: Finished difference Result 42403 states and 50118 transitions. [2019-11-20 05:54:04,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 05:54:04,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 567 [2019-11-20 05:54:04,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:54:04,339 INFO L225 Difference]: With dead ends: 42403 [2019-11-20 05:54:04,340 INFO L226 Difference]: Without dead ends: 21056 [2019-11-20 05:54:04,348 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 3 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 05:54:04,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21056 states. [2019-11-20 05:54:04,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21056 to 21047. [2019-11-20 05:54:04,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21047 states. [2019-11-20 05:54:04,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21047 states to 21047 states and 23923 transitions. [2019-11-20 05:54:04,747 INFO L78 Accepts]: Start accepts. Automaton has 21047 states and 23923 transitions. Word has length 567 [2019-11-20 05:54:04,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:54:04,748 INFO L462 AbstractCegarLoop]: Abstraction has 21047 states and 23923 transitions. [2019-11-20 05:54:04,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 05:54:04,748 INFO L276 IsEmpty]: Start isEmpty. Operand 21047 states and 23923 transitions. [2019-11-20 05:54:04,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2019-11-20 05:54:04,755 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:54:04,757 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:54:04,757 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:54:04,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:54:04,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1082476183, now seen corresponding path program 1 times [2019-11-20 05:54:04,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:54:04,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007606671] [2019-11-20 05:54:04,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:54:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:54:05,332 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 317 proven. 30 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-20 05:54:05,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007606671] [2019-11-20 05:54:05,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217370392] [2019-11-20 05:54:05,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d5055f45-6112-4b68-8c38-6031d5e173fd/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 05:54:05,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:54:05,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 05:54:05,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:54:05,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:54:05,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:54:05,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:54:05,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:54:05,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 05:54:05,895 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 317 proven. 30 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-20 05:54:05,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 05:54:05,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-11-20 05:54:05,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814110591] [2019-11-20 05:54:05,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 05:54:05,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:54:05,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 05:54:05,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-20 05:54:05,901 INFO L87 Difference]: Start difference. First operand 21047 states and 23923 transitions. Second operand 8 states. [2019-11-20 05:54:08,564 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-11-20 05:54:21,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:54:21,558 INFO L93 Difference]: Finished difference Result 56772 states and 64018 transitions. [2019-11-20 05:54:21,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 05:54:21,559 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 573 [2019-11-20 05:54:21,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:54:21,598 INFO L225 Difference]: With dead ends: 56772 [2019-11-20 05:54:21,598 INFO L226 Difference]: Without dead ends: 35727 [2019-11-20 05:54:21,612 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 584 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-11-20 05:54:21,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35727 states. [2019-11-20 05:54:21,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35727 to 26431. [2019-11-20 05:54:21,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26431 states. [2019-11-20 05:54:21,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26431 states to 26431 states and 29647 transitions. [2019-11-20 05:54:21,958 INFO L78 Accepts]: Start accepts. Automaton has 26431 states and 29647 transitions. Word has length 573 [2019-11-20 05:54:21,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:54:21,959 INFO L462 AbstractCegarLoop]: Abstraction has 26431 states and 29647 transitions. [2019-11-20 05:54:21,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 05:54:21,959 INFO L276 IsEmpty]: Start isEmpty. Operand 26431 states and 29647 transitions. [2019-11-20 05:54:21,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 717 [2019-11-20 05:54:21,980 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:54:21,981 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:54:22,184 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:54:22,185 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:54:22,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:54:22,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1451542345, now seen corresponding path program 1 times [2019-11-20 05:54:22,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:54:22,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264972617] [2019-11-20 05:54:22,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:54:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:54:25,047 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 391 proven. 192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 05:54:25,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264972617] [2019-11-20 05:54:25,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576680960] [2019-11-20 05:54:25,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d5055f45-6112-4b68-8c38-6031d5e173fd/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 05:54:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:54:25,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 830 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 05:54:25,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:54:25,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:54:25,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:54:25,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:54:25,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:54:25,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:54:25,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:54:25,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:54:25,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 05:54:30,394 WARN L191 SmtUtils]: Spent 4.64 s on a formula simplification. DAG size of input: 68 DAG size of output: 49 [2019-11-20 05:54:36,680 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2019-11-20 05:54:36,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 05:54:36,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 13 [2019-11-20 05:54:36,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211564794] [2019-11-20 05:54:36,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:54:36,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:54:36,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:54:36,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-20 05:54:36,683 INFO L87 Difference]: Start difference. First operand 26431 states and 29647 transitions. Second operand 3 states. [2019-11-20 05:56:43,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:56:43,640 INFO L93 Difference]: Finished difference Result 59147 states and 66285 transitions. [2019-11-20 05:56:43,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:56:43,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 716 [2019-11-20 05:56:43,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:56:43,672 INFO L225 Difference]: With dead ends: 59147 [2019-11-20 05:56:43,672 INFO L226 Difference]: Without dead ends: 28532 [2019-11-20 05:56:43,688 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 685 SyntacticMatches, 31 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-20 05:56:43,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28532 states. [2019-11-20 05:56:43,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28532 to 28233. [2019-11-20 05:56:43,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28233 states. [2019-11-20 05:56:43,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28233 states to 28233 states and 31069 transitions. [2019-11-20 05:56:43,999 INFO L78 Accepts]: Start accepts. Automaton has 28233 states and 31069 transitions. Word has length 716 [2019-11-20 05:56:44,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:56:44,000 INFO L462 AbstractCegarLoop]: Abstraction has 28233 states and 31069 transitions. [2019-11-20 05:56:44,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:56:44,000 INFO L276 IsEmpty]: Start isEmpty. Operand 28233 states and 31069 transitions. [2019-11-20 05:56:44,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 738 [2019-11-20 05:56:44,017 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:56:44,018 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 05:56:44,222 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:56:44,222 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:56:44,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:56:44,222 INFO L82 PathProgramCache]: Analyzing trace with hash 748082237, now seen corresponding path program 1 times [2019-11-20 05:56:44,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:56:44,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891616573] [2019-11-20 05:56:44,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:56:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:56:45,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1531 backedges. 896 proven. 3 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2019-11-20 05:56:45,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891616573] [2019-11-20 05:56:45,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431802427] [2019-11-20 05:56:45,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d5055f45-6112-4b68-8c38-6031d5e173fd/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 05:56:46,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:56:46,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 913 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 05:56:46,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 05:56:46,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1531 backedges. 956 proven. 0 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2019-11-20 05:56:46,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 05:56:46,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-20 05:56:46,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880620093] [2019-11-20 05:56:46,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:56:46,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:56:46,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:56:46,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-20 05:56:46,618 INFO L87 Difference]: Start difference. First operand 28233 states and 31069 transitions. Second operand 3 states. [2019-11-20 05:56:48,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:56:48,908 INFO L93 Difference]: Finished difference Result 60942 states and 67025 transitions. [2019-11-20 05:56:48,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:56:48,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 737 [2019-11-20 05:56:48,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:56:48,933 INFO L225 Difference]: With dead ends: 60942 [2019-11-20 05:56:48,933 INFO L226 Difference]: Without dead ends: 27926 [2019-11-20 05:56:48,944 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 743 GetRequests, 736 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-20 05:56:48,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27926 states. [2019-11-20 05:56:49,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27926 to 24329. [2019-11-20 05:56:49,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24329 states. [2019-11-20 05:56:49,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24329 states to 24329 states and 26048 transitions. [2019-11-20 05:56:49,185 INFO L78 Accepts]: Start accepts. Automaton has 24329 states and 26048 transitions. Word has length 737 [2019-11-20 05:56:49,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:56:49,185 INFO L462 AbstractCegarLoop]: Abstraction has 24329 states and 26048 transitions. [2019-11-20 05:56:49,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:56:49,186 INFO L276 IsEmpty]: Start isEmpty. Operand 24329 states and 26048 transitions. [2019-11-20 05:56:49,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 804 [2019-11-20 05:56:49,205 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:56:49,206 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:49,409 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 05:56:49,410 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:56:49,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:56:49,410 INFO L82 PathProgramCache]: Analyzing trace with hash -467952914, now seen corresponding path program 1 times [2019-11-20 05:56:49,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:56:49,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296067591] [2019-11-20 05:56:49,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:56:49,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:56:50,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1307 backedges. 795 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2019-11-20 05:56:50,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296067591] [2019-11-20 05:56:50,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:56:50,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 05:56:50,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951627233] [2019-11-20 05:56:50,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 05:56:50,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:56:50,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 05:56:50,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:56:50,423 INFO L87 Difference]: Start difference. First operand 24329 states and 26048 transitions. Second operand 3 states. [2019-11-20 05:56:51,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:56:51,980 INFO L93 Difference]: Finished difference Result 47755 states and 51066 transitions. [2019-11-20 05:56:51,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 05:56:51,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 803 [2019-11-20 05:56:51,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:56:51,999 INFO L225 Difference]: With dead ends: 47755 [2019-11-20 05:56:52,000 INFO L226 Difference]: Without dead ends: 23428 [2019-11-20 05:56:52,009 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 05:56:52,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23428 states. [2019-11-20 05:56:52,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23428 to 23426. [2019-11-20 05:56:52,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23426 states. [2019-11-20 05:56:52,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23426 states to 23426 states and 25014 transitions. [2019-11-20 05:56:52,224 INFO L78 Accepts]: Start accepts. Automaton has 23426 states and 25014 transitions. Word has length 803 [2019-11-20 05:56:52,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:56:52,224 INFO L462 AbstractCegarLoop]: Abstraction has 23426 states and 25014 transitions. [2019-11-20 05:56:52,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 05:56:52,225 INFO L276 IsEmpty]: Start isEmpty. Operand 23426 states and 25014 transitions. [2019-11-20 05:56:52,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 804 [2019-11-20 05:56:52,241 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 05:56:52,242 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:56:52,242 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 05:56:52,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 05:56:52,242 INFO L82 PathProgramCache]: Analyzing trace with hash 332978800, now seen corresponding path program 1 times [2019-11-20 05:56:52,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 05:56:52,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556314487] [2019-11-20 05:56:52,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 05:56:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 05:56:53,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1307 backedges. 943 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-11-20 05:56:53,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556314487] [2019-11-20 05:56:53,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 05:56:53,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 05:56:53,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50201616] [2019-11-20 05:56:53,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 05:56:53,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 05:56:53,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 05:56:53,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 05:56:53,128 INFO L87 Difference]: Start difference. First operand 23426 states and 25014 transitions. Second operand 5 states. [2019-11-20 05:56:55,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 05:56:55,968 INFO L93 Difference]: Finished difference Result 45307 states and 48019 transitions. [2019-11-20 05:56:55,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 05:56:55,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 803 [2019-11-20 05:56:55,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 05:56:55,969 INFO L225 Difference]: With dead ends: 45307 [2019-11-20 05:56:55,969 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 05:56:55,980 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 05:56:55,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 05:56:55,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 05:56:55,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 05:56:55,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 05:56:55,981 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 803 [2019-11-20 05:56:55,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 05:56:55,982 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 05:56:55,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 05:56:55,982 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 05:56:55,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 05:56:55,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 05:56:56,599 WARN L191 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 423 DAG size of output: 353 [2019-11-20 05:56:57,210 WARN L191 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 423 DAG size of output: 353 [2019-11-20 05:56:57,747 WARN L191 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 423 DAG size of output: 353 [2019-11-20 05:57:06,914 WARN L191 SmtUtils]: Spent 9.16 s on a formula simplification. DAG size of input: 344 DAG size of output: 109 [2019-11-20 05:57:17,504 WARN L191 SmtUtils]: Spent 10.59 s on a formula simplification. DAG size of input: 344 DAG size of output: 109 [2019-11-20 05:57:20,545 WARN L191 SmtUtils]: Spent 3.04 s on a formula simplification. DAG size of input: 344 DAG size of output: 109 [2019-11-20 05:57:20,549 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,549 INFO L444 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,549 INFO L444 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,549 INFO L444 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,549 INFO L444 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-20 05:57:20,549 INFO L444 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,549 INFO L444 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,549 INFO L444 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,549 INFO L444 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,550 INFO L444 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,550 INFO L444 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,550 INFO L444 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-20 05:57:20,550 INFO L444 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,550 INFO L444 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,550 INFO L444 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,550 INFO L444 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-11-20 05:57:20,550 INFO L444 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,550 INFO L444 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,550 INFO L444 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-20 05:57:20,551 INFO L444 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,551 INFO L444 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,551 INFO L444 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,551 INFO L444 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,551 INFO L444 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,551 INFO L444 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,551 INFO L444 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-20 05:57:20,551 INFO L444 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,551 INFO L444 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,551 INFO L444 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,551 INFO L444 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,551 INFO L444 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-11-20 05:57:20,551 INFO L444 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-11-20 05:57:20,551 INFO L444 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,552 INFO L444 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,552 INFO L444 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,552 INFO L444 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,552 INFO L444 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-20 05:57:20,552 INFO L444 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-11-20 05:57:20,552 INFO L444 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,552 INFO L444 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,552 INFO L444 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,552 INFO L444 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,552 INFO L444 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,552 INFO L444 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-11-20 05:57:20,552 INFO L444 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,553 INFO L444 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-11-20 05:57:20,553 INFO L444 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-11-20 05:57:20,553 INFO L444 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-11-20 05:57:20,553 INFO L444 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-20 05:57:20,553 INFO L444 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,553 INFO L444 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,553 INFO L444 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,553 INFO L444 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,553 INFO L444 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,554 INFO L444 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-11-20 05:57:20,554 INFO L444 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,554 INFO L444 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,554 INFO L444 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-20 05:57:20,554 INFO L444 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,554 INFO L444 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-11-20 05:57:20,554 INFO L444 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,554 INFO L444 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,554 INFO L444 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,554 INFO L444 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-20 05:57:20,554 INFO L444 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,554 INFO L444 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-11-20 05:57:20,554 INFO L444 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-11-20 05:57:20,555 INFO L444 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-11-20 05:57:20,555 INFO L444 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-11-20 05:57:20,555 INFO L444 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-11-20 05:57:20,555 INFO L444 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-11-20 05:57:20,555 INFO L444 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,555 INFO L444 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,555 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,555 INFO L444 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,555 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-11-20 05:57:20,555 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-11-20 05:57:20,555 INFO L444 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,555 INFO L444 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-20 05:57:20,555 INFO L444 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,555 INFO L444 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,556 INFO L444 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,556 INFO L444 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,556 INFO L444 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,556 INFO L444 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,556 INFO L444 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-20 05:57:20,556 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 05:57:20,556 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 103) no Hoare annotation was computed. [2019-11-20 05:57:20,556 INFO L444 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,556 INFO L444 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,556 INFO L444 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,556 INFO L444 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,556 INFO L444 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,557 INFO L444 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-11-20 05:57:20,557 INFO L444 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-11-20 05:57:20,557 INFO L444 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,557 INFO L444 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-20 05:57:20,557 INFO L444 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-11-20 05:57:20,557 INFO L444 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-11-20 05:57:20,557 INFO L444 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,557 INFO L444 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-11-20 05:57:20,557 INFO L444 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-11-20 05:57:20,557 INFO L444 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,557 INFO L444 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,557 INFO L444 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,557 INFO L444 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,557 INFO L444 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-20 05:57:20,558 INFO L444 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-11-20 05:57:20,558 INFO L444 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,558 INFO L444 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,558 INFO L444 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,558 INFO L444 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-11-20 05:57:20,558 INFO L444 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-11-20 05:57:20,558 INFO L444 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,559 INFO L444 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-20 05:57:20,559 INFO L444 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,559 INFO L444 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,559 INFO L444 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,559 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,559 INFO L444 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,559 INFO L444 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,559 INFO L444 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-20 05:57:20,559 INFO L444 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,560 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,560 INFO L444 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-11-20 05:57:20,560 INFO L444 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,560 INFO L444 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,560 INFO L444 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,560 INFO L444 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,560 INFO L444 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-20 05:57:20,560 INFO L444 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,560 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,560 INFO L444 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,560 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,560 INFO L444 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,560 INFO L444 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-20 05:57:20,561 INFO L444 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,561 INFO L444 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,561 INFO L444 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,561 INFO L444 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,561 INFO L444 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-11-20 05:57:20,561 INFO L444 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,561 INFO L444 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,561 INFO L444 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,562 INFO L444 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-11-20 05:57:20,562 INFO L444 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-11-20 05:57:20,562 INFO L444 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,562 INFO L444 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,562 INFO L444 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-20 05:57:20,562 INFO L444 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,563 INFO L444 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,563 INFO L444 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,563 INFO L444 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,563 INFO L444 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,563 INFO L444 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-20 05:57:20,563 INFO L444 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,563 INFO L444 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,563 INFO L444 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,563 INFO L444 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,564 INFO L444 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,564 INFO L444 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-11-20 05:57:20,564 INFO L444 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,564 INFO L444 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,564 INFO L444 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-11-20 05:57:20,564 INFO L444 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,564 INFO L444 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-20 05:57:20,564 INFO L444 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-20 05:57:20,564 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,564 INFO L444 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,564 INFO L444 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,564 INFO L444 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,565 INFO L444 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,565 INFO L444 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-11-20 05:57:20,565 INFO L444 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-11-20 05:57:20,565 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,565 INFO L444 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-20 05:57:20,565 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 05:57:20,565 INFO L444 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-20 05:57:20,565 INFO L444 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,565 INFO L444 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,565 INFO L444 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,565 INFO L444 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,565 INFO L444 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,565 INFO L444 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-11-20 05:57:20,565 INFO L444 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-11-20 05:57:20,566 INFO L444 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-11-20 05:57:20,566 INFO L444 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-11-20 05:57:20,566 INFO L444 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,566 INFO L444 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,566 INFO L444 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,566 INFO L444 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-20 05:57:20,566 INFO L444 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-20 05:57:20,566 INFO L444 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,566 INFO L444 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-11-20 05:57:20,566 INFO L444 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,566 INFO L444 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,566 INFO L444 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,566 INFO L444 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,567 INFO L444 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-11-20 05:57:20,567 INFO L444 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-11-20 05:57:20,567 INFO L444 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-20 05:57:20,567 INFO L444 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,567 INFO L444 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-20 05:57:20,567 INFO L444 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,567 INFO L444 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,567 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,567 INFO L444 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,567 INFO L444 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,567 INFO L444 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,567 INFO L444 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,567 INFO L444 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,568 INFO L444 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-20 05:57:20,568 INFO L444 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-20 05:57:20,568 INFO L444 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-11-20 05:57:20,568 INFO L444 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-11-20 05:57:20,568 INFO L444 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,568 INFO L444 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,568 INFO L444 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,569 INFO L444 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,569 INFO L440 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse13 (+ ~a4~0 86))) (let ((.cse0 (<= .cse13 0)) (.cse12 (+ ~a0~0 98))) (let ((.cse7 (< 0 .cse13)) (.cse8 (= 3 ~a2~0)) (.cse3 (= ~a2~0 1)) (.cse6 (or (<= 0 (+ ~a0~0 44)) (and .cse0 (< 0 .cse12)))) (.cse9 (<= .cse12 0)) (.cse2 (<= (+ ~a4~0 42) 0)) (.cse4 (<= (+ ~a0~0 104) 0)) (.cse1 (not (= ~a2~0 3))) (.cse11 (<= 0 (+ ~a29~0 192415)))) (or (and .cse0 .cse1) (and .cse2 .cse3 (<= 0 (+ ~a0~0 146)) .cse4) (and (exists ((v_~a29~0_895 Int)) (and (<= (+ ~a29~0 300072) (mod v_~a29~0_895 299928)) (< 43 v_~a29~0_895) (<= 0 v_~a29~0_895))) .cse0) (and (and (let ((.cse5 (or (< 0 (+ ~a29~0 16)) .cse7))) (or (and .cse5 .cse6) (and .cse5 .cse0))) .cse8) .cse2) (and .cse9 .cse2 .cse7 .cse8) (and .cse2 .cse3 (<= ~a29~0 43) (< 0 (+ ~a29~0 144))) (and .cse2 (<= (+ ~a0~0 147) 0) .cse1 (not (= 1 ~a2~0))) (and .cse6 (<= (+ ~a0~0 61) 0)) (and (exists ((v_~a0~0_825 Int)) (let ((.cse10 (div (* v_~a0~0_825 15) 10))) (and (<= (+ v_~a0~0_825 98) 0) (<= ~a0~0 (+ (div (+ (* .cse10 10) (- 2831840)) 9) 1)) (not (= 0 (mod (+ .cse10 1) 9))) (= 0 (mod (* v_~a0~0_825 5) 10)) (< (* 10 .cse10) 2831840)))) .cse0) (and .cse9 .cse2 .cse1 (not (= 4 ~a2~0)) .cse11) (and .cse2 .cse4 .cse1 .cse11))))) [2019-11-20 05:57:20,569 INFO L444 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-20 05:57:20,569 INFO L444 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-20 05:57:20,569 INFO L444 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,569 INFO L444 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,570 INFO L444 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,570 INFO L444 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,570 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,570 INFO L444 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,570 INFO L444 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,570 INFO L444 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-11-20 05:57:20,570 INFO L444 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,570 INFO L444 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-11-20 05:57:20,570 INFO L447 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-11-20 05:57:20,570 INFO L444 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,570 INFO L444 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-11-20 05:57:20,570 INFO L444 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-11-20 05:57:20,570 INFO L444 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-20 05:57:20,571 INFO L444 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-20 05:57:20,571 INFO L444 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,571 INFO L444 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,571 INFO L444 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,571 INFO L444 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,571 INFO L444 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,571 INFO L444 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-20 05:57:20,571 INFO L444 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-20 05:57:20,571 INFO L444 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,572 INFO L444 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-11-20 05:57:20,572 INFO L444 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-11-20 05:57:20,572 INFO L444 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,572 INFO L444 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,572 INFO L444 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,572 INFO L444 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,573 INFO L444 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,573 INFO L444 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,573 INFO L440 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse13 (+ ~a4~0 86))) (let ((.cse0 (<= .cse13 0)) (.cse12 (+ ~a0~0 98))) (let ((.cse7 (< 0 .cse13)) (.cse8 (= 3 ~a2~0)) (.cse3 (= ~a2~0 1)) (.cse6 (or (<= 0 (+ ~a0~0 44)) (and .cse0 (< 0 .cse12)))) (.cse9 (<= .cse12 0)) (.cse2 (<= (+ ~a4~0 42) 0)) (.cse4 (<= (+ ~a0~0 104) 0)) (.cse1 (not (= ~a2~0 3))) (.cse11 (<= 0 (+ ~a29~0 192415)))) (or (and .cse0 .cse1) (and .cse2 .cse3 (<= 0 (+ ~a0~0 146)) .cse4) (and (exists ((v_~a29~0_895 Int)) (and (<= (+ ~a29~0 300072) (mod v_~a29~0_895 299928)) (< 43 v_~a29~0_895) (<= 0 v_~a29~0_895))) .cse0) (and (and (let ((.cse5 (or (< 0 (+ ~a29~0 16)) .cse7))) (or (and .cse5 .cse6) (and .cse5 .cse0))) .cse8) .cse2) (and .cse9 .cse2 .cse7 .cse8) (and .cse2 .cse3 (<= ~a29~0 43) (< 0 (+ ~a29~0 144))) (and .cse2 (<= (+ ~a0~0 147) 0) .cse1 (not (= 1 ~a2~0))) (and .cse6 (<= (+ ~a0~0 61) 0)) (and (exists ((v_~a0~0_825 Int)) (let ((.cse10 (div (* v_~a0~0_825 15) 10))) (and (<= (+ v_~a0~0_825 98) 0) (<= ~a0~0 (+ (div (+ (* .cse10 10) (- 2831840)) 9) 1)) (not (= 0 (mod (+ .cse10 1) 9))) (= 0 (mod (* v_~a0~0_825 5) 10)) (< (* 10 .cse10) 2831840)))) .cse0) (and .cse9 .cse2 .cse1 (not (= 4 ~a2~0)) .cse11) (and .cse2 .cse4 .cse1 .cse11))))) [2019-11-20 05:57:20,573 INFO L444 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,574 INFO L444 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-20 05:57:20,574 INFO L444 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-20 05:57:20,574 INFO L444 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,574 INFO L444 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,574 INFO L444 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,574 INFO L444 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,575 INFO L444 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,575 INFO L444 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,575 INFO L444 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-20 05:57:20,575 INFO L444 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-20 05:57:20,575 INFO L444 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,575 INFO L444 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,576 INFO L444 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-11-20 05:57:20,576 INFO L444 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,576 INFO L444 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,576 INFO L444 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,576 INFO L444 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,576 INFO L444 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,576 INFO L444 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,576 INFO L444 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-20 05:57:20,576 INFO L444 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-20 05:57:20,576 INFO L444 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,576 INFO L444 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,577 INFO L444 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,577 INFO L444 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,577 INFO L444 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,577 INFO L444 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,577 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 05:57:20,577 INFO L444 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-20 05:57:20,577 INFO L444 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,577 INFO L444 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-20 05:57:20,577 INFO L444 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,577 INFO L444 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,577 INFO L444 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,577 INFO L444 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,577 INFO L444 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,577 INFO L444 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,578 INFO L444 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,578 INFO L444 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-20 05:57:20,578 INFO L444 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-20 05:57:20,578 INFO L444 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,578 INFO L444 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,578 INFO L444 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,578 INFO L444 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,578 INFO L444 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,578 INFO L444 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,578 INFO L444 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,579 INFO L444 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-20 05:57:20,579 INFO L444 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-20 05:57:20,579 INFO L444 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,579 INFO L444 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,579 INFO L444 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,579 INFO L444 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,580 INFO L444 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,580 INFO L444 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,580 INFO L444 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,580 INFO L444 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-11-20 05:57:20,580 INFO L444 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-11-20 05:57:20,580 INFO L444 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,580 INFO L444 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-20 05:57:20,580 INFO L444 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-20 05:57:20,581 INFO L444 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,581 INFO L444 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,581 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,581 INFO L444 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,581 INFO L444 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,581 INFO L444 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,582 INFO L440 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse13 (+ ~a4~0 86))) (let ((.cse0 (<= .cse13 0)) (.cse12 (+ ~a0~0 98))) (let ((.cse7 (< 0 .cse13)) (.cse8 (= 3 ~a2~0)) (.cse3 (= ~a2~0 1)) (.cse6 (or (<= 0 (+ ~a0~0 44)) (and .cse0 (< 0 .cse12)))) (.cse9 (<= .cse12 0)) (.cse2 (<= (+ ~a4~0 42) 0)) (.cse4 (<= (+ ~a0~0 104) 0)) (.cse1 (not (= ~a2~0 3))) (.cse11 (<= 0 (+ ~a29~0 192415)))) (or (and .cse0 .cse1) (and .cse2 .cse3 (<= 0 (+ ~a0~0 146)) .cse4) (and (exists ((v_~a29~0_895 Int)) (and (<= (+ ~a29~0 300072) (mod v_~a29~0_895 299928)) (< 43 v_~a29~0_895) (<= 0 v_~a29~0_895))) .cse0) (and (and (let ((.cse5 (or (< 0 (+ ~a29~0 16)) .cse7))) (or (and .cse5 .cse6) (and .cse5 .cse0))) .cse8) .cse2) (and .cse9 .cse2 .cse7 .cse8) (and .cse2 .cse3 (<= ~a29~0 43) (< 0 (+ ~a29~0 144))) (and .cse2 (<= (+ ~a0~0 147) 0) .cse1 (not (= 1 ~a2~0))) (and .cse6 (<= (+ ~a0~0 61) 0)) (and (exists ((v_~a0~0_825 Int)) (let ((.cse10 (div (* v_~a0~0_825 15) 10))) (and (<= (+ v_~a0~0_825 98) 0) (<= ~a0~0 (+ (div (+ (* .cse10 10) (- 2831840)) 9) 1)) (not (= 0 (mod (+ .cse10 1) 9))) (= 0 (mod (* v_~a0~0_825 5) 10)) (< (* 10 .cse10) 2831840)))) .cse0) (and .cse9 .cse2 .cse1 (not (= 4 ~a2~0)) .cse11) (and .cse2 .cse4 .cse1 .cse11))))) [2019-11-20 05:57:20,582 INFO L444 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-20 05:57:20,582 INFO L444 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-20 05:57:20,582 INFO L444 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,582 INFO L444 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,582 INFO L444 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,582 INFO L444 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,582 INFO L444 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,582 INFO L444 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,582 INFO L444 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,582 INFO L444 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,582 INFO L444 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-11-20 05:57:20,582 INFO L444 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-20 05:57:20,583 INFO L444 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,583 INFO L444 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-11-20 05:57:20,583 INFO L444 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-11-20 05:57:20,583 INFO L444 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,583 INFO L444 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,583 INFO L444 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,583 INFO L444 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,583 INFO L444 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,583 INFO L444 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-11-20 05:57:20,583 INFO L444 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-20 05:57:20,583 INFO L444 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,583 INFO L444 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,583 INFO L444 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,584 INFO L444 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,584 INFO L444 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-11-20 05:57:20,584 INFO L444 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-11-20 05:57:20,584 INFO L444 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-11-20 05:57:20,584 INFO L444 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,584 INFO L444 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-11-20 05:57:20,584 INFO L444 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-20 05:57:20,584 INFO L444 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,584 INFO L444 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,584 INFO L444 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,584 INFO L444 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,584 INFO L444 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,584 INFO L444 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,585 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,585 INFO L444 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-20 05:57:20,585 INFO L444 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-11-20 05:57:20,585 INFO L444 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,585 INFO L444 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,585 INFO L444 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,585 INFO L444 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-20 05:57:20,585 INFO L444 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,585 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 05:57:20,585 INFO L444 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,585 INFO L444 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-11-20 05:57:20,585 INFO L444 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,585 INFO L444 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,585 INFO L444 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,586 INFO L444 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,586 INFO L444 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,586 INFO L444 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,586 INFO L444 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,586 INFO L444 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-11-20 05:57:20,586 INFO L444 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-11-20 05:57:20,586 INFO L444 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,586 INFO L444 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-20 05:57:20,586 INFO L444 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,586 INFO L444 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,586 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,586 INFO L444 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-20 05:57:20,586 INFO L444 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,586 INFO L444 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,587 INFO L444 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,587 INFO L444 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,587 INFO L444 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-11-20 05:57:20,587 INFO L444 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,587 INFO L444 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,587 INFO L444 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-11-20 05:57:20,587 INFO L444 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-11-20 05:57:20,587 INFO L444 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,587 INFO L444 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,587 INFO L444 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,587 INFO L444 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-20 05:57:20,587 INFO L444 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,587 INFO L444 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,588 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,588 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,588 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,588 INFO L444 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-20 05:57:20,588 INFO L444 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,588 INFO L444 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,588 INFO L444 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-11-20 05:57:20,588 INFO L444 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-11-20 05:57:20,588 INFO L444 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,588 INFO L444 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-11-20 05:57:20,588 INFO L444 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-11-20 05:57:20,588 INFO L444 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,588 INFO L444 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-20 05:57:20,588 INFO L444 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,589 INFO L444 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-11-20 05:57:20,589 INFO L444 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-11-20 05:57:20,589 INFO L444 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,589 INFO L444 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,589 INFO L444 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-11-20 05:57:20,589 INFO L444 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-11-20 05:57:20,589 INFO L444 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-11-20 05:57:20,599 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 05:57:20,600 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 05:57:20,600 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 05:57:20,601 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:20,601 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:20,602 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:20,602 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:20,602 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:20,613 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 05:57:20,614 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 05:57:20,614 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 05:57:20,615 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:20,615 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:20,615 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:20,616 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:20,616 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:20,619 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 05:57:20,620 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 05:57:20,620 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 05:57:20,621 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:20,621 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:20,621 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:20,622 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:20,622 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:20,624 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 05:57:20,625 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 05:57:20,625 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 05:57:20,626 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:20,626 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:20,626 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:20,627 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:20,627 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:20,629 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 05:57:20,630 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 05:57:20,630 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 05:57:20,631 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:20,631 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:20,631 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:20,631 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:20,632 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:20,634 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 05:57:20,634 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 05:57:20,635 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 05:57:20,635 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:20,636 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:20,636 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:20,636 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:20,637 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:20,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:57:20 BoogieIcfgContainer [2019-11-20 05:57:20,641 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 05:57:20,641 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 05:57:20,641 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 05:57:20,642 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 05:57:20,642 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:53:02" (3/4) ... [2019-11-20 05:57:20,646 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 05:57:20,687 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-20 05:57:20,691 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 05:57:20,727 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((a4 + 86 <= 0 && !(a2 == 3)) || (((a4 + 42 <= 0 && a2 == 1) && 0 <= a0 + 146) && a0 + 104 <= 0)) || ((\exists v_~a29~0_895 : int :: (a29 + 300072 <= v_~a29~0_895 % 299928 && 43 < v_~a29~0_895) && 0 <= v_~a29~0_895) && a4 + 86 <= 0)) || (((((0 < a29 + 16 || 0 < a4 + 86) && (0 <= a0 + 44 || (a4 + 86 <= 0 && 0 < a0 + 98))) || ((0 < a29 + 16 || 0 < a4 + 86) && a4 + 86 <= 0)) && 3 == a2) && a4 + 42 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a4 + 86) && 3 == a2)) || (((a4 + 42 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2))) || ((0 <= a0 + 44 || (a4 + 86 <= 0 && 0 < a0 + 98)) && a0 + 61 <= 0)) || ((\exists v_~a0~0_825 : int :: (((v_~a0~0_825 + 98 <= 0 && a0 <= (v_~a0~0_825 * 15 / 10 * 10 + -2831840) / 9 + 1) && !(0 == (v_~a0~0_825 * 15 / 10 + 1) % 9)) && 0 == v_~a0~0_825 * 5 % 10) && 10 * (v_~a0~0_825 * 15 / 10) < 2831840) && a4 + 86 <= 0)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && !(a2 == 3)) && !(4 == a2)) && 0 <= a29 + 192415)) || (((a4 + 42 <= 0 && a0 + 104 <= 0) && !(a2 == 3)) && 0 <= a29 + 192415) [2019-11-20 05:57:20,731 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((a4 + 86 <= 0 && !(a2 == 3)) || (((a4 + 42 <= 0 && a2 == 1) && 0 <= a0 + 146) && a0 + 104 <= 0)) || ((\exists v_~a29~0_895 : int :: (a29 + 300072 <= v_~a29~0_895 % 299928 && 43 < v_~a29~0_895) && 0 <= v_~a29~0_895) && a4 + 86 <= 0)) || (((((0 < a29 + 16 || 0 < a4 + 86) && (0 <= a0 + 44 || (a4 + 86 <= 0 && 0 < a0 + 98))) || ((0 < a29 + 16 || 0 < a4 + 86) && a4 + 86 <= 0)) && 3 == a2) && a4 + 42 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a4 + 86) && 3 == a2)) || (((a4 + 42 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2))) || ((0 <= a0 + 44 || (a4 + 86 <= 0 && 0 < a0 + 98)) && a0 + 61 <= 0)) || ((\exists v_~a0~0_825 : int :: (((v_~a0~0_825 + 98 <= 0 && a0 <= (v_~a0~0_825 * 15 / 10 * 10 + -2831840) / 9 + 1) && !(0 == (v_~a0~0_825 * 15 / 10 + 1) % 9)) && 0 == v_~a0~0_825 * 5 % 10) && 10 * (v_~a0~0_825 * 15 / 10) < 2831840) && a4 + 86 <= 0)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && !(a2 == 3)) && !(4 == a2)) && 0 <= a29 + 192415)) || (((a4 + 42 <= 0 && a0 + 104 <= 0) && !(a2 == 3)) && 0 <= a29 + 192415) [2019-11-20 05:57:20,744 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((a4 + 86 <= 0 && !(a2 == 3)) || (((a4 + 42 <= 0 && a2 == 1) && 0 <= a0 + 146) && a0 + 104 <= 0)) || ((\exists v_~a29~0_895 : int :: (a29 + 300072 <= v_~a29~0_895 % 299928 && 43 < v_~a29~0_895) && 0 <= v_~a29~0_895) && a4 + 86 <= 0)) || (((((0 < a29 + 16 || 0 < a4 + 86) && (0 <= a0 + 44 || (a4 + 86 <= 0 && 0 < a0 + 98))) || ((0 < a29 + 16 || 0 < a4 + 86) && a4 + 86 <= 0)) && 3 == a2) && a4 + 42 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a4 + 86) && 3 == a2)) || (((a4 + 42 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2))) || ((0 <= a0 + 44 || (a4 + 86 <= 0 && 0 < a0 + 98)) && a0 + 61 <= 0)) || ((\exists v_~a0~0_825 : int :: (((v_~a0~0_825 + 98 <= 0 && a0 <= (v_~a0~0_825 * 15 / 10 * 10 + -2831840) / 9 + 1) && !(0 == (v_~a0~0_825 * 15 / 10 + 1) % 9)) && 0 == v_~a0~0_825 * 5 % 10) && 10 * (v_~a0~0_825 * 15 / 10) < 2831840) && a4 + 86 <= 0)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && !(a2 == 3)) && !(4 == a2)) && 0 <= a29 + 192415)) || (((a4 + 42 <= 0 && a0 + 104 <= 0) && !(a2 == 3)) && 0 <= a29 + 192415) [2019-11-20 05:57:21,116 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d5055f45-6112-4b68-8c38-6031d5e173fd/bin/uautomizer/witness.graphml [2019-11-20 05:57:21,116 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 05:57:21,118 INFO L168 Benchmark]: Toolchain (without parser) took 266758.10 ms. Allocated memory was 1.0 GB in the beginning and 3.5 GB in the end (delta: 2.5 GB). Free memory was 938.1 MB in the beginning and 1.6 GB in the end (delta: -644.3 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-11-20 05:57:21,118 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 05:57:21,119 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1681.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -118.4 MB). Peak memory consumption was 42.1 MB. Max. memory is 11.5 GB. [2019-11-20 05:57:21,119 INFO L168 Benchmark]: Boogie Procedure Inliner took 266.97 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 11.5 GB. [2019-11-20 05:57:21,120 INFO L168 Benchmark]: Boogie Preprocessor took 213.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 993.0 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2019-11-20 05:57:21,120 INFO L168 Benchmark]: RCFGBuilder took 5519.49 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 119.0 MB). Free memory was 993.0 MB in the beginning and 1.1 GB in the end (delta: -118.9 MB). Peak memory consumption was 234.6 MB. Max. memory is 11.5 GB. [2019-11-20 05:57:21,121 INFO L168 Benchmark]: TraceAbstraction took 258597.17 ms. Allocated memory was 1.3 GB in the beginning and 3.5 GB in the end (delta: 2.2 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -538.0 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2019-11-20 05:57:21,121 INFO L168 Benchmark]: Witness Printer took 475.05 ms. Allocated memory is still 3.5 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 67.5 MB). Peak memory consumption was 67.5 MB. Max. memory is 11.5 GB. [2019-11-20 05:57:21,125 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1681.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -118.4 MB). Peak memory consumption was 42.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 266.97 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: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 213.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 993.0 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 5519.49 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 119.0 MB). Free memory was 993.0 MB in the beginning and 1.1 GB in the end (delta: -118.9 MB). Peak memory consumption was 234.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 258597.17 ms. Allocated memory was 1.3 GB in the beginning and 3.5 GB in the end (delta: 2.2 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -538.0 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 475.05 ms. Allocated memory is still 3.5 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 67.5 MB). Peak memory consumption was 67.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 103]: 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: 1766]: Loop Invariant [2019-11-20 05:57:21,143 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 05:57:21,144 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 05:57:21,144 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 05:57:21,146 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:21,147 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:21,147 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:21,147 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:21,147 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:21,150 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 05:57:21,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 05:57:21,151 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 05:57:21,152 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:21,152 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:21,152 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:21,152 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:21,153 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] Derived loop invariant: ((((((((((a4 + 86 <= 0 && !(a2 == 3)) || (((a4 + 42 <= 0 && a2 == 1) && 0 <= a0 + 146) && a0 + 104 <= 0)) || ((\exists v_~a29~0_895 : int :: (a29 + 300072 <= v_~a29~0_895 % 299928 && 43 < v_~a29~0_895) && 0 <= v_~a29~0_895) && a4 + 86 <= 0)) || (((((0 < a29 + 16 || 0 < a4 + 86) && (0 <= a0 + 44 || (a4 + 86 <= 0 && 0 < a0 + 98))) || ((0 < a29 + 16 || 0 < a4 + 86) && a4 + 86 <= 0)) && 3 == a2) && a4 + 42 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a4 + 86) && 3 == a2)) || (((a4 + 42 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2))) || ((0 <= a0 + 44 || (a4 + 86 <= 0 && 0 < a0 + 98)) && a0 + 61 <= 0)) || ((\exists v_~a0~0_825 : int :: (((v_~a0~0_825 + 98 <= 0 && a0 <= (v_~a0~0_825 * 15 / 10 * 10 + -2831840) / 9 + 1) && !(0 == (v_~a0~0_825 * 15 / 10 + 1) % 9)) && 0 == v_~a0~0_825 * 5 % 10) && 10 * (v_~a0~0_825 * 15 / 10) < 2831840) && a4 + 86 <= 0)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && !(a2 == 3)) && !(4 == a2)) && 0 <= a29 + 192415)) || (((a4 + 42 <= 0 && a0 + 104 <= 0) && !(a2 == 3)) && 0 <= a29 + 192415) - InvariantResult [Line: 23]: Loop Invariant [2019-11-20 05:57:21,165 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 05:57:21,165 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 05:57:21,165 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 05:57:21,168 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:21,168 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:21,169 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:21,169 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:21,169 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:21,173 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 05:57:21,173 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 05:57:21,174 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 05:57:21,174 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:21,174 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:21,175 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:21,175 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:21,175 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] Derived loop invariant: ((((((((((a4 + 86 <= 0 && !(a2 == 3)) || (((a4 + 42 <= 0 && a2 == 1) && 0 <= a0 + 146) && a0 + 104 <= 0)) || ((\exists v_~a29~0_895 : int :: (a29 + 300072 <= v_~a29~0_895 % 299928 && 43 < v_~a29~0_895) && 0 <= v_~a29~0_895) && a4 + 86 <= 0)) || (((((0 < a29 + 16 || 0 < a4 + 86) && (0 <= a0 + 44 || (a4 + 86 <= 0 && 0 < a0 + 98))) || ((0 < a29 + 16 || 0 < a4 + 86) && a4 + 86 <= 0)) && 3 == a2) && a4 + 42 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a4 + 86) && 3 == a2)) || (((a4 + 42 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2))) || ((0 <= a0 + 44 || (a4 + 86 <= 0 && 0 < a0 + 98)) && a0 + 61 <= 0)) || ((\exists v_~a0~0_825 : int :: (((v_~a0~0_825 + 98 <= 0 && a0 <= (v_~a0~0_825 * 15 / 10 * 10 + -2831840) / 9 + 1) && !(0 == (v_~a0~0_825 * 15 / 10 + 1) % 9)) && 0 == v_~a0~0_825 * 5 % 10) && 10 * (v_~a0~0_825 * 15 / 10) < 2831840) && a4 + 86 <= 0)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && !(a2 == 3)) && !(4 == a2)) && 0 <= a29 + 192415)) || (((a4 + 42 <= 0 && a0 + 104 <= 0) && !(a2 == 3)) && 0 <= a29 + 192415) - InvariantResult [Line: 1658]: Loop Invariant [2019-11-20 05:57:21,177 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 05:57:21,178 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 05:57:21,178 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 05:57:21,181 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:21,181 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:21,181 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:21,182 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:21,182 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:21,184 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 05:57:21,184 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 05:57:21,184 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-20 05:57:21,185 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:21,185 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:21,185 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:21,186 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] [2019-11-20 05:57:21,186 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a0~0_825,QUANTIFIED] Derived loop invariant: ((((((((((a4 + 86 <= 0 && !(a2 == 3)) || (((a4 + 42 <= 0 && a2 == 1) && 0 <= a0 + 146) && a0 + 104 <= 0)) || ((\exists v_~a29~0_895 : int :: (a29 + 300072 <= v_~a29~0_895 % 299928 && 43 < v_~a29~0_895) && 0 <= v_~a29~0_895) && a4 + 86 <= 0)) || (((((0 < a29 + 16 || 0 < a4 + 86) && (0 <= a0 + 44 || (a4 + 86 <= 0 && 0 < a0 + 98))) || ((0 < a29 + 16 || 0 < a4 + 86) && a4 + 86 <= 0)) && 3 == a2) && a4 + 42 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 0 < a4 + 86) && 3 == a2)) || (((a4 + 42 <= 0 && a2 == 1) && a29 <= 43) && 0 < a29 + 144)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && !(a2 == 3)) && !(1 == a2))) || ((0 <= a0 + 44 || (a4 + 86 <= 0 && 0 < a0 + 98)) && a0 + 61 <= 0)) || ((\exists v_~a0~0_825 : int :: (((v_~a0~0_825 + 98 <= 0 && a0 <= (v_~a0~0_825 * 15 / 10 * 10 + -2831840) / 9 + 1) && !(0 == (v_~a0~0_825 * 15 / 10 + 1) % 9)) && 0 == v_~a0~0_825 * 5 % 10) && 10 * (v_~a0~0_825 * 15 / 10) < 2831840) && a4 + 86 <= 0)) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && !(a2 == 3)) && !(4 == a2)) && 0 <= a29 + 192415)) || (((a4 + 42 <= 0 && a0 + 104 <= 0) && !(a2 == 3)) && 0 <= a29 + 192415) - InvariantResult [Line: 1760]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Result: SAFE, OverallTime: 258.4s, OverallIterations: 15, TraceHistogramMax: 7, AutomataDifference: 201.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 24.5s, HoareTripleCheckerStatistics: 4470 SDtfs, 15488 SDslu, 1125 SDs, 0 SdLazy, 36812 SolverSat, 8119 SolverUnsat, 56 SolverUnknown, 0 SolverNotchecked, 188.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3862 GetRequests, 3729 SyntacticMatches, 46 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 12.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28233occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 15 MinimizatonAttempts, 24951 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 316 NumberOfFragments, 859 HoareAnnotationTreeSize, 4 FomulaSimplifications, 19779 FormulaSimplificationTreeSizeReduction, 1.7s HoareSimplificationTime, 4 FomulaSimplificationsInter, 92544 FormulaSimplificationTreeSizeReductionInter, 22.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 17.4s InterpolantComputationTime, 10817 NumberOfCodeBlocks, 10817 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 10795 ConstructedInterpolants, 91 QuantifiedInterpolants, 28313013 SizeOfPredicates, 5 NumberOfNonLiveVariables, 4503 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 22 InterpolantComputations, 13 PerfectInterpolantSequences, 11525/11987 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...